/external/webkit/Source/JavaScriptCore/dfg/ |
DFGJITCompiler.cpp | 45 Node& node = graph()[nodeIndex]; 68 Node& node = graph()[nodeIndex]; 86 Node& node = graph()[nodeIndex]; 137 VirtualRegister virtualRegister = graph()[nodeIndex].virtualRegister; 151 VirtualRegister virtualRegister = graph()[nodeIndex].virtualRegister; 270 // to allow it to check which nodes in the graph may bail out, and may need to reenter the
|
DFGNonSpeculativeJIT.h | 131 Node& node = m_jit.graph()[nodeIndex]; 159 Node& node = m_jit.graph()[nodeIndex];
|
DFGNonSpeculativeJIT.cpp | 142 GenerationInfo& info = m_generationInfo[m_jit.graph()[nodeIndex].virtualRegister]; 158 GenerationInfo& info = m_generationInfo[m_jit.graph()[nodeIndex].virtualRegister]; 253 // Shifts by zero should have been optimized out of the graph! 594 BlockIndex taken = m_jit.graph().blockIndexForBytecodeOffset(node.takenBytecodeOffset()); 609 BlockIndex taken = m_jit.graph().blockIndexForBytecodeOffset(node.takenBytecodeOffset()); 610 BlockIndex notTaken = m_jit.graph().blockIndexForBytecodeOffset(node.notTakenBytecodeOffset()); 663 Node& node = m_jit.graph()[m_compileIndex]; 681 Vector<BasicBlock> blocks = m_jit.graph().m_blocks;
|
DFGSpeculativeJIT.cpp | 36 Node& node = m_jit.graph()[nodeIndex]; 183 Node& node = m_jit.graph()[nodeIndex]; 642 BlockIndex taken = m_jit.graph().blockIndexForBytecodeOffset(node.takenBytecodeOffset()); 653 BlockIndex taken = m_jit.graph().blockIndexForBytecodeOffset(node.takenBytecodeOffset()); 654 BlockIndex notTaken = m_jit.graph().blockIndexForBytecodeOffset(node.notTakenBytecodeOffset()); 794 Node& node = m_jit.graph()[m_compileIndex]; 813 Vector<BasicBlock> blocks = m_jit.graph().m_blocks;
|
/external/webkit/Source/WebCore/inspector/front-end/ |
inspector.css | [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 333 # $1: list of nodes, must be a graph closure. 422 # Return breadth-first walk of a graph, starting from an arbitrar [all...] |
/ndk/sources/cxx-stl/llvm-libc++/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);
|
/ndk/sources/cxx-stl/llvm-libc++/test/localization/locale.categories/category.ctype/locale.ctype/locale.ctype.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);
|
/prebuilts/tools/common/netbeans-visual/ |
org-netbeans-api-visual.jar | |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/src/org/eclipse/test/performance/ui/ |
FingerPrint.java | 182 // Create, paint and print the time bars graph 183 FingerPrintGraph graph = new FingerPrintGraph(this.outputDir, fileName, GRAPH_WIDTH, allResults); local 184 graph.paint(this.stream); 190 * Save the computed bar graph.
|
/external/sonivox/jet_tools/JetCreator/ |
JetAudition.py | 146 self.graph = SegmentGraph(panel, size=(-1, 50))
147 self.graph.ClickCallbackFct = self.GraphTriggerClip
152 vboxBot.Add(self.graph, 1, wx.EXPAND)
177 self.graph.SetHelpText(GetJetHelpText(JetDefs.AUDITION_CTRLS, JetDefs.AUDITION_GRAPH))
447 self.graph.UpdateLocation(evt.data)
451 info = self.graph.LoadSegment(segment)
472 self.graph.ClearGraph()
473 self.graph.UpdateLocation(0)
|
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/test/mjsunit/regress/ |
regress-3230771.js | 29 // VisitForStatement in hydrogen graph building.
|
/ndk/sources/cxx-stl/llvm-libc++/test/localization/locale.categories/category.ctype/locale.ctype.byname/ |
scan_is.pass.cpp | 45 assert(f.scan_is(F::graph, in.data(), in.data() + in.size()) - in.data() == 0); 66 assert(f.scan_is(F::graph, in.data(), in.data() + in.size()) - in.data() == 2);
|
scan_not.pass.cpp | 45 assert(f.scan_not(F::graph, in.data(), in.data() + in.size()) - in.data() == 1); 66 assert(f.scan_not(F::graph, in.data(), in.data() + in.size()) - in.data() == 0);
|
/external/svox/pico/lib/ |
picowa.c | 194 const picoos_uint8 *graph, 202 /* check existence of special char (e.g. hyphen) in graph: 210 if (graph[i++] == '-') { 216 if (!picokdt_dtPosPconstructInVec(wa->dtposp, graph, graphlen, specchar)) { 269 do POS prediction: -> WORDGRAPH(POSes,NA)graph 275 no phone, one entry -> WORDGRAPH(POS,NA)graph 291 /* no lex entry found, WORDGRAPH(POS,NA)graph */ 339 } else { /* no phone, :G2P, one entry: WORDGRAPH(POS,NA)graph */
|
picoktab.h | 83 /* graph access routine: if the desired graph 'utf8graph' exists in 84 the graph table a graph offset > 0 is returned, which then can be 90 /* check if UTF8 char 'graph' has property vowellike, return non-zero 93 const picoos_uint8 *graph, 96 /* graph properties access routines: if graph with offset 'graphsOffset' has the
|
/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
|
/external/opencv/cxcore/src/ |
cxpersistence.cpp | 4494 const CvGraph* graph = (const CvGraph*)struct_ptr; local 4638 CvGraph* graph; local [all...] |
/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/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.
|