Home
last modified time | relevance | path

Searched refs:children (Results 1 – 25 of 431) sorted by relevance

12345678910>>...18

/OK3568_Linux_fs/external/xserver/test/
H A Dlist.c38 struct xorg_list children; member
59 xorg_list_init(&parent.children); in test_xorg_list_init()
65 assert(xorg_list_is_empty(&parent.children)); in test_xorg_list_init()
75 xorg_list_init(&parent.children); in test_xorg_list_add()
77 xorg_list_add(&child[0].node, &parent.children); in test_xorg_list_add()
78 assert(!xorg_list_is_empty(&parent.children)); in test_xorg_list_add()
80 c = xorg_list_first_entry(&parent.children, struct child, node); in test_xorg_list_add()
85 xorg_list_add(&child[1].node, &parent.children); in test_xorg_list_add()
86 c = xorg_list_first_entry(&parent.children, struct child, node); in test_xorg_list_add()
90 xorg_list_add(&child[2].node, &parent.children); in test_xorg_list_add()
[all …]
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/wagyu/0.4.3/include/mapbox/geometry/wagyu/
H A Dring.hpp78 ring_vector<T> children; member
94 children(),
159 ring_vector<T> children; member
172 : children(), in ring_manager()
230 void set_to_children(ring_ptr<T> r, ring_vector<T>& children) { in set_to_children() argument
231 for (auto& c : children) { in set_to_children()
237 children.push_back(r); in set_to_children()
241 void remove_from_children(ring_ptr<T> r, ring_vector<T>& children) { in remove_from_children() argument
242 for (auto& c : children) { in remove_from_children()
260 auto& children = parent == nullptr ? manager.children : parent->children; in assign_as_child() local
[all …]
H A Dbuild_result.hpp46 for (auto c : r->children) { in build_result_polygons()
53 for (auto c : r->children) { in build_result_polygons()
57 if (!c->children.empty()) { in build_result_polygons()
58 build_result_polygons(solution, c->children, reverse_output); in build_result_polygons()
68 build_result_polygons(solution, rings.children, reverse_output); in build_result()
/OK3568_Linux_fs/yocto/poky/meta/recipes-devtools/apt/apt/
H A Dtriehash226 $self->{children} = {};
266 $self->{children}{$child} = Trie->new if (!defined($self->{children}{$child}));
268 $self->{children}{$child}->insert($tail, $label, $value);
282 foreach my $key (sort keys %{$self->{children}}) {
283 if ($togo > length($key) || defined $self->{children}{$key}->{value}) {
284 my $child = $self->{children}{$key}->filter_depth($togo - length($key));
286 $new->{children}{$key}= $child if defined $child;
307 foreach my $key (sort keys %{$self->{children}}) {
308 $self->{children}{$key}->reinsert_value_nodes_into($trie, $prefix . $key);
345 foreach my $key (sort keys %{$self->{children}}) {
[all …]
/OK3568_Linux_fs/kernel/tools/testing/selftests/cgroup/
H A Dtest_memcontrol.c268 char *children[4] = {NULL}; in test_memcg_min() local
315 for (i = 0; i < ARRAY_SIZE(children); i++) { in test_memcg_min()
316 children[i] = cg_name_indexed(parent[1], "child_memcg", i); in test_memcg_min()
317 if (!children[i]) in test_memcg_min()
320 if (cg_create(children[i])) in test_memcg_min()
326 cg_run_nowait(children[i], alloc_pagecache_50M_noexit, in test_memcg_min()
334 if (cg_write(children[0], "memory.min", "75M")) in test_memcg_min()
336 if (cg_write(children[1], "memory.min", "25M")) in test_memcg_min()
338 if (cg_write(children[2], "memory.min", "500M")) in test_memcg_min()
340 if (cg_write(children[3], "memory.min", "0")) in test_memcg_min()
[all …]
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/index/detail/rtree/rstar/
H A Dchoose_next_node.hpp53 children_type & children = rtree::elements(n); in apply() local
58 …return choose_by_minimum_overlap_cost(children, indexable, parameters.get_overlap_cost_threshold()… in apply()
62 return choose_by_minimum_content_cost(children, indexable); in apply()
67 static inline size_t choose_by_minimum_overlap_cost(children_type const& children, in choose_by_minimum_overlap_cost() argument
71 const size_t children_count = children.size(); in choose_by_minimum_overlap_cost()
85 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost()
111 if ( 0 < overlap_cost_threshold && overlap_cost_threshold < children.size() ) in choose_by_minimum_overlap_cost()
120 …choosen_index = choose_by_minimum_overlap_cost_first_n(children, indexable, first_n_children_count… in choose_by_minimum_overlap_cost()
133 static inline size_t choose_by_minimum_overlap_cost_first_n(children_type const& children, in choose_by_minimum_overlap_cost_first_n() argument
151 child_type const& ch_i = children[i]; in choose_by_minimum_overlap_cost_first_n()
[all …]
/OK3568_Linux_fs/kernel/tools/perf/Documentation/
H A Dcallchain-overhead-calculation.txt9 The 'children' overhead is calculated by adding all period values of
15 It might be confusing that the sum of all the 'children' overhead
19 spread over the children.
64 When the --children option is enabled, the 'self' overhead values of
66 calculate the 'children' overhead. In this case the report could be
96 'children' overhead of 'bar', 'main' and '\_\_libc_start_main'.
98 'children' overhead of 'main' and '\_\_libc_start_main'.
101 same (100%) 'children' overhead (even though they have zero 'self'
104 Since v3.16 the 'children' overhead is shown by default and the output
105 is sorted by its values. The 'children' overhead is disabled by
[all …]
/OK3568_Linux_fs/yocto/poky/bitbake/lib/toaster/toastergui/static/js/
H A Djquery.treetable.js30 this.treeCell = $(this.row.children(this.settings.columnElType)[this.settings.column]);
33 this.children = []; property in anonymousFunction75f42a160100.Node.Node
39 return this.children.push(child);
106 if(this.children.length > 0 || this.row.data(this.settings.branchAttr) === true) {
132 var i = $.inArray(child, this.children);
133 return this.children.splice(i, 1)
201 _ref = this.children;
230 _ref = this.children;
276 if (node.children.length > 0) {
277 return this.findLastNode(node.children[node.children.length - 1]);
[all …]
H A Dlayerdetails.js84 newLayerDep.children("span").tooltip();
86 var link = newLayerDep.children("a");
92 var trashItem = newLayerDep.children("span");
106 mParent.children("form").slideDown();
107 var currentVal = mParent.children(".current-value");
116 mParent.children(".text-muted").hide();
118 mParent.children(".delete-current-value").hide();
133 mParent.children("form").slideUp(function(){
134 mParent.children(".current-value").show();
136 if (!mParent.children(".current-value").html()){
[all …]
/OK3568_Linux_fs/kernel/drivers/net/ethernet/mellanox/mlx5/core/
H A Dfs_core.h136 struct list_head children; member
299 list_for_each_entry_reverse(pos, &(prio)->node.children, list)
302 list_for_each_entry(pos, (&(prio)->node.children), list)
305 fs_list_for_each_entry(pos, &(ns)->node.children)
308 fs_list_for_each_entry(pos, &(prio)->node.children)
311 fs_list_for_each_entry(pos, &(prio)->node.children)
314 fs_list_for_each_entry_safe(pos, tmp, &(prio)->node.children)
317 fs_list_for_each_entry(pos, &(ft)->node.children)
320 fs_list_for_each_entry(pos, &(fg)->node.children)
323 fs_list_for_each_entry(pos, &(fte)->node.children)
/OK3568_Linux_fs/kernel/drivers/mfd/
H A Dwl1273-core.c165 int children = 0; in wl1273_core_probe() local
175 if (!(pdata->children & WL1273_RADIO_CHILD)) { in wl1273_core_probe()
192 cell = &core->cells[children]; in wl1273_core_probe()
196 children++; in wl1273_core_probe()
204 if (pdata->children & WL1273_CODEC_CHILD) { in wl1273_core_probe()
205 cell = &core->cells[children]; in wl1273_core_probe()
211 children++; in wl1273_core_probe()
215 __func__, children); in wl1273_core_probe()
218 children, NULL, 0, NULL); in wl1273_core_probe()
/OK3568_Linux_fs/kernel/drivers/net/ethernet/netronome/nfp/abm/
H A Dqdisc.c23 return qdisc->children[id] && in nfp_abm_qdisc_child_valid()
24 qdisc->children[id] != NFP_QDISC_UNTRACKED; in nfp_abm_qdisc_child_valid()
80 nfp_abm_stats_update_red(alink, qdisc->children[i], i); in nfp_abm_stats_update_mq()
113 qdisc->children[i]->use_cnt--; in nfp_abm_qdisc_unlink_children()
114 qdisc->children[i] = NULL; in nfp_abm_qdisc_unlink_children()
201 !qdisc->children[0]; in nfp_abm_offload_compile_red()
236 struct nfp_qdisc *child = qdisc->children[i]; in nfp_abm_offload_compile_mq()
310 if (mq->children[i] == qdisc) { in nfp_abm_qdisc_clear_mq()
311 mq->children[i] = NULL; in nfp_abm_qdisc_clear_mq()
332 kfree(qdisc->children); in nfp_abm_qdisc_free()
[all …]
/OK3568_Linux_fs/kernel/lib/
H A Dgeneric-radix-tree.c13 struct genradix_node *children[GENRADIX_ARY]; member
71 n = n->children[offset >> genradix_depth_shift(level)]; in __genradix_ptr()
127 new_node->children[0] = n; in __genradix_ptr_alloc()
139 &n->children[offset >> genradix_depth_shift(level)]; in __genradix_ptr_alloc()
186 while (!n->children[i]) { in __genradix_iter_peek()
197 n = n->children[i]; in __genradix_iter_peek()
210 if (n->children[i]) in genradix_free_recurse()
211 genradix_free_recurse(n->children[i], level - 1); in genradix_free_recurse()
/OK3568_Linux_fs/kernel/drivers/platform/x86/
H A Dsurface3_button.c65 struct platform_device *children[BUTTON_TYPES]; member
167 if (priv->children[i]) in surface3_button_remove()
168 platform_device_unregister(priv->children[i]); in surface3_button_remove()
220 priv->children[i] = pd; in surface3_button_probe()
223 if (!priv->children[0] && !priv->children[1]) in surface3_button_probe()
/OK3568_Linux_fs/kernel/include/linux/phy/
H A Dphy.h159 struct device_node *children; member
188 #define of_phy_provider_register_full(dev, children, xlate) \ argument
189 __of_phy_provider_register(dev, children, THIS_MODULE, xlate)
191 #define devm_of_phy_provider_register_full(dev, children, xlate) \ argument
192 __devm_of_phy_provider_register(dev, children, THIS_MODULE, xlate)
257 struct device_node *children, struct module *owner,
261 struct device_node *children, struct module *owner,
476 struct device *dev, struct device_node *children, struct module *owner, in __of_phy_provider_register() argument
484 *dev, struct device_node *children, struct module *owner, in __devm_of_phy_provider_register() argument
/OK3568_Linux_fs/app/forlinx/flapp/src/plugins/allwinner/browser/
H A Dbookmarks.cpp107 for (int i = m_bookmarkRootNode->children().count() - 1; i >= 0; --i) { in load()
108 BookmarkNode *node = m_bookmarkRootNode->children().at(i); in load()
130 Q_ASSERT(m_bookmarkRootNode->children().count() == 0); in load()
177 int row = parent->children().indexOf(node); in removeBookmark()
214 for (int i = m_bookmarkRootNode->children().count() - 1; i >= 0; --i) { in menu()
215 BookmarkNode *node = m_bookmarkRootNode->children().at(i); in menu()
228 for (int i = m_bookmarkRootNode->children().count() - 1; i >= 0; --i) { in toolbar()
229 BookmarkNode *node = m_bookmarkRootNode->children().at(i); in toolbar()
282 , m_node(parent->children().value(row)) in RemoveBookmarksCommand()
370 return createIndex(parent->children().indexOf(node), 0, node); in index()
[all …]
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/src/mbgl/algorithm/
H A Dgenerate_clip_ids.cpp22 for (const auto& child : children) { in add()
27 children.emplace(p); in add()
31 return children == other.children; in operator ==()
/OK3568_Linux_fs/kernel/fs/nfs/blocklayout/
H A Ddev.c23 bl_free_device(&dev->children[i]); in bl_free_device()
24 kfree(dev->children); in bl_free_device()
182 struct pnfs_block_dev *child = &dev->children[i]; in bl_map_concat()
220 child = &dev->children[chunk_idx]; in bl_map_stripe()
424 d->children = kcalloc(v->concat.volumes_count, in bl_parse_concat()
426 if (!d->children) in bl_parse_concat()
430 ret = bl_parse_deviceid(server, &d->children[i], in bl_parse_concat()
436 d->children[i].start += len; in bl_parse_concat()
437 len += d->children[i].len; in bl_parse_concat()
453 d->children = kcalloc(v->stripe.volumes_count, in bl_parse_stripe()
[all …]
/OK3568_Linux_fs/yocto/meta-openembedded/meta-python/recipes-devtools/python/python3-yappi/
H A D0001-Fix-imports-for-ptests.patch285 - cs = fs[1].children
491 - self.assertTrue(fsa.children[0:1] is not None)
493 - prev_bchildfullname = fsa.children[fsb].full_name
497 - len(prev_bchildfullname) > len(fsa.children[fsb].full_name)
520 - childs_of_a = fsa.children.get().sort("tavg", "desc")
895 - self.assertEqual(fsa.children[fsb].ttot, fsb.ttot)
896 - self.assertEqual(fsa.children[fsb].tsub, fsb.tsub)
897 - self.assertEqual(fsb.children[fsc].ttot, fsc.ttot)
898 - self.assertEqual(fsb.children[fsc].tsub, fsc.tsub)
900 - self.assertEqual(fsc.children[fsd].ttot, fsd.ttot)
[all …]
/OK3568_Linux_fs/u-boot/drivers/power/pmic/
H A Drk8xx.c321 int children; in rk8xx_bind() local
332 children = pmic_bind_children(dev, regulators_node, pmic_children_info); in rk8xx_bind()
333 if (!children) in rk8xx_bind()
336 children = pmic_bind_children(dev, dev->node, power_key_info); in rk8xx_bind()
337 if (!children) in rk8xx_bind()
340 children = pmic_bind_children(dev, dev->node, rtc_info); in rk8xx_bind()
341 if (!children) in rk8xx_bind()
344 children = pmic_bind_children(dev, dev->node, fuel_gauge_info); in rk8xx_bind()
345 if (!children) in rk8xx_bind()
348 children = pmic_bind_children(dev, dev->node, rk817_codec_info); in rk8xx_bind()
[all …]
/OK3568_Linux_fs/kernel/scripts/
H A Dcheck-sysctl-docs97 delete children
146 children[curtable][curentry] = child
152 if (children[tables[1]][table]) {
153 for (entry in entries[children[tables[1]][table]]) {
/OK3568_Linux_fs/kernel/drivers/net/mdio/
H A Dmdio-mux.c25 struct mdio_mux_child_bus *children; member
87 struct mdio_mux_child_bus *cb = pb->children; in mdio_mux_uninit_children()
188 cb->next = pb->children; in mdio_mux_init()
189 pb->children = cb; in mdio_mux_init()
192 if (pb->children) { in mdio_mux_init()
/OK3568_Linux_fs/kernel/drivers/iio/multiplexer/
H A Diio-mux.c348 int children; in mux_probe() local
367 children = 0; in mux_probe()
370 children++; in mux_probe()
372 if (children <= 0) { in mux_probe()
378 sizeof_priv += sizeof(*mux->child) * children; in mux_probe()
379 sizeof_priv += sizeof(*mux->chan) * children; in mux_probe()
388 mux->chan = (struct iio_chan_spec *)(mux->child + children); in mux_probe()
399 indio_dev->num_channels = children; in mux_probe()
/OK3568_Linux_fs/kernel/drivers/i2c/muxes/
H A Di2c-mux-gpmux.c77 int children; in i2c_mux_probe() local
97 children = of_get_child_count(np); in i2c_mux_probe()
99 muxc = i2c_mux_alloc(parent, dev, children, 0, 0, in i2c_mux_probe()
132 dev_info(dev, "%d-port mux on %s adapter\n", children, parent->name); in i2c_mux_probe()
/OK3568_Linux_fs/kernel/tools/perf/scripts/python/
H A Dflamegraph.py30 self.children = []
37 "c": self.children
61 for child in node.children:
66 node.children.append(child)

12345678910>>...18