| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| basic-block.h | 131 /* The edges into and out of the block. */
302 /* Number of edges in this flow graph. */
512 /* Number of edges in the compressed edge list. */
592 /* Iterator object for edges. */
701 vector of predecessor or successor edges. It must not be used when
884 /* Return true when one of the predecessor edges of BB is marked with EDGE_EH. */
899 /* Return true when one of the predecessor edges of BB is marked with EDGE_ABNORMAL. */
914 /* Return the fallthru edge in EDGES if it exists, NULL otherwise. */
916 find_fallthru_edge (VEC(edge,gc) *edges)
921 FOR_EACH_EDGE (e, ei, edges)
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| basic-block.h | 131 /* The edges into and out of the block. */
302 /* Number of edges in this flow graph. */
512 /* Number of edges in the compressed edge list. */
592 /* Iterator object for edges. */
701 vector of predecessor or successor edges. It must not be used when
884 /* Return true when one of the predecessor edges of BB is marked with EDGE_EH. */
899 /* Return true when one of the predecessor edges of BB is marked with EDGE_ABNORMAL. */
914 /* Return the fallthru edge in EDGES if it exists, NULL otherwise. */
916 find_fallthru_edge (VEC(edge,gc) *edges)
921 FOR_EACH_EDGE (e, ei, edges)
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| basic-block.h | 131 /* The edges into and out of the block. */
302 /* Number of edges in this flow graph. */
512 /* Number of edges in the compressed edge list. */
592 /* Iterator object for edges. */
701 vector of predecessor or successor edges. It must not be used when
884 /* Return true when one of the predecessor edges of BB is marked with EDGE_EH. */
899 /* Return true when one of the predecessor edges of BB is marked with EDGE_ABNORMAL. */
914 /* Return the fallthru edge in EDGES if it exists, NULL otherwise. */
916 find_fallthru_edge (VEC(edge,gc) *edges)
921 FOR_EACH_EDGE (e, ei, edges)
[all...] |
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3collections.h | 409 * A vector of vectors of edges, built by calling the addEdge method()
414 pANTLR3_BITSET * edges; member in struct:ANTLR3_TOPO_struct
425 * as a stack and each time we descend a node to one of its edges we
435 * A flag that indicates the algorithm found a cycle in the edges
452 * One more than the largest node index that is contained in edges/sorted.
465 * while building these edges, it is perfectly OK to add nodes out of
466 * sequence. So, if you have edges:
|
| /external/llvm/lib/Transforms/Utils/ |
| LowerInvoke.cpp | 30 // control flow edges are not correct anymore) so only very simple things should
57 STATISTIC(NumSpilled, "Number of registers live across unwind edges");
266 // live across unwind edges. Each value that is live across an unwind edge
268 // across the unwind edge. This process also splits all critical edges
272 // First step, split all critical edges from invoke instructions.
422 // live across unwind edges. Each value that is live across an unwind edge
424 // across the unwind edge. This process also splits all critical edges
|
| /external/opencv/cvaux/src/ |
| cvlcm.cpp | 174 // Purpose: Function seeks all non-boundary edges incident to
180 // LinkedEdges : out, matrix of incident edges
183 // for this pSite, this property hold out far all edges)
184 // Returns: number of incident edges (must be less than 10)
329 LCMEdgeSeq = (CvSeq*)(*Graph)->edges;
542 counter < pLCM->VoronoiDiagram->edges->total;
598 cvSetAdd( (CvSet*)(pLCM->Graph->edges), 0, (CvSetElem**)&pLCMEdge );
|
| /external/llvm/lib/CodeGen/ |
| MachineBasicBlock.cpp | 344 // A block with no successors has no concerns with fall-through edges.
371 // fall-through edges to be concerned with.
611 // jumps to the same MBB is either case. We have duplicate CFG edges in that
613 // code, just skip those edges.
828 /// CorrectExtraCFGEdges - Various pieces of code can cause excess edges in the
833 /// Besides DestA and DestB, retain other edges leading to LandingPads
868 "CFG in a bad state. Cannot correct CFG edges");
871 // Remove superfluous edges. I.e., those which aren't destinations of this
872 // basic block, duplicate edges, or landing pads.
[all...] |
| /external/webkit/Source/WebCore/inspector/front-end/ |
| HeapSnapshot.js | 48 WebInspector.HeapSnapshotEdge = function(snapshot, edges, edgeIndex)
51 this._edges = edges;
359 get edges()
623 for (var edgesIter = node.edges; edgesIter.hasNext(); edgesIter.next()) {
642 for (var edgesIter = node.edges; edgesIter.hasNext(); edgesIter.next()) {
743 // Mark hidden edges of global objects as invisible.
746 for (var iter = this.rootNode.edges; iter.hasNext(); iter.next()) {
752 for (var innerIter = node.edges; innerIter.hasNext(); innerIter.next()) {
1029 for (var iter = this._snapshot.rootNode.edges; iter.hasNext(); iter.next()) {
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| CorrelatedValuePropagation.cpp | 142 /// incoming edges, then it's true universally and we can simplify the compare.
219 // If this was the first edge to be visited, record that all other edges
226 // If this case is known to fire for some edges and known not to fire for
|
| /external/llvm/lib/VMCore/ |
| Dominators.cpp | 199 // their operands on edges; simulate this by thinking of the use
215 // Invoke instructions define their return values on the edges
260 // PHI nodes use their operands on their incoming edges.
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp2/ |
| CSharp2.stg | [all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp3/ |
| CSharp3.stg | [all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Delphi/ |
| Delphi.stg | [all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ObjC/ |
| ObjC.stg | [all...] |
| /external/chromium/chrome/browser/history/ |
| visit_tracker.cc | 57 // edges in our visit graph.
|
| /external/chromium/chrome/browser/ui/cocoa/ |
| bubble_view.mm | 12 // The roundedness of the edges of our bubble.
|
| /external/chromium/chrome/browser/ui/cocoa/tabs/ |
| tab_controller.h | 55 CGFloat iconTitleXOffset_; // between left edges of icon and title
|
| /external/chromium/chrome/browser/ui/views/ |
| detachable_toolbar_view.h | 47 // the edges should be.
|
| /external/chromium/chrome/browser/ui/views/frame/ |
| app_panel_browser_frame_view.h | 68 // Returns the thickness of the border that makes up the window frame edges.
|
| /external/clang/include/clang/Analysis/Analyses/ |
| PostOrderCFGView.h | 53 // occasionally hand out null pointers for pruned edges, so we catch those
|
| /external/freetype/src/autofit/ |
| aflatin.h | 103 FT_Pos edge_distance_threshold; /* used for creating edges */
|
| /external/jmonkeyengine/engine/src/core/com/jme3/shadow/ |
| PssmShadowRenderer.java | 214 * Sets the filtering mode for shadow edges see {@link FilterMode} for more info
520 * returns the edges thickness <br>
529 * Sets the shadow edges thickness. default is 1, setting it to lower values can help to reduce the jagged effect of the shadow edges
|
| /external/llvm/docs/HistoricalNotes/ |
| 2001-09-18-OptimizeExceptions.txt | 17 3. Extra extraneous exception edges reduce the opportunity for code
|
| 2002-06-25-MegaPatchInfo.txt | 49 edges:
|
| /external/llvm/include/llvm/ADT/ |
| DAGDeltaAlgorithm.h | 52 /// Dependencies edges by executing \see ExecuteOneTest() on subsets of
|
