| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/dot/ |
| dfa.st | 5 <edges; separator="\n">
|
| nfa.st | 5 <edges; separator="\n">
|
| dot.stg | 33 dfa(decisionRanks,states,edges,rankdir,startState,useBox) ::= <<
38 <edges; separator="\n">
42 nfa(decisionRanks,states,edges,rankdir,startState) ::= <<
47 <edges; separator="\n">
|
| /external/dropbear/libtomcrypt/src/pk/asn1/der/set/ |
| der_encode_setof.c | 66 struct edge *edges; local
88 /* allocate edges */
89 edges = XCALLOC(inlen, sizeof(*edges));
90 if (edges == NULL) {
108 /* scan for edges */
112 edges[x].start = ptr;
120 edges[x].size = y;
123 edges[x].size = 0;
125 edges[x].size = (edges[x].size << 8) | ((unsigned long)ptr[z++])
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 32 /** A generic graph with edges; Each node as a single Object payload.
40 List<Node> edges; // points at which nodes? field in class:Graph.Node
45 if ( edges==null ) edges = new ArrayList<Node>();
46 if ( !edges.contains(n) ) edges.add(n);
99 if ( n.edges!=null ) {
100 for (Iterator it = n.edges.iterator(); it.hasNext();) {
|
| /external/chromium/chrome/browser/profiles/ |
| profile_dependency_manager.cc | 30 // Remove all dependency edges that contain this component.
74 // Step 1: Build a set of nodes with no incoming edges.
89 EdgeMap edges(edges_);
96 edges.equal_range(node);
102 edges.erase(temp);
105 for (EdgeMap::iterator jt = edges.begin(); jt != edges.end(); ++jt) {
117 if (edges.size()) {
|
| /external/llvm/lib/Analysis/ |
| ProfileEstimatorPass.cpp | 113 // weight of the incoming edges must be equal the block weight which must in
114 // turn be equal to the sume of the weights of the outgoing edges.
128 // To get the block weight, read all incoming edges.
146 // If the edges value is missing (and this is no loop header, and this is
159 SmallVector<Edge, 8> Edges;
167 // *) get all the exit edges, read the flow that is already leaving this
168 // loop, remember the edges that do not have any flow on them right now.
169 // (The edges that have already flow on them are most likely exiting edges of
175 // the remaining exiting edges
[all...] |
| /external/opencv/cvaux/src/ |
| cvdpstereo.cpp | 108 uchar* edges = (uchar*)cvAlloc(sizeof(uchar)*imgW*imgH); local
158 edges[y*imgW] = edges[y*imgW+1] = edges[y*imgW+2] = 2;
159 edges[y*imgW+imgW-1] = edges[y*imgW+imgW-2] = edges[y*imgW+imgW-3] = 1;
162 edges[y*imgW+j] = 0;
167 edges[y*imgW+j] |= 1;
172 edges[y*imgW+j] |= 2
[all...] |
| decomppoly.cpp | 261 // this edge intersects some other initial edges
328 int* edges,
344 if( edges[ mainEdgeIdx * 2 ] == vtxIdx ) {
347 x0_end = contour[ edges[ mainEdgeIdx * 2 + 1 ] ].x;
348 y0_end = contour[ edges[ mainEdgeIdx * 2 + 1 ] ].y;
353 //x0 = contour[ edges[ mainEdgeIdx * 2 ] ].x;
354 //y0 = contour[ edges[ mainEdgeIdx * 2 ] ].y;
359 x0_end = contour[ edges[ mainEdgeIdx * 2 ] ].x;
360 y0_end = contour[ edges[ mainEdgeIdx * 2 ] ].y;
368 ( edges[ i * 2 ] == vtxIdx || edges[ i * 2 + 1 ] == vtxIdx )
[all...] |
| /external/llvm/test/Transforms/Mem2Reg/ |
| 2003-04-24-MultipleIdenticalSuccessors.ll | 2 ; multiple incoming edges from a block.
|
| /external/oprofile/events/ppc64/cell-be/ |
| unit_masks | 17 0x000 Count edges [mandatory]
27 0x000 Count edges [mandatory]
38 0x000 Count edges [mandatory]
44 0x000 Count edges [optional ]
57 0x000 Count edges [mandatory]
63 0x000 Count edges [optional ]
90 0x0000 Count edges [optional ]
105 0x0000 Count edges [optional ]
122 0x0000 Count edges [optional ]
|
| /external/webkit/Source/WebCore/platform/graphics/ |
| RoundedIntRect.cpp | 78 void RoundedIntRect::Radii::includeLogicalEdges(const RoundedIntRect::Radii& edges, bool isHorizontal, bool includeLogicalLeftEdge, bool includeLogicalRightEdge)
82 m_bottomLeft = edges.bottomLeft();
84 m_topRight = edges.topRight();
85 m_topLeft = edges.topLeft();
90 m_topRight = edges.topRight();
92 m_bottomLeft = edges.bottomLeft();
93 m_bottomRight = edges.bottomRight();
133 void RoundedIntRect::includeLogicalEdges(const Radii& edges, bool isHorizontal, bool includeLogicalLeftEdge, bool includeLogicalRightEdge)
135 m_radii.includeLogicalEdges(edges, isHorizontal, includeLogicalLeftEdge, includeLogicalRightEdge);
|
| /sdk/rule_api/src/com/android/ide/common/api/ |
| MarginType.java | 32 * edges (the bounds of the target node with and without edges) and check for matches on
53 * This margin type is used for nodes that do not have margins, so margin edges and
54 * non-margin edges are the same
|
| /external/skia/third_party/glu/libtess/ |
| alg-outline | 27 edge, and coincident edges.
105 edges which intersect the sweep line, sorted by their current order of
106 intersection. For each pair of edges, we store some information about
114 edges to see if they intersect.
116 A vertex can have any number of edges. Vertices with many edges can
119 edges are in no particular order around the vertex; for processed
123 left-going edges (all these edges are currently in the edge
126 - deleting the left-going edges from the dictionary
[all...] |
| tessmono.h | 47 * loop of half-edges (see mesh.h) oriented CCW. "Monotone" in this
51 * Tessellation consists of adding interior edges (actually pairs of
52 * half-edges), to split the region into non-overlapping triangles.
64 * winding numbers on all edges so that regions marked "inside" the
68 * If keepOnlyBoundary is TRUE, it also deletes all edges which do not
|
| sweep.c | 67 * - each pair of adjacent edges e2=Succ(e1) satisfies EdgeLeq(e1,e2)
86 * - if none of the edges incident to the event vertex have an activeRegion
87 * (ie. none of these edges are in the edge dictionary), then the vertex
88 * has only right-going edges.
91 * its associated vertex. (This says that these edges exist only
98 /* When we merge two edges into one, we need to compute the combined
111 * Both edges must be directed from right to left (this is the canonical
119 * we sort the edges by slope (they would otherwise compare equally).
131 /* Two edges right of the sweep line which meet at the sweep event.
288 * We are given a vertex with one or more left-going edges. All affecte
[all...] |
| /external/freetype/src/autofit/ |
| afhints.h | 36 /* i.e., vertical segments & edges */
38 /* i.e., horizontal segments & edges */
80 * Edges
83 * edges. An edge corresponds to a single position on the main
87 * The auto-hinter first tries to grid fit edges, then to align
88 * segments on the edges unless it detects that they form a serif.
91 * edges; they are specific to a script.
173 * to be interpolated linearly between their two closest edges, even if
198 * alignment of edges and strong points, thus weak points are processed
299 FT_Fixed scale; /* used to speed up interpolation between edges */
324 AF_Edge edges; \/* edges array *\/ member in struct:AF_AxisHintsRec_
[all...] |
| afhints.c | 77 AF_Edge edges; local
97 if ( FT_RENEW_ARRAY( axis->edges, old_max, new_max ) )
103 edges = axis->edges;
104 edge = edges + axis->num_edges;
106 while ( edge > edges )
343 /* Dump the array of linked edges. */
357 AF_Edge edges = axis->edges; local
358 AF_Edge limit = edges + axis->num_edges
895 AF_Edge edges = axis->edges; local
[all...] |
| /external/skia/src/core/ |
| SkRegion_rects.cpp | 46 static void SetFromRect(VEdge edges[], const SkIRect& r) {
47 edges[0].fX = r.fLeft;
48 edges[0].fTop = r.fTop;
49 edges[0].fBottom = r.fBottom;
50 edges[0].fWinding = -1;
52 edges[1].fX = r.fRight;
53 edges[1].fTop = r.fTop;
54 edges[1].fBottom = r.fBottom;
55 edges[1].fWinding = 1;
239 // check if we have no edges
[all...] |
| /external/bison/src/ |
| vcg.h | 229 (with k ? 0) means that the graph part that is reachable via edges
306 /* Structs enum definitions for edges. */
357 edges of a class less or equal to a constant k specify folding
369 the incoming and outgoing edges. One can think of rubberbands instead
370 of edges that pull a node into its position. The priority of an edges
394 at the source node (the backarrow head). Normal edges only have the
410 lines long, and outgoing edges are related to label lines. (E.g.,
422 level the edge has to be drawn. Other edges which do not have this
453 we want to express that an edge points to a subgraph. Such edges
858 enum decision edges; member in struct:graph
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| PathNumbering.h | 12 // edges to obtain a DAG, and thus the unique path numbers [Ball96].
14 // The purpose of this analysis is to enumerate the edges in a CFG in order
16 // [Ball96] edges can be enumerated such that given a path number by following
75 // Iterator information for predecessor edges. Includes phony and
81 // Iterator information for successor edges. Includes phony and
108 // Holds the predecessor edges of this node.
111 // Holds the successor edges of this node.
189 // For backedges and split-edges, the phony edge which is linked to the
193 // For backedges and split-edges, the phony edge which is linked to the
202 // An ID to differentiate between those edges which have the same sourc
[all...] |
| /external/replicaisland/tools/ |
| ExtractPoints.js | 20 * each path in the current document and generates a list of edges and normals
53 // Walk the list of paths and extract edges and normals. Store these in
67 tile.edges = new Array();
111 tile.edges.push(edge);
138 // For each tile print the edges to a string.
142 for (var y = 0; y < tile.edges.length; y++) {
143 var edge = tile.edges[y];
191 // Render the edges and normals to the new document.
195 // draw the edges to make sure everything works
224 for (var y = 0; y < tile.edges.length; y++)
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| OptimalEdgeProfiling.cpp | 32 STATISTIC(NumEdgesInserted, "The # of edges inserted.");
83 // NumEdges counts all the edges that may be instrumented. Later on its
84 // decided which edges to actually instrument, to achieve optimal profiling.
86 // with no successors an edge (BB,0) is reserved. These edges are necessary
98 // edges!
126 // Instrument all of the edges not in MST...
134 // edges (0,entry) and (BB,0) (for blocks with no successors) and this
135 // edges also participate in the maximum spanning tree calculation.
137 // actual MST is returned but the edges _not_ in the MST.
213 // Check if the number of edges counted at first was the number of edges w
[all...] |
| /external/skia/src/gpu/ |
| GrTesselatedPathRenderer.cpp | 170 const GrDrawState::Edge* edges() const { return fEdges; } function in class:GrEdgePolygonTess
310 GrEdgeArray* edges,
327 *edges->append() = edge;
330 int count = edges->count();
334 GrDrawState::Edge prev_edge = edges->at(0);
336 GrDrawState::Edge edge = edges->at(i < count - 1 ? i + 1 : 0);
347 return edges->count();
470 GrEdgeArray edges; local
474 count = computeEdgesAndIntersect(matrix, inverse, base, count, &edges, 0.0f);
480 // All edges fit; upload all edges and draw all verts as a fa
528 GrEdgeArray edges; local
548 const GrDrawState::Edge* edges = ptess.edges(); local
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| EdgeBundles.h | 1 //===-------- EdgeBundles.h - Bundles of CFG edges --------------*- c++ -*-===//
10 // The EdgeBundles analysis forms equivalence classes of CFG edges such that all
11 // edges leaving a machine basic block are in the same bundle, and all edges
|
