Searched refs:num_stored_in_leaf (Results 1 – 2 of 2) sorted by relevance
133 unsigned int num_stored_in_leaf; member2076 for (i = 0; i < leaf->num_stored_in_leaf; ++i) in insert_arange_in_trie()2091 is_full_leaf = leaf->num_stored_in_leaf == trie->num_room_in_leaf; in insert_arange_in_trie()2109 for (i = 0; i < leaf->num_stored_in_leaf; ++i) in insert_arange_in_trie()2130 new_leaf->num_stored_in_leaf = leaf->num_stored_in_leaf; in insert_arange_in_trie()2134 leaf->num_stored_in_leaf * sizeof (leaf->ranges[0])); in insert_arange_in_trie()2146 unsigned int i = leaf->num_stored_in_leaf++; in insert_arange_in_trie()5792 for (i = 0; i < leaf->num_stored_in_leaf; ++i) in _bfd_dwarf2_find_nearest_line()5795 for (i = 0; i < leaf->num_stored_in_leaf; ++i) in _bfd_dwarf2_find_nearest_line()
136 unsigned int num_stored_in_leaf; member2163 for (i = 0; i < leaf->num_stored_in_leaf; ++i) in insert_arange_in_trie()2178 is_full_leaf = leaf->num_stored_in_leaf == trie->num_room_in_leaf; in insert_arange_in_trie()2196 for (i = 0; i < leaf->num_stored_in_leaf; ++i) in insert_arange_in_trie()2215 new_leaf->num_stored_in_leaf = leaf->num_stored_in_leaf; in insert_arange_in_trie()2219 leaf->num_stored_in_leaf * sizeof (leaf->ranges[0])); in insert_arange_in_trie()2231 unsigned int i = leaf->num_stored_in_leaf++; in insert_arange_in_trie()5923 for (i = 0; i < leaf->num_stored_in_leaf; ++i) in _bfd_dwarf2_find_nearest_line_with_alt()5926 for (i = 0; i < leaf->num_stored_in_leaf; ++i) in _bfd_dwarf2_find_nearest_line_with_alt()