Home
last modified time | relevance | path

Searched refs:path_length (Results 1 – 4 of 4) sorted by relevance

/fs/reiserfs/
Dstree.c244 int position, path_offset = chk_path->path_length; in get_lkey()
288 int position, path_offset = chk_path->path_length; in get_rkey()
338 RFALSE(!key || chk_path->path_length < FIRST_PATH_ELEMENT_OFFSET in key_in_buffer()
339 || chk_path->path_length > MAX_HEIGHT, in key_in_buffer()
341 key, chk_path->path_length); in key_in_buffer()
357 RFALSE(p->path_length != ILLEGAL_PATH_ELEMENT_OFFSET, in reiserfs_check_path()
368 int path_offset = search_path->path_length; in pathrelse_and_restore()
379 search_path->path_length = ILLEGAL_PATH_ELEMENT_OFFSET; in pathrelse_and_restore()
385 int path_offset = search_path->path_length; in pathrelse()
393 search_path->path_length = ILLEGAL_PATH_ELEMENT_OFFSET; in pathrelse()
[all …]
Dreiserfs.h1894 int path_length; /* Length of the array above. */ member
1903 struct treepath var = {.path_length = ILLEGAL_PATH_ELEMENT_OFFSET, .reada = 0,}
1914 #define PATH_PLAST_BUFFER(path) (PATH_OFFSET_PBUFFER((path), (path)->path_length))
1921 #define PATH_LAST_POSITION(path) (PATH_OFFSET_POSITION((path), (path)->path_length))
1927 #define PATH_H_PBUFFER(path, h) PATH_OFFSET_PBUFFER (path, path->path_length - (h)) /* tb->S[h] */
1929 #define PATH_H_POSITION(path, h) PATH_OFFSET_POSITION (path, path->path_length - (h))
1932 #define PATH_H_PATH_OFFSET(path, n_h) ((path)->path_length - (n_h))
Dfix_node.c1066 RFALSE(s_path_to_neighbor_father.path_length < in get_far_parent()
1069 s_path_to_neighbor_father.path_length--; in get_far_parent()
2167 for (i = tb->tb_path->path_length; in wait_tb_buffers_until_unlocked()
2181 path_length - i); in wait_tb_buffers_until_unlocked()
Dprints.c633 tb->tb_path->path_length in store_print_tb()