Home
last modified time | relevance | path

Searched refs:edge (Results 26 - 50 of 1506) sorted by relevance

12345678910>>...61

/third_party/ninja/src/
H A Dmanifest_parser_test.cc89 Edge* edge = state.GetNode("result", 0)->in_edge(); in TEST_F() local
90 EXPECT_TRUE(edge->GetBindingBool("restat")); in TEST_F()
91 EXPECT_FALSE(edge->GetBindingBool("generator")); in TEST_F()
142 Edge* edge = state.edges_[0]; in TEST_F() local
143 EXPECT_EQ("cat in\nin2 > out", edge->EvaluateCommand()); in TEST_F()
161 Edge* edge = state.edges_[0]; in TEST_F() local
163 edge->EvaluateCommand()); in TEST_F()
166 edge = state.edges_[1]; in TEST_F()
168 edge->EvaluateCommand()); in TEST_F()
394 Edge* edge in TEST_F() local
409 Edge* edge = node->in_edge(); TEST_F() local
955 Edge* edge = state.LookupNode("foo")->in_edge(); TEST_F() local
964 Edge* edge = state.LookupNode("foo")->in_edge(); TEST_F() local
973 Edge* edge = state.LookupNode("foo")->in_edge(); TEST_F() local
984 Edge* edge = state.LookupNode("imp")->in_edge(); TEST_F() local
995 Edge* edge = state.LookupNode("foo")->in_edge(); TEST_F() local
1006 Edge* edge = state.LookupNode("foo")->in_edge(); TEST_F() local
1019 Edge* edge = state.LookupNode("foo")->in_edge(); TEST_F() local
1104 Edge* edge = state.GetNode("result", 0)->in_edge(); TEST_F() local
1127 Edge* edge = state.GetNode("result", 0)->in_edge(); TEST_F() local
1139 Edge* edge = state.GetNode("result", 0)->in_edge(); TEST_F() local
1151 Edge* edge = state.GetNode("result", 0)->in_edge(); TEST_F() local
1163 Edge* edge = state.GetNode("result", 0)->in_edge(); TEST_F() local
[all...]
H A Dmanifest_parser.cc308 // Bindings on edges are rare, so allocate per-edge envs only when needed. in ParseEdge()
321 Edge* edge = state_->AddEdge(rule); in ParseEdge() local
322 edge->env_ = env; in ParseEdge()
324 string pool_name = edge->GetBinding("pool"); in ParseEdge()
329 edge->pool_ = pool; in ParseEdge()
332 edge->outputs_.reserve(outs.size()); in ParseEdge()
339 if (!state_->AddOut(edge, path, slash_bits)) { in ParseEdge()
356 if (edge->outputs_.empty()) { in ParseEdge()
357 // All outputs of the edge are already created by other edges. Don't add in ParseEdge()
358 // this edge in ParseEdge()
[all...]
H A Dbuild_test.cc47 Edge* edge = plan_.FindWork(); in FindWorkSorted() local
48 ASSERT_TRUE(edge); in FindWorkSorted()
49 ret->push_back(edge); in FindWorkSorted()
70 Edge* edge = plan_.FindWork(); in TEST_F() local
71 ASSERT_TRUE(edge); in TEST_F()
72 ASSERT_EQ("in", edge->inputs_[0]->path()); in TEST_F()
73 ASSERT_EQ("mid", edge->outputs_[0]->path()); in TEST_F()
77 plan_.EdgeFinished(edge, Plan::kEdgeSucceeded, &err); in TEST_F()
80 edge = plan_.FindWork(); in TEST_F()
81 ASSERT_TRUE(edge); in TEST_F()
106 Edge* edge; TEST_F() local
139 Edge* edge; TEST_F() local
180 Edge* edge; TEST_F() local
216 Edge* edge = plan_.FindWork(); TestPoolWithDepthOne() local
297 Edge *edge = edges[i]; TEST_F() local
304 Edge* edge = edges[4]; TEST_F() local
372 Edge* edge = NULL; TEST_F() local
445 Edge* edge = plan_.FindWork(); TEST_F() local
585 StartCommand(Edge* edge) StartCommand() argument
685 Edge* edge = *edge_iter; WaitForCommand() local
983 Edge* edge = state_.edges_.back(); TEST_F() local
1052 Edge* edge = state_.edges_.back(); TEST_F() local
1186 Edge* edge = state_.edges_.back(); TEST_F() local
2995 Edge* edge = state.edges_.back(); TEST_F() local
3150 Edge* edge = state.edges_.back(); TEST_F() local
[all...]
H A Dninja.cc159 /// For each edge, lookup in build log how long it took last time,
160 /// and record that in the edge itself. It will be used for ETA predicton.
176 // have an in edge if one of its inputs is another output that's in the deps in IsPathDead()
177 // log, but having a deps edge product an output that's input to another deps in IsPathDead()
178 // edge is rare, and the first recompaction will delete all old outputs from in IsPathDead()
297 for (Edge* edge : state_.edges_) { in ParsePreviousElapsedTimes()
298 for (Node* out : edge->outputs_) { in ParsePreviousElapsedTimes()
301 continue; // Maybe we'll have log entry for next output of this edge? in ParsePreviousElapsedTimes()
302 edge->prev_elapsed_time_millis = in ParsePreviousElapsedTimes()
304 break; // Onto next edge in ParsePreviousElapsedTimes()
336 Edge* edge = node->out_edges()[0]; CollectTarget() local
709 PrintCommands(Edge* edge, EdgeSet* seen, PrintCommandMode mode) PrintCommands() argument
767 CollectInputs(Edge* edge, std::set<Edge*>* seen, std::vector<std::string>* result) CollectInputs() argument
891 EvaluateCommandWithRspfile(const Edge* edge, const EvaluateCommandMode mode) EvaluateCommandWithRspfile() argument
925 printCompdb(const char* const directory, const Edge* const edge, const EvaluateCommandMode eval_mode) printCompdb() argument
[all...]
H A Dstatus.h27 virtual void EdgeAddedToPlan(const Edge* edge) = 0;
28 virtual void EdgeRemovedFromPlan(const Edge* edge) = 0;
29 virtual void BuildEdgeStarted(const Edge* edge,
31 virtual void BuildEdgeFinished(Edge* edge, int64_t start_time_millis,
51 virtual void EdgeAddedToPlan(const Edge* edge);
52 virtual void EdgeRemovedFromPlan(const Edge* edge);
54 virtual void BuildEdgeStarted(const Edge* edge, int64_t start_time_millis);
55 virtual void BuildEdgeFinished(Edge* edge, int64_t start_time_millis,
72 /// @param status The status of the edge.
77 void PrintStatus(const Edge* edge, int64_
[all...]
H A Dstate_test.cc36 Edge* edge = state.AddEdge(rule); in TEST() local
37 state.AddIn(edge, "in1", 0); in TEST()
38 state.AddIn(edge, "in2", 0); in TEST()
39 state.AddOut(edge, "out", 0); in TEST()
41 EXPECT_EQ("cat in1 in2 > out", edge->EvaluateCommand()); in TEST()
H A Dgraph.h98 void set_in_edge(Edge* edge) { in_edge_ = edge; } in set_in_edge()
113 void AddOutEdge(Edge* edge) { out_edges_.push_back(edge); } in AddOutEdge()
114 void AddValidationOutEdge(Edge* edge) { validation_out_edges_.push_back(edge); } in AddValidationOutEdge()
151 /// deps log. If it does not have a producing edge, the build should not
158 /// known edge to produce it.
171 /// An edge in the dependency graph; links between Nodes using Rules.
207 // Append all edge explici
[all...]
H A Dmissing_deps.cc42 virtual bool ProcessDepfileDeps(Edge* edge,
51 Edge* edge, std::vector<StringPiece>* depfile_ins, std::string* err) { in ProcessDepfileDeps()
81 Edge* edge = node->in_edge(); in ProcessNode()
82 if (!edge) in ProcessNode()
87 for (std::vector<Node*>::iterator in = edge->inputs_.begin(); in ProcessNode()
88 in != edge->inputs_.end(); ++in) { in ProcessNode()
92 std::string deps_type = edge->GetBinding("deps"); in ProcessNode()
103 dep_loader.LoadDeps(edge, &err); in ProcessNode()
111 Edge* edge = node->in_edge(); in ProcessNodeDeps() local
131 if (!PathExistsBetween(*de, edge)) { in ProcessNodeDeps()
50 ProcessDepfileDeps( Edge* edge, std::vector<StringPiece>* depfile_ins, std::string* err) ProcessDepfileDeps() argument
[all...]
/kernel/linux/linux-6.6/drivers/soc/qcom/
H A Drpm-proc.c12 struct qcom_smd_edge *edge = NULL; in rpm_proc_probe() local
17 edge_node = of_get_child_by_name(dev->of_node, "smd-edge"); in rpm_proc_probe()
19 edge = qcom_smd_register_edge(dev, edge_node); in rpm_proc_probe()
21 if (IS_ERR(edge)) in rpm_proc_probe()
22 return dev_err_probe(dev, PTR_ERR(edge), in rpm_proc_probe()
23 "Failed to register smd-edge\n"); in rpm_proc_probe()
32 platform_set_drvdata(pdev, edge); in rpm_proc_probe()
35 if (edge) in rpm_proc_probe()
36 qcom_smd_unregister_edge(edge); in rpm_proc_probe()
42 struct qcom_smd_edge *edge in rpm_proc_remove() local
[all...]
/third_party/node/deps/v8/src/compiler/
H A Dwasm-escape-analysis.cc29 for (Edge edge : node->use_edges()) { in ReduceAllocateRaw()
30 if (NodeProperties::IsValueEdge(edge)) { in ReduceAllocateRaw()
31 if (edge.index() != 0 || in ReduceAllocateRaw()
32 (edge.from()->opcode() != IrOpcode::kStoreToObject && in ReduceAllocateRaw()
33 edge.from()->opcode() != IrOpcode::kInitializeImmutableInObject)) { in ReduceAllocateRaw()
36 value_edges.push_back(edge); in ReduceAllocateRaw()
41 for (Edge edge : value_edges) { in ReduceAllocateRaw()
42 DCHECK(NodeProperties::IsValueEdge(edge)); in ReduceAllocateRaw()
43 DCHECK_EQ(edge.index(), 0); in ReduceAllocateRaw()
44 Node* use = edge in ReduceAllocateRaw()
[all...]
H A Dgraph-reducer.cc223 for (Edge edge : node->use_edges()) { in Replace()
224 Node* const user = edge.from(); in Replace()
225 Verifier::VerifyEdgeInputReplacement(edge, replacement); in Replace()
226 edge.UpdateTo(replacement); in Replace()
234 for (Edge edge : node->use_edges()) { in Replace()
235 Node* const user = edge.from(); in Replace()
237 edge.UpdateTo(replacement); in Replace()
261 for (Edge edge : node->use_edges()) { in ReplaceWithValue()
262 Node* const user = edge.from(); in ReplaceWithValue()
264 if (NodeProperties::IsControlEdge(edge)) { in ReplaceWithValue()
[all...]
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/regex/
H A DRangeTreeConverterTest.java47 Node node = assertOutEdge(nfa, INITIAL, edge(1)); in testSimple()
48 node = assertOutEdge(nfa, node, edge(2)); in testSimple()
61 Node node = assertOutEdge(nfa, INITIAL, edge(1)); in testWithOptionalEdge()
62 node = assertOutEdge(nfa, node, edge(2)); in testWithOptionalEdge()
75 Node node = assertOutEdge(nfa, INITIAL, edge(1)); in testWithEpsilon()
76 assertOutEdges(nfa, node, edge(2), epsilon()); in testWithEpsilon()
79 node = follow(nfa, node, edge(2)); in testWithEpsilon()
80 // The other is the normal edge that leads to the terminal. in testWithEpsilon()
95 assertOutEdges(nfa, INITIAL, edge(1), edge( in testMultiplePathsWithCommonTail()
121 SimpleEdge edge(int n) { edge() method in RangeTreeConverterTest
130 assertOutEdge(ValueGraph<Node, SimpleEdge> nfa, Node node, SimpleEdge edge) assertOutEdge() argument
148 follow(ValueGraph<Node, SimpleEdge> nfa, Node node, SimpleEdge edge) follow() argument
[all...]
/third_party/skia/third_party/externals/freetype/src/sdf/
H A Dftsdf.c80 * foreach edge in contour:
82 * // get shortest distance from point (x, y) to the edge
83 * d = get_min_dist(x, y, edge);
104 * each type of edge, check out the `get_min_distance_*' functions.
220 * Undefined edge, simply used to initialize and detect errors.
284 * Represent an edge of a contour.
288 * Start position of an edge. Valid for all types of edges.
291 * Etart position of an edge. Valid for all types of edges.
294 * A control point of the edge. Valid only for `SDF_EDGE_CONIC`
298 * Another control point of the edge
683 SDF_Edge* edge = NULL; sdf_line_to() local
726 SDF_Edge* edge = NULL; sdf_conic_to() local
768 SDF_Edge* edge = NULL; sdf_cubic_to() local
1233 SDF_Edge* edge = edges; split_sdf_shape() local
1352 SDF_Edge* edge = edge_list; sdf_shape_dump() local
2862 sdf_edge_get_min_distance( SDF_Edge* edge, FT_26D6_Vec point, SDF_Signed_Distance* out ) sdf_edge_get_min_distance() argument
[all...]
/third_party/skia/src/core/
H A DSkScan_Path.cpp29 static void validate_sort(const SkEdge* edge) { in validate_sort() argument
32 while (edge->fFirstY != SK_MaxS32) { in validate_sort()
33 edge->validate(); in validate_sort()
34 SkASSERT(y <= edge->fFirstY); in validate_sort()
36 y = edge->fFirstY; in validate_sort()
37 edge = edge->fNext; in validate_sort()
41 #define validate_sort(edge)
76 static void validate_edges_for_y(const SkEdge* edge, int curr_y) { in validate_edges_for_y() argument
77 while (edge in validate_edges_for_y()
193 update_edge(SkEdge* edge, int last_y) update_edge() argument
436 SkEdge* edge = sort_edges(list, count, &last); sk_fill_path() local
686 build_tri_edges(SkEdge edge[], const SkPoint pts[], const SkIRect* clipRect, SkEdge* list[]) build_tri_edges() argument
720 SkEdge* edge = sort_edges(list, count, &last); sk_fill_triangle() local
[all...]
H A DSkRegion_path.cpp461 static int extract_path(Edge* edge, Edge* stop, SkPath* path) { in extract_path() argument
462 while (0 == edge->fFlags) { in extract_path()
463 edge++; // skip over "used" edges in extract_path()
466 SkASSERT(edge < stop); in extract_path()
468 Edge* base = edge; in extract_path()
469 Edge* prev = edge; in extract_path()
470 edge = edge->fNext; in extract_path()
471 SkASSERT(edge != base); in extract_path()
477 if (prev->fX != edge in extract_path()
[all...]
/third_party/mesa3d/src/nouveau/codegen/
H A Dnv50_ir_graph.cpp97 Edge *edge = new Edge(this, node, kind); in attach() local
101 edge->next[0] = this->out; in attach()
102 edge->prev[0] = this->out->prev[0]; in attach()
103 edge->prev[0]->next[0] = edge; in attach()
104 this->out->prev[0] = edge; in attach()
106 this->out = edge; in attach()
109 edge->next[1] = node->in; in attach()
110 edge->prev[1] = node->in->prev[1]; in attach()
111 edge in attach()
365 Graph::Edge *edge; classifyDFS() local
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A Dcord_rep_btree_reader.h65 // last data edge returned to the caller, not the cumulative data returned to
93 // Returns the current data edge inside the referenced btree.
104 // first data edge of 19 bytes will return `consumed() = 19`. See also the
113 // Returns a reference to the first data edge of the provided tree.
116 // Navigates to and returns the next data edge of the referenced tree.
127 // If `chunk_size` is zero, starts reading at the next data edge. If
129 // the last returned data edge. Effectively, this means that the read starts
132 // last returned data edge. The purpose of `chunk_size` is to simplify code
176 const CordRep* edge = navigator_.InitFirst(tree); in Init() local
177 consumed_ = edge in Init()
183 const CordRep* edge = navigator_.Next(); Next() local
[all...]
H A Dcord_rep_btree_reader.cc33 // If chunk_size is non-zero, we need to start inside last returned edge. in Read()
34 // Else we start reading at the next data edge of the tree. in Read()
35 CordRep* edge = chunk_size ? navigator_.Current() : navigator_.Next(); in Read() local
36 const size_t offset = chunk_size ? edge->length - chunk_size : 0; in Read()
43 // read from the 'previous' edge, we did not consume any additional data, and in Read()
44 // can directly return the substring into the current data edge as the next in Read()
47 if (n < chunk_size) return CordRepBtree::EdgeData(edge).substr(result.n); in Read()
49 // The amount of data taken from the last edge is `chunk_size` and `result.n` in Read()
50 // contains the offset into the current edge trailing the read data (which can in Read()
60 // We did not read all data, return remaining data from current edge in Read()
[all...]
H A Dcord_rep_btree.cc89 for (CordRep* edge : node->Edges()) { in DumpAll()
90 DumpAll(edge, include_contents, stream, depth + 1); in DumpAll()
172 // Deletes a leaf node data edge. Requires `rep` to be an EXTERNAL or FLAT
352 for (CordRep* edge : tree->Edges(begin, end)) { in DestroyLeaf()
353 FastUnref(edge, DeleteLeafEdge); in DestroyLeaf()
360 for (CordRep* edge : tree->Edges(begin, end)) { in DestroyNonLeaf()
361 FastUnref(edge->btree(), Destroy); in DestroyNonLeaf()
387 for (CordRep* edge : tree->Edges()) { in IsValid()
388 NODE_CHECK_VALID(edge != nullptr); in IsValid()
390 NODE_CHECK_VALID(edge in IsValid()
431 AddEdge(bool owned, CordRep* edge, size_t delta) AddEdge() argument
440 SetEdge(bool owned, CordRep* edge, size_t delta) SetEdge() argument
673 CordRep* const edge = node->Edge(begin); CopySuffix() local
728 CordRep* edge = node->Edge(pos.index); CopyPrefix() local
833 const CordRep* edge = node->Edge(front.index); IsFlat() local
873 CordRep* const edge = node->Edge(kBack); GetAppendBufferSlow() local
[all...]
H A Dcord_rep_btree_navigator_test.cc111 CordRep* edge = nav.InitFirst(tree()); in TEST_P() local
115 EXPECT_THAT(edge, Eq(flats().front())); in TEST_P()
120 CordRep* edge = nav.InitLast(tree()); in TEST_P() local
124 EXPECT_THAT(edge, Eq(flats().back())); in TEST_P()
190 EXPECT_THAT(pos.edge, Eq(nav.Current())); in TEST_P()
191 EXPECT_THAT(pos.edge, Eq(flats[0])); in TEST_P()
203 ASSERT_THAT(pos1.edge, Eq(flats[index1])); in TEST_P()
204 ASSERT_THAT(pos1.edge, Eq(nav.Current())); in TEST_P()
209 ASSERT_THAT(pos2.edge, Eq(flats[index2])); in TEST_P()
210 ASSERT_THAT(pos2.edge, E in TEST_P()
[all...]
H A Dcord_rep_btree.h139 // return a node or data edge at any height inside the tree.
141 // `edge` as being a plain data node: EXTERNAL / FLAT or SUBSTRING thereof.
143 CordRep* edge; member
148 // - index: index of the edge.
158 // edge (see IsDataEdge()), then a new leaf node is returned containing `rep`
159 // as the sole data edge. Else, the input is assumed to be a (legacy) concat
205 // Returns true if this node holds a single data edge, and if so, sets
211 // is contained in a single data edge, and if so, sets fragment to reference
217 // last FLAT data edge inside this tree under the following conditions:
219 // - the last data edge i
733 SetEdge(CordRep* edge) SetEdge() argument
806 CordRep* edge = tree->Edge(kBack); GetAppendBuffer() local
[all...]
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/regex/
H A DNfaFlattener.java34 * Flattens an NFA graph of simple edges into a composite edge which represents all the same
41 * Flattens the given NFA graph into a single composite edge composed of concatenation and
42 * disjunction. The resulting edge can be visited using the {@code Edge.Visitor} class.
49 * A simple pair of edge value and target node which represents the current state along any path
55 private static PathFollower of(Node node, Edge edge) { in of() argument
56 return new AutoValue_NfaFlattener_PathFollower(node, edge); in of()
61 /** A composite edge representing everything up to the target node in the current sub-graph. */
62 abstract Edge edge(); in edge() method in NfaFlattener.PathFollower
74 .thenComparing(PathFollower::edge); in NfaFlattener()
84 out = PathFollower.of(subgraph.node(), Edge.concatenation(out.edge(), subgrap in flatten()
[all...]
/third_party/skia/third_party/externals/freetype/src/autofit/
H A Dafhints.c193 /* Get new edge for given axis, direction, and position, */
194 /* without initializing the edge itself. */
205 AF_Edge edge = NULL; in FT_LOCAL() local
221 FT_Int big_max = (FT_Int)( FT_INT_MAX / sizeof ( *edge ) ); in FT_LOCAL()
251 edge = edges + axis->num_edges; in FT_LOCAL()
253 while ( edge > edges ) in FT_LOCAL()
255 if ( top_to_bottom_hinting ? ( edge[-1].fpos > fpos ) in FT_LOCAL()
256 : ( edge[-1].fpos < fpos ) ) in FT_LOCAL()
259 /* we want the edge with same position and minor direction */ in FT_LOCAL()
261 if ( edge[ in FT_LOCAL()
683 AF_Edge edge; af_glyph_hints_dump_edges() local
1327 AF_Edge edge = seg->edge; af_glyph_hints_align_edge_points() local
1353 AF_Edge edge = seg->edge; af_glyph_hints_align_edge_points() local
1408 AF_Edge edge; af_glyph_hints_align_strong_points() local
[all...]
/third_party/node/test/common/
H A Dheap.js40 const edge = {
46 toNode.incomingEdges.push(edge);
47 fromNode.outgoingEdges.push(edge);
91 function isEdge(edge, { node_name, edge_name }) {
92 if (edge_name !== undefined && edge.name !== edge_name) {
96 if (edge.to.value) {
97 if (edge.to.value.constructor.name !== node_name) {
100 } else if (edge.to.name !== node_name) {
131 (edge) => (isEdge(edge, expectedEdg
[all...]
/third_party/ffmpeg/libavcodec/
H A Dh264_loopfilter.c379 #define FILTER(hv,dir,edge,intra)\ in h264_filter_mb_fast_internal()
380 if(AV_RN64A(bS[dir][edge])) { \ in h264_filter_mb_fast_internal()
381 filter_mb_edge##hv( &img_y[4*edge*(dir?linesize:1<<pixel_shift)], linesize, bS[dir][edge], edge ? qp : qp##dir, a, b, h, intra );\ in h264_filter_mb_fast_internal()
384 filter_mb_edge##hv( &img_cb[4*edge*(dir?linesize:1<<pixel_shift)], linesize, bS[dir][edge], edge ? qpc : qpc##dir, a, b, h, intra );\ in h264_filter_mb_fast_internal()
385 filter_mb_edge##hv( &img_cr[4*edge*(dir?linesize:1<<pixel_shift)], linesize, bS[dir][edge], edg in h264_filter_mb_fast_internal()
476 int edge; filter_mb_dir() local
[all...]

Completed in 17 milliseconds

12345678910>>...61