Home
last modified time | relevance | path

Searched refs:outer_node (Results 1 – 25 of 46) sorted by relevance

12

/dports/www/chromium-legacy/chromium-88.0.4324.182/cc/layers/
H A Dviewport.cc110 const ScrollNode* outer_node = OuterScrollNode(); in ComputeClampedDelta() local
112 *outer_node, remaining_delta); in ComputeClampedDelta()
124 ScrollNode* outer_node = OuterScrollNode(); in GetInnerViewportSizeExcludingScrollbars() local
145 auto* outer_node = OuterScrollNode(); in ScrollByInnerFirst() local
146 if (!unused_delta.IsZero() && outer_node) { in ScrollByInnerFirst()
147 scroll_tree().ScrollBy(*outer_node, unused_delta, in ScrollByInnerFirst()
163 auto* outer_node = OuterScrollNode(); in ScrollAnimated() local
164 if (!outer_node) in ScrollAnimated()
179 *outer_node, pending_delta); in ScrollAnimated()
333 if (auto* outer_node = OuterScrollNode()) in MaxTotalScrollOffset() local
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/cc/layers/
H A Dviewport.cc94 auto* outer_node = OuterScrollNode(); in ScrollByInnerFirst() local
95 if (!unused_delta.IsZero() && outer_node) { in ScrollByInnerFirst()
96 scroll_tree().ScrollBy(*outer_node, unused_delta, in ScrollByInnerFirst()
112 auto* outer_node = OuterScrollNode(); in ScrollAnimated() local
113 if (!outer_node) in ScrollAnimated()
128 host_impl_->ComputeScrollDelta(*outer_node, pending_delta); in ScrollAnimated()
142 host_impl_->ScrollAnimationCreate(*outer_node, outer_delta, delayed_by); in ScrollAnimated()
282 if (auto* outer_node = OuterScrollNode()) in MaxTotalScrollOffset() local
283 offset += scroll_tree().MaxScrollOffset(outer_node->id); in MaxTotalScrollOffset()
296 if (auto* outer_node = OuterScrollNode()) in TotalScrollOffset() local
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/content/browser/portal/
H A Dportal.cc128 FrameTreeNode* outer_node = outer_contents_impl->GetFrameTree()->AddFrame( in CreateProxyAndAttachPortal() local
139 outer_node->AddObserver(this); in CreateProxyAndAttachPortal()
157 portal_contents_.ReleaseOwnership(), outer_node->current_frame_host(), in CreateProxyAndAttachPortal()
547 FrameTreeNode* outer_node = FrameTreeNode::GloballyFindByID( in Clear() local
549 if (outer_node) in Clear()
550 outer_node->RemoveObserver(portal_); in Clear()
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/blink/renderer/core/editing/commands/
H A Dcomposite_edit_command.cc1167 Node* outer_node = passed_outer_node; in CloneParagraphUnderNewElement() local
1169 if (IsRootEditableElement(*outer_node)) { in CloneParagraphUnderNewElement()
1172 last_node = outer_node->cloneNode(IsDisplayInsideTable(outer_node)); in CloneParagraphUnderNewElement()
1179 start.AnchorNode()->IsDescendantOf(outer_node)) { in CloneParagraphUnderNewElement()
1185 if (runner == outer_node) in CloneParagraphUnderNewElement()
1204 if (!outer_node->isConnected()) in CloneParagraphUnderNewElement()
1215 while (outer_node && !end.AnchorNode()->IsDescendantOf(outer_node)) { in CloneParagraphUnderNewElement()
1216 outer_node = outer_node->parentNode(); in CloneParagraphUnderNewElement()
1219 if (!outer_node) in CloneParagraphUnderNewElement()
1319 Node* outer_node, in MoveParagraphWithClones() argument
[all …]
H A Dcomposite_edit_command.h207 Node* outer_node,
211 Node* outer_node,
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/blink/renderer/core/editing/commands/
H A Dcomposite_edit_command.cc1190 Node* outer_node = passed_outer_node; in CloneParagraphUnderNewElement() local
1192 if (IsRootEditableElement(*outer_node)) { in CloneParagraphUnderNewElement()
1195 last_node = outer_node->cloneNode(IsDisplayInsideTable(outer_node)); in CloneParagraphUnderNewElement()
1202 start.AnchorNode()->IsDescendantOf(outer_node)) { in CloneParagraphUnderNewElement()
1208 if (runner == outer_node) in CloneParagraphUnderNewElement()
1227 if (!outer_node->isConnected()) in CloneParagraphUnderNewElement()
1238 while (outer_node && !end.AnchorNode()->IsDescendantOf(outer_node)) { in CloneParagraphUnderNewElement()
1239 outer_node = outer_node->parentNode(); in CloneParagraphUnderNewElement()
1242 if (!outer_node) in CloneParagraphUnderNewElement()
1342 Node* outer_node, in MoveParagraphWithClones() argument
[all …]
H A Dcomposite_edit_command.h207 Node* outer_node,
211 Node* outer_node,
/dports/devel/onetbb/oneTBB-2021.4.0/test/tbb/
H A Dtest_composite_node.cpp380 tbb::flow::composite_node<std::tuple<int, int>, std::tuple<int> > outer_node(g); in test_nested_adder() local
389 …outer_node.set_external_ports(base_type::input_ports_type(tbb::flow::input_port<0>(inner_node1), t… in test_nested_adder()
391 …CHECK_MESSAGE( (&tbb::flow::input_port<0>(outer_node) == &tbb::flow::input_port<0>(inner_node1)), … in test_nested_adder()
392 …CHECK_MESSAGE( (&tbb::flow::input_port<1>(outer_node) == &tbb::flow::input_port<1>(inner_node1)), … in test_nested_adder()
393 …CHECK_MESSAGE( (&tbb::flow::output_port<0>(outer_node) == &tbb::flow::output_port<0>(inner_node3))… in test_nested_adder()
395 tbb::flow::make_edge(input, tbb::flow::input_port<0>(outer_node)/*inner_node1*/); in test_nested_adder()
396 tbb::flow::make_edge(input, tbb::flow::input_port<1>(outer_node)/*inner_node1*/); in test_nested_adder()
404 tbb::flow::make_edge(outer_node/*inner_node3*/, output); in test_nested_adder()
407 outer_node.add_nodes(inner_node1, inner_node2, inner_node3); in test_nested_adder()
409 outer_node.add_visible_nodes(inner_node1, inner_node2, inner_node3); in test_nested_adder()
[all …]
/dports/math/stanmath/math-4.2.0/lib/tbb_2020.3/src/test/
H A Dtest_composite_node.cpp390 tbb::flow::composite_node<tbb::flow::tuple<int, int>, tbb::flow::tuple<int> > outer_node(g); in test_nested_adder() local
399 …outer_node.set_external_ports(base_type::input_ports_type(tbb::flow::input_port<0>(inner_node1), t… in test_nested_adder()
401 …ASSERT(&tbb::flow::input_port<0>(outer_node) == &tbb::flow::input_port<0>(inner_node1), "input por… in test_nested_adder()
402 …ASSERT(&tbb::flow::input_port<1>(outer_node) == &tbb::flow::input_port<1>(inner_node1), "input por… in test_nested_adder()
403 …ASSERT(&tbb::flow::output_port<0>(outer_node) == &tbb::flow::output_port<0>(inner_node3), "output … in test_nested_adder()
405 tbb::flow::make_edge(input, tbb::flow::input_port<0>(outer_node)/*inner_node1*/); in test_nested_adder()
406 tbb::flow::make_edge(input, tbb::flow::input_port<1>(outer_node)/*inner_node1*/); in test_nested_adder()
414 tbb::flow::make_edge(outer_node/*inner_node3*/, output); in test_nested_adder()
417 outer_node.add_nodes(inner_node1, inner_node2, inner_node3); in test_nested_adder()
419 outer_node.add_visible_nodes(inner_node1, inner_node2, inner_node3); in test_nested_adder()
[all …]
/dports/devel/tbb/oneTBB-2020.3/src/test/
H A Dtest_composite_node.cpp390 tbb::flow::composite_node<tbb::flow::tuple<int, int>, tbb::flow::tuple<int> > outer_node(g); in test_nested_adder() local
399 …outer_node.set_external_ports(base_type::input_ports_type(tbb::flow::input_port<0>(inner_node1), t… in test_nested_adder()
401 …ASSERT(&tbb::flow::input_port<0>(outer_node) == &tbb::flow::input_port<0>(inner_node1), "input por… in test_nested_adder()
402 …ASSERT(&tbb::flow::input_port<1>(outer_node) == &tbb::flow::input_port<1>(inner_node1), "input por… in test_nested_adder()
403 …ASSERT(&tbb::flow::output_port<0>(outer_node) == &tbb::flow::output_port<0>(inner_node3), "output … in test_nested_adder()
405 tbb::flow::make_edge(input, tbb::flow::input_port<0>(outer_node)/*inner_node1*/); in test_nested_adder()
406 tbb::flow::make_edge(input, tbb::flow::input_port<1>(outer_node)/*inner_node1*/); in test_nested_adder()
414 tbb::flow::make_edge(outer_node/*inner_node3*/, output); in test_nested_adder()
417 outer_node.add_nodes(inner_node1, inner_node2, inner_node3); in test_nested_adder()
419 outer_node.add_visible_nodes(inner_node1, inner_node2, inner_node3); in test_nested_adder()
[all …]
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/tbb/src/test/
H A Dtest_composite_node.cpp390 tbb::flow::composite_node<tbb::flow::tuple<int, int>, tbb::flow::tuple<int> > outer_node(g); in test_nested_adder() local
399 …outer_node.set_external_ports(base_type::input_ports_type(tbb::flow::input_port<0>(inner_node1), t… in test_nested_adder()
401 …ASSERT(&tbb::flow::input_port<0>(outer_node) == &tbb::flow::input_port<0>(inner_node1), "input por… in test_nested_adder()
402 …ASSERT(&tbb::flow::input_port<1>(outer_node) == &tbb::flow::input_port<1>(inner_node1), "input por… in test_nested_adder()
403 …ASSERT(&tbb::flow::output_port<0>(outer_node) == &tbb::flow::output_port<0>(inner_node3), "output … in test_nested_adder()
405 tbb::flow::make_edge(input, tbb::flow::input_port<0>(outer_node)/*inner_node1*/); in test_nested_adder()
406 tbb::flow::make_edge(input, tbb::flow::input_port<1>(outer_node)/*inner_node1*/); in test_nested_adder()
414 tbb::flow::make_edge(outer_node/*inner_node3*/, output); in test_nested_adder()
417 outer_node.add_nodes(inner_node1, inner_node2, inner_node3); in test_nested_adder()
419 outer_node.add_visible_nodes(inner_node1, inner_node2, inner_node3); in test_nested_adder()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/content/browser/portal/
H A Dportal.cc137 FrameTreeNode* outer_node = outer_contents_impl->GetFrameTree()->AddFrame( in CreateProxyAndAttachPortal() local
147 outer_node->AddObserver(this); in CreateProxyAndAttachPortal()
166 portal_contents_.ReleaseOwnership(), outer_node->current_frame_host(), in CreateProxyAndAttachPortal()
677 FrameTreeNode* outer_node = FrameTreeNode::GloballyFindByID( in Clear() local
679 if (outer_node) in Clear()
680 outer_node->RemoveObserver(portal_); in Clear()
/dports/textproc/py-sphinx-tabs/sphinx-tabs-3.2.0/sphinx_tabs/
H A Dtabs.py191 outer_node = nodes.container()
200 outer_node += tab
201 outer_node += panel
203 return [outer_node]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/content/browser/web_contents/
H A Dweb_contents_view_child_frame.cc151 FrameTreeNode* outer_node = FrameTreeNode::GloballyFindByID( in TakeFocus() local
154 outer_node->parent()->render_manager()->current_frame_host(); in TakeFocus()
/dports/www/chromium-legacy/chromium-88.0.4324.182/content/browser/web_contents/
H A Dweb_contents_view_child_frame.cc152 FrameTreeNode* outer_node = FrameTreeNode::GloballyFindByID( in TakeFocus() local
154 RenderFrameHostImpl* rfhi = outer_node->parent(); in TakeFocus()
/dports/lang/gcc48/gcc-4.8.5/gcc/
H A Dipa-inline.c632 struct cgraph_node *outer_node, in want_inline_self_recursive_call_p() argument
649 else if (max_count && !outer_node->count) in want_inline_self_recursive_call_p()
660 if (outer_node->global.inlined_to) in want_inline_self_recursive_call_p()
661 caller_freq = outer_node->callers->frequency; in want_inline_self_recursive_call_p()
682 && (edge->count * CGRAPH_FREQ_BASE / outer_node->count in want_inline_self_recursive_call_p()
715 && (edge->count * 100 / outer_node->count in want_inline_self_recursive_call_p()
1585 struct cgraph_node *outer_node = NULL; in inline_small_functions() local
1597 outer_node = where, depth++; in inline_small_functions()
1600 if (outer_node in inline_small_functions()
1601 && !want_inline_self_recursive_call_p (edge, outer_node, in inline_small_functions()
/dports/devel/mingw32-gcc/gcc-4.8.1/gcc/
H A Dipa-inline.c632 struct cgraph_node *outer_node, in want_inline_self_recursive_call_p() argument
649 else if (max_count && !outer_node->count) in want_inline_self_recursive_call_p()
660 if (outer_node->global.inlined_to) in want_inline_self_recursive_call_p()
661 caller_freq = outer_node->callers->frequency; in want_inline_self_recursive_call_p()
682 && (edge->count * CGRAPH_FREQ_BASE / outer_node->count in want_inline_self_recursive_call_p()
715 && (edge->count * 100 / outer_node->count in want_inline_self_recursive_call_p()
1585 struct cgraph_node *outer_node = NULL; in inline_small_functions() local
1597 outer_node = where, depth++; in inline_small_functions()
1600 if (outer_node in inline_small_functions()
1601 && !want_inline_self_recursive_call_p (edge, outer_node, in inline_small_functions()
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/
H A Dipa-inline.c675 struct cgraph_node *outer_node, in want_inline_self_recursive_call_p() argument
692 else if (max_count && !outer_node->count) in want_inline_self_recursive_call_p()
703 if (outer_node->global.inlined_to) in want_inline_self_recursive_call_p()
704 caller_freq = outer_node->callers->frequency; in want_inline_self_recursive_call_p()
731 && (edge->count * CGRAPH_FREQ_BASE / outer_node->count in want_inline_self_recursive_call_p()
764 && (edge->count * 100 / outer_node->count in want_inline_self_recursive_call_p()
1778 struct cgraph_node *outer_node = NULL; in inline_small_functions() local
1791 outer_node = where, depth++; in inline_small_functions()
1794 if (outer_node in inline_small_functions()
1795 && !want_inline_self_recursive_call_p (edge, outer_node, in inline_small_functions()
/dports/games/abstreet/earcutr-e029a11b66fd27f2ca2fd457dd37c403485ebba1/src/
H A Dlib.rs252 let mut outer_node = inouter_node; in eliminate_holes() localVariable
272 eliminate_hole(ll, queue[i].idx, outer_node); in eliminate_holes()
273 let nextidx = next!(ll, outer_node).idx; in eliminate_holes()
274 outer_node = filter_points(ll, outer_node, nextidx); in eliminate_holes()
276 outer_node in eliminate_holes()
712 let (mut ll, mut outer_node) = linked_list(data, 0, outer_len, true); in earcut()
718 outer_node = eliminate_holes(&mut ll, data, hole_indices, outer_node); in earcut()
731 earcut_linked_hashed(&mut ll, outer_node, &mut triangles, 0); in earcut()
733 earcut_linked_unhashed(&mut ll, outer_node, &mut triangles, 0); in earcut()
862 let mut p = outer_node; in find_hole_bridge()
[all …]
/dports/lang/gnat_util/gcc-6-20180516/gcc/
H A Dipa-inline.c833 struct cgraph_node *outer_node, in want_inline_self_recursive_call_p() argument
850 else if (max_count && !outer_node->count) in want_inline_self_recursive_call_p()
861 if (outer_node->global.inlined_to) in want_inline_self_recursive_call_p()
862 caller_freq = outer_node->callers->frequency; in want_inline_self_recursive_call_p()
889 && (edge->count * CGRAPH_FREQ_BASE / outer_node->count in want_inline_self_recursive_call_p()
922 && (edge->count * 100 / outer_node->count in want_inline_self_recursive_call_p()
1992 struct cgraph_node *outer_node = NULL; in inline_small_functions() local
2005 outer_node = where, depth++; in inline_small_functions()
2008 if (outer_node in inline_small_functions()
2009 && !want_inline_self_recursive_call_p (edge, outer_node, in inline_small_functions()
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/
H A Dipa-inline.c833 struct cgraph_node *outer_node, in want_inline_self_recursive_call_p() argument
850 else if (max_count && !outer_node->count) in want_inline_self_recursive_call_p()
861 if (outer_node->global.inlined_to) in want_inline_self_recursive_call_p()
862 caller_freq = outer_node->callers->frequency; in want_inline_self_recursive_call_p()
889 && (edge->count * CGRAPH_FREQ_BASE / outer_node->count in want_inline_self_recursive_call_p()
922 && (edge->count * 100 / outer_node->count in want_inline_self_recursive_call_p()
1992 struct cgraph_node *outer_node = NULL; in inline_small_functions() local
2005 outer_node = where, depth++; in inline_small_functions()
2008 if (outer_node in inline_small_functions()
2009 && !want_inline_self_recursive_call_p (edge, outer_node, in inline_small_functions()
/dports/devel/avr-gcc/gcc-10.2.0/gcc/
H A Dipa-inline.c947 struct cgraph_node *outer_node, in want_inline_self_recursive_call_p() argument
954 int max_depth = opt_for_fn (outer_node->decl, in want_inline_self_recursive_call_p()
958 max_depth = opt_for_fn (outer_node->decl, in want_inline_self_recursive_call_p()
971 else if (outer_node->inlined_to in want_inline_self_recursive_call_p()
972 && (caller_freq = outer_node->callers->sreal_frequency ()) == 0) in want_inline_self_recursive_call_p()
1021 * opt_for_fn (outer_node->decl, in want_inline_self_recursive_call_p()
2174 struct cgraph_node *outer_node = NULL; in inline_small_functions() local
2187 outer_node = where, depth++; in inline_small_functions()
2190 if (outer_node in inline_small_functions()
2191 && !want_inline_self_recursive_call_p (edge, outer_node, in inline_small_functions()
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/
H A Dipa-inline.c979 struct cgraph_node *outer_node, in want_inline_self_recursive_call_p() argument
986 int max_depth = opt_for_fn (outer_node->decl, in want_inline_self_recursive_call_p()
990 max_depth = opt_for_fn (outer_node->decl, in want_inline_self_recursive_call_p()
1003 else if (outer_node->inlined_to in want_inline_self_recursive_call_p()
1004 && (caller_freq = outer_node->callers->sreal_frequency ()) == 0) in want_inline_self_recursive_call_p()
1053 * opt_for_fn (outer_node->decl, in want_inline_self_recursive_call_p()
2208 struct cgraph_node *outer_node = NULL; in inline_small_functions() local
2221 outer_node = where, depth++; in inline_small_functions()
2224 if (outer_node in inline_small_functions()
2225 && !want_inline_self_recursive_call_p (edge, outer_node, in inline_small_functions()
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/
H A Dipa-inline.c947 struct cgraph_node *outer_node, in want_inline_self_recursive_call_p() argument
954 int max_depth = opt_for_fn (outer_node->decl, in want_inline_self_recursive_call_p()
958 max_depth = opt_for_fn (outer_node->decl, in want_inline_self_recursive_call_p()
971 else if (outer_node->inlined_to in want_inline_self_recursive_call_p()
972 && (caller_freq = outer_node->callers->sreal_frequency ()) == 0) in want_inline_self_recursive_call_p()
1021 * opt_for_fn (outer_node->decl, in want_inline_self_recursive_call_p()
2174 struct cgraph_node *outer_node = NULL; in inline_small_functions() local
2187 outer_node = where, depth++; in inline_small_functions()
2190 if (outer_node in inline_small_functions()
2191 && !want_inline_self_recursive_call_p (edge, outer_node, in inline_small_functions()
/dports/lang/gcc11/gcc-11.2.0/gcc/
H A Dipa-inline.c979 struct cgraph_node *outer_node, in want_inline_self_recursive_call_p() argument
986 int max_depth = opt_for_fn (outer_node->decl, in want_inline_self_recursive_call_p()
990 max_depth = opt_for_fn (outer_node->decl, in want_inline_self_recursive_call_p()
1003 else if (outer_node->inlined_to in want_inline_self_recursive_call_p()
1004 && (caller_freq = outer_node->callers->sreal_frequency ()) == 0) in want_inline_self_recursive_call_p()
1053 * opt_for_fn (outer_node->decl, in want_inline_self_recursive_call_p()
2208 struct cgraph_node *outer_node = NULL; in inline_small_functions() local
2221 outer_node = where, depth++; in inline_small_functions()
2224 if (outer_node in inline_small_functions()
2225 && !want_inline_self_recursive_call_p (edge, outer_node, in inline_small_functions()

12