Home
last modified time | relevance | path

Searched refs:graph (Results 1 - 25 of 241) sorted by relevance

12345678910

/third_party/skia/tests/
H A DTopoSortTest.cpp14 typedef void (*CreateGraphPF)(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph);
25 static void create_graph0(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph0() argument
26 ToolUtils::TopoTestNode::AllocNodes(graph, 4); in create_graph0()
28 (*graph)[0]->dependsOn((*graph)[1].get()); in create_graph0()
29 (*graph)[0]->dependsOn((*graph)[2].get()); in create_graph0()
30 (*graph)[1]->dependsOn((*graph)[3].get()); in create_graph0()
31 (*graph)[ in create_graph0()
46 create_graph1(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) create_graph1() argument
61 create_graph2(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) create_graph2() argument
84 create_graph3(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) create_graph3() argument
107 create_graph4(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) create_graph4() argument
130 create_graph5(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) create_graph5() argument
150 create_graph6(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) create_graph6() argument
179 SkTArray<sk_sp<ToolUtils::TopoTestNode>> graph; DEF_TEST() local
[all...]
H A DGrRenderTaskClusterTest.cpp13 typedef void (*CreateGraphPF)(SkTArray<sk_sp<GrMockRenderTask>>* graph,
35 static void create_graph0(SkTArray<sk_sp<GrMockRenderTask>>* graph, in create_graph0() argument
39 make_tasks(3, graph); in create_graph0()
41 graph->at(0)->addTarget(proxies[0]); in create_graph0()
42 graph->at(1)->addTarget(proxies[1]); in create_graph0()
43 graph->at(2)->addTarget(proxies[0]); in create_graph0()
44 graph->at(2)->addDependency(graph->at(1).get()); in create_graph0()
46 expected->push_back(graph->at(1)); in create_graph0()
47 expected->push_back(graph in create_graph0()
55 create_graph1(SkTArray<sk_sp<GrMockRenderTask>>* graph, SkTArray<sk_sp<GrMockRenderTask>>* expected) create_graph1() argument
79 create_graph2(SkTArray<sk_sp<GrMockRenderTask>>* graph, SkTArray<sk_sp<GrMockRenderTask>>* expected) create_graph2() argument
102 create_graph3(SkTArray<sk_sp<GrMockRenderTask>>* graph, SkTArray<sk_sp<GrMockRenderTask>>* expected) create_graph3() argument
131 SkTArray<sk_sp<GrMockRenderTask>> graph; DEF_TEST() local
[all...]
/third_party/node/deps/npm/node_modules/color-convert/
H A Droute.js15 const graph = {};
20 graph[models[i]] = {
28 return graph;
33 const graph = buildGraph();
36 graph[fromModel].distance = 0;
44 const node = graph[adjacent];
47 node.distance = graph[current].distance + 1;
54 return graph;
63 function wrapConversion(toModel, graph) {
64 const path = [graph[toMode
[all...]
/third_party/skia/third_party/externals/spirv-tools/test/fuzz/
H A Dcall_graph_test.cpp284 const auto graph = CallGraph(context.get()); in TEST() local
286 const auto& function_in_degree = graph.GetFunctionInDegree(); in TEST()
304 const auto graph = CallGraph(context.get()); in TEST() local
307 ASSERT_EQ(graph.GetDirectCallees(2), std::set<uint32_t>({35, 48, 50})); in TEST()
308 ASSERT_EQ(graph.GetDirectCallees(35), std::set<uint32_t>({})); in TEST()
309 ASSERT_EQ(graph.GetDirectCallees(48), std::set<uint32_t>({35, 50, 61})); in TEST()
310 ASSERT_EQ(graph.GetDirectCallees(50), std::set<uint32_t>({35})); in TEST()
311 ASSERT_EQ(graph.GetDirectCallees(61), std::set<uint32_t>({})); in TEST()
323 const auto graph = CallGraph(context.get()); in TEST() local
326 ASSERT_EQ(graph in TEST()
342 const auto graph = CallGraph(context.get()); TEST() local
365 const auto graph = CallGraph(context.get()); TEST() local
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/fuzz/
H A Dcall_graph_test.cpp284 const auto graph = CallGraph(context.get()); in TEST() local
286 const auto& function_in_degree = graph.GetFunctionInDegree(); in TEST()
304 const auto graph = CallGraph(context.get()); in TEST() local
307 ASSERT_EQ(graph.GetDirectCallees(2), std::set<uint32_t>({35, 48, 50})); in TEST()
308 ASSERT_EQ(graph.GetDirectCallees(35), std::set<uint32_t>({})); in TEST()
309 ASSERT_EQ(graph.GetDirectCallees(48), std::set<uint32_t>({35, 50, 61})); in TEST()
310 ASSERT_EQ(graph.GetDirectCallees(50), std::set<uint32_t>({35})); in TEST()
311 ASSERT_EQ(graph.GetDirectCallees(61), std::set<uint32_t>({})); in TEST()
323 const auto graph = CallGraph(context.get()); in TEST() local
326 ASSERT_EQ(graph in TEST()
342 const auto graph = CallGraph(context.get()); TEST() local
365 const auto graph = CallGraph(context.get()); TEST() local
[all...]
/third_party/spirv-tools/test/fuzz/
H A Dcall_graph_test.cpp284 const auto graph = CallGraph(context.get()); in TEST() local
286 const auto& function_in_degree = graph.GetFunctionInDegree(); in TEST()
304 const auto graph = CallGraph(context.get()); in TEST() local
307 ASSERT_EQ(graph.GetDirectCallees(2), std::set<uint32_t>({35, 48, 50})); in TEST()
308 ASSERT_EQ(graph.GetDirectCallees(35), std::set<uint32_t>({})); in TEST()
309 ASSERT_EQ(graph.GetDirectCallees(48), std::set<uint32_t>({35, 50, 61})); in TEST()
310 ASSERT_EQ(graph.GetDirectCallees(50), std::set<uint32_t>({35})); in TEST()
311 ASSERT_EQ(graph.GetDirectCallees(61), std::set<uint32_t>({})); in TEST()
323 const auto graph = CallGraph(context.get()); in TEST() local
326 ASSERT_EQ(graph in TEST()
342 const auto graph = CallGraph(context.get()); TEST() local
365 const auto graph = CallGraph(context.get()); TEST() local
[all...]
/third_party/ffmpeg/libavfilter/
H A Dpthread.c36 AVFilterGraph *graph; member
62 ThreadContext *c = ctx->graph->internal->thread; in thread_execute()
83 int ff_graph_thread_init(AVFilterGraph *graph) in ff_graph_thread_init() argument
87 if (graph->nb_threads == 1) { in ff_graph_thread_init()
88 graph->thread_type = 0; in ff_graph_thread_init()
92 graph->internal->thread = av_mallocz(sizeof(ThreadContext)); in ff_graph_thread_init()
93 if (!graph->internal->thread) in ff_graph_thread_init()
96 ret = thread_init_internal(graph->internal->thread, graph->nb_threads); in ff_graph_thread_init()
98 av_freep(&graph in ff_graph_thread_init()
110 ff_graph_thread_free(AVFilterGraph *graph) ff_graph_thread_free() argument
[all...]
H A Davfiltergraph.c70 void ff_graph_thread_free(AVFilterGraph *graph) in ff_graph_thread_free() argument
74 int ff_graph_thread_init(AVFilterGraph *graph) in ff_graph_thread_init() argument
76 graph->thread_type = 0; in ff_graph_thread_init()
77 graph->nb_threads = 1; in ff_graph_thread_init()
101 void ff_filter_graph_remove_filter(AVFilterGraph *graph, AVFilterContext *filter) in ff_filter_graph_remove_filter() argument
104 for (i = 0; i < graph->nb_filters; i++) { in ff_filter_graph_remove_filter()
105 if (graph->filters[i] == filter) { in ff_filter_graph_remove_filter()
106 FFSWAP(AVFilterContext*, graph->filters[i], in ff_filter_graph_remove_filter()
107 graph->filters[graph in ff_filter_graph_remove_filter()
119 avfilter_graph_free(AVFilterGraph **graph) avfilter_graph_free() argument
160 avfilter_graph_set_auto_convert(AVFilterGraph *graph, unsigned flags) avfilter_graph_set_auto_convert() argument
165 avfilter_graph_alloc_filter(AVFilterGraph *graph, const AVFilter *filter, const char *name) avfilter_graph_alloc_filter() argument
207 graph_check_validity(AVFilterGraph *graph, void *log_ctx) graph_check_validity() argument
245 graph_config_links(AVFilterGraph *graph, void *log_ctx) graph_config_links() argument
262 graph_check_links(AVFilterGraph *graph, void *log_ctx) graph_check_links() argument
283 avfilter_graph_get_filter(AVFilterGraph *graph, const char *name) avfilter_graph_get_filter() argument
406 query_formats(AVFilterGraph *graph, void *log_ctx) query_formats() argument
771 reduce_formats(AVFilterGraph *graph) reduce_formats() argument
829 swap_samplerates(AVFilterGraph *graph) swap_samplerates() argument
965 swap_channel_layouts(AVFilterGraph *graph) swap_channel_layouts() argument
1033 swap_sample_fmts(AVFilterGraph *graph) swap_sample_fmts() argument
1042 pick_formats(AVFilterGraph *graph) pick_formats() argument
1097 graph_config_formats(AVFilterGraph *graph, void *log_ctx) graph_config_formats() argument
1125 graph_config_pointers(AVFilterGraph *graph, void *log_ctx) graph_config_pointers() argument
1184 avfilter_graph_send_command(AVFilterGraph *graph, const char *target, const char *cmd, const char *arg, char *res, int res_len, int flags) avfilter_graph_send_command() argument
1214 avfilter_graph_queue_command(AVFilterGraph *graph, const char *target, const char *command, const char *arg, int flags, double ts) avfilter_graph_queue_command() argument
1245 heap_bubble_up(AVFilterGraph *graph, AVFilterLink *link, int index) heap_bubble_up() argument
1264 heap_bubble_down(AVFilterGraph *graph, AVFilterLink *link, int index) heap_bubble_down() argument
1288 ff_avfilter_graph_update_heap(AVFilterGraph *graph, AVFilterLink *link) ff_avfilter_graph_update_heap() argument
1294 avfilter_graph_request_oldest(AVFilterGraph *graph) avfilter_graph_request_oldest() argument
1339 ff_filter_graph_run_once(AVFilterGraph *graph) ff_filter_graph_run_once() argument
[all...]
H A Dgraphparser.c2 * filter graph parser
168 * corresponding filter instance which is added to graph with
182 static int parse_filter(AVFilterContext **filt_ctx, const char **buf, AVFilterGraph *graph, in parse_filter() argument
201 ret = create_filter(filt_ctx, graph, index, name, opts, log_ctx); in parse_filter()
395 static int parse_sws_flags(const char **buf, AVFilterGraph *graph) in parse_sws_flags() argument
403 av_log(graph, AV_LOG_ERROR, "sws_flags not terminated with ';'.\n"); in parse_sws_flags()
409 av_freep(&graph->scale_sws_opts); in parse_sws_flags()
410 if (!(graph->scale_sws_opts = av_mallocz(p - *buf + 1))) in parse_sws_flags()
412 av_strlcpy(graph->scale_sws_opts, *buf, p - *buf + 1); in parse_sws_flags()
418 int avfilter_graph_parse2(AVFilterGraph *graph, cons argument
486 avfilter_graph_parse(AVFilterGraph *graph, const char *filters, AVFilterInOut *open_inputs, AVFilterInOut *open_outputs, void *log_ctx) avfilter_graph_parse() argument
549 avfilter_graph_parse_ptr(AVFilterGraph *graph, const char *filters, AVFilterInOut **open_inputs_ptr, AVFilterInOut **open_outputs_ptr, void *log_ctx) avfilter_graph_parse_ptr() argument
[all...]
/third_party/skia/src/gpu/
H A DGrTTopoSort.h16 void GrTTopoSort_CheckAllUnmarked(const SkTArray<sk_sp<T>>& graph) { in GrTTopoSort_CheckAllUnmarked() argument
17 for (int i = 0; i < graph.count(); ++i) { in GrTTopoSort_CheckAllUnmarked()
18 SkASSERT(!Traits::IsTempMarked(graph[i].get())); in GrTTopoSort_CheckAllUnmarked()
19 SkASSERT(!Traits::WasOutput(graph[i].get())); in GrTTopoSort_CheckAllUnmarked()
24 void GrTTopoSort_CleanExit(const SkTArray<sk_sp<T>>& graph) { in GrTTopoSort_CleanExit() argument
25 for (int i = 0; i < graph.count(); ++i) { in GrTTopoSort_CleanExit()
26 SkASSERT(!Traits::IsTempMarked(graph[i].get())); in GrTTopoSort_CleanExit()
27 SkASSERT(Traits::WasOutput(graph[i].get())); in GrTTopoSort_CleanExit()
28 SkASSERT(Traits::GetIndex(graph[i].get()) == (uint32_t) i); in GrTTopoSort_CleanExit()
63 // Topologically sort the nodes in 'graph'
85 GrTTopoSort(SkTArray<sk_sp<T>>* graph) GrTTopoSort() argument
[all...]
/third_party/skia/third_party/externals/harfbuzz/src/
H A Dtest-repacker.cc75 graph_t graph (overflowing.object_graph ()); in run_resolve_overflow_test()
791 graph_t graph (c.object_graph ()); in test_sort_kahn_1()
792 graph.sort_kahn (); in test_sort_kahn_1()
794 assert(strncmp (graph.object (3).head, "abc", 3) == 0); in test_sort_kahn_1()
795 assert(graph.object (3).links.length == 2); in test_sort_kahn_1()
796 assert(graph.object (3).links[0].objidx == 2); in test_sort_kahn_1()
797 assert(graph.object (3).links[1].objidx == 1); in test_sort_kahn_1()
799 assert(strncmp (graph.object (2).head, "def", 3) == 0); in test_sort_kahn_1()
800 assert(graph.object (2).links.length == 1); in test_sort_kahn_1()
801 assert(graph in test_sort_kahn_1()
[all...]
/third_party/node/deps/v8/src/compiler/
H A Dint64-lowering.cc9 #include "src/compiler/graph.h"
25 Graph* graph, MachineOperatorBuilder* machine, in Int64Lowering()
30 graph_(graph), in Int64Lowering()
34 state_(graph->NodeCount(), State::kUnvisited), in Int64Lowering()
38 placeholder_(graph->NewNode(common->Dead())), in Int64Lowering()
40 DCHECK_NOT_NULL(graph); in Int64Lowering()
41 DCHECK_NOT_NULL(graph->end()); in Int64Lowering()
42 replacements_ = zone->NewArray<Replacement>(graph->NodeCount()); in Int64Lowering()
43 memset(replacements_, 0, sizeof(Replacement) * graph->NodeCount()); in Int64Lowering()
50 stack_.push_back({graph() in LowerGraph()
24 Int64Lowering( Graph* graph, MachineOperatorBuilder* machine, CommonOperatorBuilder* common, SimplifiedOperatorBuilder* simplified, Zone* zone, Signature<MachineRepresentation>* signature, std::unique_ptr<Int64LoweringSpecialCase> special_case) Int64Lowering() argument
[all...]
H A Dgraph-assembler.cc5 #include "src/compiler/graph-assembler.h"
9 #include "src/compiler/graph-reducer.h"
78 return AddNode(graph()->NewNode( in UniqueIntPtrConstant()
112 graph()->NewNode(common()->Parameter(index), graph()->start())); in Parameter()
120 return AddNode(graph()->NewNode(machine()->LoadFramePointer())); in LoadFramePointer()
146 return AddNode(graph()->NewNode(machine()->Name(), input)); \
153 return AddNode(graph()->NewNode(machine()->Name(), left, right)); \
161 graph()->NewNode(machine()->Name(), left, right, control())); \
196 return AddNode(graph() in Float64RoundDown()
[all...]
H A Dbasic-block-instrumentor.cc11 #include "src/compiler/graph.h"
55 OptimizedCompilationInfo* info, Graph* graph, Schedule* schedule, in Instrument()
77 CommonOperatorBuilder common(graph->zone()); in Instrument()
78 MachineOperatorBuilder machine(graph->zone()); in Instrument()
90 counters_array = graph->NewNode(common.HeapConstant(Handle<HeapObject>::New( in Instrument()
93 counters_array = graph->NewNode(PointerConstant(&common, data->counts())); in Instrument()
95 Node* zero = graph->NewNode(common.Int32Constant(0)); in Instrument()
96 Node* one = graph->NewNode(common.Int32Constant(1)); in Instrument()
113 graph->NewNode(IntPtrConstant(&common, offset_to_counter_value)); in Instrument()
115 graph in Instrument()
54 Instrument( OptimizedCompilationInfo* info, Graph* graph, Schedule* schedule, Isolate* isolate) Instrument() argument
[all...]
H A Djs-typed-lowering.cc14 #include "src/compiler/graph-assembler.h"
15 #include "src/compiler/js-graph.h"
136 Node* left_input = graph()->NewNode(simplified()->CheckReceiver(), left(), in CheckLeftInputToReceiver()
145 graph()->NewNode(simplified()->CheckReceiverOrNullOrUndefined(), left(), in CheckLeftInputToReceiverOrNullOrUndefined()
159 Node* right_input = graph()->NewNode(simplified()->CheckReceiver(), in CheckInputsToReceiver()
175 graph()->NewNode(simplified()->CheckReceiverOrNullOrUndefined(), in CheckInputsToReceiverOrNullOrUndefined()
184 Node* left_input = graph()->NewNode(simplified()->CheckSymbol(), left(), in CheckLeftInputToSymbol()
198 Node* right_input = graph()->NewNode(simplified()->CheckSymbol(), right(), in CheckInputsToSymbol()
211 graph()->NewNode(simplified()->CheckString(FeedbackSource()), left(), in CheckInputsToString()
218 graph() in CheckInputsToString()
398 Graph* graph() const { return lowering_->graph(); } graph() function in v8::internal::compiler::final
2459 Graph* JSTypedLowering::graph() const { return jsgraph()->graph(); } graph() function in v8::internal::compiler::JSTypedLowering
[all...]
H A Djs-call-reducer.cc23 #include "src/compiler/graph-assembler.h"
24 #include "src/compiler/js-graph.h"
289 // Emplace a copy of the call node into the graph at current effect/control.
305 // TODO(jgruber): Implement MapInference::InsertMapChecks in graph in MaybeInsertMapChecks()
322 // The IfException node is later merged into the outer graph. in MayThrow()
326 graph()->NewNode(common()->IfException(), effect(), control()); in MayThrow()
330 AddNode(graph()->NewNode(common()->IfSuccess(), control())); in MayThrow()
338 // outside graph into which the reduction will be integrated (in this case
402 Node* merge = gasm_->graph()->NewNode(gasm_->common()->Merge(size), in MergeExceptionalPaths()
411 Node* ephi = gasm_->graph() in MergeExceptionalPaths()
[all...]
H A Dall-nodes.cc7 #include "src/compiler/graph.h"
13 AllNodes::AllNodes(Zone* local_zone, const Graph* graph, bool only_inputs) in AllNodes() argument
15 is_reachable_(graph->NodeCount(), false, local_zone), in AllNodes()
17 Mark(local_zone, graph->end(), graph); in AllNodes()
20 AllNodes::AllNodes(Zone* local_zone, Node* end, const Graph* graph, in AllNodes() argument
23 is_reachable_(graph->NodeCount(), false, local_zone), in AllNodes()
25 Mark(local_zone, end, graph); in AllNodes()
28 void AllNodes::Mark(Zone* local_zone, Node* end, const Graph* graph) { in Mark() argument
29 DCHECK_LT(end->id(), graph in Mark()
[all...]
H A Djs-native-context-specialization.cc17 #include "src/compiler/js-graph.h"
171 Replace(graph()->NewNode(common()->DelayedStringConstant(base))); in ReduceJSToString()
227 graph()->NewNode(javascript()->CreatePromise(), context, effect); in ReduceJSAsyncFunctionEnter()
244 graph()->NewNode(javascript()->CreateAsyncFunctionObject(register_count), in ReduceJSAsyncFunctionEnter()
263 Node* promise = effect = graph()->NewNode( in ReduceJSAsyncFunctionReject()
280 effect = graph()->NewNode(javascript()->RejectPromise(), promise, reason, in ReduceJSAsyncFunctionReject()
299 Node* promise = effect = graph()->NewNode( in ReduceJSAsyncFunctionResolve()
313 effect = graph()->NewNode(javascript()->ResolvePromise(), promise, value, in ReduceJSAsyncFunctionResolve()
348 Node* reduced = graph()->NewNode(common()->DelayedStringConstant(cons)); in ReduceJSAdd()
486 node->EnsureInputCount(graph() in ReduceJSInstanceOf()
3447 Graph* JSNativeContextSpecialization::graph() const { graph() function in v8::internal::compiler::JSNativeContextSpecialization
[all...]
H A Dwasm-compiler.cc30 #include "src/compiler/graph-assembler.h"
31 #include "src/compiler/graph-visualizer.h"
32 #include "src/compiler/graph.h"
54 #include "src/wasm/graph-builder-interface.h"
105 ? graph()->NewNode(mcgraph()->common()->HeapConstant( \
204 NodeProperties::MergeControlToEnd(graph(), mcgraph()->common(), node); in MergeControlToEnd()
229 graph()->NewNode(mcgraph()->common()->Branch(hint), cond, control()); in Branch()
230 *true_node = graph()->NewNode(mcgraph()->common()->IfTrue(), branch); in Branch()
231 *false_node = graph()->NewNode(mcgraph()->common()->IfFalse(), branch); in Branch()
236 return graph() in NumberConstant()
4348 Graph* WasmGraphBuilder::graph() { return mcgraph()->graph(); } graph() function in v8::internal::compiler::WasmGraphBuilder
[all...]
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/regex/
H A DNfaFlattener.java23 import com.google.common.graph.ValueGraph;
34 * 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
44 public static Edge flatten(ValueGraph<Node, SimpleEdge> graph) { in flatten() argument
45 return new NfaFlattener(graph).flatten(); in flatten()
50 * in the NFA graph. Path followers may be joined (if they point at the same node) but can only
61 /** A composite edge representing everything up to the target node in the current sub-graph. */
65 // The graph being flattened.
66 private final ValueGraph<Node, SimpleEdge> graph; field in NfaFlattener
70 private NfaFlattener(ValueGraph<Node, SimpleEdge> graph) { in NfaFlattener() argument
178 nodeOrdering(ValueGraph<Node, ?> graph) nodeOrdering() argument
185 recursivelySetMaxPathLength( Node node, int length, ValueGraph<Node, ?> graph, Map<Node, Integer> map) recursivelySetMaxPathLength() argument
[all...]
H A DRangeTreeConverter.java21 import com.google.common.graph.ElementOrder;
22 import com.google.common.graph.MutableValueGraph;
23 import com.google.common.graph.ValueGraph;
24 import com.google.common.graph.ValueGraphBuilder;
34 * Converts DFA {@link RangeTree}s to NFA {@link ValueGraph}s. The resulting graph has almost
47 * Returns the directed NFA graph representation of a {@link RangeTree}. The returned graph is
49 * for the initial and terminal nodes which are always present in the graph.
54 return visitor.graph; in toNfaGraph()
58 private final MutableValueGraph<Node, SimpleEdge> graph field in RangeTreeConverter.NfaVisitor
[all...]
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/regex/
H A DNfaBuilder.java23 import com.google.common.graph.MutableValueGraph;
24 import com.google.common.graph.ValueGraph;
25 import com.google.common.graph.ValueGraphBuilder;
31 private final MutableValueGraph<Node, SimpleEdge> graph = field in NfaBuilder
33 // The last node added to the graph.
36 /** Creates a new mutable NFA graph. */
38 graph.addNode(INITIAL); in NfaBuilder()
39 graph.addNode(TERMINAL); in NfaBuilder()
44 * Returns an unmodifiable view of the underlying graph (not a snapshot). If the builder is
47 public ValueGraph<Node, SimpleEdge> graph() { in graph() method in NfaBuilder
[all...]
/third_party/icu/tools/cldr/cldr-to-icu/src/main/java/org/unicode/icu/tool/cldrtoicu/localedistance/
H A DTerritoryContainment.java26 * Territory containment graph. This is built from CLDR supplemental data and
28 * such as {@code "016"}. The root node of the graph is {@code "001"}.
41 // The world region must be the only root in the graph.
50 // Directed, acyclic containment graph. Maps each territory to its direct contents. in getContainment()
53 SortedSetMultimap<String, String> graph = TreeMultimap.create(); in getContainment()
57 graph.putAll(v.get(TYPE), LIST_SPLITTER.split(v.get(CONTAINS))); in getContainment()
60 return new TerritoryContainment(ImmutableSetMultimap.copyOf(graph)); in getContainment()
66 private TerritoryContainment(ImmutableSetMultimap<String, String> graph) { in TerritoryContainment() argument
68 graph.values().forEach( in TerritoryContainment()
69 r -> checkArgument(REGION.matcher(r).matches(), "bad region '%s' in: %s", r, graph)); in TerritoryContainment()
95 resolve( String region, SetMultimap<String, String> graph, SetMultimap<String, String> resolved) resolve() argument
[all...]
/third_party/node/deps/v8/src/maglev/
H A Dmaglev-graph-processor.h10 #include "src/maglev/maglev-graph.h"
27 // // A function that processes the graph before the nodes are walked.
28 // void PreProcessGraph(MaglevCompilationUnit*, Graph* graph);
30 // // A function that processes the graph after the nodes are walked.
31 // void PostProcessGraph(MaglevCompilationUnit*, Graph* graph);
82 void ProcessGraph(Graph* graph) { in ProcessGraph() argument
83 graph_ = graph; in ProcessGraph()
85 node_processor_.PreProcessGraph(compilation_unit_, graph); in ProcessGraph()
87 for (block_it_ = graph->begin(); block_it_ != graph in ProcessGraph()
152 PreProcessGraph(MaglevCompilationUnit*, Graph* graph) PreProcessGraph() argument
153 PostProcessGraph(MaglevCompilationUnit*, Graph* graph) PostProcessGraph() argument
169 PreProcessGraph(MaglevCompilationUnit* unit, Graph* graph) PreProcessGraph() argument
173 PostProcessGraph(MaglevCompilationUnit* unit, Graph* graph) PostProcessGraph() argument
[all...]
/third_party/mesa3d/src/nouveau/codegen/
H A Dnv50_ir_graph.cpp49 node->graph = this; in insert()
87 in(0), out(0), graph(0), in Node()
119 assert(graph || node->graph); in attach()
120 if (!node->graph) in attach()
121 graph->insert(node); in attach()
122 if (!graph) in attach()
123 node->graph->insert(this); in attach()
126 graph->classifyEdges(); in attach()
143 // Cut a node from the graph, deletin
199 DFSIterator(Graph *graph, const bool preorder) DFSIterator() argument
257 CFGIterator(Graph *graph) CFGIterator() argument
[all...]

Completed in 24 milliseconds

12345678910