| /external/llvm/examples/OCaml-Kaleidoscope/Chapter4/ |
| toy.ml | 41 (* Simplify the control flow graph (deleting unreachable blocks, etc). *)
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter5/ |
| toy.ml | 41 (* Simplify the control flow graph (deleting unreachable blocks, etc). *)
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter6/ |
| toy.ml | 41 (* Simplify the control flow graph (deleting unreachable blocks, etc). *)
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter7/ |
| toy.ml | 45 (* Simplify the control flow graph (deleting unreachable blocks, etc). *)
|
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.h | 31 #define ITER_NODE(x) reinterpret_cast<Graph::Node *>((x).get())
32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
34 // A connected graph.
35 class Graph
72 friend class Graph;
79 EdgeIterator(Graph::Edge *first, int dir, bool reverse)
87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
99 Graph::Edge *e;
100 Graph::Edge *t;
129 Graph *getGraph() const { return graph;
136 Graph *graph; member in class:nv50_ir::Graph::Node
[all...] |
| /external/svox/pico/lib/ |
| picokdt.h | 167 /* graph attributes: values to be used if the graph attribute is
173 /* graph attributes (special case for g2p): values to be used if the
174 graph attribute is directly outside the grapheme string (ie. at the
205 graph: the grapheme string of the word for wich POS will be predicted
206 graphlen: length of graph in number of bytes
212 const picoos_uint8 *graph,
285 graph: the grapheme string used to determine invec[0:8]
286 graphlen: length of graph in number of bytes
289 nrvow number of vowel-like graphemes in graph if vowel
[all...] |
| /frameworks/base/media/mca/filterfw/java/android/filterfw/core/ |
| AsyncRunner.java | 66 if (mLogVerbose) Log.v(TAG, "Starting background graph processing.");
69 if (mLogVerbose) Log.v(TAG, "Preparing filter graph for processing.");
72 if (mLogVerbose) Log.v(TAG, "Running graph.");
103 if (mLogVerbose) Log.v(TAG, "Done with background graph processing.");
132 if (mLogVerbose) Log.v(TAG, "Calling graph done callback.");
142 /** Create a new asynchronous graph runner with the given filter
154 /** Create a new asynchronous graph runner with the given filter
167 * completes running a graph, whether the completion is due to a stop() call
175 /** Sets the graph to be run. Will call prepare() on graph. Cannot be calle
[all...] |
| /external/chromium_org/cc/layers/ |
| heads_up_display_layer_impl.h | 51 class Graph {
53 Graph(double indicator_value, double start_upper_bound);
56 // graph, so that the graph always scales to either it's max or
95 const Graph& graph) const;
117 Graph fps_graph_;
118 Graph paint_time_graph_;
|
| /external/chromium_org/cc/resources/ |
| worker_pool.h | 98 // A worker thread pool that runs tasks provided by task graph and
112 // A task graph contains a unique set of tasks with edges between
122 // Schedule running of tasks in |graph|. Any previously scheduled tasks
125 void SetTaskGraph(TaskGraph* graph);
|
| pixel_buffer_raster_worker_pool.cc | 438 TaskGraph graph; local
494 &graph));
519 &graph));
541 &graph);
561 &graph);
569 SetTaskGraph(&graph);
|
| /external/chromium_org/cc/trees/ |
| layer_sorter.h | 108 void RemoveEdgeFromList(GraphEdge* graph, std::vector<GraphEdge*>* list);
|
| /external/chromium_org/third_party/angle/src/compiler/ |
| ShHandle.h | 109 bool enforceFragmentShaderTimingRestrictions(const TDependencyGraph& graph);
|
| /external/chromium_org/v8/src/ |
| hydrogen-minus-zero.cc | 34 const ZoneList<HBasicBlock*>* blocks(graph()->blocks());
|
| hydrogen-redundant-phi.cc | 35 const ZoneList<HBasicBlock*>* blocks(graph()->blocks());
|
| hydrogen.cc | 82 HBasicBlock::HBasicBlock(HGraph* graph)
83 : block_id_(graph->GetNextBlockID()),
84 graph_(graph),
85 phis_(4, graph->zone()),
90 predecessors_(2, graph->zone()),
92 dominated_blocks_(4, graph->zone()),
97 deleted_phis_(4, graph->zone()),
161 !graph()->info()->IsOptimizing());
170 if (graph()->IsInsideNoSideEffectsScope()) {
274 graph()->update_maximum_environment_size(env->first_expression_index())
[all...] |
| hydrogen-bce.cc | 174 new_check->block()->graph()->isolate()->counters()->
317 zone()->NewArray<HBoundsCheckEliminationState>(graph()->blocks()->length());
373 bb->graph()->isolate()->counters()->
378 } else if (graph()->use_optimistic_licm() ||
|
| hydrogen-load-elimination.cc | 493 engine(graph(), zone());
500 engine.AnalyzeDominatedBlocks(graph()->blocks()->at(0), table);
503 for (int i = 0; i < graph()->blocks()->length(); i++) {
505 engine.AnalyzeOneBlock(graph()->blocks()->at(i), table);
|
| /external/dropbear/libtommath/ |
| dep.pl | 91 #now let's make a cool call graph...
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| pycodegen.py | 187 define an __init__() that defines self.graph and then calls the
216 self.graph.setFlag(CO_FUTURE_DIVISION)
219 self.graph.setFlag(CO_FUTURE_ABSIMPORT)
221 self.graph.setFlag(CO_FUTURE_WITH_STATEMENT)
223 self.graph.setFlag(CO_FUTURE_PRINT_FUNCTION)
231 assert hasattr(self, 'graph')
240 self.emit = self.graph.emit
241 self.newBlock = self.graph.newBlock
242 self.startBlock = self.graph.startBlock
243 self.nextBlock = self.graph.nextBloc
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| pycodegen.py | 187 define an __init__() that defines self.graph and then calls the
216 self.graph.setFlag(CO_FUTURE_DIVISION)
219 self.graph.setFlag(CO_FUTURE_ABSIMPORT)
221 self.graph.setFlag(CO_FUTURE_WITH_STATEMENT)
223 self.graph.setFlag(CO_FUTURE_PRINT_FUNCTION)
231 assert hasattr(self, 'graph')
240 self.emit = self.graph.emit
241 self.newBlock = self.graph.newBlock
242 self.startBlock = self.graph.startBlock
243 self.nextBlock = self.graph.nextBloc
[all...] |
| /external/chromium_org/sandbox/linux/seccomp-bpf/ |
| codegen_unittest.cc | 137 // This also gives us a diamond-shaped pattern in our graph, which stresses
285 // The shape of our graph and thus the function of our program should
287 // serializing the graph and verifying that it is still the same.
290 std::string graph[2]; local
294 // our graph.
306 graph[i].append(reinterpret_cast<char *>(&(*iter)->code),
310 graph[i].append(reinterpret_cast<char *>(&(*iter)->k),
319 // Depth-first traversal of the graph. We only ever need to look at the
350 SANDBOX_ASSERT(graph[0] == graph[1])
[all...] |
| /ndk/build/core/ |
| definitions-graph.mk | 15 # Definitions of various graph-related generic functions, used by
117 # specific graph nodes. The following helper functions help implement
145 # Many graph walking operations require a work queue and computing
150 # _ndk_mod_module current graph node name.
153 # _ndk_mod_depends current graph node's children.
199 # in the graph. A node is visited once it has been put into the work
267 # in each graph node. The following helper functions implement this and
309 # node B if A depends on B. Assumes that the graph is a DAG (if there are
330 # $1: list of nodes, must be a graph closure.
437 # Return breadth-first walk of a graph, starting from an arbitrar
[all...] |
| /external/chromium_org/webkit/data/test_shell/sort/ |
| sort.js | 254 var graph = document.getElementById(this.name);
255 if (graph == undefined) {
260 var height_multiple = (graph.clientHeight-20) / len;
261 var width = Math.max(1,Math.floor((graph.clientWidth-10) / len));
267 var left_offset = Math.round((graph.clientWidth - (width*len))/2);
274 graph.innerHTML = text;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/localization/locale.categories/category.ctype/facet.ctype.special/facet.ctype.char.members/ |
| scan_is.pass.cpp | 42 assert(f.scan_is(F::graph, in.data(), in.data() + in.size()) - in.data() == 1);
|
| scan_not.pass.cpp | 42 assert(f.scan_not(F::graph, in.data(), in.data() + in.size()) - in.data() == 0);
|
