Home
last modified time | relevance | path

Searched refs:edge (Results 151 - 175 of 357) sorted by relevance

12345678910>>...15

/third_party/skia/third_party/externals/swiftshader/src/Pipeline/
H A DSpirvShaderControlFlow.cpp166 !ExistsPath(blockId, dep, block.mergeBlock)) // or a loop and not a loop back edge in ForeachBlockDependency()
205 auto edge = Block::Edge{ from, to }; in addActiveLaneMaskEdge() local
206 auto it = edgeActiveLaneMasks.find(edge); in addActiveLaneMaskEdge()
209 edgeActiveLaneMasks.emplace(edge, mask); in addActiveLaneMaskEdge()
214 edgeActiveLaneMasks.erase(edge); in addActiveLaneMaskEdge()
215 edgeActiveLaneMasks.emplace(edge, combined); in addActiveLaneMaskEdge()
221 auto edge = Block::Edge{ from, to }; in GetActiveLaneMaskEdge() local
222 auto it = state->edgeActiveLaneMasks.find(edge); in GetActiveLaneMaskEdge()
223 ASSERT_MSG(it != state->edgeActiveLaneMasks.end(), "Could not find edge %d -> %d", from.value(), to.value()); in GetActiveLaneMaskEdge()
373 // mergeActiveLaneMasks contains edge lan in EmitLoop()
431 auto edge = Block::Edge{ in, mergeBlockId }; EmitLoop() local
[all...]
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/regex/
H A DNfaFlattenerTest.java37 // The 'any digit' edge.
81 // Add 2 edges to the first join point (if we add only one edge then it clashes with the in testSubgroupWithEarlyJoining()
82 // joining edge, which goes directly from groupStart to firstJoin. in testSubgroupWithEarlyJoining()
159 // IMPORTANT: Order of insertion determines the node IDs (A=1, B=2...). The edge index just in testNodeOrdering_bug_65250963()
197 // Creates a simple edge from a range specification string for testing.
207 Edge edge = Edge.concatenation(first, second); in seq()
209 edge = Edge.concatenation(edge, e); in seq()
211 return edge; in seq()
/third_party/node/deps/v8/src/compiler/
H A Djs-generic-lowering.cc1074 for (Edge edge : node->use_edges()) use_edges.push_back(edge); in LowerJSForInPrepare()
1100 for (Edge edge : use_edges) { in LowerJSForInPrepare()
1101 Node* const user = edge.from(); in LowerJSForInPrepare()
1102 if (NodeProperties::IsEffectEdge(edge)) { in LowerJSForInPrepare()
1103 edge.UpdateTo(effect); in LowerJSForInPrepare()
1104 } else if (NodeProperties::IsControlEdge(edge)) { in LowerJSForInPrepare()
1105 edge.UpdateTo(control); in LowerJSForInPrepare()
1107 DCHECK(NodeProperties::IsValueEdge(edge)); in LowerJSForInPrepare()
1225 for (Edge edge in LowerJSStackCheck()
[all...]
H A Dloop-peeling.cc243 for (Edge edge : node->use_edges()) { in EliminateLoopExit()
244 if (NodeProperties::IsControlEdge(edge)) { in EliminateLoopExit()
245 Node* marker = edge.from(); in EliminateLoopExit()
H A Djs-inlining.cc125 for (Edge edge : start->use_edges()) { in InlineCall()
126 Node* use = edge.from(); in InlineCall()
151 if (NodeProperties::IsEffectEdge(edge)) { in InlineCall()
152 edge.UpdateTo(effect); in InlineCall()
153 } else if (NodeProperties::IsControlEdge(edge)) { in InlineCall()
154 edge.UpdateTo(control); in InlineCall()
155 } else if (NodeProperties::IsFrameStateEdge(edge)) { in InlineCall()
156 edge.UpdateTo(frame_state); in InlineCall()
H A Dverifier.cc160 for (Edge edge : node->use_edges()) { in Check()
161 if (all.IsLive(edge.from()) && NodeProperties::IsEffectEdge(edge)) { in Check()
216 for (Edge edge : node->use_edges()) { in Check()
217 if (!NodeProperties::IsControlEdge(edge)) { in Check()
221 Node* control_use = edge.from(); in Check()
298 for (Edge edge : node->use_edges()) { in Check()
299 Node* use = edge.from(); in Check()
300 if (NodeProperties::IsValueEdge(edge) && all.IsLive(use)) { in Check()
2144 for (Edge edge in VerifyNode()
2180 VerifyEdgeInputReplacement(const Edge& edge, const Node* replacement) VerifyEdgeInputReplacement() argument
[all...]
/kernel/linux/linux-5.10/drivers/irqchip/
H A Dirq-vt8500.c75 u8 edge, dctr; in vt8500_irq_mask() local
78 edge = readb(base + VT8500_ICDC + d->hwirq) & VT8500_EDGE; in vt8500_irq_mask()
79 if (edge) { in vt8500_irq_mask()
/kernel/linux/linux-6.6/drivers/irqchip/
H A Dirq-vt8500.c75 u8 edge, dctr; in vt8500_irq_mask() local
78 edge = readb(base + VT8500_ICDC + d->hwirq) & VT8500_EDGE; in vt8500_irq_mask()
79 if (edge) { in vt8500_irq_mask()
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dpropagator.cpp20 void SSAPropagator::AddControlEdge(const Edge& edge) { in AddControlEdge() argument
21 BasicBlock* dest_bb = edge.dest; in AddControlEdge()
28 // Try to mark the edge executable. If it was already in the set of in AddControlEdge()
30 if (!MarkEdgeExecutable(edge)) { in AddControlEdge()
34 // If the edge had not already been marked executable, add the destination in AddControlEdge()
139 // the operand comes from an edge that has not yet been traversed or if its in Simulate()
199 // If this block has exactly one successor, mark the edge to its successor in Simulate()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dpropagator.cpp20 void SSAPropagator::AddControlEdge(const Edge& edge) { in AddControlEdge() argument
21 BasicBlock* dest_bb = edge.dest; in AddControlEdge()
28 // Try to mark the edge executable. If it was already in the set of in AddControlEdge()
30 if (!MarkEdgeExecutable(edge)) { in AddControlEdge()
34 // If the edge had not already been marked executable, add the destination in AddControlEdge()
139 // the operand comes from an edge that has not yet been traversed or if its in Simulate()
199 // If this block has exactly one successor, mark the edge to its successor in Simulate()
/third_party/spirv-tools/source/opt/
H A Dpropagator.cpp20 void SSAPropagator::AddControlEdge(const Edge& edge) { in AddControlEdge() argument
21 BasicBlock* dest_bb = edge.dest; in AddControlEdge()
28 // Try to mark the edge executable. If it was already in the set of in AddControlEdge()
30 if (!MarkEdgeExecutable(edge)) { in AddControlEdge()
34 // If the edge had not already been marked executable, add the destination in AddControlEdge()
139 // the operand comes from an edge that has not yet been traversed or if its in Simulate()
199 // If this block has exactly one successor, mark the edge to its successor in Simulate()
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A Dcord_rep_btree_test.cc39 static void SetEdge(CordRepBtree* node, size_t idx, CordRep* edge) { in SetEdge() argument
40 node->edges_[idx] = edge; in SetEdge()
42 static void AddEdge(CordRepBtree* node, CordRep* edge) { in AddEdge() argument
43 node->edges_[node->fetch_add_end(1)] = edge; in AddEdge()
167 for (CordRep* edge : tree->Edges()) { in GetLeafEdges()
168 edges.push_back(edge); in GetLeafEdges()
171 for (CordRep* edge : tree->Edges()) { in GetLeafEdges()
172 GetLeafEdges(edge->btree(), edges); in GetLeafEdges()
1291 CordRep* const edge = leaf->Edges()[0]; in TEST() local
1292 const uint8_t tag = edge in TEST()
1314 CordRep* const edge = tree->Edges()[0]; TEST() local
[all...]
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/arborist/
H A Dload-actual.js379 for (const [name, edge] of node.edgesOut.entries()) {
380 const notMissing = !edge.missing &&
381 !(edge.to && (edge.to.dummy || edge.to.parent !== node))
/kernel/linux/linux-5.10/drivers/mfd/
H A Dasic3.c127 u16 edge; in asic3_irq_flip_edge() local
131 edge = asic3_read_register(asic, in asic3_irq_flip_edge()
133 edge ^= bit; in asic3_irq_flip_edge()
135 base + ASIC3_GPIO_EDGE_TRIGGER, edge); in asic3_irq_flip_edge()
300 u16 trigger, level, edge, bit; in asic3_gpio_irq_type() local
310 edge = asic3_read_register(asic, in asic3_gpio_irq_type()
318 edge |= bit; in asic3_gpio_irq_type()
321 edge &= ~bit; in asic3_gpio_irq_type()
325 edge &= ~bit; in asic3_gpio_irq_type()
327 edge | in asic3_gpio_irq_type()
[all...]
/third_party/skia/src/gpu/geometry/
H A DGrAATriangulator.h31 Event(SSEdge* edge, const SkPoint& point, uint8_t alpha) in Event()
32 : fEdge(edge), fPoint(point), fAlpha(alpha) {} in Event()
/third_party/skia/tests/
H A DFontTest.cpp92 for (auto edge : edges) { in DEF_TEST()
93 font.setEdging(edge); in DEF_TEST()
/third_party/python/Lib/turtledemo/
H A Dfractalcurves.py52 edge = 2 * rad * math.sin(math.pi / n)
58 self.fractal(edge, lev, dir)
/third_party/skia/third_party/externals/spirv-tools/source/val/
H A Dvalidate_cfg.cpp386 for (auto& edge : back_edges) { in UpdateContinueConstructExitBlocks()
389 std::tie(back_edge_block_id, loop_header_block_id) = edge; in UpdateContinueConstructExitBlocks()
428 exit_name = "back-edge block"; in ConstructNames()
690 /// back-edge branching to it in StructuredControlFlowChecks()
707 // Check the loop headers have exactly one back-edge branching to it in StructuredControlFlowChecks()
717 << " back-edge blocks but the standard requires exactly one"; in StructuredControlFlowChecks()
870 for (auto edge : edges) { in PerformCfgChecks()
871 if (edge.first != edge.second) in PerformCfgChecks()
872 edge in PerformCfgChecks()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/val/
H A Dvalidate_cfg.cpp386 for (auto& edge : back_edges) { in UpdateContinueConstructExitBlocks()
389 std::tie(back_edge_block_id, loop_header_block_id) = edge; in UpdateContinueConstructExitBlocks()
428 exit_name = "back-edge block"; in ConstructNames()
690 /// back-edge branching to it in StructuredControlFlowChecks()
707 // Check the loop headers have exactly one back-edge branching to it in StructuredControlFlowChecks()
717 << " back-edge blocks but the standard requires exactly one"; in StructuredControlFlowChecks()
870 for (auto edge : edges) { in PerformCfgChecks()
871 if (edge.first != edge.second) in PerformCfgChecks()
872 edge in PerformCfgChecks()
[all...]
/third_party/node/deps/v8/src/profiler/
H A Dheap-snapshot-generator.cc240 // visitor. All we can verify at this point is that the edge type declares in VerifyReference()
329 HeapGraphEdge& edge = **i; in Print() local
333 switch (edge.type()) { in Print()
336 edge_name = edge.name(); in Print()
339 SNPrintF(index, "%d", edge.index()); in Print()
343 edge_name = edge.name(); in Print()
346 edge_name = edge.name(); in Print()
350 SNPrintF(index, "%d", edge.index()); in Print()
354 edge_name = edge.name(); in Print()
358 edge_name = edge in Print()
2812 SerializeEdge(HeapGraphEdge* edge, bool first_edge) SerializeEdge() argument
[all...]
/third_party/mesa3d/src/freedreno/ir3/
H A Dir3_sched.c321 util_dynarray_foreach (&n->dag.edges, struct dag_edge, edge) { in schedule()
322 unsigned delay = (unsigned)(uintptr_t)edge->data; in schedule()
324 container_of(edge->child, struct ir3_sched_node, dag); in schedule()
867 util_dynarray_foreach (&n->dag.edges, struct dag_edge, edge) { in dump_state()
868 struct ir3_sched_node *child = (struct ir3_sched_node *)edge->child; in dump_state()
944 /* don't need to remove old dag edge since old addr is in split_addr()
996 /* don't need to remove old dag edge since old pred is in split_pred()
1148 util_dynarray_foreach (&n->dag.edges, struct dag_edge, edge) { in sched_dag_max_delay_cb()
1149 struct ir3_sched_node *child = (struct ir3_sched_node *)edge->child; in sched_dag_max_delay_cb()
/kernel/linux/linux-5.10/drivers/staging/media/atomisp/pci/css_2401_system/host/
H A Disys_irq_local.h26 hrt_data edge; member
/kernel/linux/linux-6.6/drivers/staging/media/atomisp/pci/css_2401_system/host/
H A Disys_irq_local.h26 hrt_data edge; member
/third_party/ffmpeg/libavcodec/arm/
H A Drv40dsp_init_arm.c62 int beta, int beta2, int edge,
65 int beta, int beta2, int edge,
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/
H A DRangeTreeFactorizer.java38 * contains "[0-5]" it will not be merged with the candidate edge "[0-8]".
42 * Edges can be merged if the candidate edge accepts more digits than the existing edge. If the
43 * existing factor contains "[0-5]" and the candidate edge is "[0-8]", the candidate edge is
44 * split so that "[0-5]" is merged as normal and an additional edge "[6-8]" is branched off.
126 // True if we encountered a situation when an edge we are merging (srcMask) has a partial
127 // overlap with the existing edge (dstMask) (e.g. merging "[0-6]" into "[4-9]"). This is
128 // distinct from the case where the existing edge is a subset of the edge bein
190 visit(DfaNode source, DfaEdge edge, DfaNode target) visit() argument
[all...]

Completed in 22 milliseconds

12345678910>>...15