| /third_party/skia/tests/ |
| D | TopoSortTest.cpp | 25 static void create_graph0(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph0()
46 static void create_graph1(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph1()
61 static void create_graph2(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph2()
84 static void create_graph3(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph3()
107 static void create_graph4(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph4()
130 static void create_graph5(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph5()
150 static void create_graph6(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph6()
179 SkTArray<sk_sp<ToolUtils::TopoTestNode>> graph; in DEF_TEST() local
|
| D | GrRenderTaskClusterTest.cpp | 35 static void create_graph0(SkTArray<sk_sp<GrMockRenderTask>>* graph, in create_graph0()
55 static void create_graph1(SkTArray<sk_sp<GrMockRenderTask>>* graph, in create_graph1()
79 static void create_graph2(SkTArray<sk_sp<GrMockRenderTask>>* graph, in create_graph2()
102 static void create_graph3(SkTArray<sk_sp<GrMockRenderTask>>* graph, in create_graph3()
131 SkTArray<sk_sp<GrMockRenderTask>> graph; in DEF_TEST() local
|
| /third_party/ffmpeg/libavfilter/ |
| D | avfiltergraph.c | 70 void ff_graph_thread_free(AVFilterGraph *graph) in ff_graph_thread_free()
74 int ff_graph_thread_init(AVFilterGraph *graph) in ff_graph_thread_init()
101 void ff_filter_graph_remove_filter(AVFilterGraph *graph, AVFilterContext *filter) in ff_filter_graph_remove_filter()
119 void avfilter_graph_free(AVFilterGraph **graph) in avfilter_graph_free()
160 void avfilter_graph_set_auto_convert(AVFilterGraph *graph, unsigned flags) in avfilter_graph_set_auto_convert()
165 AVFilterContext *avfilter_graph_alloc_filter(AVFilterGraph *graph, in avfilter_graph_alloc_filter()
207 static int graph_check_validity(AVFilterGraph *graph, void *log_ctx) in graph_check_validity()
245 static int graph_config_links(AVFilterGraph *graph, void *log_ctx) in graph_config_links()
262 static int graph_check_links(AVFilterGraph *graph, void *log_ctx) in graph_check_links()
283 AVFilterContext *avfilter_graph_get_filter(AVFilterGraph *graph, const char *name) in avfilter_graph_get_filter()
[all …]
|
| D | pthread.c | 36 AVFilterGraph *graph; member
83 int ff_graph_thread_init(AVFilterGraph *graph) in ff_graph_thread_init()
110 void ff_graph_thread_free(AVFilterGraph *graph) in ff_graph_thread_free()
|
| D | graphparser.c | 182 static int parse_filter(AVFilterContext **filt_ctx, const char **buf, AVFilterGraph *graph, in parse_filter()
395 static int parse_sws_flags(const char **buf, AVFilterGraph *graph) in parse_sws_flags()
418 int avfilter_graph_parse2(AVFilterGraph *graph, const char *filters, in avfilter_graph_parse2()
486 int avfilter_graph_parse(AVFilterGraph *graph, const char *filters, in avfilter_graph_parse()
549 int avfilter_graph_parse_ptr(AVFilterGraph *graph, const char *filters, in avfilter_graph_parse_ptr()
|
| D | graphdump.c | 65 static void avfilter_graph_dump_to_buf(AVBPrint *buf, AVFilterGraph *graph) in avfilter_graph_dump_to_buf()
157 char *avfilter_graph_dump(AVFilterGraph *graph, const char *options) in avfilter_graph_dump()
|
| /third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/regex/ |
| D | NfaFlattener.java | 44 public static Edge flatten(ValueGraph<Node, SimpleEdge> graph) { in flatten()
66 private final ValueGraph<Node, SimpleEdge> graph; field in NfaFlattener
70 private NfaFlattener(ValueGraph<Node, SimpleEdge> graph) { in NfaFlattener()
178 static Comparator<Node> nodeOrdering(ValueGraph<Node, ?> graph) { in nodeOrdering()
186 Node node, int length, ValueGraph<Node, ?> graph, Map<Node, Integer> map) { in recursivelySetMaxPathLength()
|
| /third_party/spirv-tools/test/fuzz/ |
| D | call_graph_test.cpp | 284 const auto graph = CallGraph(context.get()); in TEST() local
304 const auto graph = CallGraph(context.get()); in TEST() local
323 const auto graph = CallGraph(context.get()); in TEST() local
342 const auto graph = CallGraph(context.get()); in TEST() local
365 const auto graph = CallGraph(context.get()); in TEST() local
|
| /third_party/skia/third_party/externals/spirv-tools/test/fuzz/ |
| D | call_graph_test.cpp | 284 const auto graph = CallGraph(context.get()); in TEST() local
304 const auto graph = CallGraph(context.get()); in TEST() local
323 const auto graph = CallGraph(context.get()); in TEST() local
342 const auto graph = CallGraph(context.get()); in TEST() local
365 const auto graph = CallGraph(context.get()); in TEST() local
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/fuzz/ |
| D | call_graph_test.cpp | 284 const auto graph = CallGraph(context.get()); in TEST() local
304 const auto graph = CallGraph(context.get()); in TEST() local
323 const auto graph = CallGraph(context.get()); in TEST() local
342 const auto graph = CallGraph(context.get()); in TEST() local
365 const auto graph = CallGraph(context.get()); in TEST() local
|
| /third_party/node/deps/v8/src/compiler/ |
| D | all-nodes.cc | 13 AllNodes::AllNodes(Zone* local_zone, const Graph* graph, bool only_inputs) in AllNodes()
20 AllNodes::AllNodes(Zone* local_zone, Node* end, const Graph* graph, in AllNodes()
28 void AllNodes::Mark(Zone* local_zone, Node* end, const Graph* graph) { in Mark()
|
| /third_party/skia/src/gpu/ |
| D | GrTTopoSort.h | 16 void GrTTopoSort_CheckAllUnmarked(const SkTArray<sk_sp<T>>& graph) { in GrTTopoSort_CheckAllUnmarked()
24 void GrTTopoSort_CleanExit(const SkTArray<sk_sp<T>>& graph) { in GrTTopoSort_CleanExit()
85 bool GrTTopoSort(SkTArray<sk_sp<T>>* graph) { in GrTTopoSort()
|
| /third_party/gn/tools/ |
| D | find_unreachable.py | 25 def find_reachable_targets(known, graph): argument
37 def find_source_targets_from(targets, graph): argument
|
| /third_party/node/deps/v8/src/maglev/ |
| D | maglev-graph-processor.h | 82 void ProcessGraph(Graph* graph) { in ProcessGraph()
152 void PreProcessGraph(MaglevCompilationUnit*, Graph* graph) {} in PreProcessGraph()
153 void PostProcessGraph(MaglevCompilationUnit*, Graph* graph) {} in PostProcessGraph()
169 void PreProcessGraph(MaglevCompilationUnit* unit, Graph* graph) { in PreProcessGraph()
173 void PostProcessGraph(MaglevCompilationUnit* unit, Graph* graph) { in PostProcessGraph()
|
| D | maglev-vreg-allocator.h | 29 void PreProcessGraph(MaglevCompilationUnit*, Graph* graph) {} in PreProcessGraph()
30 void PostProcessGraph(MaglevCompilationUnit*, Graph* graph) { in PostProcessGraph()
|
| D | maglev-compiler.cc | 50 void PreProcessGraph(MaglevCompilationUnit*, Graph* graph) { node_id_ = 1; } in PreProcessGraph()
51 void PostProcessGraph(MaglevCompilationUnit*, Graph* graph) {} in PostProcessGraph()
64 void PreProcessGraph(MaglevCompilationUnit*, Graph* graph) {} in PreProcessGraph()
65 void PostProcessGraph(MaglevCompilationUnit*, Graph* graph) {} in PostProcessGraph()
212 Graph* const graph = toplevel_compilation_unit->info()->graph(); in GenerateCode() local
|
| D | maglev-graph-verifier.h | 33 void PreProcessGraph(MaglevCompilationUnit* compilation_unit, Graph* graph) { in PreProcessGraph()
39 void PostProcessGraph(MaglevCompilationUnit*, Graph* graph) {} in PostProcessGraph()
|
| D | maglev-compilation-info.h | 63 void set_graph(Graph* graph) { graph_ = graph; } in set_graph()
64 Graph* graph() const { return graph_; } in graph() function
|
| /third_party/icu/tools/cldr/cldr-to-icu/src/main/java/org/unicode/icu/tool/cldrtoicu/localedistance/ |
| D | TerritoryContainment.java | 53 SortedSetMultimap<String, String> graph = TreeMultimap.create(); in getContainment() local
66 private TerritoryContainment(ImmutableSetMultimap<String, String> graph) { in TerritoryContainment() argument
96 String region, SetMultimap<String, String> graph, SetMultimap<String, String> resolved) { in resolve() argument
|
| /third_party/node/test/async-hooks/ |
| D | verify-graph.js | 7 function findInGraph(graph, type, n) { argument
59 module.exports = function verifyGraph(hooks, graph) { argument
|
| /third_party/node/deps/npm/node_modules/color-convert/ |
| D | route.js | 20 graph[models[i]] = { variable
63 function wrapConversion(toModel, graph) { argument
|
| /third_party/skia/third_party/externals/harfbuzz/src/ |
| D | test-repacker.cc | 75 graph_t graph (overflowing.object_graph ()); in run_resolve_overflow_test() local
791 graph_t graph (c.object_graph ()); in test_sort_kahn_1() local
819 graph_t graph (c.object_graph ()); in test_sort_kahn_2() local
853 graph_t graph (c.object_graph ()); in test_sort_shortest() local
886 graph_t graph (c.object_graph ()); in test_duplicate_leaf() local
922 graph_t graph (c.object_graph ()); in test_duplicate_interior() local
968 graph_t graph (c1.object_graph ()); in test_serialize() local
986 graph_t graph (c.object_graph ()); in test_will_overflow_1() local
999 graph_t graph (c.object_graph ()); in test_will_overflow_2() local
1012 graph_t graph (c.object_graph ()); in test_will_overflow_3() local
[all …]
|
| /third_party/node/src/ |
| D | memory_tracker.h | 257 inline v8::EmbedderGraph* graph() { return graph_; } in graph() function
261 v8::EmbedderGraph* graph) in MemoryTracker()
|
| /third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/regex/ |
| D | NfaBuilder.java | 31 private final MutableValueGraph<Node, SimpleEdge> graph = field in NfaBuilder
47 public ValueGraph<Node, SimpleEdge> graph() { in graph() method in NfaBuilder
|
| /third_party/ffmpeg/tools/ |
| D | graph2dot.c | 53 static void print_digraph(FILE *outfile, AVFilterGraph *graph) in print_digraph()
115 AVFilterGraph *graph = NULL; in main() local
|