Searched refs:fIsCoincident (Results 1 - 14 of 14) sorted by relevance
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | Intersections.h | 22 bzero(fIsCoincident, sizeof(fIsCoincident)); 28 if (!fIsCoincident[0]) { 29 SkASSERT(!fIsCoincident[0]); 35 if (fIsCoincident[0] & (1 << index)) { 39 if (fIsCoincident[1] & (1 << index)) { 64 fIsCoincident[0] |= bit; 65 fIsCoincident[1] |= bit; 130 unsigned short fIsCoincident[2]; // bit arrays, one bit set for each coincident T member in class:Intersections
|
H A D | Intersections.cpp | 23 while (i1 < fUsed && !(fIsCoincident[fSwap] & (1 << i1))) { 31 while (!(fIsCoincident[fSwap] & (1 << iEnd1))) { 41 while (i2 < fUsed && !(fIsCoincident[fSwap ^ 1] & (1 << i2))) { 45 while (!(fIsCoincident[fSwap ^ 1] & (1 << iEnd2))) { 124 fIsCoincident[0] += fIsCoincident[0] & ~((1 << index) - 1); 125 fIsCoincident[1] += fIsCoincident[1] & ~((1 << index) - 1); 136 if (!(fIsCoincident[0] & (1 << index)) && (between(one, fT[fSwap][index], two) 153 SkASSERT(fIsCoincident[ [all...] |
H A D | CubicIntersection.cpp | 134 if (locals.fIsCoincident[0] & 1 << tIdx) {
|
H A D | Simplify.cpp | 5756 && ts.fIsCoincident[0]) {
|
/external/skia/experimental/Intersection/ |
H A D | Intersections.h | 22 bzero(fIsCoincident, sizeof(fIsCoincident)); 28 if (!fIsCoincident[0]) { 29 SkASSERT(!fIsCoincident[0]); 35 if (fIsCoincident[0] & (1 << index)) { 39 if (fIsCoincident[1] & (1 << index)) { 64 fIsCoincident[0] |= bit; 65 fIsCoincident[1] |= bit; 130 unsigned short fIsCoincident[2]; // bit arrays, one bit set for each coincident T member in class:Intersections
|
H A D | Intersections.cpp | 23 while (i1 < fUsed && !(fIsCoincident[fSwap] & (1 << i1))) { 31 while (!(fIsCoincident[fSwap] & (1 << iEnd1))) { 41 while (i2 < fUsed && !(fIsCoincident[fSwap ^ 1] & (1 << i2))) { 45 while (!(fIsCoincident[fSwap ^ 1] & (1 << iEnd2))) { 124 fIsCoincident[0] += fIsCoincident[0] & ~((1 << index) - 1); 125 fIsCoincident[1] += fIsCoincident[1] & ~((1 << index) - 1); 136 if (!(fIsCoincident[0] & (1 << index)) && (between(one, fT[fSwap][index], two) 153 SkASSERT(fIsCoincident[ [all...] |
H A D | CubicIntersection.cpp | 134 if (locals.fIsCoincident[0] & 1 << tIdx) {
|
H A D | Simplify.cpp | 5756 && ts.fIsCoincident[0]) {
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkIntersections.cpp | 31 if (!fIsCoincident[0]) { 32 SkASSERT(!fIsCoincident[1]); 38 if (fIsCoincident[0] & (1 << index)) { 42 if (fIsCoincident[1] & (1 << index)) { 65 if (fIsCoincident[0] == 3 && between(fT[0][0], one, fT[0][1])) { 110 fIsCoincident[0] += fIsCoincident[0] & clearMask; 111 fIsCoincident[1] += fIsCoincident[1] & clearMask; 132 fIsCoincident[ [all...] |
H A D | SkIntersections.h | 26 sk_bzero(fIsCoincident, sizeof(fIsCoincident)); 109 return (fIsCoincident[0] & 1 << index) != 0; 279 uint16_t fIsCoincident[2]; // bit set for each curve's coincident T member in class:SkIntersections
|
H A D | SkDCubicIntersection.cpp | 279 fIsCoincident[0] = fIsCoincident[1] = 0x03; 652 fIsCoincident[0] = 0x03; 653 fIsCoincident[1] = 0x03;
|
/external/skia/src/pathops/ |
H A D | SkIntersections.cpp | 31 if (!fIsCoincident[0]) { 32 SkASSERT(!fIsCoincident[1]); 38 if (fIsCoincident[0] & (1 << index)) { 42 if (fIsCoincident[1] & (1 << index)) { 65 if (fIsCoincident[0] == 3 && between(fT[0][0], one, fT[0][1])) { 110 fIsCoincident[0] += fIsCoincident[0] & clearMask; 111 fIsCoincident[1] += fIsCoincident[1] & clearMask; 132 fIsCoincident[ [all...] |
H A D | SkIntersections.h | 26 sk_bzero(fIsCoincident, sizeof(fIsCoincident)); 109 return (fIsCoincident[0] & 1 << index) != 0; 279 uint16_t fIsCoincident[2]; // bit set for each curve's coincident T member in class:SkIntersections
|
H A D | SkDCubicIntersection.cpp | 279 fIsCoincident[0] = fIsCoincident[1] = 0x03; 652 fIsCoincident[0] = 0x03; 653 fIsCoincident[1] = 0x03;
|
Completed in 1777 milliseconds