| /external/llvm/docs/ |
| BlockFrequencyTerminology.rst | 26 Weights are relative to the other edges of a given predecessor block. The
28 the sum of the weights on the predecessor's outgoing edges.
|
| /external/llvm/include/llvm/Analysis/ |
| SparsePropagation.h | 126 /// KnownFeasibleEdges - Entries in this set are edges which have already had
170 /// edges into the basic block. This is generally only useful when
|
| /external/llvm/lib/CodeGen/ |
| MachineSink.cpp | 42 cl::desc("Split critical edges during machine sinking"),
52 STATISTIC(NumSplit, "Number of critical edges split");
66 // Remember which edges have been considered for breaking.
69 // Remember which edges we are about to split.
70 // This is different from CEBCandidates since those edges
113 /// We do not split the edges on the fly. Indeed, this invalidates
418 // It's not always legal to break critical edges and sink the computation
456 // sources are only defined on the specific predecessor edges.
|
| PHIElimination.cpp | 46 SplitAllCriticalEdges("phi-elim-split-all-critical-edges", cl::init(false),
47 cl::Hidden, cl::desc("Split all critical edges during "
85 /// Split critical edges where necessary for good coalescer performance.
110 STATISTIC(NumCriticalEdgesSplit, "Number of critical edges split");
142 // Split critical edges to help the coalescer. This does not yet support
253 // Can we reuse an earlier PHI node? This only happens for critical edges,
|
| /external/llvm/lib/Transforms/Utils/ |
| LoopSimplify.cpp | 172 assert(!LoopBlocks.empty() && "No edges coming in from outside the loop?");
270 // We can't split indirectbr edges.
366 // Figure out which basic blocks contain back-edges to the loop header.
371 // Indirectbr edges cannot be split, so we must fail if we find one.
473 // unreachable we can just shamelessly delete those CFG edges!
675 // parent loop doesn't change (spliting edges doesn't count). If blocks,
676 // CFG edges, or other values in the parent loop change, then we need call
757 AU.addPreservedID(BreakCriticalEdgesID); // No critical edges added.
[all...] |
| /external/mesa3d/src/mesa/swrast/ |
| s_tritemp.h | 68 * over the triangle edges and interpolate ancillary data (such as Z,
289 * call it a ``major'' edge. The other two edges are the
292 * edges is horizontal or very close to horizontal, the
299 * the top and bottom edges meet. However, this forces us to
304 * and top edges. Since this magnitude depends on the sine of
305 * the angle between the two edges, its sign tells us whether
452 * the bottom edge. (Some edges may be degenerate.)
468 * until we check the other edges.)
[all...] |
| /external/opencv3/doc/py_tutorials/py_feature2d/py_features_meaning/ |
| py_features_meaning.markdown | 49 C and D are much more simpler. They are edges of the building. You can find an approximate location,
52 enough (It is good in jigsaw puzzle for comparing continuity of edges).
|
| /external/opencv3/doc/tutorials/imgproc/morph_lines_detection/ |
| moprh_lines_detection.md | 84 -# As you can see we are almost there. However, at that point you will notice that the edges of the notes are a bit rough. For that reason we need to refine the edges in order to obtain a smoother result:
|
| /external/opencv3/modules/imgproc/src/ |
| canny.cpp | 196 hysteresis (add weak edges if they are connected with strong edges)
216 // get edges
532 // now track the edges (hysteresis thresholding)
675 // now track the edges (hysteresis thresholding)
[all...] |
| /external/pdfium/third_party/freetype/src/cff/ |
| cf2hints.h | 102 * appropriate pixel alignment to stem edges.
105 * representing an edge. When edges are paired, as from stem hints, the
|
| /external/replicaisland/src/com/replica/replicaisland/ |
| CameraSystem.java | 186 * @return An x-coordinate that is guaranteed not to expose the edges of the world.
209 * @return A y-coordinate that is guaranteed not to expose the edges of the world.
|
| /external/skia/gm/ |
| convexpolyeffect.cpp | 138 // integer edges
140 // half-integer edges
|
| /frameworks/base/core/java/com/android/internal/widget/ |
| AutoScrollHelper.java | 59 * horizontal edges.
340 * <li>{@link #EDGE_TYPE_INSIDE} for edges that respond to touches inside
343 * <li>{@link #EDGE_TYPE_INSIDE_EXTEND} for inside edges that continued to
345 * <li>{@link #EDGE_TYPE_OUTSIDE} for edges that only respond to touches
360 * If both relative and maximum edges are specified, the maximum edge will
380 * If relative edge size is not specified, activation edges will always be
381 * the maximum edge size. If both relative and maximum edges are specified,
605 // For now, leading and trailing edges are always the same size.
[all...] |
| /frameworks/base/tools/layoutlib/bridge/src/android/view/ |
| RectShadowPainter.java | 74 // A rectangle with edges corresponding to the straight edges of the outline.
|
| /frameworks/support/v4/donut/android/support/v4/view/ |
| WindowInsetsCompat.java | 127 * <p>A round window's left, top, right and bottom edges reach all the way to the
128 * associated edges of the window but the corners may not be visible. Views responding
|
| /packages/apps/Camera2/src/com/android/camera/processing/imagebackend/ |
| TaskConvertImageToRGBPreview.java | 191 * also feathers the edges with 50% alpha on its edges. <br>
212 * apparent in sharp color edges. But since our eyes are pretty bad at color
213 * edges anyway, it may be an acceptable trade-off for run-time efficiency on an
346 // Do a little alpha feathering on the edges
528 * apparent in sharp color edges. But since our eyes are pretty bad at color
529 * edges anyway, it may be an acceptable trade-off for run-time efficiency on an
646 // Do a little alpha feathering on the edges
[all...] |
| /prebuilts/go/darwin-x86/src/go/types/ |
| initorder.go | 37 // (the one with the fewest dependencies) and its edges from the graph,
101 // such that there is a path (list of edges) from a to z.
|
| /prebuilts/go/linux-x86/src/go/types/ |
| initorder.go | 37 // (the one with the fewest dependencies) and its edges from the graph,
101 // such that there is a path (list of edges) from a to z.
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| ConstraintType.java | 158 * is one of the parent edges (actual edge, not center/baseline segments)
168 * Returns a {@link ConstraintType} for a potential match of edges.
|
| ResizeHandler.java | 45 * edges in a RelativeLayout.
158 // must always use positive margins, so mark closer edges that result in a negative
|
| /system/update_engine/payload_generator/ |
| cycle_breaker.cc | 42 // Make a copy, which we will modify by removing edges. Thus, in each
78 // Set subgraph edges for the components in the SCC.
|
| /external/clang/test/Analysis/inlining/ |
| path-notes.c | 193 // CHECK-NEXT: <key>edges</key>
285 // CHECK-NEXT: <key>edges</key>
368 // CHECK-NEXT: <key>edges</key>
431 // CHECK-NEXT: <key>edges</key>
465 // CHECK-NEXT: <key>edges</key>
577 // CHECK-NEXT: <key>edges</key>
611 // CHECK-NEXT: <key>edges</key>
674 // CHECK-NEXT: <key>edges</key>
708 // CHECK-NEXT: <key>edges</key>
[all...] |
| /external/clang/test/Analysis/ |
| NewDelete-path-notes.cpp | 37 // CHECK-NEXT: <key>edges</key>
100 // CHECK-NEXT: <key>edges</key>
134 // CHECK-NEXT: <key>edges</key>
197 // CHECK-NEXT: <key>edges</key>
323 // CHECK-NEXT: <key>edges</key>
415 // CHECK-NEXT: <key>edges</key>
|
| /external/libhevc/decoder/ |
| ihevcd_sao.c | [all...] |
| /external/opencv3/modules/shape/src/ |
| emdL1.cpp | 185 //- initialize edges
210 //- initialize nodes and edges
219 //- initialize edges
283 nNBV = 0; // number of NON-BV edges
385 nNBV = 0; // number of NON-BV edges
552 // test each NON-BV edges
|
