Home
last modified time | relevance | path

Searched refs:graph (Results 101 - 125 of 319) sorted by relevance

12345678910>>...13

/third_party/node/deps/v8/src/compiler/
H A Dnode-properties.cc7 #include "src/compiler/graph.h"
154 void NodeProperties::MergeControlToEnd(Graph* graph, in MergeControlToEnd() argument
157 graph->end()->AppendInput(graph->zone(), node); in MergeControlToEnd()
158 graph->end()->set_op(common->End(graph->end()->InputCount())); in MergeControlToEnd()
161 void NodeProperties::RemoveControlFromEnd(Graph* graph, in RemoveControlFromEnd() argument
165 for (int i = 0; i < graph->end()->op()->ControlInputCount(); i++) { in RemoveControlFromEnd()
166 int index = NodeProperties::FirstControlIndex(graph->end()) + i; in RemoveControlFromEnd()
167 if (graph in RemoveControlFromEnd()
[all...]
H A Dgraph.h25 // Marks are used during traversal of the graph to distinguish states of nodes.
41 // the original start and end nodes of the graph, and resets them when you
45 explicit SubgraphScope(Graph* graph) in SubgraphScope() argument
46 : graph_(graph), start_(graph->start()), end_(graph->end()) {} in SubgraphScope()
113 // A graph decorator can be used to add behavior to the creation of nodes
114 // in a graph.
H A Dloop-analysis.h11 #include "src/compiler/graph.h"
32 // Represents a tree of loops in a graph.
176 // Build a loop tree for the entire graph.
177 static LoopTree* BuildLoopTree(Graph* graph, TickCounter* tick_counter,
188 // 1) the loop size (in graph nodes) exceeds {max_size},
204 NodeCopier(Graph* graph, uint32_t max, NodeVector* p, uint32_t copy_count) in NodeCopier() argument
205 : node_map_(graph, max), copies_(p), copy_count_(copy_count) { in NodeCopier()
223 void CopyNodes(Graph* graph, Zone* tmp_zone_, Node* dead, in CopyNodes() argument
235 Node* copy = graph->CloneNode(original); in CopyNodes()
H A Dbranch-condition-duplicator.cc8 #include "src/compiler/graph.h"
102 BranchConditionDuplicator::BranchConditionDuplicator(Zone* zone, Graph* graph) in BranchConditionDuplicator() argument
103 : graph_(graph), to_visit_(zone), seen_(graph, 2) {} in BranchConditionDuplicator()
H A Dnode-origin-table.cc6 #include "src/compiler/graph.h"
41 NodeOriginTable::NodeOriginTable(Graph* graph) in NodeOriginTable() argument
42 : graph_(graph), in NodeOriginTable()
46 table_(graph->zone()) {} in NodeOriginTable()
H A Dtype-narrowing-reducer.cc7 #include "src/compiler/js-graph.h"
80 Graph* TypeNarrowingReducer::graph() const { return jsgraph()->graph(); } in graph() function in v8::internal::compiler::TypeNarrowingReducer
82 Zone* TypeNarrowingReducer::zone() const { return graph()->zone(); } in zone()
H A Dcontrol-flow-optimizer.cc9 #include "src/compiler/graph.h"
17 ControlFlowOptimizer::ControlFlowOptimizer(Graph* graph, in ControlFlowOptimizer() argument
22 : graph_(graph), in ControlFlowOptimizer()
26 queued_(graph, 2), in ControlFlowOptimizer()
31 Enqueue(graph()->start()); in Optimize()
H A Dframe-states.cc9 #include "src/compiler/graph.h"
10 #include "src/compiler/js-graph.h"
119 Graph* const graph = jsgraph->graph(); in CreateBuiltinContinuationFrameStateCommon() local
124 Node* params_node = graph->NewNode(op_param, parameter_count, parameters); in CreateBuiltinContinuationFrameStateCommon()
142 return FrameState(graph->NewNode(op, params_node, jsgraph->EmptyStateValues(), in CreateBuiltinContinuationFrameStateCommon()
250 JSGraph* graph, const SharedFunctionInfoRef& shared, Node* target, in CreateGenericLazyDeoptContinuationFrameState()
255 graph, shared, Builtin::kGenericLazyDeoptContinuation, target, context, in CreateGenericLazyDeoptContinuationFrameState()
249 CreateGenericLazyDeoptContinuationFrameState( JSGraph* graph, const SharedFunctionInfoRef& shared, Node* target, Node* context, Node* receiver, Node* outer_frame_state) CreateGenericLazyDeoptContinuationFrameState() argument
H A Dadd-type-assertions-reducer.h9 #include "src/compiler/graph-reducer.h"
10 #include "src/compiler/js-graph.h"
38 Graph* graph() { return jsgraph_->graph(); } in graph() function in v8::internal::compiler::final
H A Dpipeline.h66 // Run the pipeline on a machine graph and generate code.
75 std::unique_ptr<Zone> zone, Graph* graph, CodeKind kind,
79 // Run the pipeline on a machine graph and generate code.
81 Isolate* isolate, CallDescriptor* call_descriptor, Graph* graph,
97 // Run the pipeline on a machine graph and generate code. If {schedule} is
101 CallDescriptor* call_descriptor, Graph* graph,
H A Dstate-values-utils.h12 #include "src/compiler/js-graph.h"
72 Graph* graph() { return js_graph_->graph(); } in graph() function in v8::internal::compiler::StateValuesCache
75 Zone* zone() { return graph()->zone(); } in zone()
H A Dwasm-inlining.h12 #include "src/compiler/graph-reducer.h"
13 #include "src/compiler/js-graph.h"
34 // The WasmInliner provides the core graph inlining machinery for Webassembly
52 initial_graph_size_(mcgraph->graph()->NodeCount()), in WasmInliner()
86 Graph* graph() const { return mcgraph_->graph(); } in graph() function in v8::internal::compiler::final
117 // Stores the graph size before an inlining was performed, to make it
/third_party/ffmpeg/libavfilter/
H A Df_ebur128.c96 struct rect graph; ///< rectangle for the main graph in the center member
104 int *y_line_ref; ///< y reference values for drawing the LU lines in the graph and the gauge
224 v = av_clipf(v, 0, ebur128->scale_range); // make sure it's in the graph scale in lu_to_y()
226 return v * ebur128->graph.h / ebur128->scale_range; // rescale from scale range to px height in lu_to_y()
316 /* configure graph position and size */ in config_video_output()
317 ebur128->graph.x = ebur128->text.x + ebur128->text.w + PAD; in config_video_output()
318 ebur128->graph.y = ebur128->gauge.y; in config_video_output()
319 ebur128->graph.w = ebur128->gauge.x - ebur128->graph in config_video_output()
[all...]
H A Dthread.h24 int ff_graph_thread_init(AVFilterGraph *graph);
26 void ff_graph_thread_free(AVFilterGraph *graph);
/third_party/ffmpeg/doc/examples/
H A Dfilter_audio.c62 static int init_filter_graph(AVFilterGraph **graph, AVFilterContext **src, in init_filter_graph() argument
84 fprintf(stderr, "Unable to create filter graph.\n"); in init_filter_graph()
89 * it will be used for feeding the data into the graph. */ in init_filter_graph()
166 * it will be used to get the filtered data out of the graph. */ in init_filter_graph()
198 /* Configure the graph. */ in init_filter_graph()
201 av_log(NULL, AV_LOG_ERROR, "Error configuring the filter graph\n"); in init_filter_graph()
205 *graph = filter_graph; in init_filter_graph()
272 AVFilterGraph *graph; in main() local
305 err = init_filter_graph(&graph, &src, &sink); in main()
307 fprintf(stderr, "Unable to init filter graph in main()
[all...]
/kernel/linux/linux-5.10/arch/sparc/kernel/
H A Dstacktrace.c20 int graph = 0; in __save_stack_trace() local
63 graph); in __save_stack_trace()
69 graph++; in __save_stack_trace()
/kernel/linux/linux-6.6/arch/sparc/kernel/
H A Dstacktrace.c20 int graph = 0; in __save_stack_trace() local
63 graph); in __save_stack_trace()
69 graph++; in __save_stack_trace()
/third_party/node/deps/v8/src/maglev/
H A Dmaglev-graph-printer.h31 void PreProcessGraph(MaglevCompilationUnit*, Graph* graph);
32 void PostProcessGraph(MaglevCompilationUnit*, Graph* graph) {} in PostProcessGraph() argument
48 Graph* const graph);
H A Dmaglev-regalloc.h10 #include "src/maglev/maglev-graph.h"
25 Graph* graph);
43 void ComputePostDominatingHoles(Graph* graph);
44 void AllocateRegisters(Graph* graph);
H A Dmaglev-compilation-info.h63 void set_graph(Graph* graph) { graph_ = graph; } in set_graph() argument
64 Graph* graph() const { return graph_; } in graph() function in v8::internal::maglev::final
/third_party/vk-gl-cts/external/vulkan-docs/src/scripts/
H A Dextdependency.py18 """A directed graph.
48 """Iterate over the nodes in the graph."""
54 the start node itself. Each node in the graph is yielded at most once.
110 self.graph = DiGraph()
139 self.graph.add_node(name)
149 self.graph.add_edge(name, dep)
155 """Returns a set of all extensions in the graph"""
159 """Returns a set of all KHR extensions in the graph"""
163 """Returns a set of all ratified extensions in the graph"""
168 Throws an exception if the extension is not in the graph
[all...]
/third_party/ffmpeg/libavdevice/
H A Dlavfi.c51 AVFilterGraph *graph; member
92 avfilter_graph_free(&lavfi->graph); in lavfi_read_close()
142 "Only one of the graph or graph_file options must be specified\n"); in lavfi_read_header()
170 /* parse the graph, create a stream for each open output */ in lavfi_read_header()
171 if (!(lavfi->graph = avfilter_graph_alloc())) in lavfi_read_header()
174 if ((ret = avfilter_graph_parse_ptr(lavfi->graph, lavfi->graph_str, in lavfi_read_header()
247 /* create a sink for each output and connect them to the graph */ in lavfi_read_header()
266 NULL, lavfi->graph); in lavfi_read_header()
279 NULL, lavfi->graph); in lavfi_read_header()
300 /* configure the graph */ in lavfi_read_header()
[all...]
/third_party/mesa3d/src/gallium/drivers/r300/compiler/
H A Dradeon_pair_regalloc.c523 struct ra_graph * graph; in do_advanced_regalloc() local
569 graph = ra_alloc_interference_graph(ra_state->regs, in do_advanced_regalloc()
573 ra_set_node_class(graph, node_index, node_classes[node_index]); in do_advanced_regalloc()
576 /* Build the interference graph */ in do_advanced_regalloc()
589 ra_add_node_interference(graph, in do_advanced_regalloc()
599 /* Add input registers to the interference graph */ in do_advanced_regalloc()
609 ra_add_node_interference(graph, node_index, in do_advanced_regalloc()
614 ra_set_node_reg(graph, node_count + input_node, get_reg_id( in do_advanced_regalloc()
619 if (!ra_allocate(graph)) { in do_advanced_regalloc()
627 int reg = ra_get_node_reg(graph, node_inde in do_advanced_regalloc()
[all...]
/kernel/linux/linux-5.10/scripts/
H A Dheaderdep.pl4 # Detect cycles in the header file dependency graph
24 graph => \$opt_graph,
36 graph();
47 print " --graph\n";
52 print " $0 --graph include/linux/kernel.h | dot -Tpng -o graph.png\n";
172 # Output dependency graph in GraphViz language.
173 sub graph { subroutine
/kernel/linux/linux-6.6/scripts/
H A Dheaderdep.pl4 # Detect cycles in the header file dependency graph
24 graph => \$opt_graph,
36 graph();
47 print " --graph\n";
52 print " $0 --graph include/linux/kernel.h | dot -Tpng -o graph.png\n";
172 # Output dependency graph in GraphViz language.
173 sub graph { subroutine

Completed in 11 milliseconds

12345678910>>...13