Home
last modified time | relevance | path

Searched refs:edge (Results 101 - 125 of 433) sorted by relevance

12345678910>>...18

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp181 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addIntraChainConstraint() local
183 // The edge does not exist. Create one with the appropriate interference in addIntraChainConstraint()
185 if (edge == G.invalidEdgeId()) { in addIntraChainConstraint()
206 if (G.getEdgeNode1Id(edge) == node2) { in addIntraChainConstraint()
212 PBQPRAGraph::RawMatrix costs(G.getEdgeCosts(edge)); in addIntraChainConstraint()
237 G.updateEdgeCosts(edge, std::move(costs)); in addIntraChainConstraint()
277 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addInterChainConstraint() local
278 assert(edge != G.invalidEdgeId() && in addInterChainConstraint()
279 "PBQP error ! The edge should exist !"); in addInterChainConstraint()
283 if (G.getEdgeNode1Id(edge) in addInterChainConstraint()
[all...]
/foundation/arkui/ace_engine/frameworks/core/components/navigation_bar/
H A Dnavigation_bar_component_base.cpp59 Edge edge; in BuildPadding() local
61 edge.SetBottom(Dimension(size, DimensionUnit::VP)); in BuildPadding()
63 edge.SetRight(Dimension(size, DimensionUnit::VP)); in BuildPadding()
65 padding->SetPadding(edge); in BuildPadding()
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/
H A Doverride-set.js47 getEdgeRule (edge) {
49 if (rule.name !== edge.name) {
58 let spec = npa(`${edge.name}@${edge.spec}`)
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dpropagator.h32 // Represents a CFG control edge.
118 // (c) For conditional branches, |visit_fn| may decide which edge to take out
136 // SSA Edges: An SSA edge is a def-use edge between a value-producing
138 // contains the statements at the end of a def-use edge that need
196 // Returns true if the |i|th argument for |phi| comes through a CFG edge that
247 // Marks |edge| as executable. Returns false if the edge was already marked
249 bool MarkEdgeExecutable(const Edge& edge) { in MarkEdgeExecutable() argument
250 return executable_edges_.insert(edge) in MarkEdgeExecutable()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dpropagator.h32 // Represents a CFG control edge.
118 // (c) For conditional branches, |visit_fn| may decide which edge to take out
136 // SSA Edges: An SSA edge is a def-use edge between a value-producing
138 // contains the statements at the end of a def-use edge that need
196 // Returns true if the |i|th argument for |phi| comes through a CFG edge that
247 // Marks |edge| as executable. Returns false if the edge was already marked
249 bool MarkEdgeExecutable(const Edge& edge) { in MarkEdgeExecutable() argument
250 return executable_edges_.insert(edge) in MarkEdgeExecutable()
[all...]
/third_party/spirv-tools/source/opt/
H A Dpropagator.h32 // Represents a CFG control edge.
118 // (c) For conditional branches, |visit_fn| may decide which edge to take out
136 // SSA Edges: An SSA edge is a def-use edge between a value-producing
138 // contains the statements at the end of a def-use edge that need
196 // Returns true if the |i|th argument for |phi| comes through a CFG edge that
247 // Marks |edge| as executable. Returns false if the edge was already marked
249 bool MarkEdgeExecutable(const Edge& edge) { in MarkEdgeExecutable() argument
250 return executable_edges_.insert(edge) in MarkEdgeExecutable()
[all...]
/third_party/ffmpeg/tests/checkasm/
H A Dvp8dsp.c385 int dir, edge, force_hev; in check_loopfilter_16y() local
396 for (edge = 0; edge < 2; edge++) { in check_loopfilter_16y()
398 switch (dir << 1 | edge) { in check_loopfilter_16y()
404 if (check_func(func, "vp8_loop_filter16y%s_%s", edge ? "_inner" : "", dir ? "v" : "h")) { in check_loopfilter_16y()
431 int dir, edge, force_hev; in check_loopfilter_8uv() local
444 for (edge = 0; edge < 2; edge in check_loopfilter_8uv()
[all...]
/third_party/skia/src/gpu/geometry/
H A DGrAATriangulator.cpp46 SSEdge(Edge* edge, SSVertex* prev, SSVertex* next) in SSEdge()
47 : fEdge(edge), fEvent(nullptr), fPrev(prev), fNext(next) { in SSEdge()
75 TESS_LOG("found edge event for %g, %g (original %g -> %g), " in makeEvent()
84 void GrAATriangulator::makeEvent(SSEdge* edge, Vertex* v, SSEdge* other, Vertex* dest, in makeEvent() argument
89 Vertex* top = edge->fEdge->fTop; in makeEvent()
90 Vertex* bottom = edge->fEdge->fBottom; in makeEvent()
94 Line line = edge->fEdge->fLine; in makeEvent()
101 TESS_LOG("found p edge event for %g, %g (original %g -> %g), " in makeEvent()
104 edge->fEvent = fAlloc->make<Event>(edge, in makeEvent()
[all...]
/foundation/arkui/ace_engine/frameworks/bridge/common/dom/
H A Ddom_badge.cpp41 auto edge = boxComponent_->GetPadding(); in PrepareSpecializedComponent() local
42 if (edge == Edge::NONE) { in PrepareSpecializedComponent()
45 declaration->SetPadding(edge); in PrepareSpecializedComponent()
/kernel/linux/linux-6.6/fs/btrfs/
H A Dbackref.c3041 struct btrfs_backref_edge *edge; in btrfs_backref_alloc_edge() local
3043 edge = kzalloc(sizeof(*edge), GFP_NOFS); in btrfs_backref_alloc_edge()
3044 if (edge) in btrfs_backref_alloc_edge()
3046 return edge; in btrfs_backref_alloc_edge()
3060 struct btrfs_backref_edge *edge; in btrfs_backref_cleanup_node() local
3067 edge = list_entry(node->upper.next, struct btrfs_backref_edge, in btrfs_backref_cleanup_node()
3069 upper = edge->node[UPPER]; in btrfs_backref_cleanup_node()
3070 list_del(&edge->list[LOWER]); in btrfs_backref_cleanup_node()
3071 list_del(&edge in btrfs_backref_cleanup_node()
3136 struct btrfs_backref_edge *edge; handle_direct_tree_backref() local
3215 struct btrfs_backref_edge *edge; handle_indirect_tree_backref() local
3380 struct btrfs_backref_edge *edge; btrfs_backref_add_tree_node() local
3499 struct btrfs_backref_edge *edge; btrfs_backref_finish_upper_links() local
3601 struct btrfs_backref_edge *edge; btrfs_backref_error_cleanup() local
[all...]
/kernel/linux/linux-5.10/drivers/clk/
H A Dclk-axi-clkgen.c166 unsigned int edge; member
188 params->edge = divider % 2; in axi_clkgen_calc_clk_params()
195 params->edge = divider % 2; in axi_clkgen_calc_clk_params()
198 if (params->edge == 0) { in axi_clkgen_calc_clk_params()
203 if (params->edge == 0 || frac_divider == 1) in axi_clkgen_calc_clk_params()
205 if (((params->edge == 0) ^ (frac_divider == 1)) || in axi_clkgen_calc_clk_params()
209 params->frac_phase = params->edge * 4 + frac_divider / 2; in axi_clkgen_calc_clk_params()
310 (params->frac_wf_r << 10) | (params->edge << 7) | in axi_clkgen_set_div()
350 (params.edge << 13) | (params.nocount << 12) | in axi_clkgen_set_rate()
/kernel/linux/linux-6.6/drivers/clk/
H A Dclk-axi-clkgen.c184 unsigned int edge; member
206 params->edge = divider % 2; in axi_clkgen_calc_clk_params()
213 params->edge = divider % 2; in axi_clkgen_calc_clk_params()
216 if (params->edge == 0) { in axi_clkgen_calc_clk_params()
221 if (params->edge == 0 || frac_divider == 1) in axi_clkgen_calc_clk_params()
223 if (((params->edge == 0) ^ (frac_divider == 1)) || in axi_clkgen_calc_clk_params()
227 params->frac_phase = params->edge * 4 + frac_divider / 2; in axi_clkgen_calc_clk_params()
328 (params->frac_wf_r << 10) | (params->edge << 7) | in axi_clkgen_set_div()
369 (params.edge << 13) | (params.nocount << 12) | in axi_clkgen_set_rate()
/third_party/node/deps/v8/src/compiler/
H A Dloop-variable-optimizer.cc61 for (Edge edge : node->use_edges()) { in Run()
62 if (NodeProperties::IsControlEdge(edge) && in Run()
63 edge.from()->op()->ControlOutputCount() > 0) { in Run()
64 Node* use = edge.from(); in Run()
66 edge.index() != kAssumedLoopEntryIndex) { in Run()
270 for (Edge edge : loop->use_edges()) { in DetectInductionVariables()
271 if (NodeProperties::IsControlEdge(edge) && in DetectInductionVariables()
272 edge.from()->opcode() == IrOpcode::kPhi) { in DetectInductionVariables()
273 Node* phi = edge.from(); in DetectInductionVariables()
H A Dcontrol-equivalence.cc99 Edge edge = *entry.input; in RunUndirectedDFS() local
100 Node* input = edge.to(); in RunUndirectedDFS()
102 if (NodeProperties::IsControlEdge(edge)) { in RunUndirectedDFS()
129 Edge edge = *entry.use; in RunUndirectedDFS() local
130 Node* use = edge.from(); in RunUndirectedDFS()
132 if (NodeProperties::IsControlEdge(edge)) { in RunUndirectedDFS()
H A Dnode-properties.h100 static bool IsValueEdge(Edge edge);
101 static bool IsContextEdge(Edge edge);
102 static bool IsFrameStateEdge(Edge edge);
103 static bool IsEffectEdge(Edge edge);
104 static bool IsControlEdge(Edge edge);
272 static inline bool IsInputRange(Edge edge, int first, int count);
/third_party/mesa3d/src/util/tests/
H A Ddag_test.cpp191 util_dynarray_foreach (&node[0].edges, struct dag_edge, edge) { in TEST_F()
192 if (edge->child == &node[1]) { in TEST_F()
193 EXPECT_EQ(edge->data, 1); in TEST_F()
195 EXPECT_EQ(edge->child, &node[2]); in TEST_F()
196 EXPECT_EQ(edge->data, 0); in TEST_F()
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/
H A DPrefixTree.java257 public void visit(DfaNode source, DfaEdge edge, DfaNode target) { in visit() argument
259 path = path.extendByMask(edge.getDigitMask()); in visit()
296 * steps if the current included edge overlaps with multiple "excluded" paths. Once a path no
302 for (DfaEdge edge : node.getEdges()) { in recursivelyMinimize()
303 int mask = edge.getDigitMask(); in recursivelyMinimize()
304 DfaNode target = edge.getTarget(); in recursivelyMinimize()
307 // from the current edge, just emit it and continue on to the next edge. in recursivelyMinimize()
/kernel/linux/linux-5.10/include/linux/rpmsg/
H A Dqcom_smd.h14 int qcom_smd_unregister_edge(struct qcom_smd_edge *edge);
25 static inline int qcom_smd_unregister_edge(struct qcom_smd_edge *edge) in qcom_smd_unregister_edge() argument
/kernel/linux/linux-6.6/include/linux/rpmsg/
H A Dqcom_smd.h14 void qcom_smd_unregister_edge(struct qcom_smd_edge *edge);
25 static inline void qcom_smd_unregister_edge(struct qcom_smd_edge *edge) in qcom_smd_unregister_edge() argument
/foundation/arkui/ace_engine/frameworks/core/components_ng/pattern/bubble/
H A Dbubble_paint_method.cpp91 BorderEdge edge = border_.Left(); in PaintBorder() local
93 edge = border_.GetValidEdge(); in PaintBorder()
94 border_ = Border(edge); in PaintBorder()
99 float borderWidth = edge.GetWidth().ConvertToPx(); in PaintBorder()
102 paint.SetColor(edge.GetColor().GetValue()); in PaintBorder()
104 if (edge.GetBorderStyle() == BorderStyle::DOTTED) { in PaintBorder()
116 } else if (edge.GetBorderStyle() == BorderStyle::DASHED) { in PaintBorder()
768 Edge edge; in GetArrowOffset() local
769 InitEdgeSize(edge); in GetArrowOffset()
773 motionRange = childSize_.Width() - edge in GetArrowOffset()
803 InitEdgeSize(Edge& edge) InitEdgeSize() argument
[all...]
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/regex/
H A DEdgeWriterTest.java40 // The 'any digit' edge.
72 // Basic nesting is handled by a very straightforward edge visitor, so one non-trivial test in testNesting()
122 // Creates a simple edge from a range specification string for testing.
132 Edge edge = Edge.concatenation(first, second); in seq()
134 edge = Edge.concatenation(edge, e); in seq()
136 return edge; in seq()
/foundation/arkui/ace_engine/frameworks/bridge/cj_frontend/interfaces/cj_ffi/
H A Dcj_scroll_ffi.cpp85 void NativeNGScroller::ScrollEdge(ScrollEdgeType edge) in ScrollEdge() argument
91 controller_->ScrollToEdge(edge, true); in ScrollEdge()
221 void FfiOHOSAceFrameworkScrollOnScrollEdge(void (*callback)(int32_t edge)) in FfiOHOSAceFrameworkScrollOnScrollEdge() argument
289 void FfiOHOSAceFrameworkScrollerScrollEdge(int64_t selfID, int32_t edge) in FfiOHOSAceFrameworkScrollerScrollEdge() argument
291 if (!Utils::CheckParamsValid(edge, SCROLL_EDGE_TYPES.size())) { in FfiOHOSAceFrameworkScrollerScrollEdge()
297 self_->ScrollEdge(SCROLL_EDGE_TYPES[edge]); in FfiOHOSAceFrameworkScrollerScrollEdge()
/foundation/arkui/ace_engine/frameworks/bridge/declarative_frontend/jsview/
H A Djs_piece.cpp59 Edge edge; in Create() local
60 edge.SetLeft(theme->GetPaddingHorizontal()); in Create()
61 edge.SetRight(theme->GetPaddingHorizontal()); in Create()
62 edge.SetTop(theme->GetPaddingVertical()); in Create()
63 edge.SetBottom(theme->GetPaddingVertical()); in Create()
64 box->SetPadding(edge); in Create()
/kernel/linux/linux-5.10/drivers/counter/
H A Dmicrochip-tcb-capture.c220 u32 edge = ATMEL_TC_ETRGEDG_NONE; in mchp_tc_count_action_set() local
222 /* QDEC mode is rising edge only; only TIOA handled in non-QDEC mode */ in mchp_tc_count_action_set()
228 edge = ATMEL_TC_ETRGEDG_NONE; in mchp_tc_count_action_set()
231 edge = ATMEL_TC_ETRGEDG_RISING; in mchp_tc_count_action_set()
234 edge = ATMEL_TC_ETRGEDG_FALLING; in mchp_tc_count_action_set()
237 edge = ATMEL_TC_ETRGEDG_BOTH; in mchp_tc_count_action_set()
243 ATMEL_TC_ETRGEDG, edge); in mchp_tc_count_action_set()
/kernel/linux/linux-6.6/drivers/counter/
H A Dmicrochip-tcb-capture.c209 u32 edge = ATMEL_TC_ETRGEDG_NONE; in mchp_tc_count_action_write() local
211 /* QDEC mode is rising edge only; only TIOA handled in non-QDEC mode */ in mchp_tc_count_action_write()
217 edge = ATMEL_TC_ETRGEDG_NONE; in mchp_tc_count_action_write()
220 edge = ATMEL_TC_ETRGEDG_RISING; in mchp_tc_count_action_write()
223 edge = ATMEL_TC_ETRGEDG_FALLING; in mchp_tc_count_action_write()
226 edge = ATMEL_TC_ETRGEDG_BOTH; in mchp_tc_count_action_write()
235 ATMEL_TC_ETRGEDG, edge); in mchp_tc_count_action_write()

Completed in 18 milliseconds

12345678910>>...18