| /external/chromium_org/tools/clang/blink_gc_plugin/ |
| process-graph.py | 10 "Process the Blink points-to graph generated by the Blink GC plugin.")
14 help='Read JSON graph files from stdin')
37 '--pickle-graph', default=None, metavar='FILE',
38 help='File to read/save the graph from/to')
42 help='JSON graph files or directories containing them')
48 graph = {} variable
76 return graph.setdefault(name, Node(name))
82 node = graph.get(dst)
90 # Representation of graph nodes. Basically a map of directed edges.
124 # Representation of directed graph edges
[all...] |
| /external/chromium_org/tools/deep_memory_profiler/visualizer/static/ |
| graph-view.js | 6 * This is a view class showing flot graph.
12 this.placeholder_ = '#graph-div';
13 // Update graph view and menu view when profiler model changed.
101 * Update graph view when model updated.
110 var $graph = $(this.placeholder_);
111 this.graph_ = $.plot($graph, data, {
125 // checked y range by accumulated y values because this is a stack graph.
126 $graph.bind('plotclick', function(event, pos, item) {
127 // Get newest lines data from graph.
|
| graph-view_unittest.js | 24 test('graph-view:generateLines_', function() {
35 inspect(lines, 'lines generated by graph view:\n');
|
| /external/chromium_org/ppapi/proxy/ |
| raw_var_data.h | 33 // Contains the data associated with a graph of connected PP_Vars. Useful for
34 // serializing/deserializing a graph of PP_Vars. First we compute the transitive
38 // idx | size | (number of vars in the graph)
60 // Construct a new PP_Var from the graph. All of the PP_Vars referenced by
62 // ref-count equal to the number of references it has in the graph of vars.
66 // Write the graph to a message using the given HandleWriter.
83 // A list of the nodes in the graph.
106 // along with the graph it is a part of to be initialized.
108 const std::vector<PP_Var>& graph) = 0;
139 const std::vector<PP_Var>& graph) OVERRIDE
[all...] |
| /external/chromium_org/v8/src/ |
| hydrogen-range-analysis.cc | 36 HBasicBlock* block(graph()->entry_block());
37 ZoneList<Pending> stack(graph()->blocks()->length(), zone());
111 for (int i = 0; i < graph()->blocks()->length(); ++i) {
112 HBasicBlock* block = graph()->blocks()->at(i);
153 new_range = range->Copy(graph()->zone());
155 new_range = range->CopyClearLower(graph()->zone());
160 new_range = range->CopyClearUpper(graph()->zone());
175 value->ComputeInitialRange(graph()->zone());
197 value->AddNewRange(range, graph()->zone());
|
| hydrogen-environment-liveness.h | 25 explicit HEnvironmentLivenessAnalysisPhase(HGraph* graph);
41 // Largest number of local variables in any environment in the graph
51 // It is populated during the first pass over the graph, controlled by
|
| hydrogen-mark-unreachable.cc | 12 // If there is unreachable code in the graph, propagate the unreachable marks
15 const ZoneList<HBasicBlock*>* blocks = graph()->blocks();
|
| /art/compiler/optimizing/ |
| pretty_printer_test.cc | 35 HGraph* graph = builder.BuildGraph(*item); local
36 ASSERT_NE(graph, nullptr);
37 StringPrettyPrinter printer(graph);
|
| code_generator_arm.h | 86 explicit LocationsBuilderARM(HGraph* graph, CodeGeneratorARM* codegen)
87 : HGraphVisitor(graph), codegen_(codegen) {}
105 InstructionCodeGeneratorARM(HGraph* graph, CodeGeneratorARM* codegen);
126 explicit CodeGeneratorARM(HGraph* graph);
|
| code_generator_x86.h | 87 LocationsBuilderX86(HGraph* graph, CodeGeneratorX86* codegen)
88 : HGraphVisitor(graph), codegen_(codegen) {}
106 InstructionCodeGeneratorX86(HGraph* graph, CodeGeneratorX86* codegen);
128 explicit CodeGeneratorX86(HGraph* graph);
|
| code_generator_x86_64.h | 84 LocationsBuilderX86_64(HGraph* graph, CodeGeneratorX86_64* codegen)
85 : HGraphVisitor(graph), codegen_(codegen) {}
103 InstructionCodeGeneratorX86_64(HGraph* graph, CodeGeneratorX86_64* codegen);
125 explicit CodeGeneratorX86_64(HGraph* graph);
|
| /external/chromium_org/third_party/angle/src/compiler/translator/depgraph/ |
| DependencyGraphBuilder.h | 13 // Creates a dependency graph of symbols, function calls, conditions etc. by
19 static void build(TIntermNode *node, TDependencyGraph *graph);
35 // This data structure is stack of sets. Each set contains dependency graph
174 TDependencyGraphBuilder(TDependencyGraph *graph)
178 mGraph(graph) {}
|
| /external/llvm/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 33 typedef PBQP::RegAlloc::Graph PBQPRAGraph;
44 PBQPRAGraph& getGraph() { return graph; }
46 const PBQPRAGraph& getGraph() const { return graph; }
99 PBQPRAGraph graph; member in class:llvm::PBQPRAProblem
|
| /external/chromium_org/v8/src/compiler/ |
| js-typed-lowering.cc | 6 #include "src/compiler/graph-inl.h"
25 // TODO(turbofan): replace the effect input to {node} with {graph->start()}.
72 node_->ReplaceInput(1, graph()->NewNode(machine()->Word32And(), rnum,
103 Node* value = graph()->NewNode(simplified()->BooleanNot(), node_);
135 Graph* graph() { return lowering_->graph(); } function in class:v8::internal::compiler::JSBinopReduction
150 Node* n = graph()->NewNode(javascript()->ToString(), node, context(),
160 Node* n = graph()->NewNode(javascript()->ToNumber(), node, context(),
214 Node* n = graph()->NewNode(op, node)
[all...] |
| simplified-operator-reducer.h | 8 #include "src/compiler/graph-reducer.h"
39 Graph* graph() const;
|
| /external/fio/ |
| gfio.h | 10 #include "graph.h"
43 struct graph *iops_graph;
47 struct graph *bandwidth_graph;
128 struct graph *clat_graph;
129 struct graph *lat_bucket_graph;
|
| /external/libcxx/test/localization/locale.categories/category.ctype/locale.ctype.byname/ |
| is_1.pass.cpp | 60 assert(f.is(F::graph, L'.'));
61 assert(!f.is(F::graph, L'\x07'));
103 assert(f.is(F::graph, L'.'));
104 assert(!f.is(F::graph, L'\x07'));
|
| /frameworks/base/media/mca/filterfw/java/android/filterfw/core/ |
| SyncRunner.java | 45 public SyncRunner(FilterContext context, FilterGraph graph, Class schedulerClass) {
56 mScheduler = (Scheduler)schedulerConstructor.newInstance(graph);
72 // Associate this runner and the graph with the context
74 mFilterContext.addGraph(graph);
80 // Setup graph filters
81 graph.setupFilters();
92 throw new RuntimeException("Trying to process graph that is not open!");
104 if (mLogVerbose) Log.v(TAG, "Closing graph.");
150 throw new RuntimeException("SyncRunner does not support stopping a graph!");
224 throw new RuntimeException("Calling step on scheduler with no graph in place!")
[all...] |
| /frameworks/compile/mclinker/include/mcld/ADT/GraphLite/ |
| Digraph.h | 16 namespace graph { namespace in namespace:mcld
78 } // namespace of graph
|
| ListDigraph.h | 14 namespace graph { namespace in namespace:mcld
17 * \brief ListDigraph provides an linked-list inplementation of a graph.
20 * graph theory.
85 } // namespace of graph
|
| /frameworks/compile/mclinker/lib/ADT/GraphLite/ |
| Digraph.cpp | 11 using namespace mcld::graph;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/localization/locale.categories/category.ctype/locale.ctype.byname/ |
| is_1.pass.cpp | 60 assert(f.is(F::graph, L'.'));
61 assert(!f.is(F::graph, L'\x07'));
103 assert(f.is(F::graph, L'.'));
104 assert(!f.is(F::graph, L'\x07'));
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/libs/armeabi/include/bits/ |
| ctype_base.h | 67 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/libs/armeabi-v7a/include/bits/ |
| ctype_base.h | 67 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/libs/mips/include/bits/ |
| ctype_base.h | 67 static const mask graph = _P | _U | _L | _N; member in struct:ctype_base
|
