/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/ |
H A D | order_statistics_imp.hpp | 59 const size_type num_children = nd_it.num_children(); local 60 if (num_children == 0) 63 for (size_type i = 0; i < num_children; ++i) 68 i = num_children; 112 const size_type num_children = nd_it.num_children(); local 113 if (num_children == 0) 127 size_type i = num_children - 1; 155 const size_type num_children local [all...] |
H A D | trie_policy_base.hpp | 159 if (nd_it.num_children() == 0) 170 const size_type num_children = nd_it.num_children(); local 172 if (num_children == 0) 175 return rightmost_it(nd_it.get_child(num_children - 1));
|
H A D | prefix_search_node_update_imp.hpp | 119 const size_type num_children = nd_it.num_children(); local 122 for (size_type i = 0; i < num_children; ++i)
|
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/ |
H A D | order_statistics_imp.hpp | 59 const size_type num_children = nd_it.num_children(); local 60 if (num_children == 0) 63 for (size_type i = 0; i < num_children; ++i) 68 i = num_children; 112 const size_type num_children = nd_it.num_children(); local 113 if (num_children == 0) 127 size_type i = num_children - 1; 155 const size_type num_children local [all...] |
H A D | trie_policy_base.hpp | 159 if (nd_it.num_children() == 0) 170 const size_type num_children = nd_it.num_children(); local 172 if (num_children == 0) 175 return rightmost_it(nd_it.get_child(num_children - 1));
|
H A D | prefix_search_node_update_imp.hpp | 119 const size_type num_children = nd_it.num_children(); local 122 for (size_type i = 0; i < num_children; ++i)
|
/netbsd-current/external/apache2/llvm/dist/llvm/utils/ |
H A D | lldbDataFormatters.py | 42 def num_children(self): member in class:SmallVectorSynthProvider 55 if index >= self.num_children(): 81 def num_children(self): member in class:ArrayRefSynthProvider 91 if index < 0 or index >= self.num_children(): 131 def num_children(self): member in class:OptionalSynthProvider 132 return self.valobj.num_children 136 return self.valobj.num_children 140 if index < self.valobj.num_children:
|
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
H A D | trace_fn_imps.hpp | 86 const size_type num_children = std::distance(p_internal->begin(), local 89 for (size_type child_i = 0; child_i < num_children; ++child_i) 92 std::advance(child_it, num_children - child_i - 1);
|
H A D | split_fn_imps.hpp | 199 size_type num_children, branch_bag& r_bag) 207 const size_type total_num_children = start + num_children; 235 while (num_inserted++ < num_children) 197 split_insert_branch(size_type e_ind, a_const_iterator b_it, inode_iterator child_b_it, size_type num_children, branch_bag& r_bag) argument
|
H A D | pat_trie_base.hpp | 879 _GLIBCXX_DEBUG_ASSERT(num_children() == 0); 890 num_children() const function in class:__gnu_pbds::detail::pat_trie_base::_Node_citer 960 _GLIBCXX_DEBUG_ASSERT(base_type::num_children() == 0); 1291 const size_type num_children = std::distance(begin(), end()); local 1292 _GLIBCXX_DEBUG_ASSERT(num_children >= 2); 1295 std::advance(it, num_children - 1);
|
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
H A D | trace_fn_imps.hpp | 86 const size_type num_children = std::distance(p_internal->begin(), local 89 for (size_type child_i = 0; child_i < num_children; ++child_i) 92 std::advance(child_it, num_children - child_i - 1);
|
H A D | split_fn_imps.hpp | 199 size_type num_children, branch_bag& r_bag) 207 const size_type total_num_children = start + num_children; 235 while (num_inserted++ < num_children) 197 split_insert_branch(size_type e_ind, a_const_iterator b_it, inode_iterator child_b_it, size_type num_children, branch_bag& r_bag) argument
|
H A D | pat_trie_base.hpp | 879 _GLIBCXX_DEBUG_ASSERT(num_children() == 0); 890 num_children() const function in class:__gnu_pbds::detail::pat_trie_base::_Node_citer 960 _GLIBCXX_DEBUG_ASSERT(base_type::num_children() == 0); 1291 const size_type num_children = std::distance(begin(), end()); local 1292 _GLIBCXX_DEBUG_ASSERT(num_children >= 2); 1295 std::advance(it, num_children - 1);
|
/netbsd-current/external/gpl3/gdb.old/dist/gdb/ |
H A D | varobj.c | 810 var->num_children = var->children.size (); 818 if (var->num_children == -1) 830 var->num_children = number_of_children (var); 833 return var->num_children >= 0 ? var->num_children : 0; 857 if (var->num_children == -1) 858 var->num_children = number_of_children (var); 861 if (var->num_children == -1) 866 while (var->children.size () < var->num_children) 869 for (int i = 0; i < var->num_children; [all...] |
H A D | varobj.h | 128 int num_children = -1; member in struct:varobj
|
/netbsd-current/external/gpl3/gdb/dist/gdb/ |
H A D | varobj.c | 771 var->num_children = var->children.size (); 779 if (var->num_children == -1) 791 var->num_children = number_of_children (var); 794 return var->num_children >= 0 ? var->num_children : 0; 818 if (var->num_children == -1) 819 var->num_children = number_of_children (var); 822 if (var->num_children == -1) 827 while (var->children.size () < var->num_children) 830 for (int i = 0; i < var->num_children; [all...] |
H A D | varobj.h | 128 int num_children = -1; member in struct:varobj
|
/netbsd-current/games/fortune/fortune/ |
H A D | fortune.c | 102 int num_children; member in struct:fd 658 fp->num_children = 2; 703 fp->num_children = 0; 709 fp->num_children++; 714 if (fp->num_children == 0) { 990 choice = arc4random_uniform(parent->num_children); 992 choice, parent->num_children));
|
/netbsd-current/external/gpl3/gcc.old/dist/libgomp/ |
H A D | task.c | 499 taskgroup->num_children++; 809 taskgroup->num_children++; 823 taskgroup->num_children++; 1286 if (taskgroup->num_children > 1) 1287 --taskgroup->num_children; 1290 /* We access taskgroup->num_children in GOMP_taskgroup_end 1295 __atomic_store_n (&taskgroup->num_children, 0, MEMMODEL_RELEASE); 1844 taskgroup->num_children = 0; 1891 /* The acquire barrier on load of taskgroup->num_children here 1897 if (__atomic_load_n (&taskgroup->num_children, MEMMODEL_ACQUIR [all...] |
H A D | taskloop.c | 343 taskgroup->num_children += num_tasks;
|
H A D | libgomp.h | 563 size_t num_children; member in struct:gomp_taskgroup
|
/netbsd-current/external/gpl3/gcc.old/dist/fixincludes/ |
H A D | fixincl.c | 1348 int num_children = 0; local 1415 num_children++; 1425 apply_ct += num_children; 1431 } while (--num_children > 0);
|
/netbsd-current/external/gpl3/gcc/dist/fixincludes/ |
H A D | fixincl.c | 1348 int num_children = 0; local 1423 num_children++; 1433 apply_ct += num_children; 1439 } while (--num_children > 0);
|
/netbsd-current/external/gpl3/gcc/dist/libgomp/ |
H A D | task.c | 537 taskgroup->num_children++; 869 taskgroup->num_children++; 883 taskgroup->num_children++; 1346 if (taskgroup->num_children > 1) 1347 --taskgroup->num_children; 1350 /* We access taskgroup->num_children in GOMP_taskgroup_end 1355 __atomic_store_n (&taskgroup->num_children, 0, MEMMODEL_RELEASE); 1939 taskgroup->num_children = 0; 1986 /* The acquire barrier on load of taskgroup->num_children here 1992 if (__atomic_load_n (&taskgroup->num_children, MEMMODEL_ACQUIR [all...] |
H A D | taskloop.c | 362 taskgroup->num_children += num_tasks;
|