| /external/chromium_org/chrome/browser/ui/views/ |
| status_bubble_views.cc | 48 // The roundedness of the edges of our bubble.
365 // Top Edges - if the bubble is in its bottom position (sticking downwards),
366 // then we square the top edges. Otherwise, we square the edges based on the
399 // Bottom edges - square these off if the bubble is in its standard position
765 // and mate to the edges of the tab content).
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderFrameSet.cpp | 92 // Now stroke the edges but only if we have enough room to paint both edges with a little
111 // Now stroke the edges but only if we have enough room to paint both edges with a little
164 // To track edges for resizability and borders, we need to be (size + 1). This is because a parent frameset
165 // may ask us for information about our left/top/right/bottom edges in order to make its own decisions about
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| HeuristicSolver.h | 47 /// \brief Iterator type for edges in the solver graph.
141 /// \brief Begin iterator for the set of edges adjacent to the given node in
144 /// @return Begin iterator for the set of edges adjacent to the given node
150 /// \brief End iterator for the set of edges adjacent to the given node in
153 /// @return End iterator for the set of edges adjacent to the given node in
563 // Solve based on existing solved edges.
|
| /external/llvm/lib/CodeGen/ |
| PHIElimination.cpp | 44 SplitAllCriticalEdges("phi-elim-split-all-critical-edges", cl::init(false),
45 cl::Hidden, cl::desc("Split all critical edges during "
79 /// Split critical edges where necessary for good coalescer performance.
104 STATISTIC(NumCriticalEdgesSplit, "Number of critical edges split");
136 // Split critical edges to help the coalescer. This does not yet support
250 // Can we reuse an earlier PHI node? This only happens for critical edges,
|
| MachineBasicBlock.cpp | 388 // A block with no successors has no concerns with fall-through edges.
415 // fall-through edges to be concerned with.
689 // jumps to the same MBB is either case. We have duplicate CFG edges in that
691 // code, just skip those edges.
[all...] |
| MachineSink.cpp | 37 cl::desc("Split critical edges during machine sinking"),
41 STATISTIC(NumSplit, "Number of critical edges split");
53 // Remember which edges have been considered for breaking.
338 // It's not always legal to break critical edges and sink the computation
376 // sources are only defined on the specific predecessor edges.
|
| /external/llvm/lib/Target/Mips/ |
| Mips16ISelLowering.cpp | 514 // Transfer the remainder of BB and its successor edges to sinkMBB.
532 // Update machine-CFG edges
577 // Transfer the remainder of BB and its successor edges to sinkMBB.
596 // Update machine-CFG edges
642 // Transfer the remainder of BB and its successor edges to sinkMBB.
661 // Update machine-CFG edges
|
| /external/clang/test/Analysis/diagnostics/ |
| report-issues-within-main-file.cpp | 123 // CHECK-NEXT: <key>edges</key>
186 // CHECK-NEXT: <key>edges</key>
309 // CHECK-NEXT: <key>edges</key>
386 // CHECK-NEXT: <key>edges</key>
449 // CHECK-NEXT: <key>edges</key>
572 // CHECK-NEXT: <key>edges</key>
635 // CHECK-NEXT: <key>edges</key>
715 // CHECK-NEXT: <key>edges</key>
778 // CHECK-NEXT: <key>edges</key>
[all...] |
| /external/clang/test/Analysis/ |
| objc-arc.m | 270 // CHECK-NEXT: <key>edges</key>
304 // CHECK-NEXT: <key>edges</key>
384 // CHECK-NEXT: <key>edges</key>
447 // CHECK-NEXT: <key>edges</key>
481 // 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>
424 // CHECK-NEXT: <key>edges</key>
458 // CHECK-NEXT: <key>edges</key>
492 // CHECK-NEXT: <key>edges</key>
572 // CHECK-NEXT: <key>edges</key>
652 // CHECK-NEXT: <key>edges</key>
732 // CHECK-NEXT: <key>edges</key
[all...] |
| method-call-path-notes.cpp | 81 // CHECK-NEXT: <key>edges</key>
190 // CHECK-NEXT: <key>edges</key>
270 // CHECK-NEXT: <key>edges</key>
333 // CHECK-NEXT: <key>edges</key>
413 // CHECK-NEXT: <key>edges</key>
476 // CHECK-NEXT: <key>edges</key>
585 // CHECK-NEXT: <key>edges</key>
665 // CHECK-NEXT: <key>edges</key>
728 // CHECK-NEXT: <key>edges</key>
[all...] |
| /external/opencv/cxcore/src/ |
| cxdatastructs.cpp | 2881 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/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 437 /// of the edges being split is an exit of a loop with other exits).
449 // Move the edges from Preds to point to NewBB instead of BB.
489 /// case where one of the edges being split is an exit of a loop with other
509 // Move the edges from Preds to point to NewBB1 instead of OrigBB.
526 // Move the remaining edges from OrigBB to point to NewBB2.
549 // Move the remaining edges from OrigBB to point to NewBB2.
724 // doesn't have incoming edges from other blocks. If it does, the condition
|
| /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/chromium_org/cc/resources/ |
| picture_layer_tiling.cc | 274 // edges.
670 // Compute the delta to expand from edges to cover target_area.
680 // Compute the delta for our edges using the quadratic equation.
741 // In the beginning we will consider 2 edges in each dimension.
773 // Apply the delta to the edges and edge events.
|
| /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>
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineBasicBlock.h | 362 /// Note that duplicate Machine CFG edges are not allowed.
568 /// CorrectExtraCFGEdges - Various pieces of code can cause excess edges in
571 /// DestB can be null. Besides DestA and DestB, retain other edges leading
705 // to be when traversing the predecessor edges of a MBB
706 // instead of the successor edges.
|
| /external/chromium/chrome/browser/ui/views/location_bar/ |
| location_bar_view.h | 262 // Thickness of the left and right edges of the omnibox, in normal mode.
264 // Thickness of the top and bottom edges of the omnibox.
270 // Space between the edges and the items next to them.
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkOpSegment.h | 36 // when the edges are initially walked, they don't automatically get the prior and next
37 // edges assigned to positions t=0 and t=1. Doing that would remove the need for this check,
38 // and would additionally remove the need for similar checks in condition edges. It would
|
| /external/chromium_org/ui/views/ |
| painter.cc | 245 // In case the corners and edges don't all have the same width/height, we draw
246 // the center first, and extend it out in all directions to the edges of the
248 // unpainted areas, though some corners or edges might overlap the center.
|
| /external/llvm/include/llvm/ADT/ |
| PostOrderIterator.h | 44 // edges can be pruned by returning false in the insertEdge() function. This
45 // could be used to remove loop back-edges from the CFG seen by po_iterator.
78 // Graph edges can be pruned by specializing this function.
|
| /external/skia/src/pathops/ |
| SkOpSegment.h | 36 // when the edges are initially walked, they don't automatically get the prior and next
37 // edges assigned to positions t=0 and t=1. Doing that would remove the need for this check,
38 // and would additionally remove the need for similar checks in condition edges. It would
|
| /hardware/ti/omap3/omx/video/src/openmax_il/video_encode/inc/ |
| OMX_VideoEnc_DSP.h | 104 FILTER_ALL_EDGES = 0, /* Enable filtering of all the edges*/
105 DISABLE_FILTER_ALL_EDGES, /* Disable filtering of all the edges*/
106 DISABLE_FILTER_SLICE_EDGES /* Disable filtering of slice edges */
|
