Home
last modified time | relevance | path

Searched defs:edge (Results 1 - 25 of 122) sorted by relevance

12345

/third_party/ninja/src/
H A Dstate_test.cc36 Edge* edge = state.AddEdge(rule); in TEST() local
H A Dgraphviz.cc34 Edge* edge = node->in_edge(); in AddTarget() local
[all...]
H A Dmanifest_parser_test.cc89 Edge* edge = state.GetNode("result", 0)->in_edge(); in TEST_F() local
142 Edge* edge = state.edges_[0]; in TEST_F() local
161 Edge* edge = state.edges_[0]; in TEST_F() local
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 Ddyndep.cc48 Edge* const edge = *oe; in LoadDyndeps() local
71 Edge* const edge = oe->first; in LoadDyndeps() local
82 bool DyndepLoader::UpdateEdge(Edge* edge, Dyndeps const* dyndeps, in UpdateEdge() argument
[all...]
H A Dgraph_test.cc110 Edge* edge = GetNode("out")->in_edge(); in TEST_F() local
152 Edge* edge = GetNode("out.imp")->in_edge(); in TEST_F() local
224 Edge* edge = GetNode("out 1")->in_edge(); TEST_F() local
255 Edge* edge = GetNode("a b")->in_edge(); TEST_F() local
315 Edge* edge = GetNode("out")->in_edge(); TEST_F() local
327 Edge* edge = GetNode("out")->in_edge(); TEST_F() local
339 Edge* edge = GetNode("out")->in_edge(); TEST_F() local
440 Edge* edge = GetNode("a")->in_edge(); TEST_F() local
465 Edge* edge = GetNode("a")->in_edge(); TEST_F() local
492 Edge* edge = GetNode("a")->in_edge(); TEST_F() local
536 Edge* edge = GetNode("out")->in_edge(); TEST_F() local
566 Edge* edge = GetNode("out1")->in_edge(); TEST_F() local
911 Edge* edge = GetNode("out")->in_edge(); TEST_F() local
[all...]
H A Dmissing_deps.cc111 Edge* edge = node->in_edge(); in ProcessNodeDeps() local
50 ProcessDepfileDeps( Edge* edge, std::vector<StringPiece>* depfile_ins, std::string* err) ProcessDepfileDeps() argument
[all...]
H A Dstate.cc26 void Pool::EdgeScheduled(const Edge& edge) { in EdgeScheduled() argument
31 void Pool::EdgeFinished(const Edge& edge) { in EdgeFinished() argument
36 void Pool::DelayEdge(Edge* edge) { in DelayEdge() argument
44 Edge* edge = *it; in RetrieveReadyEdges() local
87 Edge* edge = new Edge(); AddEdge() local
129 AddIn(Edge* edge, StringPiece path, uint64_t slash_bits) AddIn() argument
136 AddOut(Edge* edge, StringPiece path, uint64_t slash_bits) AddOut() argument
147 AddValidation(Edge* edge, StringPiece path, uint64_t slash_bits) AddValidation() argument
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A Dcord_rep_btree_reader.cc35 CordRep* edge = chunk_size ? navigator_.Current() : navigator_.Next(); in Read() local
[all...]
H A Dcord_rep_btree_navigator.cc70 CordRep* edge = node->Edge(index); in Skip() local
111 CordRep* edge = node->Edge(index); Read() local
[all...]
H A Dcord_rep_btree_reader.h176 const CordRep* edge = navigator_.InitFirst(tree); in Init() local
183 const CordRep* edge = navigator_.Next(); Next() local
[all...]
/third_party/node/deps/v8/src/compiler/
H A Dverifier.h53 static void VerifyEdgeInputReplacement(const Edge& edge, in VerifyEdgeInputReplacement() argument
H A Dcontrol-equivalence.cc99 Edge edge = *entry.input; in RunUndirectedDFS() local
129 Edge edge = *entry.use; in RunUndirectedDFS() local
/third_party/mesa3d/src/gallium/auxiliary/util/
H A Du_split_prim.h14 void (*edge)(void *priv, boolean enabled); member
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/regex/
H A DRangeTreeConverterTest.java121 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/mesa3d/src/util/
H A Ddag.c33 struct dag_edge edge = { in append_edge() local
88 dag_remove_edge(struct dag *dag, struct dag_edge *edge) dag_remove_edge() argument
[all...]
/third_party/node/deps/v8/src/profiler/
H A Dheap-snapshot-generator-inl.h33 void HeapEntry::add_child(HeapGraphEdge* edge) { in add_child() argument
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/regex/
H A DNfaFlattener.java55 private static PathFollower of(Node node, Edge edge) { in of() argument
62 abstract Edge edge(); in edge() method in NfaFlattener.PathFollower
[all...]
H A DEdgeWriter.java53 public static String toRegex(Edge edge, boolean useDotMatch) { in toRegex() argument
175 visit(SimpleEdge edge) visit() argument
[all...]
H A DEdge.java45 void visit(SimpleEdge edge); in visit() argument
[all...]
H A DSubgroupOptimizer.java90 private static int getEdgeWeight(DfaEdge edge) { in getEdgeWeight() argument
125 public void visit(DfaNode source, DfaEdge edge, DfaNode target) { in visit() argument
162 visit(DfaNode source, DfaEdge edge, DfaNode target) visit() argument
[all...]
/third_party/skia/src/core/
H A DSkScanPriv.h45 static inline void remove_edge(EdgeType* edge) { in remove_edge() argument
51 static inline void insert_edge_after(EdgeType* edge, EdgeType* afterMe) { in insert_edge_after() argument
59 backward_insert_edge_based_on_x(EdgeType* edge) backward_insert_edge_based_on_x() argument
[all...]
/third_party/ffmpeg/libavfilter/
H A Ddeshake.h63 int edge; ///< Edge fill method member
/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
H A DRangeTreeFactorizer.java190 visit(DfaNode source, DfaEdge edge, DfaNode target) visit() argument
[all...]
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/table/
H A DRangeKey.java131 public void visit(DfaNode source, DfaEdge edge, DfaNode target) { in visit() argument

Completed in 10 milliseconds

12345