Home
last modified time | relevance | path

Searched refs:ILLEGAL_PATH_ELEMENT_OFFSET (Results 1 – 5 of 5) sorted by relevance

/fs/reiserfs/
Dstree.c357 RFALSE(p->path_length != ILLEGAL_PATH_ELEMENT_OFFSET, in reiserfs_check_path()
370 RFALSE(path_offset < ILLEGAL_PATH_ELEMENT_OFFSET, in pathrelse_and_restore()
373 while (path_offset > ILLEGAL_PATH_ELEMENT_OFFSET) { in pathrelse_and_restore()
379 search_path->path_length = ILLEGAL_PATH_ELEMENT_OFFSET; in pathrelse_and_restore()
387 RFALSE(path_offset < ILLEGAL_PATH_ELEMENT_OFFSET, in pathrelse()
390 while (path_offset > ILLEGAL_PATH_ELEMENT_OFFSET) in pathrelse()
393 search_path->path_length = ILLEGAL_PATH_ELEMENT_OFFSET; in pathrelse()
1135 PATH_OFFSET_PBUFFER(path, ILLEGAL_PATH_ELEMENT_OFFSET) = NULL; in init_tb_struct()
1136 PATH_OFFSET_POSITION(path, ILLEGAL_PATH_ELEMENT_OFFSET) = 0; in init_tb_struct()
Dprints.c635 h) > ILLEGAL_PATH_ELEMENT_OFFSET) { in store_print_tb()
Dibalance.c967 PATH_OFFSET_PBUFFER(tb->tb_path, ILLEGAL_PATH_ELEMENT_OFFSET) = in balance_internal()
Dreiserfs.h1865 #define ILLEGAL_PATH_ELEMENT_OFFSET 1 /* Must be equal to FIRST_PATH_ELEMENT_OFFSET - 1 */ macro
1898 struct treepath var = {.path_length = ILLEGAL_PATH_ELEMENT_OFFSET, .reada = 0,}
Dfix_node.c2168 !locked && i > ILLEGAL_PATH_ELEMENT_OFFSET; i--) { in wait_tb_buffers_until_unlocked()