Lines Matching refs:key
124 * directories use this key as well as old files
161 struct key
176 #define KEY_SIZE (sizeof (struct key))
185 struct key blk_right_delim_key; /* Right delimiting key for this block (supported for leaf level nodes
193 struct key ih_key; /* Everything in the tree is found by searching for it based on its key.*/
199 stat data item. Note that the key, not this field, is used to determine
248 __u32 deh_offset; /* third component of the directory entry key */
350 #define KEY(cache) ((struct key *) ((int) cache + BLKH_SIZE))
680 * I have only two methods to find a key in the tree:
683 * next_key() gets the next key in tree order.
725 /* Get the next key, i.e. the key following the last retrieved key in
736 printf ("next_key:\n old ih: key %d:%d:%d:%d version:%d\n",
800 printf (" new ih: key %d:%d:%d:%d version:%d\n",
813 * nonzero iff we were able to find the key successfully.
815 * current_item fields describe the key that equals the
816 * searched key. INFO->next_key contains the next key after
817 * the searched key.
829 printf ("search_stat:\n key %d:%d:0:0\n", dir_id, objectid);
837 struct key *key;
840 key = KEY (cache);
844 if (key->k_dir_id > dir_id
845 || (key->k_dir_id == dir_id
846 && (key->k_objectid > objectid
847 || (key->k_objectid == objectid
848 && (key->u.v1.k_offset
849 | key->u.v1.k_uniqueness) > 0))))
851 key++;
1139 printf ("ih: key %d:%d:%d:%d version:%d\n",