Searched refs:n_h (Results 1 – 2 of 2) sorted by relevance
757 int n_h in get_empty_nodes() argument760 * p_s_Sh = PATH_H_PBUFFER (p_s_tb->tb_path, n_h); in get_empty_nodes()786 for ( n_counter = 0, n_number_of_freeblk = p_s_tb->cur_blknum; n_counter < n_h; n_counter++ ) in get_empty_nodes()791 n_amount_needed = ( p_s_Sh ) ? (p_s_tb->blknum[n_h] - 1) : 1; in get_empty_nodes()895 int n_h in is_left_neighbor_in_cache() argument902 if ( ! p_s_tb->FL[n_h] ) /* Father of the left neighbor does not exist. */ in is_left_neighbor_in_cache()906 p_s_father = PATH_H_PBUFFER(p_s_tb->tb_path, n_h + 1); in is_left_neighbor_in_cache()910 ! B_IS_IN_TREE (p_s_tb->FL[n_h]) || in is_left_neighbor_in_cache()912 ! buffer_uptodate (p_s_tb->FL[n_h]), in is_left_neighbor_in_cache()914 p_s_father, p_s_tb->FL[n_h]); in is_left_neighbor_in_cache()[all …]
1276 #define PATH_H_PATH_OFFSET(p_s_path, n_h) ((p_s_path)->path_length - (n_h)) argument