| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 59 const size_type num_children = nd_it.num_children(); in find_by_order() local
60 if (num_children == 0) in find_by_order()
63 for (size_type i = 0; i < num_children; ++i) in find_by_order()
68 i = num_children; in find_by_order()
112 const size_type num_children = nd_it.num_children(); in order_of_prefix() local
113 if (num_children == 0) in order_of_prefix()
127 size_type i = num_children - 1; in order_of_prefix()
155 const size_type num_children = nd_it.num_children(); in operator ()() local
157 for (size_type i = 0; i < num_children; ++i) in operator ()()
160 const size_type res = (num_children == 0) ? 1 : children_rank; in operator ()()
|
| H A D | trie_policy_base.hpp | 159 if (nd_it.num_children() == 0) in leftmost_it()
170 const size_type num_children = nd_it.num_children(); in rightmost_it() local
172 if (num_children == 0) in rightmost_it()
175 return rightmost_it(nd_it.get_child(num_children - 1)); in rightmost_it()
|
| H A D | prefix_search_node_update_imp.hpp | 119 const size_type num_children = nd_it.num_children(); in next_child() local
122 for (size_type i = 0; i < num_children; ++i) in next_child()
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/ext/pb_ds/detail/trie_policy/ |
| H A D | order_statistics_imp.hpp | 59 const size_type num_children = nd_it.num_children(); in find_by_order() local
60 if (num_children == 0) in find_by_order()
63 for (size_type i = 0; i < num_children; ++i) in find_by_order()
68 i = num_children; in find_by_order()
112 const size_type num_children = nd_it.num_children(); in order_of_prefix() local
113 if (num_children == 0) in order_of_prefix()
127 size_type i = num_children - 1; in order_of_prefix()
155 const size_type num_children = nd_it.num_children(); in operator ()() local
157 for (size_type i = 0; i < num_children; ++i) in operator ()()
160 const size_type res = (num_children == 0) ? 1 : children_rank; in operator ()()
|
| H A D | trie_policy_base.hpp | 159 if (nd_it.num_children() == 0) in leftmost_it()
170 const size_type num_children = nd_it.num_children(); in rightmost_it() local
172 if (num_children == 0) in rightmost_it()
175 return rightmost_it(nd_it.get_child(num_children - 1)); in rightmost_it()
|
| H A D | prefix_search_node_update_imp.hpp | 119 const size_type num_children = nd_it.num_children(); in next_child() local
122 for (size_type i = 0; i < num_children; ++i) in next_child()
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/ext/pb_ds/detail/pat_trie_/ |
| H A D | trace_fn_imps.hpp | 86 const size_type num_children = std::distance(p_internal->begin(), in trace_node() local
89 for (size_type child_i = 0; child_i < num_children; ++child_i) in trace_node()
92 std::advance(child_it, num_children - child_i - 1); in trace_node()
|
| H A D | split_fn_imps.hpp | 199 size_type num_children, branch_bag& r_bag) in split_insert_branch() argument
207 const size_type total_num_children = start + num_children; in split_insert_branch()
235 while (num_inserted++ < num_children) in split_insert_branch()
|
| H A D | pat_trie_base.hpp | 879 _GLIBCXX_DEBUG_ASSERT(num_children() == 0); in operator *()
890 num_children() const in num_children() function in __gnu_pbds::detail::pat_trie_base::_Node_citer
960 _GLIBCXX_DEBUG_ASSERT(base_type::num_children() == 0); in operator *()
1291 const size_type num_children = std::distance(begin(), end()); in rightmost_descendant() local
1292 _GLIBCXX_DEBUG_ASSERT(num_children >= 2); in rightmost_descendant()
1295 std::advance(it, num_children - 1); in rightmost_descendant()
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/ext/pb_ds/detail/pat_trie_/ |
| H A D | trace_fn_imps.hpp | 86 const size_type num_children = std::distance(p_internal->begin(), in trace_node() local
89 for (size_type child_i = 0; child_i < num_children; ++child_i) in trace_node()
92 std::advance(child_it, num_children - child_i - 1); in trace_node()
|
| H A D | split_fn_imps.hpp | 199 size_type num_children, branch_bag& r_bag) in split_insert_branch() argument
207 const size_type total_num_children = start + num_children; in split_insert_branch()
235 while (num_inserted++ < num_children) in split_insert_branch()
|
| H A D | pat_trie_base.hpp | 879 _GLIBCXX_DEBUG_ASSERT(num_children() == 0); in operator *()
890 num_children() const in num_children() function in __gnu_pbds::detail::pat_trie_base::_Node_citer
960 _GLIBCXX_DEBUG_ASSERT(base_type::num_children() == 0); in operator *()
1291 const size_type num_children = std::distance(begin(), end()); in rightmost_descendant() local
1292 _GLIBCXX_DEBUG_ASSERT(num_children >= 2); in rightmost_descendant()
1295 std::advance(it, num_children - 1); in rightmost_descendant()
|
| /OK3568_Linux_fs/kernel/drivers/net/ethernet/intel/ice/ |
| H A D | ice_sched.c | 64 if (!start_node->num_children || in ice_sched_find_node_by_teid()
70 for (i = 0; i < start_node->num_children; i++) in ice_sched_find_node_by_teid()
75 for (i = 0; i < start_node->num_children; i++) { in ice_sched_find_node_by_teid()
197 parent->children[parent->num_children++] = node; in ice_sched_add_node()
289 for (i = 0; i < pi->root->num_children; i++) in ice_sched_get_tc_node()
314 while (node->num_children) in ice_free_sched_node()
332 for (i = 0; i < parent->num_children; i++) in ice_free_sched_node()
334 for (j = i + 1; j < parent->num_children; j++) in ice_free_sched_node()
337 parent->num_children--; in ice_free_sched_node()
942 if ((parent->num_children + num_nodes) > max_child_nodes) { in ice_sched_add_nodes_to_layer()
[all …]
|
| H A D | ice_dcb.c | 1360 for (i = 0; i < pi->root->num_children; i++) { in ice_update_port_tc_tree_cfg()
1378 for (i = 0; i < pi->root->num_children; i++) { in ice_update_port_tc_tree_cfg()
1389 if (i < pi->root->num_children) in ice_update_port_tc_tree_cfg()
|
| H A D | ice_type.h | 379 u8 num_children; member
|
| /OK3568_Linux_fs/kernel/drivers/net/ethernet/netronome/nfp/abm/ |
| H A D | qdisc.c | 309 for (i = 0; i < mq->num_children; i++) in nfp_abm_qdisc_clear_mq()
361 qdisc->num_children = children; in nfp_abm_qdisc_alloc()
417 nfp_abm_qdisc_unlink_children(qdisc, 0, qdisc->num_children); in nfp_abm_qdisc_destroy()
439 if (WARN(id >= parent->num_children, in nfp_abm_qdisc_graft()
441 id, parent->num_children)) in nfp_abm_qdisc_graft()
794 for (i = 0; i < qdisc->num_children; i++) { in nfp_abm_mq_stats()
|
| H A D | main.h | 158 unsigned int num_children; member
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/share/info/ |
| H A D | gdb.info | 39584 'num_children'
39608 ^done,groups=[{id="17",type="process",pid="yyy",num_children="2"}]
39616 ^done,groups=[{id="17",type="process",pid="yyy",num_children="2",cores=[1,2]}]
39618 ^done,groups=[{id="17", types="process",pid="yyy",num_children="2",cores=[1,2],
39622 ^done,groups=[{id="17", types="process",pid="yyy",num_children="2",cores=[1,2],
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/share/info/ |
| H A D | gdb.info | 39584 'num_children'
39608 ^done,groups=[{id="17",type="process",pid="yyy",num_children="2"}]
39616 ^done,groups=[{id="17",type="process",pid="yyy",num_children="2",cores=[1,2]}]
39618 ^done,groups=[{id="17", types="process",pid="yyy",num_children="2",cores=[1,2],
39622 ^done,groups=[{id="17", types="process",pid="yyy",num_children="2",cores=[1,2],
|