Home
last modified time | relevance | path

Searched refs:edge (Results 51 - 75 of 1506) sorted by relevance

12345678910>>...61

/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/
H A Dedge.js1 // An edge in the dependency graph
9 constructor (edge) {
10 this.name = edge.name
11 this.spec = edge.spec
12 this.type = edge.type
14 const edgeFrom = edge.from?.location
15 const edgeTo = edge.to?.location
16 const override = edge.overrides?.value
24 if (edge.error) {
25 this.error = edge
[all...]
/third_party/libinput/src/
H A Devdev-mt-touchpad-edge-scroll.c75 uint32_t edge = EDGE_NONE; in tp_touch_get_edge() local
81 edge |= EDGE_RIGHT; in tp_touch_get_edge()
84 edge |= EDGE_BOTTOM; in tp_touch_get_edge()
86 return edge; in tp_touch_get_edge()
96 * edge scrolling. A finger resting on the button areas is in tp_edge_scroll_set_timer()
119 t->scroll.edge = EDGE_NONE; in tp_edge_scroll_set_state()
122 t->scroll.edge = tp_touch_get_edge(tp, t); in tp_edge_scroll_set_state()
129 t->scroll.edge = EDGE_NONE; in tp_edge_scroll_set_state()
159 "edge-scroll: touch %d: unexpected scroll event %d in none state\n", in tp_edge_scroll_handle_none()
175 "edge in tp_edge_scroll_handle_edge_new()
[all...]
/third_party/vk-gl-cts/external/openglcts/modules/glesext/tessellation_shader/
H A DesextcTessellationShaderVertexSpacing.cpp158 /* First convert the array data to a vector of edges, where each edge in getEdgesForIsolinesTessellation()
160 * points for each edge need to be sorted by U component. in getEdgesForIsolinesTessellation()
164 /* Isolines are simple - we only need to create a new edge per each unique height */ in getEdgesForIsolinesTessellation()
176 _tess_edge& edge = *edges_iterator; in getEdgesForIsolinesTessellation() local
178 /* Each edge uses the same Y component, so we only need to check the first entry */ in getEdgesForIsolinesTessellation()
179 if (de::abs(edge.points[0].y - coordinate[1]) < epsilon) in getEdgesForIsolinesTessellation()
182 edge.points.push_back(new_item); in getEdgesForIsolinesTessellation()
190 /* New edge starts at this point. in getEdgesForIsolinesTessellation()
203 /* For each edge, sort the points by U coordinate */ in getEdgesForIsolinesTessellation()
257 * data set to identify all points that are part of edges connecting the edge corner in getEdgesForQuadsTessellation()
428 _tess_edge& edge = *(edge_ptrs[n_edge]); getEdgesForQuadsTessellation() local
486 _tess_edge& edge = *(edge_ptrs[n_edge]); getEdgesForQuadsTessellation() local
505 _tess_edge& edge = *(edge_ptrs[n_edge]); getEdgesForQuadsTessellation() local
726 const std::vector<_tess_coordinate_cartesian>& edge = *edge_ptrs[n_edge_ptr]; getEdgesForTrianglesTessellation() local
836 const std::vector<_tess_coordinate_cartesian>& edge = *edge_ptrs[n_edge_ptr]; getEdgesForTrianglesTessellation() local
1111 const _tess_edge& edge = *edges_iterator; verifyEdges() local
[all...]
/kernel/linux/linux-5.10/drivers/gpio/
H A Dgpio-mxc.c179 int edge; in gpio_set_irq_type() local
185 edge = GPIO_INT_RISE_EDGE; in gpio_set_irq_type()
188 edge = GPIO_INT_FALL_EDGE; in gpio_set_irq_type()
192 edge = GPIO_INT_BOTH_EDGES; in gpio_set_irq_type()
196 edge = GPIO_INT_LOW_LEV; in gpio_set_irq_type()
199 edge = GPIO_INT_HIGH_LEV; in gpio_set_irq_type()
206 edge = GPIO_INT_LOW_LEV; in gpio_set_irq_type()
209 edge = GPIO_INT_HIGH_LEV; in gpio_set_irq_type()
217 if (edge == GPIO_INT_BOTH_EDGES) in gpio_set_irq_type()
225 if (edge ! in gpio_set_irq_type()
241 int edge; mxc_flip_edge() local
[all...]
/kernel/linux/linux-5.10/drivers/media/rc/
H A Dserial_ir.c36 void (*send_pulse)(unsigned int length, ktime_t edge);
59 static void send_pulse_irdeo(unsigned int length, ktime_t edge);
62 static void send_pulse_homebrew(unsigned int length, ktime_t edge);
214 static void send_pulse_homebrew_softcarrier(unsigned int length, ktime_t edge) in send_pulse_homebrew_softcarrier() argument
216 ktime_t now, target = ktime_add_us(edge, length); in send_pulse_homebrew_softcarrier()
235 edge = ktime_add_ns(edge, pulse); in send_pulse_homebrew_softcarrier()
236 delta = ktime_to_ns(ktime_sub(edge, now)); in send_pulse_homebrew_softcarrier()
243 edge = ktime_add_ns(edge, spac in send_pulse_homebrew_softcarrier()
250 send_pulse_homebrew(unsigned int length, ktime_t edge) send_pulse_homebrew() argument
638 ktime_t edge; serial_ir_tx() local
[all...]
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 Dserial_ir.c36 void (*send_pulse)(unsigned int length, ktime_t edge);
59 static void send_pulse_irdeo(unsigned int length, ktime_t edge);
62 static void send_pulse_homebrew(unsigned int length, ktime_t edge);
214 static void send_pulse_homebrew_softcarrier(unsigned int length, ktime_t edge) in send_pulse_homebrew_softcarrier() argument
216 ktime_t now, target = ktime_add_us(edge, length); in send_pulse_homebrew_softcarrier()
235 edge = ktime_add_ns(edge, pulse); in send_pulse_homebrew_softcarrier()
236 delta = ktime_to_ns(ktime_sub(edge, now)); in send_pulse_homebrew_softcarrier()
243 edge = ktime_add_ns(edge, spac in send_pulse_homebrew_softcarrier()
250 send_pulse_homebrew(unsigned int length, ktime_t edge) send_pulse_homebrew() argument
638 ktime_t edge; serial_ir_tx() local
[all...]
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-6.6/drivers/gpio/
H A Dgpio-mxc.c167 int edge; in gpio_set_irq_type() local
173 edge = GPIO_INT_RISE_EDGE; in gpio_set_irq_type()
176 edge = GPIO_INT_FALL_EDGE; in gpio_set_irq_type()
180 edge = GPIO_INT_BOTH_EDGES; in gpio_set_irq_type()
184 edge = GPIO_INT_LOW_LEV; in gpio_set_irq_type()
187 edge = GPIO_INT_HIGH_LEV; in gpio_set_irq_type()
194 edge = GPIO_INT_LOW_LEV; in gpio_set_irq_type()
197 edge = GPIO_INT_HIGH_LEV; in gpio_set_irq_type()
207 if (edge == GPIO_INT_BOTH_EDGES) in gpio_set_irq_type()
215 if (edge ! in gpio_set_irq_type()
235 int edge; mxc_flip_edge() local
[all...]
/kernel/linux/linux-5.10/drivers/media/pci/cobalt/
H A Dcobalt-irq.c140 u32 edge = cobalt_read_bar1(cobalt, COBALT_SYS_STAT_EDGE); in cobalt_irq_handler() local
145 cobalt_write_bar1(cobalt, COBALT_SYS_STAT_MASK, mask & ~edge); in cobalt_irq_handler()
146 cobalt_write_bar1(cobalt, COBALT_SYS_STAT_EDGE, edge); in cobalt_irq_handler()
158 edge &= ~dma_fifo_mask; in cobalt_irq_handler()
160 mask & ~edge); in cobalt_irq_handler()
165 if (edge & s->adv_irq_mask) in cobalt_irq_handler()
167 if ((edge & mask & dma_fifo_mask) && vb2_is_streaming(&s->q)) { in cobalt_irq_handler()
175 if (edge & mask & (COBALT_SYSSTAT_VI0_INT1_MSK | in cobalt_irq_handler()
182 if (edge & mask & (COBALT_SYSSTAT_VI0_INT2_MSK | in cobalt_irq_handler()
188 if (edge in cobalt_irq_handler()
[all...]
/kernel/linux/linux-6.6/drivers/media/pci/cobalt/
H A Dcobalt-irq.c140 u32 edge = cobalt_read_bar1(cobalt, COBALT_SYS_STAT_EDGE); in cobalt_irq_handler() local
145 cobalt_write_bar1(cobalt, COBALT_SYS_STAT_MASK, mask & ~edge); in cobalt_irq_handler()
146 cobalt_write_bar1(cobalt, COBALT_SYS_STAT_EDGE, edge); in cobalt_irq_handler()
158 edge &= ~dma_fifo_mask; in cobalt_irq_handler()
160 mask & ~edge); in cobalt_irq_handler()
165 if (edge & s->adv_irq_mask) in cobalt_irq_handler()
167 if ((edge & mask & dma_fifo_mask) && vb2_is_streaming(&s->q)) { in cobalt_irq_handler()
175 if (edge & mask & (COBALT_SYSSTAT_VI0_INT1_MSK | in cobalt_irq_handler()
182 if (edge & mask & (COBALT_SYSSTAT_VI0_INT2_MSK | in cobalt_irq_handler()
188 if (edge in cobalt_irq_handler()
[all...]
/third_party/skia/src/gpu/geometry/
H A DGrTriangulator.h92 // Stages (4) and (5) use an active edge list -- a list of all edges for which the
101 // not exact and may violate the mesh topology or active edge list ordering. We
105 // A) Intersections may cause a shortened edge to no longer be ordered with respect to its
108 // B) Intersections may cause an edge to violate the left-to-right ordering of the
109 // active edge list. This is handled by detecting potential violations and rewinding
110 // the active edge list to the vertex before they occur (rewind() during merging,
115 // currently uses a linked list for the active edge list, rather than a 2-3 tree as the
120 // are O(1), since we know the adjacent edge in the active edge list based on the topology.
144 void setTop(Edge* edge, Verte
[all...]
/third_party/node/test/pummel/
H A Dtest-heapdump-inspector.js34 (edge) => edge.name === 'callback' &&
35 (edge.to.type === undefined || // embedded graph
36 edge.to.type === 'closure'), // snapshot
/third_party/ninja/src/
H A Dbuild.h49 // Pop a ready edge off the queue of edges to build.
64 /// Mark an edge as done building (whether it succeeded or failed).
65 /// If any of the edge's outputs are dyndep bindings of their dependents,
68 bool EdgeFinished(Edge* edge, EdgeResult result, std::string* err);
97 /// Enumerate possible steps we want for an edge.
100 /// We do not want to build the edge, but we might want to build one of
103 /// We want to build the edge, but have not yet scheduled it.
105 /// We want to build the edge, have scheduled it, and are waiting
110 void EdgeWanted(const Edge* edge);
113 /// Submits a ready edge a
146 Edge* edge; global() member
[all...]
H A Dstate.h38 /// the total scheduled weight diminishes enough (i.e. when a scheduled edge
50 /// true if the Pool might delay this edge
53 /// informs this Pool that the given edge is committed to be run.
54 /// Pool will count this edge as using resources from this pool.
55 void EdgeScheduled(const Edge& edge);
57 /// informs this Pool that the given edge is no longer runnable, and should
59 void EdgeFinished(const Edge& edge);
61 /// adds the given edge to this Pool to be delayed.
62 void DelayEdge(Edge* edge);
108 /// Add input / output / validation nodes to a given edge
[all...]
/third_party/node/deps/npm/lib/utils/
H A Dsbom-spdx.js43 .filter(edge => nodes.find(n => n === edge.to))
44 .map(edge => toSpdxRelationship(node, edge))
133 const toSpdxRelationship = (node, edge) => {
135 switch (edge.type) {
150 spdxElementId: toSpdxID(edge.to),
/third_party/skia/src/core/
H A DSkEdgeBuilder.h49 virtual Combine addPolyLine(const SkPoint pts[], char* edge, char** edgePtr) = 0;
59 Combine combineVertical(const SkEdge* edge, SkEdge* last);
67 Combine addPolyLine(const SkPoint pts[], char* edge, char** edgePtr) override;
79 Combine combineVertical(const SkAnalyticEdge* edge, SkAnalyticEdge* last);
87 Combine addPolyLine(const SkPoint pts[], char* edge, char** edgePtr) override;
/third_party/node/deps/v8/src/compiler/
H A Dgraph-trimmer.cc33 for (Edge edge : live->use_edges()) { in TrimGraph()
34 Node* const user = edge.from(); in TrimGraph()
37 StdoutStream{} << "DeadLink: " << *user << "(" << edge.index() in TrimGraph()
40 edge.UpdateTo(nullptr); in TrimGraph()
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()
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/arborist/
H A Dindex.js143 for (const edge of tree.edgesOut.values()) {
144 if (edge.type !== 'workspace' && edge.to) {
145 wsNodes.push(edge.to)
152 for (const edge of node.edgesOut.values()) {
153 const dep = edge.to
195 [...tree.edgesOut.values()].map(edge => edge.to),
/third_party/skia/src/gpu/effects/
H A DGrConvexPolyEffect.cpp114 Var edge(kHalf_Type, "edge"); in onMakeProgramImpl()
115 Declare(edge); in onMakeProgramImpl()
117 edge = Dot(edgeArray[i], Half3(Swizzle(sk_FragCoord(), X, Y, ONE))); in onMakeProgramImpl()
119 edge = Saturate(edge); in onMakeProgramImpl()
121 edge = Select(edge >= 0.5, 1.0, 0.0); in onMakeProgramImpl()
123 alpha *= edge; in onMakeProgramImpl()
164 // Outset the edges by 0.5 so that a pixel with center on an edge i in GrConvexPolyEffect()
[all...]
/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/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/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...]

Completed in 14 milliseconds

12345678910>>...61