| /external/skia/src/core/ |
| SkScan_Path.cpp | 257 // our edge choppers for curves can result in the initial edges
414 // now make the edges linked in sorted order
435 // If we're convex, then we need both edges, even the right edge is past the clip
504 SkASSERT(count >= 2); // convex walker does not handle missing right edges
597 * of a rectangle, and corresponds to the way the scan converter treats the top and left edges.
636 // Our edges are fixed-point, and don't like the bounds of the clip to
|
| /external/clang/test/Analysis/ |
| bug_hash_test.m | 37 // CHECK-NEXT: <key>edges</key>
120 // CHECK-NEXT: <key>edges</key>
252 // CHECK-NEXT: <key>edges</key>
335 // CHECK-NEXT: <key>edges</key>
418 // CHECK-NEXT: <key>edges</key>
501 // CHECK-NEXT: <key>edges</key>
578 // CHECK-NEXT: <key>edges</key>
658 // CHECK-NEXT: <key>edges</key>
[all...] |
| unix-fns.c | 213 // CHECK-NEXT: <key>edges</key>
247 // CHECK-NEXT: <key>edges</key>
310 // CHECK-NEXT: <key>edges</key>
344 // CHECK-NEXT: <key>edges</key>
427 // CHECK-NEXT: <key>edges</key>
461 // CHECK-NEXT: <key>edges</key>
495 // CHECK-NEXT: <key>edges</key>
578 // CHECK-NEXT: <key>edges</key>
661 // CHECK-NEXT: <key>edges</key>
744 // CHECK-NEXT: <key>edges</key
[all...] |
| generics.m | 367 // CHECK-NEXT: <key>edges</key>
401 // CHECK-NEXT: <key>edges</key>
513 // CHECK-NEXT: <key>edges</key>
625 // CHECK-NEXT: <key>edges</key>
659 // CHECK-NEXT: <key>edges</key>
742 // CHECK-NEXT: <key>edges</key>
[all...] |
| plist-output-alternate.m | 96 // CHECK-NEXT: <key>edges</key>
179 // CHECK-NEXT: <key>edges</key>
242 // CHECK-NEXT: <key>edges</key>
325 // CHECK-NEXT: <key>edges</key>
388 // CHECK-NEXT: <key>edges</key>
451 // CHECK-NEXT: <key>edges</key>
534 // CHECK-NEXT: <key>edges</key>
597 // CHECK-NEXT: <key>edges</key>
631 // CHECK-NEXT: <key>edges</key>
714 // CHECK-NEXT: <key>edges</key
[all...] |
| method-call-path-notes.cpp | 81 // CHECK-NEXT: <key>edges</key>
193 // CHECK-NEXT: <key>edges</key>
276 // CHECK-NEXT: <key>edges</key>
339 // CHECK-NEXT: <key>edges</key>
422 // CHECK-NEXT: <key>edges</key>
485 // CHECK-NEXT: <key>edges</key>
597 // CHECK-NEXT: <key>edges</key>
680 // CHECK-NEXT: <key>edges</key>
[all...] |
| retain-release-path-notes.m | 339 // CHECK-NEXT: <key>edges</key>
402 // CHECK-NEXT: <key>edges</key>
485 // CHECK-NEXT: <key>edges</key>
548 // CHECK-NEXT: <key>edges</key>
631 // CHECK-NEXT: <key>edges</key>
[all...] |
| /external/clang/test/Analysis/diagnostics/ |
| report-issues-within-main-file.cpp | 124 // CHECK-NEXT: <key>edges</key>
187 // CHECK-NEXT: <key>edges</key>
313 // CHECK-NEXT: <key>edges</key>
390 // CHECK-NEXT: <key>edges</key>
453 // CHECK-NEXT: <key>edges</key>
579 // CHECK-NEXT: <key>edges</key>
642 // CHECK-NEXT: <key>edges</key>
725 // CHECK-NEXT: <key>edges</key>
[all...] |
| /external/opencv/cxcore/src/ |
| cxdatastructs.cpp | 2881 CvSet *edges = 0; local
[all...] |
| /external/opencv3/modules/core/src/ |
| datastructs.cpp | 2574 CvSet *edges = 0; local
[all...] |
| /external/opencv/cvaux/include/ |
| cvaux.h | 257 // but it verifies some relations between quad-edges
362 // CV_WEIGHTED_EDGE - the same but edges
363 // CV_WEIGHTED_ALL - the same but both edges and vertices
371 // weights of edges ought to be supplied. If weight_edge is not zero
373 // edges of graph to be inherited from CvGraphWeightedEdge.
376 // absent edges should be zero.
401 // CV_WEIGHTED_EDGE - the same but edges
402 // CV_WEIGHTED_ALL - the same but both edges and vertices
410 // weights of edges ought to be supplied. If weight_edge is not zero
412 // edges of graph to be inherited from CvGraphWeightedEdge
[all...] |
| /external/guava/guava/src/com/google/common/util/concurrent/ |
| CycleDetectingLockFactory.java | 102 * <li>If a new edge needs to be created, the outgoing edges of the acquired
135 * In order to allow proper garbage collection of unused locks, the edges of
533 // For pre-populated disallowedPriorLocks edges, omit the stack trace.
616 * the directed edges in the lock acquisition graph.
701 // "safe" edges which together form a cycle. Preventing this race
718 * Performs a depth-first traversal of the graph edges defined by each
736 // Recurse the edges.
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 472 /// of the edges being split is an exit of a loop with other exits).
501 // Move the edges from Preds to point to NewBB instead of BB.
542 /// case where one of the edges being split is an exit of a loop with other
564 // Move the edges from Preds to point to NewBB1 instead of OrigBB.
581 // Move the remaining edges from OrigBB to point to NewBB2.
605 // Move the remaining edges from OrigBB to point to NewBB2.
[all...] |
| /ndk/build/core/ |
| definitions-graph.mk | 266 # For topological sort, we need to count the number of incoming edges
270 # Count the number of incoming edges for each node during topological
274 # 2 edges -> 'xx'
275 # 3 edges -> 'xxx'
294 # Find first node in a list that has zero incoming edges.
296 # Out: first node that has zero incoming edges, or empty.
329 # Given a closure list of nodes, count their incoming edges.
|
| /packages/apps/Gallery2/src/com/android/gallery3d/ui/ |
| PositionController.java | 671 int edges = getImageAtEdges(); local
672 if ((velocityX > 0 && (edges & IMAGE_AT_LEFT_EDGE) != 0) ||
673 (velocityX < 0 && (edges & IMAGE_AT_RIGHT_EDGE) != 0)) {
676 if ((velocityY > 0 && (edges & IMAGE_AT_TOP_EDGE) != 0) ||
677 (velocityY < 0 && (edges & IMAGE_AT_BOTTOM_EDGE) != 0)) {
1217 int edges = 0; local
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineBasicBlock.cpp | 416 // A block with no successors has no concerns with fall-through edges.
443 // fall-through edges to be concerned with.
739 // jumps to the same MBB is either case. We have duplicate CFG edges in that
741 // code, just skip those edges.
[all...] |
| MachineBlockPlacement.cpp | 135 /// block chains for SCC-formation and iteration. We store the edges to child
247 /// allow implicitly defining edges between chains as the existing edges
355 // Disregard edges within a fixed chain, or edges to the loop header.
373 /// very hot successor edges.
385 // Adjust edge probabilities by excluding edges pointing to blocks that is
[all...] |
| /external/clang/test/Analysis/inlining/ |
| eager-reclamation-path-notes.cpp | 44 // CHECK-NEXT: <key>edges</key>
121 // CHECK-NEXT: <key>edges</key>
213 // CHECK-NEXT: <key>edges</key>
276 // CHECK-NEXT: <key>edges</key>
310 // CHECK-NEXT: <key>edges</key>
|
| /frameworks/support/design/res/values/ |
| attrs.xml | 107 <!-- The preferred padding along all edges of tabs. -->
166 <!-- Additional option that can be set to have the top and/or bottom edges of
169 edge, a bottom gravity will clip the top edge, and neither will clip both edges. -->
171 <!-- Additional option that can be set to have the left and/or right edges of
174 edge, a right gravity will clip the left edge, and neither will clip both edges. -->
|
| /prebuilts/sdk/current/support/design/res/values/ |
| attrs.xml | 107 <!-- The preferred padding along all edges of tabs. -->
166 <!-- Additional option that can be set to have the top and/or bottom edges of
169 edge, a bottom gravity will clip the top edge, and neither will clip both edges. -->
171 <!-- Additional option that can be set to have the left and/or right edges of
174 edge, a right gravity will clip the left edge, and neither will clip both edges. -->
|
| /development/perftests/panorama/feature_mos/src/mosaic/ |
| Delaunay.cpp | 40 int CDelaunay::triangulate(SEdgeVector **edges, int n_sites, int width, int height)
47 *edges = ev;
608 // Throw out any edges that are too far apart
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| PlistDiagnostics.cpp | 95 // Emit edges.
96 Indent(o, indent) << "<key>edges</key>\n";
105 // Make the ranges of the start and end point self-consistent with adjacent edges
|
| /external/libavc/common/arm/ |
| ih264_deblk_chroma_a9.s | 66 @* "Filtering process for edges for bS equal to 4" in ITU T Rec H.264.
142 @* "Filtering process for edges for bS equal to 4" in ITU T Rec H.264.
236 @* "Filtering process for edges for bS equal to 4" in ITU T Rec H.264.
338 @* "Filtering process for edges for bS equal to 4" in ITU T Rec H.264.
477 @* "Filtering process for edges for bS equal to 4" in ITU T Rec H.264.
555 @* "Filtering process for edges for bS equal to 4" in ITU T Rec H.264.
668 @* "Filtering process for edges for bS equal to 4" in ITU T Rec H.264.
755 @* "Filtering process for edges for bS equal to 4" in ITU T Rec H.264.
860 @* "Filtering process for edges for bS equal to 4" in ITU T Rec H.264.
[all...] |
| /external/llvm/include/llvm/ADT/ |
| PostOrderIterator.h | 45 // edges can be pruned by returning false in the insertEdge() function. This
46 // could be used to remove loop back-edges from the CFG seen by po_iterator.
79 // Graph edges can be pruned by specializing this function.
|
| /external/v8/src/compiler/ |
| scheduler.cc | 158 // Make sure that control edges from coupled nodes are not counted.
181 // Make sure that control edges from coupled nodes are not counted.
211 // Internal class to build a control flow graph (i.e the basic blocks and edges
212 // between them within a Schedule) from the node graph. Visits control edges of
229 // backwards from end through control edges, building and connecting the
784 // edges that lead out of loops. Visits each block once, but linking loop
797 // Process additional outgoing edges from the loop header.
805 // Pop the loop stack and continue visiting outgoing edges within
809 // and later iterations will go through its outgoing edges list.
830 // Add it to the outgoing edges of this loop and visit it later
[all...] |
