| /external/deqp/modules/gles2/functional/ |
| es2fClippingTests.cpp | 174 // edges are considered a "deviation" too. The suitable pixel could be "behind" the edge
[all...] |
| /external/deqp/modules/gles3/functional/ |
| es3fClippingTests.cpp | 177 // edges are considered a "deviation" too. The suitable pixel could be "behind" the edge
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/ |
| vp9_loopfilter.c | 528 // These set 1 in the current block size for the block size edges.
546 // the loop filter on block edges.
819 // Internal edges are not applied on the last column of the image so
820 // we mask 1 more for the internal edges
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| params.def | 235 /* This is the threshold ratio of the critical edges execution count compared to
240 "The threshold ratio of critical edges execution count that permit performing redundancy elimination after reload",
426 /* The maximum number of incoming edges to consider for crossjumping. */
428 "max-crossjump-edges",
429 "The maximum number of incoming edges to consider for crossjumping",
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| ImageUtils.java | 128 * Crops blank pixels from the edges of the image and returns the cropped result. We
147 * Crops blank pixels from the edges of the image and returns the cropped result. We
173 * Crops pixels of a given color from the edges of the image and returns the cropped
194 * Crops pixels of a given color from the edges of the image and returns the cropped
259 // This algorithm is a bit dumb -- it just scans along the edges looking for
[all...] |
| /external/llvm/lib/Target/X86/ |
| X86FloatingPoint.cpp | 16 // to implement exact liveness tracking between basic blocks. The CFG edges are
21 // This approach avoids splitting critical edges at the potential cost of more
22 // live register shuffling instructions when critical edges are present.
84 // Two CFG edges are related if they leave the same block, or enter the same
86 // LiveBundle. It represents a set of CFG edges where the live FP stack
89 // A LiveBundle is usually all the edges leaving a block, or all the edges
90 // entering a block, but it can contain more edges if critical edges are
113 // Numbered LiveBundle structs. LiveBundles[0] is used for all CFG edges
[all...] |
| /frameworks/support/v17/tests/src/android/support/v17/leanback/widget/ |
| GridWidgetTest.java | 308 int[] edges = new int[sorted.length]; local
312 edges[i] = sorted[i][0].getLeft();
316 edges[i] = sorted[i][sorted[i].length - 1].getRight();
321 edges[i] = sorted[i][sorted[i].length - 1].getBottom();
324 return edges;
327 protected void verifyEdgesSame(int[] edges, int[] edges2) {
328 assertEquals(edges.length, edges2.length);
329 for (int i = 0; i < edges.length; i++) {
330 assertEquals(edges[i], edges2[i]);
641 // we should get same aligned end edges
[all...] |
| /external/libvpx/libvpx/vp9/common/ |
| vp9_loopfilter.c | 738 // These set 1 in the current block size for the block size edges.
756 // the loop filter on block edges.
[all...] |
| /art/compiler/optimizing/ |
| nodes.cc | 149 // (1) Find the back edges in the graph doing a DFS traversal.
253 // Once all the forward edges have been visited, we know the immediate
263 // Check if the graph has back edges not dominated by their respective headers.
407 // (1): Split critical edges.
415 // Only split normal-flow edges. We cannot split exceptional edges as they
456 // TODO: Dealing with exceptional back edges could be tricky because
611 // then we visit the back edges.
[all...] |
| /external/libavc/common/arm/ |
| ih264_deblk_luma_a9.s | 59 @* "Filtering process for edges for bS equal to 4" in ITU T Rec H.264.
199 @* "Filtering process for edges for bS equal to 4" in ITU T Rec H.264.
365 @* "Filtering process for edges for bS equal to 4" in ITU T Rec H.264.
586 @* "Filtering process for edges for bS equal to 4" in ITU T Rec H.264.
[all...] |
| /external/libavc/common/x86/ |
| ih264_deblk_luma_ssse3.c | 75 /* title "Filtering process for edges for bS equal to 4" in */
496 /* title "Filtering process for edges for bS equal to 4" in */
[all...] |
| /development/samples/training/InteractiveChart/src/com/example/android/interactivechart/ |
| InteractiveLineGraphView.java | 57 * indicate to users that they've reached the content edges after a pan or fling gesture. This
554 * Draws the overscroll "glow" at the four edges of the chart region, if necessary. The edges
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| DFAState.java | 422 * this to the work list and then have semantic predicate edges
713 // the indident edges.
721 // gated preds can be used with edges leading to accept states.
|
| DFAOptimizer.java | 87 * can do on cyclic DFAs to make them have fewer edges. Might have
|
| /external/llvm/lib/CodeGen/ |
| ExecutionDepsFix.cpp | 356 // Detect back-edges from predecessors we haven't processed yet.
435 // Also use LiveOuts as a visited set to detect back-edges.
771 // back-edges.
|
| TailDuplication.cpp | 788 // EH edges are ignored by AnalyzeBranch.
873 // This has to check PrevBB->succ_size() because EH edges are ignored by
[all...] |
| /external/skia/src/gpu/effects/ |
| GrRRectEffect.cpp | 156 // edges correspond to components x, y, z, and w, respectively. When a side of the rrect has
185 // fragments near the other three edges will get the correct AA. Fragments in the interior of
523 // fragments near the other three edges will get the correct AA. Fragments in the interior of
[all...] |
| /external/v8/src/full-codegen/ |
| full-codegen.h | 442 // This is meant to be called at loop back edges, |back_edge_target| is
[all...] |
| /development/samples/devbytes/animation/CardFlip/src/com/example/android/cardflip/ |
| CardView.java | 39 * This CardView object is a view which can flip horizontally about its edges,
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
| DFA.cs | 134 // what about predicated edges coming from EOT
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
| DFA.cs | 159 // what about predicated edges coming from EOT
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
| CodeGenerator.java | 662 * they have no emanating edges. Don't worry about switch vs if-then-else
708 stateST.add("edges", edgeST);
717 stateST.add("edges", eotST);
[all...] |
| /external/autotest/client/site_tests/firmware_TouchMTB/ |
| touch_device.py | 94 """Get the left, right, top, and bottom edges of the device."""
|
| /external/clang/lib/StaticAnalyzer/ |
| README.txt | 26 from exploding the control-flow edges in the control-flow graph (CFG).
|
| /external/freetype/src/autofit/ |
| afblue.dat | 208 // During the glyph analysis, edges are sorted from bottom to top, and then
|
