| /netbsd-src/external/bsd/kyua-cli/dist/utils/config/ |
| H A D | tree.cpp | 113 const leaf_node& child = dynamic_cast< const leaf_node& >( in is_set()
138 const leaf_node& child = dynamic_cast< const leaf_node& >(*raw_node); in push_lua()
163 leaf_node& child = dynamic_cast< leaf_node& >(*raw_node); in set_lua()
186 const leaf_node& child = dynamic_cast< const leaf_node& >(*raw_node); in lookup_string()
214 leaf_node& child = dynamic_cast< leaf_node& >(*raw_node); in set_string()
|
| H A D | nodes.hpp | 91 class leaf_node : public detail::base_node { class
93 virtual ~leaf_node(void);
143 class typed_leaf_node : public leaf_node {
236 class base_set_node : public leaf_node {
|
| H A D | nodes.cpp | 145 config::leaf_node*
167 leaf_node& child = dynamic_cast< leaf_node& >( in lookup_rw()
202 leaf_node& child = dynamic_cast< leaf_node& >(*(*iter).second); in all_properties()
296 config::leaf_node::~leaf_node(void) in ~leaf_node()
|
| H A D | tree.ipp | 137 leaf_node* raw_node = _root->lookup_rw(key, 0,
|
| H A D | nodes.ipp | 98 leaf_node* lookup_rw(const tree_key&, const tree_key::size_type,
|
| /netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
| H A D | find_fn_imps.hpp | 51 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
76 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
108 while (p_nd->m_type != leaf_node) in find_imp()
140 if (p_nd->m_type == leaf_node) in lower_bound_imp()
213 if (p_nd->m_type == leaf_node) in pref_begin()
225 if (p_nd->m_type == leaf_node) in pref_end()
237 if (p_nd->m_type == leaf_node) in leftmost_descendant()
247 if (p_nd->m_type == leaf_node) in leftmost_descendant()
257 if (p_nd->m_type == leaf_node) in rightmost_descendant()
267 if (p_nd->m_type == leaf_node) in rightmost_descendant()
|
| H A D | erase_fn_imps.hpp | 55 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == leaf_node); in erase()
162 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == leaf_node); in clear_imp()
179 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == leaf_node); in erase()
197 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == leaf_node); in erase()
216 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == leaf_node); in erase()
235 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == leaf_node); in erase()
|
| H A D | pat_trie_base.hpp | 61 leaf_node, enumerator
178 : base_type(leaf_node), m_value(other) { } in _Leaf()
196 PB_DS_DEBUG_VERIFY(base_type::m_type == leaf_node); in assert_valid_imp()
537 _GLIBCXX_DEBUG_ASSERT(m_p_nd->m_type == leaf_node); in operator ->()
544 _GLIBCXX_DEBUG_ASSERT(m_p_nd->m_type == leaf_node); in operator *()
691 if (p_nd->m_type == leaf_node) in leftmost_descendant()
699 if (p_nd->m_type == leaf_node) in rightmost_descendant()
750 _GLIBCXX_DEBUG_ASSERT(base_type::m_p_nd->m_type == leaf_node); in operator ->()
757 _GLIBCXX_DEBUG_ASSERT(base_type::m_p_nd->m_type == leaf_node); in operator *()
828 if (m_p_nd->m_type == leaf_node) in pref_begin()
[all …]
|
| H A D | debug_fn_imps.hpp | 62 PB_DS_DEBUG_VERIFY(m_p_head->m_p_min->m_type == leaf_node); in assert_valid()
63 PB_DS_DEBUG_VERIFY(m_p_head->m_p_max->m_type == leaf_node); in assert_valid()
106 if (p_nd->m_type == leaf_node) in recursive_count_leafs()
|
| H A D | insert_join_fn_imps.hpp | 108 if (p_l->m_type == leaf_node) in rec_join_prep()
110 if (p_r->m_type == leaf_node) in rec_join_prep()
124 if (p_r->m_type == leaf_node) in rec_join_prep()
211 if (p_l->m_type == leaf_node) in rec_join()
213 if (p_r->m_type == leaf_node) in rec_join()
230 if (p_r->m_type == leaf_node) in rec_join()
387 if (p_lf != 0 && p_lf->m_type == leaf_node && in insert()
|
| H A D | split_fn_imps.hpp | 119 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == leaf_node); in split_prep()
137 if (p_nd->m_type == leaf_node) in rec_split()
|
| H A D | constructors_destructor_fn_imps.hpp | 170 if (p_ncp->m_type == leaf_node) in recursive_copy_node()
|
| /netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
| H A D | find_fn_imps.hpp | 51 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
76 if (p_nd == 0 || p_nd->m_type != leaf_node) in find()
108 while (p_nd->m_type != leaf_node) in find_imp()
140 if (p_nd->m_type == leaf_node) in lower_bound_imp()
213 if (p_nd->m_type == leaf_node) in pref_begin()
225 if (p_nd->m_type == leaf_node) in pref_end()
237 if (p_nd->m_type == leaf_node) in leftmost_descendant()
247 if (p_nd->m_type == leaf_node) in leftmost_descendant()
257 if (p_nd->m_type == leaf_node) in rightmost_descendant()
267 if (p_nd->m_type == leaf_node) in rightmost_descendant()
|
| H A D | erase_fn_imps.hpp | 55 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == leaf_node); in erase()
162 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == leaf_node); in clear_imp()
179 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == leaf_node); in erase()
197 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == leaf_node); in erase()
216 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == leaf_node); in erase()
235 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == leaf_node); in erase()
|
| H A D | pat_trie_base.hpp | 61 leaf_node, enumerator
178 : base_type(leaf_node), m_value(other) { } in _Leaf()
196 PB_DS_DEBUG_VERIFY(base_type::m_type == leaf_node); in assert_valid_imp()
537 _GLIBCXX_DEBUG_ASSERT(m_p_nd->m_type == leaf_node); in operator ->()
544 _GLIBCXX_DEBUG_ASSERT(m_p_nd->m_type == leaf_node); in operator *()
691 if (p_nd->m_type == leaf_node) in leftmost_descendant()
699 if (p_nd->m_type == leaf_node) in rightmost_descendant()
750 _GLIBCXX_DEBUG_ASSERT(base_type::m_p_nd->m_type == leaf_node); in operator ->()
757 _GLIBCXX_DEBUG_ASSERT(base_type::m_p_nd->m_type == leaf_node); in operator *()
828 if (m_p_nd->m_type == leaf_node) in pref_begin()
[all …]
|
| H A D | debug_fn_imps.hpp | 62 PB_DS_DEBUG_VERIFY(m_p_head->m_p_min->m_type == leaf_node); in assert_valid()
63 PB_DS_DEBUG_VERIFY(m_p_head->m_p_max->m_type == leaf_node); in assert_valid()
106 if (p_nd->m_type == leaf_node) in recursive_count_leafs()
|
| H A D | insert_join_fn_imps.hpp | 108 if (p_l->m_type == leaf_node) in rec_join_prep()
110 if (p_r->m_type == leaf_node) in rec_join_prep()
124 if (p_r->m_type == leaf_node) in rec_join_prep()
211 if (p_l->m_type == leaf_node) in rec_join()
213 if (p_r->m_type == leaf_node) in rec_join()
230 if (p_r->m_type == leaf_node) in rec_join()
387 if (p_lf != 0 && p_lf->m_type == leaf_node && in insert()
|
| H A D | split_fn_imps.hpp | 119 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == leaf_node); in split_prep()
137 if (p_nd->m_type == leaf_node) in rec_split()
|
| H A D | constructors_destructor_fn_imps.hpp | 170 if (p_ncp->m_type == leaf_node) in recursive_copy_node()
|
| /netbsd-src/sys/ufs/ext2fs/ |
| H A D | ext2fs_htree.c | 483 struct ext2fs_htree_entry *entries, *leaf_node; in ext2fs_htree_add_entry() local
612 leaf_node = info.h_levels[info.h_levels_num - 1].h_entry; in ext2fs_htree_add_entry()
613 blknum = ext2fs_htree_get_block(leaf_node); in ext2fs_htree_add_entry()
806 struct ext2fs_htree_entry *leaf_node; in ext2fs_htree_lookup() local
828 leaf_node = info.h_levels[info.h_levels_num - 1].h_entry; in ext2fs_htree_lookup()
829 blk = ext2fs_htree_get_block(leaf_node); in ext2fs_htree_lookup()
|
| /netbsd-src/common/lib/libc/gen/ |
| H A D | ptree.c | 362 const uintptr_t leaf_node = id->id_node; in ptree_insert_leaf() local
363 pt_node_t * const leaf = PT_NODE(leaf_node); in ptree_insert_leaf()
380 KASSERT(PT_LEAF_P(leaf_node)); in ptree_insert_leaf()
1099 const uintptr_t leaf_node = PTN_LEAF(ptn); in ptree_check_leaf() local
1105 ok = ok && PTN_BRANCH_ODDMAN_SLOT(parent) == leaf_node; in ptree_check_leaf()
1116 ok = ok && PTN_BRANCH_SLOT(parent, leaf_position) == leaf_node; in ptree_check_leaf()
1120 if (PTN_BRANCH_ODDMAN_SLOT(&pt->pt_rootnode) != leaf_node) { in ptree_check_leaf()
|
| /netbsd-src/sbin/fsck_udf/ |
| H A D | main.c | 3354 struct udf_fsck_node *leaf_node; in udf_node_pass1_add_entry() local
3378 leaf_node = udf_node_lookup(&fid->icb); in udf_node_pass1_add_entry()
3379 if (leaf_node) { in udf_node_pass1_add_entry()
3381 leaf_node->found_link_count++; in udf_node_pass1_add_entry()
3386 leaf_node = udf_new_fsck_node( in udf_node_pass1_add_entry()
3389 leaf_node->fsck_flags |= FSCK_NODE_FLAG_STREAM_ENTRY; in udf_node_pass1_add_entry()
3391 TAILQ_INSERT_TAIL(&fs_nodes, leaf_node, next); in udf_node_pass1_add_entry()
3393 LIST_INSERT_HEAD(&fs_nodes_hash[entry], leaf_node, next_hash); in udf_node_pass1_add_entry()
3400 struct udf_fsck_node *leaf_node; in udf_node_pass1_add_streamdir_entry() local
3414 leaf_node = udf_node_lookup(&node->streamdir_loc); in udf_node_pass1_add_streamdir_entry()
[all …]
|