Lines Matching full:token
40 * Generic helpers with a token (cached address of the most recently accessed
56 u##bits btrfs_get_token_##bits(struct btrfs_map_token *token, \
66 ASSERT(token); \
67 ASSERT(token->kaddr); \
68 ASSERT(check_setget_bounds(token->eb, ptr, off, size)); \
69 if (token->offset <= member_offset && \
70 member_offset + size <= token->offset + PAGE_SIZE) { \
71 return get_unaligned_le##bits(token->kaddr + oip); \
73 token->kaddr = page_address(token->eb->pages[idx]); \
74 token->offset = idx << PAGE_SHIFT; \
76 return get_unaligned_le##bits(token->kaddr + oip); \
78 memcpy(lebytes, token->kaddr + oip, part); \
79 token->kaddr = page_address(token->eb->pages[idx + 1]); \
80 token->offset = (idx + 1) << PAGE_SHIFT; \
81 memcpy(lebytes + part, token->kaddr, size - part); \
104 void btrfs_set_token_##bits(struct btrfs_map_token *token, \
115 ASSERT(token); \
116 ASSERT(token->kaddr); \
117 ASSERT(check_setget_bounds(token->eb, ptr, off, size)); \
118 if (token->offset <= member_offset && \
119 member_offset + size <= token->offset + PAGE_SIZE) { \
120 put_unaligned_le##bits(val, token->kaddr + oip); \
123 token->kaddr = page_address(token->eb->pages[idx]); \
124 token->offset = idx << PAGE_SHIFT; \
126 put_unaligned_le##bits(val, token->kaddr + oip); \
130 memcpy(token->kaddr + oip, lebytes, part); \
131 token->kaddr = page_address(token->eb->pages[idx + 1]); \
132 token->offset = (idx + 1) << PAGE_SHIFT; \
133 memcpy(token->kaddr, lebytes + part, size - part); \