| /third_party/ffmpeg/tests/fate/ |
| H A D | flvenc.mak | 2 fate-flv-add_keyframe_index: CMD = transcode "lavfi -graph testsrc=r=7:n=2:d=20" "foo" flv "-vf scale -c:v flv1 -dct int -g 7 -flvflags add_keyframe_index" "-c copy -t 0.1" "-show_entries format_tags"
|
| /third_party/node/deps/v8/src/compiler/ |
| H A D | basic-block-instrumentor.h | 24 Graph* graph, Schedule* schedule,
|
| H A D | machine-graph-verifier.h | 19 // Verifies properties of a scheduled graph, such as that the nodes' inputs are
23 static void Run(Graph* graph, Schedule const* const schedule,
|
| H A D | effect-control-linearizer.h | 24 JSGraph* graph, Schedule* schedule, Zone* temp_zone,
|
| H A D | wasm-loop-peeling.h | 24 void PeelWasmLoop(Node* loop_node, ZoneUnorderedSet<Node*>* loop, Graph* graph,
|
| H A D | effect-control-linearizer.cc | 17 #include "src/compiler/graph-assembler.h"
18 #include "src/compiler/js-graph.h"
327 Graph* graph() const { return js_graph_->graph(); } in graph() function in v8::internal::compiler::EffectControlLinearizer
454 Graph* graph, CommonOperatorBuilder* common, in TryCloneBranch()
461 // input graph as shown below and clones the Branch node for every predecessor in TryCloneBranch()
489 // The resulting graph (modulo the Phi and EffectPhi nodes) looks like this: in TryCloneBranch()
547 Node** const inputs = graph->zone()->NewArray<Node*>(2 * input_count); in TryCloneBranch()
553 Node* branch1 = graph->NewNode(common->Branch(hint), cond1, control1); in TryCloneBranch()
554 merge_true_inputs[index] = graph in TryCloneBranch()
453 TryCloneBranch(Node* node, BasicBlock* block, Zone* temp_zone, Graph* graph, CommonOperatorBuilder* common, BlockEffectControlMap* block_effects, SourcePositionTable* source_positions, NodeOriginTable* node_origins) TryCloneBranch() argument
6708 LinearizeEffectControl(JSGraph* graph, Schedule* schedule, Zone* temp_zone, SourcePositionTable* source_positions, NodeOriginTable* node_origins, JSHeapBroker* broker) LinearizeEffectControl() argument
[all...] |
| H A D | branch-condition-duplicator.h | 64 BranchConditionDuplicator(Zone* zone, Graph* graph);
|
| H A D | type-narrowing-reducer.h | 9 #include "src/compiler/graph-reducer.h"
33 Graph* graph() const;
|
| H A D | loop-unrolling.h | 36 Graph* graph, CommonOperatorBuilder* common, Zone* tmp_zone,
|
| H A D | select-lowering.h | 8 #include "src/compiler/graph-reducer.h"
20 SelectLowering(JSGraphAssembler* graph_assembler, Graph* graph);
|
| H A D | csa-load-elimination.h | 11 #include "src/compiler/graph-reducer.h"
12 #include "src/compiler/js-graph.h"
35 node_states_(jsgraph->graph()->NodeCount(), zone), in CsaLoadElimination()
172 Graph* graph() const;
|
| H A D | verifier.h | 20 // Verifies properties of a graph, such as the well-formedness of inputs to
31 static void Run(Graph* graph, Typing typing = TYPED,
|
| H A D | simplified-operator-reducer.h | 11 #include "src/compiler/graph-reducer.h"
56 Graph* graph() const;
|
| H A D | memory-optimizer.cc | 10 #include "src/compiler/js-graph.h"
197 EnqueueUses(graph()->start(), empty_state()); in Optimize()
213 // Allocate nodes were purged from the graph in effect-control in VisitNode()
340 // In case of replacement, the replacement graph should not require futher in VisitLoadField()
341 // lowering, so we can proceed iterating the graph from the node uses. in VisitLoadField()
405 // an unschedulable graph. in MergeStates()
479 Graph* MemoryOptimizer::graph() const { return jsgraph()->graph(); } in graph() function in v8::internal::compiler::MemoryOptimizer
|
| H A D | js-generic-lowering.h | 8 #include "src/compiler/graph-reducer.h"
58 Graph* graph() const;
|
| /third_party/openssl/doc/life-cycles/ |
| H A D | Makefile | 18 # for the graph-easy program:
22 graph-easy --from=dot --as_ascii < $< > $@
|
| /third_party/ffmpeg/libavfilter/ |
| H A D | vf_zscale.c | 134 zimg_filter_graph *alpha_graph[MAX_THREADS], *graph[MAX_THREADS]; member
536 /* returns 0 if graph builder parameters are the same and 1 otherwise */
605 if (s->graph[job_nr]) { in graphs_build()
606 zimg_filter_graph_free(s->graph[job_nr]); in graphs_build()
608 s->graph[job_nr] = zimg_filter_graph_build(&src_format, &dst_format, &s->params); in graphs_build()
609 if (!s->graph[job_nr]) in graphs_build()
612 ret = zimg_filter_graph_get_tmp_size(s->graph[job_nr], &size); in graphs_build()
742 if (!s->graph[job_nr]) in filter_slice()
744 ret = zimg_filter_graph_process(s->graph[job_nr], &src_buf, &dst_buf, s->tmp[job_nr], 0, 0, 0, 0); in filter_slice()
933 if (s->graph[ in uninit()
[all...] |
| /third_party/node/deps/v8/tools/ |
| H A D | run-perf.sh | 57 --call-graph $CALL_GRAPH_METHOD \
|
| /third_party/vk-gl-cts/external/vulkan-docs/src/scripts/spec_tools/ |
| H A D | consistency_tools.py | 657 self.graph = nx.DiGraph()
684 return shortest_path(self.graph, source=source, target=target)
702 # Update graph
703 self.graph.add_node(type_name)
704 self.graph.add_edges_from((type_name, t)
|
| /third_party/skia/third_party/externals/tint/src/resolver/ |
| H A D | dependency_graph.cc | 119 /// @param graph the dependency graph to populate with resolved symbols
125 DependencyGraph& graph, in DependencyScanner()
130 graph_(graph), in DependencyScanner()
472 DependencyGraph& graph) in DependencyAnalysis()
473 : symbols_(symbols), diagnostics_(diagnostics), graph_(graph) {} in DependencyAnalysis()
482 // Traverse the named globals to build the dependency graph in Run()
488 // Dump the dependency graph if TINT_DUMP_DEPENDENCY_GRAPH is non-zero in Run()
764 /// The resulting dependency graph
122 DependencyScanner(const SymbolTable& syms, const GlobalMap& globals_by_name, diag::List& diagnostics, DependencyGraph& graph, DependencyEdges& edges) DependencyScanner() argument
|
| /third_party/node/deps/v8/src/heap/cppgc-js/ |
| H A D | cpp-snapshot.cc | 49 // consumers of the graph may merge a node and its wrapper node. in SetWrapperNode()
143 // dependencies on ancestors in the sub graph which ensures that there will be
383 // graph with hidden nodes that do not carry information. For that reason, the
386 // In this case the (hidden) objects are filtered from the graph. The trickiest
413 CppGraphBuilderImpl(CppHeap& cpp_heap, v8::EmbedderGraph& graph) in CppGraphBuilderImpl() argument
414 : cpp_heap_(cpp_heap), graph_(graph) {} in CppGraphBuilderImpl()
482 // pointing back to the object. Set up a wrapper node for the graph so in AddEdge()
589 // the object graph.
801 // In case the names are visible, the graph is not traversed in this phase. in VisitForVisibility()
861 // First pass: Figure out which objects should be included in the graph in Run()
904 Run(v8::Isolate* isolate, v8::EmbedderGraph* graph, void* data) Run() argument
[all...] |
| /third_party/ffmpeg/fftools/ |
| H A D | ffmpeg_hw.c | 574 for (i = 0; i < fg->graph->nb_filters; i++) { in hw_device_setup_for_filter()
575 fg->graph->filters[i]->hw_device_ctx = in hw_device_setup_for_filter()
577 if (!fg->graph->filters[i]->hw_device_ctx) in hw_device_setup_for_filter()
|
| H A D | ffmpeg.h | 245 struct FilterGraph *graph; member
269 struct FilterGraph *graph; member
294 AVFilterGraph *graph; member
|
| /third_party/node/src/ |
| H A D | heap_utils.cc | 213 JSGraph graph(env->isolate()); in BuildEmbedderGraph()
214 Environment::BuildEmbedderGraph(env->isolate(), &graph, env); in BuildEmbedderGraph()
216 if (graph.CreateObject().ToLocal(&ret)) in BuildEmbedderGraph()
|
| /third_party/node/deps/v8/src/maglev/ |
| H A D | maglev-graph-builder.h | 17 #include "src/maglev/maglev-graph-labeller.h"
18 #include "src/maglev/maglev-graph.h"
47 Graph* graph() const { return graph_; } in graph() function in v8::internal::maglev::MaglevGraphBuilder
171 graph()->last_block(), offset); in VisitSingleBytecode()
397 graph()->Add(block); in CreateBlock()
546 // Allow marking some bytecodes as unsupported during graph building, so that
|