Home
last modified time | relevance | path

Searched refs:graph (Results 201 - 225 of 245) sorted by relevance

12345678910

/third_party/ltp/tools/sparse/sparse-src/
H A DMakefile98 PROGRAMS += graph
/third_party/node/deps/v8/src/compiler/
H A Djs-typed-lowering.h10 #include "src/compiler/graph-reducer.h"
94 Graph* graph() const;
H A Dmemory-lowering.h8 #include "src/compiler/graph-assembler.h"
9 #include "src/compiler/graph-reducer.h"
32 // An allocation state is propagated on the effect paths through the graph.
117 Graph* graph() const { return graph_; } in graph() function in v8::internal::compiler::final
H A Dstate-values-utils.cc94 graph()->NewNode(common()->StateValues(0, SparseInputMask::Dense())); in GetEmptyStateValues()
128 node = graph()->NewNode(common()->StateValues(node_count, mask), node_count, in GetValuesNodeFromCache()
H A Dmachine-graph-verifier.cc5 #include "src/compiler/machine-graph-verifier.h"
8 #include "src/compiler/graph.h"
24 MachineRepresentationInferrer(Schedule const* schedule, Graph const* graph, in MachineRepresentationInferrer() argument
28 representation_vector_(graph->NodeCount(), MachineRepresentation::kNone, in MachineRepresentationInferrer()
718 << " in the machine graph is not being checked."; in Run()
995 // TODO(turbofan): At the moment, the machine graph doesn't contain in IsCompatible()
1040 void MachineGraphVerifier::Run(Graph* graph, Schedule const* const schedule, in Run() argument
1043 MachineRepresentationInferrer representation_inferrer(schedule, graph, in Run()
H A Descape-analysis.h10 #include "src/compiler/graph-reducer.h"
11 #include "src/compiler/js-graph.h"
43 EffectGraphReducer(Graph* graph,
54 // part of the graph.
106 // An object that can track the nodes in the graph whose current reduction
136 // dead nodes in the graph. This is a workaround that should be removed in FieldAt()
H A Djs-create-lowering.h10 #include "src/compiler/graph-reducer.h"
122 Graph* graph() const;
H A Dmachine-operator-reducer.h10 #include "src/compiler/graph-reducer.h"
120 Graph* graph() const;
H A Dload-elimination.cc9 #include "src/compiler/js-graph.h"
948 NodeProperties::GetType(replacement), graph()->zone()); in ReduceLoadField()
950 graph()->NewNode(common()->TypeGuard(replacement_type), in ReduceLoadField()
1019 graph()->NewNode(common()->Unreachable(), effect, control); in ReduceStoreField()
1454 Graph* LoadElimination::graph() const { return jsgraph()->graph(); } in graph() function in v8::internal::compiler::LoadElimination
H A Djs-native-context-specialization.h10 #include "src/compiler/graph-reducer.h"
239 Graph* graph() const;
H A Dverifier.cc15 #include "src/compiler/graph.h"
283 // All inputs are graph terminators. in Check()
290 // Dead is never connected to the graph. in Check()
358 // stay connected to the graph end. in Check()
453 // Type is merged from other values in the graph and could be any. in Check()
1874 void Verifier::Run(Graph* graph, Typing typing, CheckInputs check_inputs, in Run() argument
1876 CHECK_NOT_NULL(graph->start()); in Run()
1877 CHECK_NOT_NULL(graph->end()); in Run()
1878 Zone zone(graph->zone()->allocator(), ZONE_NAME); in Run()
1880 AllNodes all(&zone, graph); in Run()
[all...]
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/regex/
H A DRegexGenerator.java25 import com.google.common.graph.ValueGraph;
71 * DFA graph in an attempt to reduce the number of problematic terminating states. This results
81 * DFA graph in an attempt to identify and handle subgroups which would cause repetition. This
92 * NFA graph to factor out common trailing paths. This results in a small size improvement to
122 // graph (i.e. we can generate "(?:<re>)?" but only if "<re>" is non-empty). We just get in toRegex()
/third_party/node/tools/gyp/pylib/gyp/
H A Dcommon.py595 def TopologicallySorted(graph, get_edges):
599 graph: A list of node names.
603 A list containing all of the node in graph in topological order.
609 graph = {'a': '$(b) $(c)', 'b': 'hi', 'c': '$(b)'}
611 return re.findall(r'\$\(([^))]\)', graph[node])
612 print TopologicallySorted(graph.keys(), GetEdges)
633 for node in sorted(graph):
/third_party/node/deps/npm/node_modules/node-gyp/gyp/pylib/gyp/
H A Dcommon.py589 def TopologicallySorted(graph, get_edges):
593 graph: A list of node names.
597 A list containing all of the node in graph in topological order.
603 graph = {'a': '$(b) $(c)', 'b': 'hi', 'c': '$(b)'}
605 return re.findall(r'\$\(([^))]\)', graph[node])
606 print TopologicallySorted(graph.keys(), GetEdges)
627 for node in sorted(graph):
/third_party/node/deps/v8/tools/
H A Drun_perf.py366 # A regular expression for results. If the parent graph provides a
450 """Changes the cwd to to path defined in the current graph.
526 """Factory method for making graph configuration objects."""
531 # A main file makes this graph runnable. Empty strings are accepted.
533 # This graph has subgraphs (traces).
536 # This graph has no subgraphs, it's a leaf.
546 """Builds a tree structure of graph objects that corresponds to the suite
554 graph = MakeGraphConfig(suite, arch, parent)
556 BuildGraphConfigs(subsuite, arch, graph)
557 parent.AppendChild(graph)
[all...]
/third_party/ninja/src/
H A Dninja.cc44 #include "graph.h"
386 GraphViz graph(&state_, &disk_interface_); in ToolGraph()
387 graph.Start(); in ToolGraph()
389 graph.AddTarget(*n); in ToolGraph()
390 graph.Finish(); in ToolGraph()
1110 { "browse", "browse dependency graph in a web browser", in ChooseTool()
1126 { "graph", "output graphviz dot file for targets", in ChooseTool()
/third_party/ffmpeg/libavfilter/
H A Df_zmq.c179 ret = avfilter_graph_send_command(inlink->graph, in filter_frame()
H A Df_graphmonitor.c343 for (int i = 0; i < ctx->graph->nb_filters; i++) { in create_frame()
344 AVFilterContext *filter = ctx->graph->filters[i]; in create_frame()
H A Df_sendcmd.c559 ret = avfilter_graph_send_command(inlink->graph, in filter_frame()
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/regex/
H A DRangeTreeConverterTest.java28 import com.google.common.graph.ValueGraph;
146 // Follows the given edge from a node (which must be in the graph), returning the target node
147 // (or null if the edge does not exist in the graph).
/third_party/ffmpeg/libavdevice/
H A Ddshow_capture.h290 IGraphBuilder *graph; member
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/tool/locale/
H A DLocaleDistanceBuilder.java55 /** Directed, acyclic containment graph. Maps each container to its direct contents. */
56 final Multimap<String, String> graph = TreeMultimap.create(); field in LocaleDistanceBuilder.TerritoryContainment
61 /** The leaves of the graph. */
88 graph.put(container, s); in addContainments()
97 Set<String> contained = graph.get(region); in resolve()
/third_party/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/locale/
H A DLocaleDistanceBuilder.java55 /** Directed, acyclic containment graph. Maps each container to its direct contents. */
56 final Multimap<String, String> graph = TreeMultimap.create(); field in LocaleDistanceBuilder.TerritoryContainment
61 /** The leaves of the graph. */
88 graph.put(container, s); in addContainments()
97 Set<String> contained = graph.get(region); in resolve()
/third_party/alsa-lib/src/topology/
H A Ddapm.c250 /* add graph to manifest */ in tplg_build_routes()
377 SNDERR("compound is expected for dapm graph definition"); in tplg_parse_dapm_graph()
400 SNDERR("failed to parse dapm graph %s, missing index", in tplg_parse_dapm_graph()
406 SNDERR("failed to parse dapm graph %s", in tplg_parse_dapm_graph()
417 /* save DAPM graph */
767 struct snd_tplg_graph_template *gt = t->graph; in tplg_add_graph_object()
1062 SNDERR("dapm graph: small size %d", size); in tplg_decode_dapm_graph()
1069 tplg_log(tplg, 'D', pos, "dapm graph: src='%s' ctl='%s' sink='%s'", in tplg_decode_dapm_graph()
1076 t.graph = gt; in tplg_decode_dapm_graph()
/third_party/littlefs/scripts/
H A Dstack.py172 for k, graph in vcg:
173 if k != 'graph':
175 for k, info in graph:

Completed in 24 milliseconds

12345678910