key_ptr
sort_key_t *key_ptr;
for (key_ptr = task.first_key; key_ptr <= task.last_key; key_ptr++) {
u8 bin = (*key_ptr)[task.offset];
memcpy(key_ptr(left, nr_left),
key_ptr(right, 0),
memcpy(key_ptr(right, 0),
key_ptr(left, nr_left - shift),
memmove(key_ptr(n, index),
key_ptr(n, index + 1),
*key_ptr(parent, r->index) = right->keys[0];
*key_ptr(parent, r->index) = right->keys[0];
*key_ptr(parent, c->index) = center->keys[0];
*key_ptr(parent, r->index) = right->keys[0];
BUG_ON((void *) key_ptr(n, shift) >= value_ptr(n, shift));
memmove(key_ptr(n, 0),
key_ptr(n, shift),
memmove(key_ptr(n, shift),
key_ptr(n, 0),
keys = le64_to_cpu(*key_ptr(n, i));
*key = le64_to_cpu(*key_ptr(bn, n->index));
*key_ptr(parent, parent_index) = right->keys[0];
*key_ptr(parent, parent_index + 1) = right->keys[0];
char *key_ptr;
key_ptr = &p[note_strings +
if (key && !strncasecmp(key, key_ptr, strlen(key_ptr))) {
struct btrfs_key *key_ptr = NULL;
key_ptr = &key;
key_ptr, level + 1, node->bytenr,
void *key_ptr = !i ? NULL : &key;
if (bpf_map_get_next_key(first, key_ptr, &next_first) != 0)
CHECK(bpf_map_get_next_key(second, key_ptr, &next_second) != 0,
"key_ptr: %p", key_ptr);