Lines Matching defs:cpu_key
85 const struct cpu_key *cpu_key)
89 if (n < cpu_key->on_disk_key.k_dir_id)
91 if (n > cpu_key->on_disk_key.k_dir_id)
94 if (n < cpu_key->on_disk_key.k_objectid)
96 if (n > cpu_key->on_disk_key.k_objectid)
107 const struct cpu_key *cpu_key)
111 retval = comp_short_keys(le_key, cpu_key);
115 cpu_key_k_offset(cpu_key))
118 cpu_key_k_offset(cpu_key))
121 if (cpu_key->key_length == 3)
126 cpu_key_k_type(cpu_key))
130 cpu_key_k_type(cpu_key))
153 inline void le_key2cpu_key(struct cpu_key *to, const struct reiserfs_key *from)
209 (struct cpu_key *)p_v_key)) {
340 const struct cpu_key *p_s_key, /* Key which should be checked. */
602 int search_by_key(struct super_block *p_s_sb, const struct cpu_key *p_s_key, /* Key to search. */
813 const struct cpu_key *p_cpu_key, /* Key to search (cpu variable) */
987 static char prepare_for_delete_or_cut(struct reiserfs_transaction_handle *th, struct inode *inode, struct treepath *p_s_path, const struct cpu_key *p_s_item_key, int *p_n_removed, /* Number of unformatted nodes which were removed
1176 const struct cpu_key *p_s_item_key, /* Key to search for the deleted item. */
1326 struct cpu_key cpu_key;
1332 le_key2cpu_key(&cpu_key, key);
1335 retval = search_item(th->t_super, &cpu_key, &path);
1340 &cpu_key);
1391 &cpu_key);
1468 const struct cpu_key *p_s_item_key,
1504 struct cpu_key tail_key;
1545 struct cpu_key *p_s_item_key,
1768 struct cpu_key s_item_key; /* Key to search for a previous file item. */
1917 const struct cpu_key *p_s_key)
1951 const struct cpu_key *p_s_key, /* Key to search for the needed item. */
2033 const struct cpu_key *key, struct item_head *p_s_ih, /* Pointer to the item header to insert. */