Lines Matching refs:path
2074 * search_by_key fills up the path from the root to the leaf as it descends
2087 /* Pointer to the buffer at the path in the tree. */
2115 * of nodes is called the path. This information is used while
2116 * performing balancing. Note that this path information may become
2136 /* Array of the path elements. */
2141 #define pos_in_item(path) ((path)->pos_in_item)
2146 /* Get path element by path and path position. */
2147 #define PATH_OFFSET_PELEMENT(path, n_offset) ((path)->path_elements + (n_offset))
2149 /* Get buffer header at the path by path and path position. */
2150 #define PATH_OFFSET_PBUFFER(path, n_offset) (PATH_OFFSET_PELEMENT(path, n_offset)->pe_buffer)
2152 /* Get position in the element at the path by path and path position. */
2153 #define PATH_OFFSET_POSITION(path, n_offset) (PATH_OFFSET_PELEMENT(path, n_offset)->pe_position)
2155 #define PATH_PLAST_BUFFER(path) (PATH_OFFSET_PBUFFER((path), (path)->path_length))
2162 #define PATH_LAST_POSITION(path) (PATH_OFFSET_POSITION((path), (path)->path_length))
2165 * in do_balance leaf has h == 0 in contrast with path structure,
2170 #define PATH_H_PBUFFER(path, h) \
2171 PATH_OFFSET_PBUFFER(path, path->path_length - (h))
2174 #define PATH_H_PPARENT(path, h) PATH_H_PBUFFER(path, (h) + 1)
2176 #define PATH_H_POSITION(path, h) \
2177 PATH_OFFSET_POSITION(path, path->path_length - (h))
2180 #define PATH_H_B_ITEM_ORDER(path, h) PATH_H_POSITION(path, h + 1)
2182 #define PATH_H_PATH_OFFSET(path, n_h) ((path)->path_length - (n_h))
2226 static inline struct item_head *tp_item_head(const struct treepath *path)
2228 return item_head(PATH_PLAST_BUFFER(path), PATH_LAST_POSITION(path));
2231 static inline void *tp_item_body(const struct treepath *path)
2233 return item_body(PATH_PLAST_BUFFER(path), PATH_LAST_POSITION(path));
2236 #define get_last_bh(path) PATH_PLAST_BUFFER(path)
2237 #define get_item_pos(path) PATH_LAST_POSITION(path)
2238 #define item_moved(ih,path) comp_items(ih, path)
2239 #define path_changed(ih,path) comp_items (ih, path)
2413 /* array of left neighbors of nodes in the path */
2416 /* array of right neighbors of nodes in the path */
3001 int comp_items(const struct item_head *stored_ih, const struct treepath *path);
3006 #define search_item(s,key,path) search_by_key (s, key, path, DISK_LEAF_NODE_LEVEL)
3017 struct treepath *path,
3023 struct treepath *path,
3029 struct treepath *path,
3035 struct treepath *path,
3112 struct treepath *path, struct reiserfs_dir_entry *de);
3264 * arguments, such as node, search path, transaction_handle, etc.
3274 * search path, used by allocator to deternine search_start by
3277 struct treepath *path;
3336 .path = tb->tb_path,
3349 struct treepath *path,
3354 .path = path,
3367 struct treepath *path,
3372 .path = path,