Home
last modified time | relevance | path

Searched refs:edge (Results 76 - 100 of 1582) sorted by relevance

12345678910>>...64

/third_party/skia/samplecode/
H A DSamplePatch.cpp78 static void eval_sheet(const SkPoint edge[], int nu, int nv, int iu, int iv, in eval_sheet() argument
93 SkScalar x0 = UV * edge[TL].fX + uV * edge[TR].fX + Uv * edge[BL].fX + uv * edge[BR].fX; in eval_sheet()
94 SkScalar y0 = UV * edge[TL].fY + uV * edge[TR].fY + Uv * edge[BL].fY + uv * edge[BR].fY; in eval_sheet()
96 SkScalar x = (1 - v) * edge[T in eval_sheet()
[all...]
/third_party/node/deps/v8/src/compiler/
H A Dadd-type-assertions-reducer.cc38 for (Edge edge : node->use_edges()) { in Reduce()
39 Node* const user = edge.from(); in Reduce()
41 if (NodeProperties::IsValueEdge(edge) && user != assertion) { in Reduce()
42 edge.UpdateTo(assertion); in Reduce()
H A Dmemory-optimizer.cc246 const Edge edge) { in AllocationTypeNeedsUpdateToOld()
248 if (node->opcode() == IrOpcode::kStoreField && edge.index() == 1) { in AllocationTypeNeedsUpdateToOld()
279 for (Edge const edge : node->use_edges()) { in VisitAllocateRaw()
280 Node* const user = edge.from(); in VisitAllocateRaw()
281 if (user->opcode() == IrOpcode::kStoreField && edge.index() == 0) { in VisitAllocateRaw()
292 for (Edge const edge : node->use_edges()) { in VisitAllocateRaw()
293 Node* const user = edge.from(); in VisitAllocateRaw()
294 if (AllocationTypeNeedsUpdateToOld(user, edge)) { in VisitAllocateRaw()
459 for (Edge const edge : node->use_edges()) { in EnqueueUses()
460 if (NodeProperties::IsEffectEdge(edge)) { in EnqueueUses()
245 AllocationTypeNeedsUpdateToOld(Node* const node, const Edge edge) AllocationTypeNeedsUpdateToOld() argument
[all...]
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/regex/
H A DSubgroupOptimizer.java66 // Reasonable approximation for the cost of an edge in a subgraph is the length of the
90 private static int getEdgeWeight(DfaEdge edge) { in getEdgeWeight() argument
91 // Subtract 1 since the array is 1-based (a zero edge mask is not legal). in getEdgeWeight()
92 return EDGE_WEIGHTS.get(edge.getDigitMask() - 1); in getEdgeWeight()
105 // This returns null if no edge has a cost greater than zero. Since the cost function uses
107 // a single in-edge (the terminal node can have more than one in-edge, but it has a weight of
125 public void visit(DfaNode source, DfaEdge edge, DfaNode target) { in visit() argument
132 // Add an extra one for the edge we are processing now and increment our target's in-order. in visit()
133 subgraphWeight.add(source, targetWeight + getEdgeWeight(edge)); in visit()
162 visit(DfaNode source, DfaEdge edge, DfaNode target) visit() argument
[all...]
/third_party/node/deps/npm/test/fixtures/
H A Deresolve-explanations.js6 edge: {
83 edge: {
151 edge: {
237 edge: {
303 'no current node, but has current edge': {
315 edge: {
345 'no current node, no current edge, idk': {
348 edge: {
381 edge: {
/kernel/linux/linux-5.10/drivers/media/rc/
H A Dpwm-ir-tx.c57 ktime_t edge; in pwm_ir_tx() local
65 edge = ktime_get(); in pwm_ir_tx()
73 edge = ktime_add_us(edge, txbuf[i]); in pwm_ir_tx()
74 delta = ktime_us_delta(edge, ktime_get()); in pwm_ir_tx()
/kernel/linux/linux-6.6/drivers/media/rc/
H A Dpwm-ir-tx.c58 ktime_t edge; in pwm_ir_tx() local
66 edge = ktime_get(); in pwm_ir_tx()
72 edge = ktime_add_us(edge, txbuf[i]); in pwm_ir_tx()
73 delta = ktime_us_delta(edge, ktime_get()); in pwm_ir_tx()
/kernel/linux/linux-5.10/fs/btrfs/
H A Dbackref.c2584 struct btrfs_backref_edge *edge; local
2586 edge = kzalloc(sizeof(*edge), GFP_NOFS);
2587 if (edge)
2589 return edge;
2603 struct btrfs_backref_edge *edge; local
2610 edge = list_entry(node->upper.next, struct btrfs_backref_edge,
2612 upper = edge->node[UPPER];
2613 list_del(&edge->list[LOWER]);
2614 list_del(&edge
2679 struct btrfs_backref_edge *edge; global() local
2756 struct btrfs_backref_edge *edge; global() local
2920 struct btrfs_backref_edge *edge; global() local
3043 struct btrfs_backref_edge *edge; global() local
3145 struct btrfs_backref_edge *edge; global() local
[all...]
H A Dbackref.h215 * Represent an edge connecting upper and lower backref nodes.
280 static inline void btrfs_backref_link_edge(struct btrfs_backref_edge *edge, in btrfs_backref_link_edge() argument
286 edge->node[LOWER] = lower; in btrfs_backref_link_edge()
287 edge->node[UPPER] = upper; in btrfs_backref_link_edge()
289 list_add_tail(&edge->list[LOWER], &lower->upper); in btrfs_backref_link_edge()
291 list_add_tail(&edge->list[UPPER], &upper->lower); in btrfs_backref_link_edge()
308 struct btrfs_backref_edge *edge) in btrfs_backref_free_edge()
310 if (edge) { in btrfs_backref_free_edge()
312 kfree(edge); in btrfs_backref_free_edge()
307 btrfs_backref_free_edge(struct btrfs_backref_cache *cache, struct btrfs_backref_edge *edge) btrfs_backref_free_edge() argument
/kernel/linux/linux-5.10/drivers/gpio/
H A Dgpio-mxs.c78 int edge; in mxs_gpio_set_irq_type() local
89 edge = GPIO_INT_FALL_EDGE; in mxs_gpio_set_irq_type()
91 edge = GPIO_INT_RISE_EDGE; in mxs_gpio_set_irq_type()
95 edge = GPIO_INT_RISE_EDGE; in mxs_gpio_set_irq_type()
98 edge = GPIO_INT_FALL_EDGE; in mxs_gpio_set_irq_type()
101 edge = GPIO_INT_LOW_LEV; in mxs_gpio_set_irq_type()
104 edge = GPIO_INT_HIGH_LEV; in mxs_gpio_set_irq_type()
110 /* set level or edge */ in mxs_gpio_set_irq_type()
112 if (edge & GPIO_INT_LEV_MASK) { in mxs_gpio_set_irq_type()
122 if (edge in mxs_gpio_set_irq_type()
134 u32 bit, val, edge; mxs_flip_edge() local
[all...]
/kernel/linux/linux-6.6/drivers/gpio/
H A Dgpio-mxs.c72 int edge; in mxs_gpio_set_irq_type() local
83 edge = GPIO_INT_FALL_EDGE; in mxs_gpio_set_irq_type()
85 edge = GPIO_INT_RISE_EDGE; in mxs_gpio_set_irq_type()
89 edge = GPIO_INT_RISE_EDGE; in mxs_gpio_set_irq_type()
92 edge = GPIO_INT_FALL_EDGE; in mxs_gpio_set_irq_type()
95 edge = GPIO_INT_LOW_LEV; in mxs_gpio_set_irq_type()
98 edge = GPIO_INT_HIGH_LEV; in mxs_gpio_set_irq_type()
104 /* set level or edge */ in mxs_gpio_set_irq_type()
106 if (edge & GPIO_INT_LEV_MASK) { in mxs_gpio_set_irq_type()
116 if (edge in mxs_gpio_set_irq_type()
128 u32 bit, val, edge; mxs_flip_edge() local
[all...]
/third_party/skia/src/pathops/
H A DSkPathOpsAsWinding.cpp47 static int contains_edge(SkPoint pts[4], SkPath::Verb verb, SkScalar weight, const SkPoint& edge) { in contains_edge() argument
50 if (bounds.fTop > edge.fY) { in contains_edge()
53 if (bounds.fBottom <= edge.fY) { // check to see if y is at line end to avoid double counting in contains_edge()
56 if (bounds.fLeft >= edge.fX) { in contains_edge()
63 int count = (*CurveIntercept[verb * 2])(pts, weight, edge.fY, tVals); in contains_edge()
65 // remove results to the right of edge in contains_edge()
68 if (intersectX < edge.fX) { in contains_edge()
72 if (intersectX > edge.fX) { in contains_edge()
76 // if intersect x equals edge x, we need to determine if pts is to the left or right of edge in contains_edge()
[all...]
/third_party/skia/src/core/
H A DSkScan_AAAPath.cpp609 SkFixed first = SK_Fixed1 - l; // horizontal edge length of the left-most triangle
610 SkFixed last = r - ((R - 1) << 16); // horizontal edge length of the right-most triangle
611 SkFixed firstH = SkFixedMul(first, dY); // vertical edge of the left-most triangle
636 SkFixed first = SK_Fixed1 - l; // horizontal edge length of the left-most triangle
637 SkFixed last = r - ((R - 1) << 16); // horizontal edge length of the right-most triangle
638 SkFixed lastH = SkFixedMul(last, dY); // vertical edge of the right-most triangle
1034 static void validate_sort(const SkAnalyticEdge* edge) {
1038 while (edge->fUpperY != SK_MaxS32) {
1039 edge->validate();
1040 SkASSERT(y <= edge
[all...]
/kernel/linux/linux-5.10/drivers/remoteproc/
H A Dqcom_common.c41 glink->edge = qcom_glink_smem_register(glink->dev, glink->node); in glink_subdev_start()
43 return PTR_ERR_OR_ZERO(glink->edge); in glink_subdev_start()
50 qcom_glink_smem_unregister(glink->edge); in glink_subdev_stop()
51 glink->edge = NULL; in glink_subdev_stop()
72 glink->node = of_get_child_by_name(dev->parent->of_node, "glink-edge"); in qcom_add_glink_subdev()
152 smd->edge = qcom_smd_register_edge(smd->dev, smd->node); in smd_subdev_start()
154 return PTR_ERR_OR_ZERO(smd->edge); in smd_subdev_start()
161 qcom_smd_unregister_edge(smd->edge); in smd_subdev_stop()
162 smd->edge = NULL; in smd_subdev_stop()
174 smd->node = of_get_child_by_name(dev->parent->of_node, "smd-edge"); in qcom_add_smd_subdev()
[all...]
/kernel/linux/linux-6.6/fs/btrfs/
H A Dbackref.h390 * Represent an edge connecting upper and lower backref nodes.
455 static inline void btrfs_backref_link_edge(struct btrfs_backref_edge *edge, in btrfs_backref_link_edge() argument
461 edge->node[LOWER] = lower; in btrfs_backref_link_edge()
462 edge->node[UPPER] = upper; in btrfs_backref_link_edge()
464 list_add_tail(&edge->list[LOWER], &lower->upper); in btrfs_backref_link_edge()
466 list_add_tail(&edge->list[UPPER], &upper->lower); in btrfs_backref_link_edge()
483 struct btrfs_backref_edge *edge) in btrfs_backref_free_edge()
485 if (edge) { in btrfs_backref_free_edge()
487 kfree(edge); in btrfs_backref_free_edge()
482 btrfs_backref_free_edge(struct btrfs_backref_cache *cache, struct btrfs_backref_edge *edge) btrfs_backref_free_edge() argument
/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/
H A Dgraphcycles_test.cc31 // We emulate a GraphCycles object with a node vector and an edge vector.
54 for (const auto &edge : *edges) { in IsReachable()
55 if (edge.from == from) { in IsReachable()
56 if (edge.to == to) { // success via edge directly in IsReachable()
58 } else if (seen->find(edge.to) == seen->end() && // success via edge in IsReachable()
59 IsReachable(edges, edge.to, to, seen)) { in IsReachable()
69 for (const auto &edge : *edges) { in PrintEdges()
70 int a = edge in PrintEdges()
[all...]
/third_party/node/deps/npm/node_modules/libnpmfund/lib/
H A Dindex.js100 const directDepsWithFunding = Array.from(edges).map(edge => {
101 if (!edge || !edge.to) {
105 const node = edge.to.target || edge.to
/third_party/rust/crates/bindgen/bindgen/ir/
H A Dtraversal.rs7 /// An outgoing edge in the IR graph is a reference from some item to another
13 /// yielded this outgoing edge.
21 /// Construct a new edge whose referent is `to` and is of the given `kind`.
33 /// The kind of edge reference. This is useful when we wish to only consider
37 /// A generic, catch-all edge.
40 /// An edge from a template declaration, to the definition of a named type
41 /// parameter. For example, the edge from `Foo<T>` to `T` in the following
50 /// An edge from a template instantiation to the template declaration that
51 /// is being instantiated. For example, the edge from `Foo<int>` to
62 /// An edge fro
[all...]
/kernel/linux/linux-5.10/drivers/irqchip/
H A Dirq-lpc32xx.c75 bool high, edge; in lpc32xx_irq_set_type() local
79 edge = true; in lpc32xx_irq_set_type()
83 edge = true; in lpc32xx_irq_set_type()
87 edge = false; in lpc32xx_irq_set_type()
91 edge = false; in lpc32xx_irq_set_type()
109 if (edge) { in lpc32xx_irq_set_type()
/kernel/linux/linux-6.6/drivers/irqchip/
H A Dirq-lpc32xx.c76 bool high, edge; in lpc32xx_irq_set_type() local
80 edge = true; in lpc32xx_irq_set_type()
84 edge = true; in lpc32xx_irq_set_type()
88 edge = false; in lpc32xx_irq_set_type()
92 edge = false; in lpc32xx_irq_set_type()
110 if (edge) { in lpc32xx_irq_set_type()
/foundation/arkui/ace_engine/frameworks/bridge/common/dom/
H A Ddom_button.cpp438 Edge edge; in PrepareWaitingWithText() local
439 edge.SetLeft(buttonDeclaration_->GetInnerPadding()); in PrepareWaitingWithText()
441 innerPadding->SetPadding(edge); in PrepareWaitingWithText()
488 Edge edge; in PrepareChildren() local
491 edge.SetBottom(INNER_PADDING); in PrepareChildren()
493 edge.SetTop(INNER_PADDING); in PrepareChildren()
495 edge.SetLeft(INNER_PADDING); in PrepareChildren()
497 edge.SetRight(INNER_PADDING); in PrepareChildren()
498 edge.SetBottom(Dimension(1.0, DimensionUnit::PX)); in PrepareChildren()
502 innerPaddingChild_->SetPadding(edge); in PrepareChildren()
532 auto edge = boxComponent_->GetPadding(); AddPadding() local
[all...]
/third_party/skia/tests/
H A DTriangulatingPathRendererTests.cpp31 // Also tests active edge list forced into an invalid ordering by
171 // a split edge must remain active.
186 // Handle the case where edge.dist(edge.fTop) != 0.0.
246 // same edge to be added to more than one poly on the same side.
262 // A shape with a vertex collinear to the right hand edge.
275 // Exercises the case where an edge becomes collinear with *two* of its
350 // A path which hangs during simplification. It produces an edge which is
352 // right-enclosing-edge splitting.
372 // zombie edge
[all...]
/foundation/arkui/ace_engine/frameworks/core/components_ng/pattern/text_field/
H A Dtext_input_ai_checker.cpp61 auto edge = textRect.GetX() + textRect.Width(); in IsMultiClickAtBoundary() local
62 if (handleOffset.GetX() >= edge - FLOAT_DIFF_COMPARE) { in IsMultiClickAtBoundary()
64 handleOffset.GetX(), edge); in IsMultiClickAtBoundary()
/kernel/linux/linux-5.10/drivers/pps/
H A Dkc.c41 if (bind_args->edge == 0) in pps_kc_bind()
57 pps_kc_hardpps_mode = bind_args->edge; in pps_kc_bind()
61 "edge=0x%x\n", bind_args->edge); in pps_kc_bind()
95 * @event: PPS event edge
/kernel/linux/linux-6.6/drivers/pps/
H A Dkc.c41 if (bind_args->edge == 0) in pps_kc_bind()
57 pps_kc_hardpps_mode = bind_args->edge; in pps_kc_bind()
61 "edge=0x%x\n", bind_args->edge); in pps_kc_bind()
95 * @event: PPS event edge

Completed in 16 milliseconds

12345678910>>...64