/external/chromium_org/v8/test/mjsunit/regress/ |
regress-crbug-178790.js | 29 // traversing the entire graph would be prohibitively expensive.
|
regress-crbug-323942.js | 50 // Lookup of o.f during graph creation fails.
|
regress-embedded-cons-string.js | 44 // Tenure cons string after compile graph has been created.
|
/external/chromium_org/v8/test/webkit/ |
dfg-cfg-simplify-phantom-get-local-on-same-block-set-local.js | 50 // Trick to delay control flow graph simplification until after the flush of x above gets turned into a phantom.
|
/external/v8/src/ |
hydrogen.h | 56 explicit HBasicBlock(HGraph* graph); 62 HGraph* graph() const { return graph_; } function in class:v8::internal::HBasicBlock 809 HGraph* graph() const { return graph_; } function in class:v8::internal::HGraphBuilder 923 // Create a back edge in the flow graph. body_exit is the predecessor [all...] |
/external/v8/src/ia32/ |
lithium-codegen-ia32.h | 150 HGraph* graph() const { return chunk_->graph(); } function in class:v8::internal::BASE_EMBEDDED
|
/external/v8/src/x64/ |
lithium-codegen-x64.h | 141 HGraph* graph() const { return chunk_->graph(); } function in class:v8::internal::BASE_EMBEDDED
|
/frameworks/base/tests/Camera2Tests/SmartCamera/SimpleCamera/src/androidx/media/filterfw/ |
Filter.java | 82 * be unique within the filter graph. 222 * Called when an input port has been attached in the graph. 234 * Called when an output port has been attached in the graph. 325 * It is called when the filter graph that the filter belongs to is disposed. 437 * Use this method when your filter requires to perform operations while the graph is not 645 final void insertIntoFilterGraph(FilterGraph graph) { 646 mFilterGraph = graph;
|
/external/opencv/cxcore/src/ |
cxpersistence.cpp | 4494 const CvGraph* graph = (const CvGraph*)struct_ptr; local 4638 CvGraph* graph; local [all...] |
/external/chromium_org/v8/src/ |
hydrogen.h | 59 explicit HBasicBlock(HGraph* graph); 65 HGraph* graph() const { return graph_; } function in class:v8::internal::V8_FINAL 1013 HGraph* graph() const { return graph_; } function in class:v8::internal::HGraphBuilder 1644 HGraph* graph() { return builder_->graph(); } function in class:v8::internal::HGraphBuilder::V8_FINAL 2527 HGraph* graph() const { return graph_; } function in class:v8::internal::HPhase [all...] |
hydrogen-instructions.cc | 585 id_ = block->graph()->GetNextValueID(this); 825 // Verify that all uses are in the graph. 880 Zone* zone = block()->graph()->zone(); 881 HValue* context = block()->graph()->GetInvalidContext(); 4119 HGraph* graph = block()->graph(); local [all...] |
lithium.h | 738 static LChunk* NewChunk(HGraph* graph); 749 HGraph* graph() const { return graph_; } function in class:v8::internal::LChunk 780 LChunk(CompilationInfo* info, HGraph* graph);
|
/external/chromium_org/third_party/WebKit/Source/devtools/scripts/closure/ |
compiler.jar | |
/external/bison/tests/ |
testsuite | 660 68;output.at:101;Output files: -o foo.c++ --graph=foo.gph ;; 665 73;output.at:158;Conflicting output files: --graph=\"foo.tab.c\";; 667 75;output.at:168;Conflicting output files: %skeleton \"lalr1.cc\" %defines --graph=\"location.hh\";; 678 86;output.at:260;Graph with no conflicts;graph; 679 87;output.at:294;Graph with unsolved S/R;graph; 680 88;output.at:358;Graph with solved S/R;graph; 681 89;output.at:417;Graph with R/R;graph [all...] |
/external/chromium_org/v8/tools/ |
profile.js | 270 * Performs a BF traversal of the top down call graph. 280 * Performs a BF traversal of the bottom up call graph. 522 * Constructs a call graph. 613 * Computes total weights in the call graph. 625 * Traverses the call graph in preorder. This function can be used for 655 * Performs an indepth call graph traversal. 673 * Constructs a call graph node.
|
/external/sonivox/jet_tools/JetCreator/ |
JetCreator.py | 93 self.graph.ClickCallbackFct = self.GraphTriggerClip
199 self.graph = SegmentGraph(rightPanel, size=(-1, 50))
208 vboxRight.Add(self.graph, 1, wx.EXPAND)
223 graphBox = wx.StaticBox(pnlGraph, wx.ID_ANY, label='Graph')
248 self.graph.SetHelpText(GetJetHelpText(JetDefs.AUDITION_CTRLS, JetDefs.AUDITION_GRAPH))
318 self.graph.ClearGraph()
398 info = self.graph.LoadSegment(self.jet_file.GetSegment(self.currentSegmentName), showLabels=IniGetValue(self.currentJetConfigFile, JetDefs.F_GRAPHLABELS, JetDefs.F_GRAPHLABELS, 'bool', 'True'), showClips=IniGetValue(self.currentJetConfigFile, JetDefs.F_GRAPHCLIPS, JetDefs.F_GRAPHCLIPS, 'bool', 'True'), showAppEvts=IniGetValue(self.currentJetConfigFile, JetDefs.F_GRAPHAPPEVTS, JetDefs.F_GRAPHAPPEVTS, 'bool', 'True'))
552 self.graph.ClearGraph()
[all...] |
/external/v8/tools/ |
profile.js | 270 * Performs a BF traversal of the top down call graph. 280 * Performs a BF traversal of the bottom up call graph. 522 * Constructs a call graph. 613 * Computes total weights in the call graph. 625 * Traverses the call graph in preorder. This function can be used for 655 * Performs an indepth call graph traversal. 673 * Constructs a call graph node.
|
/external/svox/pico/lib/ |
picosa.c | 83 WORDGRAPH(POSes,NA)graph -> WORDGRAPH(POS,NA)graph \n 90 WORDGRAPH(POS,NA)graph -> WORDPHON(POS,NA)phon \n 831 const picoos_uint8 *graph, [all...] |
/cts/suite/cts/deviceTests/browserbench/assets/octane/ |
deltablue.js | 171 * graph. Answer the constraint that this constraint overrides, if 225 * Adds this constraint to the constraint graph 382 * Add this constraint to the constraint graph 468 * Adds this constraint to the constraint graph. 536 * structure of the constraint graph, the current dataflow graph, and 579 * incrementally update the dataflow graph. Details: If satifying 589 * constraint graph has an inadvertent cycle. 600 * constraint and incrementally update the dataflow graph.
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/ |
v8-deltablue.js | 162 * graph. Answer the constraint that this constraint overrides, if 216 * Adds this constraint to the constraint graph 373 * Add this constraint to the constraint graph 459 * Adds this constraint to the constraint graph. 527 * structure of the constraint graph, the current dataflow graph, and 570 * incrementally update the dataflow graph. Details: If satifying 580 * constraint graph has an inadvertent cycle. 591 * constraint and incrementally update the dataflow graph.
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/ |
v8-deltablue.js | 162 * graph. Answer the constraint that this constraint overrides, if 216 * Adds this constraint to the constraint graph 373 * Add this constraint to the constraint graph 459 * Adds this constraint to the constraint graph. 527 * structure of the constraint graph, the current dataflow graph, and 570 * incrementally update the dataflow graph. Details: If satifying 580 * constraint graph has an inadvertent cycle. 591 * constraint and incrementally update the dataflow graph.
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v6/ |
v8-deltablue.js | 162 * graph. Answer the constraint that this constraint overrides, if 216 * Adds this constraint to the constraint graph 373 * Add this constraint to the constraint graph 459 * Adds this constraint to the constraint graph. 527 * structure of the constraint graph, the current dataflow graph, and 570 * incrementally update the dataflow graph. Details: If satifying 580 * constraint graph has an inadvertent cycle. 591 * constraint and incrementally update the dataflow graph.
|
/external/chromium_org/tools/deep_memory_profiler/visualizer/static/ |
menu-view.js | 14 // Update graph view and menu view when profiler model changed.
|
/external/chromium_org/tools/gyp/pylib/gyp/ |
common.py | 483 def TopologicallySorted(graph, get_edges): 487 graph: A list of node names. 491 A list containing all of the node in graph in topological order. 497 graph = {'a': '$(b) $(c)', 'b': 'hi', 'c': '$(b)'} 499 return re.findall(r'\$\(([^))]\)', graph[node]) 500 print TopologicallySorted(graph.keys(), GetEdges) 519 for node in sorted(graph):
|
/external/chromium_org/v8/benchmarks/ |
deltablue.js | 168 * graph. Answer the constraint that this constraint overrides, if 222 * Adds this constraint to the constraint graph 379 * Add this constraint to the constraint graph 465 * Adds this constraint to the constraint graph. 533 * structure of the constraint graph, the current dataflow graph, and 576 * incrementally update the dataflow graph. Details: If satifying 586 * constraint graph has an inadvertent cycle. 597 * constraint and incrementally update the dataflow graph.
|