/external/chromium_org/tools/gyp/test/mac/type_envvars/ |
H A D | test_check_sdkroot.sh | 33 # Returns true if |string1| is smaller than |string2|. 36 function smaller() { function
|
/external/chromium_org/third_party/skia/tests/ |
H A D | PDFJpegEmbedTest.cpp | 28 static bool is_subset_of(SkData* smaller, SkData* larger) { argument 29 SkASSERT(smaller && larger); 30 if (smaller->size() > larger->size()) { 33 size_t size = smaller->size(); 36 if (0 == memcmp(larger->bytes() + i, smaller->bytes(), size)) {
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | CubicConvexHull.cpp | 52 Cubic smaller, larger; local 54 sub_divide(cubic1, minT1, maxT1, intersections.swapped() ? larger : smaller); 55 sub_divide(cubic2, minT2, maxT2, intersections.swapped() ? smaller : larger); 57 if (reduceOrder(smaller, smallResult, kReduceOrder_NoQuadraticsAllowed, 83 if (!bezier_clip(smaller, larger, minT, maxT)) {
|
H A D | QuadraticReduceOrder.cpp | 32 int smaller = reduction[1].y > reduction[0].y; local 33 int larger = smaller ^ 1; 36 if (reduction[smaller].y > yExtrema) { 37 reduction[smaller].y = yExtrema; 53 int smaller = reduction[1].x > reduction[0].x; local 54 int larger = smaller ^ 1; 57 if (reduction[smaller].x > xExtrema) { 58 reduction[smaller].x = xExtrema; 107 // sameSide > 0 means mid is smaller than either [0] or [2], so replace smaller [all...] |
H A D | CubicReduceOrder.cpp | 34 int smaller = reduction[1].y > reduction[0].y; local 35 int larger = smaller ^ 1; 39 if (reduction[smaller].y > yExtrema) { 40 reduction[smaller].y = yExtrema; 57 int smaller = reduction[1].x > reduction[0].x; local 58 int larger = smaller ^ 1; 62 if (reduction[smaller].x > xExtrema) { 63 reduction[smaller].x = xExtrema; 138 // sameSide > 0 means mid is smaller than either [0] or [3], so replace smaller [all...] |
H A D | QuadraticIntersection.cpp | 62 Quadratic smaller, larger; local 64 sub_divide(quad1, minT1, maxT1, intersections.swapped() ? larger : smaller); 65 sub_divide(quad2, minT2, maxT2, intersections.swapped() ? smaller : larger); 67 if (!bezier_clip(smaller, larger, minT, maxT)) {
|
/external/skia/experimental/Intersection/ |
H A D | CubicConvexHull.cpp | 52 Cubic smaller, larger; local 54 sub_divide(cubic1, minT1, maxT1, intersections.swapped() ? larger : smaller); 55 sub_divide(cubic2, minT2, maxT2, intersections.swapped() ? smaller : larger); 57 if (reduceOrder(smaller, smallResult, kReduceOrder_NoQuadraticsAllowed, 83 if (!bezier_clip(smaller, larger, minT, maxT)) {
|
H A D | QuadraticReduceOrder.cpp | 32 int smaller = reduction[1].y > reduction[0].y; local 33 int larger = smaller ^ 1; 36 if (reduction[smaller].y > yExtrema) { 37 reduction[smaller].y = yExtrema; 53 int smaller = reduction[1].x > reduction[0].x; local 54 int larger = smaller ^ 1; 57 if (reduction[smaller].x > xExtrema) { 58 reduction[smaller].x = xExtrema; 107 // sameSide > 0 means mid is smaller than either [0] or [2], so replace smaller [all...] |
H A D | CubicReduceOrder.cpp | 34 int smaller = reduction[1].y > reduction[0].y; local 35 int larger = smaller ^ 1; 39 if (reduction[smaller].y > yExtrema) { 40 reduction[smaller].y = yExtrema; 57 int smaller = reduction[1].x > reduction[0].x; local 58 int larger = smaller ^ 1; 62 if (reduction[smaller].x > xExtrema) { 63 reduction[smaller].x = xExtrema; 138 // sameSide > 0 means mid is smaller than either [0] or [3], so replace smaller [all...] |
H A D | QuadraticIntersection.cpp | 62 Quadratic smaller, larger; local 64 sub_divide(quad1, minT1, maxT1, intersections.swapped() ? larger : smaller); 65 sub_divide(quad2, minT2, maxT2, intersections.swapped() ? smaller : larger); 67 if (!bezier_clip(smaller, larger, minT, maxT)) {
|
/external/chromium_org/third_party/skia/src/gpu/ |
H A D | GrResourceCache.cpp | 129 bool smaller = (maxResources < fMaxCount) || (maxResourceBytes < fMaxBytes); local 134 if (smaller) {
|
/external/skia/src/gpu/ |
H A D | GrResourceCache.cpp | 129 bool smaller = (maxResources < fMaxCount) || (maxResourceBytes < fMaxBytes); local 134 if (smaller) {
|
/external/chromium_org/third_party/zlib/ |
H A D | trees.c | 449 #define smaller(tree, n, m, depth) \ macro 456 * when the heap property is re-established (each father smaller than its 469 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { 472 /* Exit if v is smaller than both sons */ 473 if (smaller(tree, v, s->heap[j], s->depth)) break;
|
/external/ltrace/ |
H A D | dict.c | 435 size_t smaller = smaller_size(n(dict)); local 436 if (smaller != n(dict)) 438 rehash(dict, smaller);
|
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/ |
H A D | fx_zlib_trees.c | 443 #define smaller(tree, n, m, depth) \ macro 450 * when the heap property is re-established (each father smaller than its 463 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { 466 /* Exit if v is smaller than both sons */ 467 if (smaller(tree, v, s->heap[j], s->depth)) break;
|
/external/qemu/distrib/zlib-1.2.8/ |
H A D | trees.c | 443 #define smaller(tree, n, m, depth) \ macro 450 * when the heap property is re-established (each father smaller than its 463 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { 466 /* Exit if v is smaller than both sons */ 467 if (smaller(tree, v, s->heap[j], s->depth)) break;
|
/external/zlib/src/ |
H A D | trees.c | 443 #define smaller(tree, n, m, depth) \ macro 450 * when the heap property is re-established (each father smaller than its 463 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { 466 /* Exit if v is smaller than both sons */ 467 if (smaller(tree, v, s->heap[j], s->depth)) break;
|
/external/chromium_org/third_party/WebKit/Source/core/css/ |
H A D | CSSGradientValue.cpp | 1077 float smaller = std::min(xDist, yDist); local 1078 xDist = smaller; 1079 yDist = smaller;
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | com.ibm.icu_4.2.1.v20100412.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |