| /external/opencv/cv/include/ |
| cv.h | 642 /* Locates a point within the Delaunay triangulation (finds the edge
647 CvSubdiv2DEdge* edge,
662 /************ Basic quad-edge navigation and operations ************/
664 CV_INLINE CvSubdiv2DEdge cvSubdiv2DNextEdge( CvSubdiv2DEdge edge )
666 return CV_SUBDIV2D_NEXT_EDGE(edge);
670 CV_INLINE CvSubdiv2DEdge cvSubdiv2DRotateEdge( CvSubdiv2DEdge edge, int rotate )
672 return (edge & ~3) + ((edge + rotate) & 3);
675 CV_INLINE CvSubdiv2DEdge cvSubdiv2DSymEdge( CvSubdiv2DEdge edge )
677 return edge ^ 2
[all...] |
| /external/ceres-solver/internal/ceres/ |
| graph_algorithms.h | 266 // empty edge set. We then iterate over the edges of G in decreasing
309 // edge>. Sorting it using the reverse iterators gives us the edges
316 const pair<Vertex, Vertex>& edge = weighted_edges[i].second; local
317 const Vertex vertex1 = edge.first;
318 const Vertex vertex2 = edge.second;
321 // which case adding this edge will violate the degree 2
331 // vertex, and adding this edge will create a cycle.
339 // This edge can be added, add an edge in either direction with
|
| visibility.h | 66 // f_blocks and an edge connects two vertices if they have atleast one
67 // e_block in common. The weight of this edge is normalized dot
|
| /external/llvm/lib/IR/ |
| Dominators.cpp | 142 // Assert that we have a single edge. We could handle them by simply
148 // If the BB the edge ends in doesn't dominate the use BB, then the
149 // edge also doesn't.
156 // dominates the use block implies that the edge also does.
160 // The normal edge from the invoke is critical. Conceptually, what we would
193 // Assert that we have a single edge. We could handle them by simply
200 // A PHI in the end of the edge is dominated by it.
206 // Otherwise use the edge-dominates-block query, which
207 // handles the crazy critical edge cases properly.
|
| GCOV.cpp | 184 GCOVEdge *Edge = Edges.back().get();
185 Blocks[BlockNo]->addDstEdge(Edge);
186 Blocks[Dst]->addSrcEdge(Edge);
188 return false; // Edge flag
303 // required to combine the edge counts that are contained in the GCDA file.
373 /// addCount - Add to block counter while storing the edge count. If the
404 for (const GCOVEdge *Edge : SrcEdges)
405 dbgs() << Edge->Src.Number << " (" << Edge->Count << "), ";
410 for (const GCOVEdge *Edge : DstEdges
[all...] |
| /external/v8/src/compiler/ |
| loop-analysis.cc | 210 // Entry or normal edge. Propagate all marks except loop_num.
277 for (Edge edge : node->use_edges()) {
278 Node* use = edge.from();
279 if (!IsBackedge(use, edge)) {
286 bool IsBackedge(Node* use, Edge& edge) {
288 if (edge.index() == kAssumedLoopEntryIndex) return false;
290 return !NodeProperties::IsControlEdge(edge);
|
| node.cc | 351 { // Input edge iteration.
353 for (Edge edge : this->input_edges()) {
354 CHECK_EQ(edge.from(), this);
355 CHECK_EQ(index, edge.index());
356 CHECK_EQ(this->InputAt(index), edge.to());
|
| /frameworks/support/core-ui/java/android/support/v4/widget/ |
| FocusStrategy.java | 269 // direction down, completely closer means for rect2's top edge to
270 // be closer to the source's top edge than rect1's bottom edge.
292 * Includes an edge case for an empty rect,which is used in some cases
358 * @return the distance from the edge furthest in the given direction
359 * of source to the edge nearest in the given direction of
386 * the edge of source to the far edge of dest. If the dest is
414 * nearest edge of the destination rectangle.
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/ |
| b2CollideEdge.cpp | 25 // Compute contact points for edge versus circle.
26 // This accounts for edge connectivity.
33 // Compute circle in frame of edge
60 // Is there an edge connected to A?
68 // Is the circle in Region AB of the previous edge?
98 // Is there an edge connected to B?
106 // Is the circle in Region AB of the next edge?
193 // This class collides and edge and a polygon, taking into account edge adjacency.
252 // Is there a preceding edge
[all...] |
| /art/compiler/optimizing/ |
| graph_test.cc | 97 // Ensure the critical edge has been removed.
132 // Ensure the critical edge has been removed.
165 // Ensure there is only one back edge.
170 // Ensure the new block is the back edge.
200 // Ensure there is only one back edge.
205 // Ensure the new block is the back edge.
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaConverter.java | 32 * Returns an SSA representation, edge-split and with phi
55 * The exit block, added here, is not considered for edge splitting
77 * Returns an SSA represention with only the edge-splitter run.
83 * @return an SSA represention with only the edge-splitter run
103 * @return an SSA represention with only the edge-splitter run
122 * Converts CFG into "edge-split" form, such that each node either a
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/ |
| Dot.py | 69 # customizing edge drawing
94 - edge attributes, passed via the :py:meth:`Dot.edge_style` method::
136 # self.edges: edge styles
208 Modifies an edge style to the dot representation.
218 raise GraphError("invalid edge %s -> %s " % (head, tail) )
246 # write edge attributes
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/doc/ |
| dot.rst | 74 # customizing edge drawing
99 - edge attributes, passed via the :py:meth:`Dot.edge_style` method::
126 add edges to the dot file unless both the head and tail of the edge
133 for a given edge or node (both default to functions that return an empty
165 Sets the style of an edge to the given attributes. The edge will
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| SsaConverter.java | 33 * Returns an SSA representation, edge-split and with phi
56 * The exit block, added here, is not considered for edge splitting
78 * Returns an SSA represention with only the edge-splitter run.
84 * @return an SSA represention with only the edge-splitter run
104 * @return an SSA represention with only the edge-splitter run
123 * Converts CFG into "edge-split" form, such that each node either a
|
| /external/llvm/test/Transforms/SampleProfile/ |
| fnptr.ll | 8 ; CHECK: edge for.body3 -> if.then probability is 0x1a4f3959 / 0x80000000 = 20.55%
9 ; CHECK: edge for.body3 -> if.else probability is 0x65b0c6a7 / 0x80000000 = 79.45%
10 ; CHECK: edge for.inc -> for.inc12 probability is 0x33d4a4c1 / 0x80000000 = 40.49%
11 ; CHECK: edge for.inc -> for.body3 probability is 0x4c2b5b3f / 0x80000000 = 59.51%
12 ; CHECK: edge for.inc12 -> for.end14 probability is 0x3f06d04e / 0x80000000 = 49.24%
13 ; CHECK: edge for.inc12 -> for.cond1.preheader probability is 0x40f92fb2 / 0x80000000 = 50.76%
|
| /external/opencv3/modules/imgproc/src/ |
| gcgraph.hpp | 69 class Edge
78 std::vector<Edge> edges;
124 Edge fromI, toI;
160 Edge *edgePtr = &edges[0];
191 // grow S & T search trees, find an edge connecting them
242 // find the minimum edge weight along the path
|
| /system/update_engine/payload_generator/ |
| cycle_breaker_unittest.cc | 78 set<Edge> broken_edges;
164 set<Edge> broken_edges;
168 set<Edge> expected_cuts;
216 set<Edge> broken_edges;
247 set<Edge> broken_edges;
272 set<Edge> broken_edges;
|
| /external/autotest/client/site_tests/firmware_TouchMTB/ |
| test_conf.py | 44 # relaxed_linearity_criteria is used for lines drawn with thumb edge or
337 GV.TS: ('top edge',),
455 GV.CL: ('horizontal', 'from the center off left edge',),
456 GV.CR: ('horizontal', 'from the center off right edge',),
457 GV.CT: ('vertical', 'from the center off top edge',),
458 GV.CB: ('vertical', 'from the center off bottom edge',),
601 GV.TS: ('top edge',),
726 GV.RL: ('bottom edge', 'from right to left', 'above'),
745 prompt='Drag the edge of your thumb {0} in a straight line '
[all...] |
| /external/clang/docs/ |
| SanitizerCoverage.rst | 12 get function-level, basic-block-level, and edge-level coverage at a very low
25 * ``-fsanitize-coverage=edge`` for edge-level coverage (up to 40% slowdown).
116 Edge coverage
141 and B=>C were executed, but we still don't know if the edge A=>C was executed.
144 edge-level coverage (``-fsanitize-coverage=edge``) simply splits all critical
166 % clang++ -fsanitize=address -fsanitize-coverage=edge cov.cc
215 every basic block (edge) the instrumentation will collect imprecise counters.
222 % clang++ -g cov.cc -fsanitize=address -fsanitize-coverage=edge,8bit-counter
[all...] |
| /external/llvm/lib/CodeGen/ |
| PHIElimination.cpp | 41 DisableEdgeSplitting("disable-phi-elim-edge-splitting", cl::init(false),
42 cl::Hidden, cl::desc("Disable critical edge splitting "
406 // last PHI use of SrcReg to be lowered on this CFG edge and it is not live
563 // Is there a critical edge from PreMBB to MBB?
580 // If the copy would be a kill, there is no need to split the edge.
585 DEBUG(dbgs() << PrintReg(Reg) << " live-out before critical edge BB#"
592 // the edge.
596 // exiting edge, split it so we won't insert code in the loop, otherwise
600 // Check for a loop exiting edge.
607 // This edge could be entering a loop, exiting a loop, or it could b
[all...] |
| ScheduleDAG.cpp | 62 /// addPred - This adds the specified edge as a pred of the current node if
70 // add them if another kind of edge already exists.
130 /// removePred - This removes the specified edge as a pred of the current
438 /// "Maintaining a topological order under edge insertions".
449 /// if Z is reachable from X, then an insertion of the edge Z->X would
454 /// the ordering up-to-date after edge insertions by reordering the DAG.
456 /// On insertion of the edge X->Y, the algorithm first marks by calling DFS
516 /// AddPred - Updates the topological ordering to accommodate an edge
528 assert(!HasLoop && "Inserted edge creates a loop!");
535 /// an edge to be removed from the specified node N from the predecessor
[all...] |
| /art/test/594-checker-irreducible-linorder/smali/ |
| IrreducibleLoop.smali | 99 # This constant has a use in a phi in :back_edge2 and a back edge use in
100 # :back_edge1. Because the linear order is wrong, the back edge use has
|
| /build/blueprint/ |
| context_test.go | 105 // |---B===D - represents a non-walkable edge
106 // A = represents a walkable edge
|
| /external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/ui/ |
| BoxModel.java | 58 * Returns a RectF instance describing the inner edge of the margin layer.
70 * Returns a RectF instance describing the inner edge of the padding layer.
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 56 //System.out.println("add edge "+a+" to "+b);
75 * If there exists an edge u -> v then u depends on v and v
|
