/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
H A D | DOTGenerator.java | 131 // make a DOT edge for each transition 133 Transition edge = (Transition) s.transition(i); 136 " edge from s"+s.stateNumber+" ["+i+"] of "+s.getNumberOfTransitions()); 139 if ( edge.target instanceof DFAState && 140 ((DFAState)edge.target).getAcceptStateReachable()!=DFA.REACHABLE_YES ) 145 st = stlib.getInstanceOf("edge"); 146 st.add("label", getEdgeLabel(edge)); 148 st.add("target", getStateLabel(edge.target)); 151 walkCreatingDFADOT(dot, (DFAState)edge.target); // keep walkin' 205 // make a DOT edge fo 284 getEdgeLabel(Transition edge) argument [all...] |
/external/dropbear/libtomcrypt/src/pk/asn1/der/set/ |
H A D | der_encode_setof.c | 20 struct edge { struct 27 struct edge *A = (struct edge *)a, *B = (struct edge *)b; 66 struct edge *edges;
|
/external/llvm/lib/Analysis/ |
H A D | ProfileDataLoaderPass.cpp | 92 /// readEdge - Take the value from a profile counter and assign it to an edge. 107 /// matchEdges - Link every profile counter with an edge. 131 /// edge into branch weights for each conditional branch (a branch with 2 or 152 ProfileData::Edge edge = PB.getEdge(BB, TI->getSuccessor(s)); local 153 Weights[s] = (uint32_t)PB.getEdgeWeight(edge); 154 DEBUG(dbgs() << "---- Edge '" << edge << "' has weight "
|
H A D | ProfileInfoLoaderPass.cpp | 61 // recurseBasicBlock() - Calculates the edge weights for as much basic 97 void LoaderPass::readEdgeOrRemember(Edge edge, Edge &tocalc, argument 100 if ((w = getEdgeWeight(edge)) == MissingValue) { 101 tocalc = edge; 109 // calculate the missing edge values. 215 assert(0 && "No edge calculated!");
|
H A D | ProfileEstimatorPass.cpp | 116 // flow, once an edge has a flow assigned this flow is never changed again, 134 Edge edge = getEdge(*bbi,BB); local 135 double w = getEdgeWeight(edge); 140 // loop, thus the edge is a backedge, continue and do not check if the 143 printEdgeError(edge, "but is backedge, continuing"); 149 printEdgeError(edge, "returning"); 172 // *) In case there is not a single exiting edge left, create one at the loop 205 Edge edge = getEdge(Latch,0); local 206 EdgeInformation[BB->getParent()][edge] = BBWeight; 207 printEdgeWeight(edge); 267 Edge edge = getEdge(BB,0); local 273 Edge edge = getEdge(BB,*bbi); local 341 Edge edge = getEdge(0,entry); local [all...] |
H A D | PathProfileInfo.cpp | 186 // add block to the block list if it is a real edge 189 // make the back edge the last edge since we are at the end 204 BallLarusEdge* edge = getNextEdge(root, _number); local 206 if( edge && (edge->getType() == BallLarusEdge::BACKEDGE_PHONY || 207 edge->getType() == BallLarusEdge::SPLITEDGE_PHONY) ) 208 return edge->getTarget()->getBlock();
|
H A D | PathNumbering.cpp | 114 // Add an edge to the predecessor list. 115 void BallLarusNode::addPredEdge(BallLarusEdge* edge) { argument 116 _predEdges.push_back(edge); 119 // Remove an edge from the predecessor list. 120 void BallLarusNode::removePredEdge(BallLarusEdge* edge) { argument 121 removeEdge(_predEdges, edge); 124 // Add an edge to the successor list. 125 void BallLarusNode::addSuccEdge(BallLarusEdge* edge) { argument 126 _succEdges.push_back(edge); 129 // Remove an edge fro 130 removeSuccEdge(BallLarusEdge* edge) argument [all...] |
/external/llvm/lib/Transforms/Instrumentation/ |
H A D | OptimalEdgeProfiling.cpp | 1 //===- OptimalEdgeProfiling.cpp - Insert counters for opt. edge profiling -===// 10 // This pass instruments the specified program with counters for edge profiling. 15 #define DEBUG_TYPE "insert-optimal-edge-profiling" 55 INITIALIZE_PASS_BEGIN(OptimalEdgeProfiler, "insert-optimal-edge-profiling", 56 "Insert optimal instrumentation for edge profiling", 60 INITIALIZE_PASS_END(OptimalEdgeProfiler, "insert-optimal-edge-profiling", 61 "Insert optimal instrumentation for edge profiling", 78 errs() << "WARNING: cannot insert edge profiling into a module" 85 // For the entry block a virtual edge (0,entry) is reserved, for each block 86 // with no successors an edge (B 150 ProfileInfo::Edge edge = ProfileInfo::getEdge(0, entry); local 173 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB, 0); local 184 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB,Succ); local [all...] |
/external/opencv/cvaux/src/ |
H A D | cvsubdiv2.cpp | 59 CvQuadEdge2D* edge = (CvQuadEdge2D*)cvGetSetElem(subdiv->edges,i); local 61 if( edge && CV_IS_SET_ELEM( edge )) 65 CvSubdiv2DEdge e = (CvSubdiv2DEdge)edge + j; 107 draw_subdiv_facet( CvSubdiv2D * subdiv, IplImage * dst, IplImage * src, CvSubdiv2DEdge edge ) 109 CvSubdiv2DEdge t = edge; 120 while( t != edge && count < subdiv->quad_edges * 4 ); 128 t = edge; 142 CvSubdiv2DPoint *pt = cvSubdiv2DEdgeDst( cvSubdiv2DRotateEdge( edge, 1 )); 173 CvQuadEdge2D *edge local [all...] |
/external/qemu/distrib/sdl-1.2.15/src/video/bwindow/ |
H A D | SDL_sysevents.cc | 195 BPoint edge; local 196 GetXYOffset(edge.x, edge.y); 197 edge.x += x; 198 edge.y += y; 199 ConvertToScreen(&edge); 200 set_mouse_position((int)edge.x, (int)edge.y);
|
/external/skia/src/core/ |
H A D | SkClampRange.cpp | 13 * returns [0..count] for the number of steps (<= count) for which x0 <= edge 16 static int chop(int64_t x0, SkFixed edge, int64_t x1, int64_t dx, int count) { argument 20 if (x0 >= edge) { 23 if (x1 <= edge) { 26 int64_t n = (edge - x0 + dx - 1) / dx;
|
H A D | SkEdgeBuilder.cpp | 24 SkEdge* edge = typedAllocThrow<SkEdge>(fAlloc); local 25 if (edge->setLine(pts[0], pts[1], NULL, fShiftUp)) { 26 fList.push(edge); 28 // TODO: unallocate edge from storage... 33 SkQuadraticEdge* edge = typedAllocThrow<SkQuadraticEdge>(fAlloc); local 34 if (edge->setQuadratic(pts, fShiftUp)) { 35 fList.push(edge); 37 // TODO: unallocate edge from storage... 42 SkCubicEdge* edge = typedAllocThrow<SkCubicEdge>(fAlloc); local 43 if (edge [all...] |
H A D | SkRegion_path.cpp | 388 static int extract_path(Edge* edge, Edge* stop, SkPath* path) { argument 389 while (0 == edge->fFlags) { 390 edge++; // skip over "used" edges 393 SkASSERT(edge < stop); 395 Edge* base = edge; 396 Edge* prev = edge; 397 edge = edge->fNext; 398 SkASSERT(edge != base); 404 if (prev->fX != edge [all...] |
/external/webkit/Source/WebCore/rendering/ |
H A D | RenderFrameSet.h | 44 bool preventResize(FrameEdge edge) const { return m_preventResize[edge]; } 45 bool allowBorder(FrameEdge edge) const { return m_allowBorder[edge]; } 47 void setPreventResize(FrameEdge edge, bool preventResize) { m_preventResize[edge] = preventResize; } argument 48 void setAllowBorder(FrameEdge edge, bool allowBorder) { m_allowBorder[edge] = allowBorder; } argument
|
/external/bison/src/ |
H A D | lalr.c | 173 goto_number *edge = xnmalloc (ngotos + 1, sizeof *edge); local 193 edge[nedges++] = map_goto (stateno, sym); 201 memcpy (reads[i], edge, nedges * sizeof edge[0]); 213 free (edge); 232 goto_number *edge = xnmalloc (ngotos + 1, sizeof *edge); local 274 edge[nedges++] = map_goto (states1[--length], 289 includes[i][j] = edge[ [all...] |
/external/quake/quake/src/QW/client/ |
H A D | r_edge.c | 31 this breaks spans at every edge, even hidden ones (bad) 71 void R_LeadingEdge (edge_t *edge); 72 void R_LeadingEdgeBackwards (edge_t *edge); 73 void R_TrailingEdge (surf_t *surf, edge_t *edge); 169 sentinel at the end (actually, this is the active edge table starting at 270 // pull the edge out of the edge list 274 // find out where the edge goes in the edge list 282 // put the edge bac 336 R_LeadingEdgeBackwards(edge_t *edge) argument 416 R_TrailingEdge(surf_t *surf, edge_t *edge) argument 460 R_LeadingEdge(edge_t *edge) argument 590 edge_t *edge; local 629 edge_t *edge; local [all...] |
/external/quake/quake/src/WinQuake/ |
H A D | r_edge.cpp | 31 this breaks spans at every edge, even hidden ones (bad)
71 void R_LeadingEdge (edge_t *edge);
72 void R_LeadingEdgeBackwards (edge_t *edge);
73 void R_TrailingEdge (surf_t *surf, edge_t *edge);
169 sentinel at the end (actually, this is the active edge table starting at
270 // pull the edge out of the edge list
274 // find out where the edge goes in the edge list
282 // put the edge bac 336 R_LeadingEdgeBackwards(edge_t *edge) argument 416 R_TrailingEdge(surf_t *surf, edge_t *edge) argument 460 R_LeadingEdge(edge_t *edge) argument 590 edge_t *edge; local 629 edge_t *edge; local [all...] |
/external/webkit/Source/WebCore/platform/graphics/ |
H A D | IntRect.h | 113 void shiftXEdgeTo(int edge) argument 115 int delta = edge - x(); 116 setX(edge); 119 void shiftMaxXEdgeTo(int edge) argument 121 int delta = edge - maxX(); 124 void shiftYEdgeTo(int edge) argument 126 int delta = edge - y(); 127 setY(edge); 130 void shiftMaxYEdgeTo(int edge) argument 132 int delta = edge [all...] |
/external/chromium/chrome/browser/ui/views/bubble/ |
H A D | bubble_border.cc | 222 // |arrow_offset| is offset of arrow from the begining of the edge. 234 // Left edge. 263 // Top edge. 292 // Right edge. 321 // Bottom edge. 353 SkBitmap* edge, 372 canvas->TileImageInt(*edge, start_x, start_y, 373 is_horizontal ? before_arrow : edge->width(), 374 is_horizontal ? edge->height() : before_arrow); 384 canvas->TileImageInt(*edge, start_ 351 DrawEdgeWithArrow(gfx::Canvas* canvas, bool is_horizontal, SkBitmap* edge, SkBitmap* arrow, int start_x, int start_y, int before_arrow, int after_arrow, int offset) const argument [all...] |
/external/icu4c/common/ |
H A D | stringtriebuilder.cpp | 499 Node *edge=equal[--i]; local 500 if(edge!=NULL) { 501 edgeNumber=edge->markRightEdgesFirst(edgeNumber-step); 503 // For all but the rightmost edge, decrement the edge number.
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
H A D | CodeGenerator.java | 661 * edge. Generate a simple if-then-else. Cannot be an accept state as 678 Transition edge = (Transition) s.transition(i); 680 if ( edge.label.getAtom()==Label.EOT ) { 689 genLabelExpr(templates,edge,1); 694 Utils.integer(edge.target.stateNumber)); 695 // stick in any gated predicates for any edge if not already a pred 696 if ( !edge.label.isSemanticPredicate() ) { 697 DFAState t = (DFAState)edge.target; 707 if ( edge.label.getAtom()!=Label.EOT ) { 712 // state has >= 1 edge wit 723 genLabelExpr(STGroup templates, Transition edge, int k) argument 742 genSemanticPredicateExpr(STGroup templates, Transition edge) argument [all...] |
/external/freetype/src/autofit/ |
H A D | afhints.c | 66 /* Get new edge for given axis, direction, and position. */ 76 AF_Edge edge = NULL; local 84 FT_Int big_max = (FT_Int)( FT_INT_MAX / sizeof ( *edge ) ); 104 edge = edges + axis->num_edges; 106 while ( edge > edges ) 108 if ( edge[-1].fpos < fpos ) 111 /* we want the edge with same position and minor direction */ 113 if ( edge[-1].fpos == fpos && dir == axis->major_dir ) 116 edge[0] = edge[ 359 AF_Edge edge; local 827 AF_Edge edge = seg->edge; local 853 AF_Edge edge = seg->edge; local 908 AF_Edge edge; local [all...] |
H A D | afhints.h | 83 * edges. An edge corresponds to a single position on the main 172 * Experience has shown that points which are not part of an edge need 234 /* edge hint flags */ 269 FT_Byte flags; /* edge/segment flags for this segment */ 276 AF_Edge edge; /* the segment's parent edge */ member in struct:AF_SegmentRec_ 277 AF_Segment edge_next; /* link to next segment in parent edge */ 285 AF_Point first; /* first point in edge segment */ 286 AF_Point last; /* last point in edge segment */ 297 FT_Byte flags; /* edge flag [all...] |
/external/llvm/lib/CodeGen/ |
H A D | RegAllocPBQP.cpp | 279 PBQP::Graph::EdgeItr edge = local 283 addInterferenceCosts(g.getEdgeCosts(edge), vr1Allowed, vr2Allowed, tri); 379 PBQP::Graph::EdgeItr edge = g.findEdge(node1, node2); local 380 if (edge == g.edgesEnd()) { 381 edge = g.addEdge(node1, node2, PBQP::Matrix(allowed1->size() + 1, 385 if (g.getEdgeNode1(edge) == node2) { 391 addVirtRegCoalesce(g.getEdgeCosts(edge), *allowed1, *allowed2,
|
/external/opencv/cv/src/ |
H A D | cvgeometry.cpp | 130 icvCreateCenterNormalLine( CvSubdiv2DEdge edge, double *_a, double *_b, double *_c ) argument 132 CvPoint2D32f org = cvSubdiv2DEdgeOrg( edge )->pt; 133 CvPoint2D32f dst = cvSubdiv2DEdgeDst( edge )->pt;
|