| /external/chromium_org/third_party/skia/src/pathops/ |
| SkIntersectionHelper.h | 21 fContour->addCoincident(fIndex, other.fContour, other.fIndex, ts, swap);
27 fContour->addOtherT(fIndex, index, otherT, otherIndex);
36 return fContour->addT(fIndex, other.fContour, other.fIndex, pt, newT);
40 return fContour->addSelfT(fIndex, other.fContour, other.fIndex, pt, newT);
45 return fContour->addUnsortableT(fIndex, other.fContour, other.fIndex, start, pt, newT);
49 return ++fIndex < fLast
[all...] |
| /external/skia/src/pathops/ |
| SkIntersectionHelper.h | 21 fContour->addCoincident(fIndex, other.fContour, other.fIndex, ts, swap);
27 fContour->addOtherT(fIndex, index, otherT, otherIndex);
36 return fContour->addT(fIndex, other.fContour, other.fIndex, pt, newT);
40 return fContour->addSelfT(fIndex, other.fContour, other.fIndex, pt, newT);
45 return fContour->addUnsortableT(fIndex, other.fContour, other.fIndex, start, pt, newT);
49 return ++fIndex < fLast
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkPtrRecorder.cpp | 41 return fList[index].fIndex;
57 pair.fIndex = count + 1;
61 return fList[index].fIndex;
70 // p->fIndex is base-1, so we need to subtract to find its slot
72 int index = p[i].fIndex - 1;
|
| SkMath.cpp | 456 int findex = radians & (kTableSize * 256 - 1); local
457 int index = findex >> 8;
458 int partial = findex & 255;
461 findex = kTableSize * 256 - findex - 1;
462 index = findex >> 8;
463 partial = findex & 255;
|
| SkPtrRecorder.h | 68 uint32_t fIndex; // 1...N
73 // ptr and its ID/fIndex explicitly, since the ptr's position in the array
|
| SkPictureFlat.cpp | 98 fIndex = index;
|
| /external/skia/src/core/ |
| SkPtrRecorder.cpp | 41 return fList[index].fIndex;
57 pair.fIndex = count + 1;
61 return fList[index].fIndex;
70 // p->fIndex is base-1, so we need to subtract to find its slot
72 int index = p[i].fIndex - 1;
|
| SkMath.cpp | 456 int findex = radians & (kTableSize * 256 - 1); local
457 int index = findex >> 8;
458 int partial = findex & 255;
461 findex = kTableSize * 256 - findex - 1;
462 index = findex >> 8;
463 partial = findex & 255;
|
| SkPtrRecorder.h | 68 uint32_t fIndex; // 1...N
73 // ptr and its ID/fIndex explicitly, since the ptr's position in the array
|
| SkPictureFlat.cpp | 98 fIndex = index;
|
| /external/icu4c/i18n/ |
| regeximp.cpp | 66 fChars(chars), fIndex(start), fLimit(limit), fcsp(NULL), fFoldChars(NULL), fFoldLength(0) {
80 if (fIndex >= fLimit) {
83 U16_NEXT(fChars, fIndex, fLimit, originalC);
113 return fIndex;
|
| /external/skia/tools/ |
| bench_pictures_main.cpp | 97 for (size_t fIndex = 0; fIndex < kFilterFlagsCount; ++fIndex) {
99 if (all & (1 << fIndex)) {
103 if (drawFilters[tIndex] & (1 << fIndex)) {
114 result += gFilterFlags[fIndex];
255 for (size_t fIndex = 0; fIndex < kFilterFlagsCount; ++fIndex) {
256 if (flagLen == strlen(gFilterFlags[fIndex])
[all...] |
| /external/chromium_org/third_party/skia/src/utils/ |
| SkNWayCanvas.cpp | 49 fIndex = 0;
52 if (fIndex < fList.count()) {
53 fCanvas = fList[fIndex++];
62 int fIndex;
|
| /external/skia/src/utils/ |
| SkNWayCanvas.cpp | 49 fIndex = 0;
52 if (fIndex < fList.count()) {
53 fCanvas = fList[fIndex++];
62 int fIndex;
|
| /external/iproute2/netem/ |
| maketable.c | 139 double findex, fvalue; local
146 findex = ((double)i/(double)DISTTABLEGRANULARITY) - DISTTABLEDOMAIN;
149 inversevalue = (int)rint(findex*TABLEFACTOR);
|
| /external/chromium_org/third_party/skia/src/utils/debugger/ |
| SkDebugCanvas.cpp | 34 fIndex = 0;
55 fIndex = fCommandVector.count() - 1;
142 if (fIndex < index) {
143 i = fIndex + 1;
196 fIndex = index;
|
| /external/skia/src/utils/debugger/ |
| SkDebugCanvas.cpp | 34 fIndex = 0;
55 fIndex = fCommandVector.count() - 1;
142 if (fIndex < index) {
143 i = fIndex + 1;
196 fIndex = index;
|
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
| Antlr.Runtime.Collections.pas | 86 FIndex: Integer;
297 if (FIndex < FOrderList.Count) then
299 FPair.Key := FOrderList[FIndex];
301 Inc(FIndex);
|
| Antlr.Runtime.Tools.pas | 274 FIndex: Integer;
897 FIndex := -1;
913 Result.Key := FDictionary.FItems[FIndex].Key;
914 Result.Value := FDictionary.FItems[FIndex].Value;
919 while FIndex < Length(FDictionary.FItems) - 1 do
921 Inc(FIndex);
922 if FDictionary.FItems[FIndex].HashCode <> 0 then
|
| /external/chromium_org/third_party/skia/src/sfnt/ |
| SkOTTable_name.h | 552 Iterator(const SkOTTableName& name) : fName(name), fIndex(0), fType(-1) { }
554 : fName(name), fIndex(0), fType(type)
558 fIndex = 0;
571 size_t fIndex;
|
| /external/skia/src/sfnt/ |
| SkOTTable_name.h | 552 Iterator(const SkOTTableName& name) : fName(name), fIndex(0), fType(-1) { }
554 : fName(name), fIndex(0), fType(type)
558 fIndex = 0;
571 size_t fIndex;
|
| /external/libffi/doc/ |
| libffi.texi | 127 @findex ffi_prep_cif
156 @findex ffi_call
433 @findex FFI_CLOSURES
440 @findex ffi_closure_alloca
449 @findex ffi_closure_free
460 @findex ffi_prep_closure_loc
|
| /external/bison/doc/ |
| bison.texi | 734 @findex %glr-parser
[all...] |
| /ndk/sources/host-tools/make-3.81/doc/ |
| make.texi | [all...] |
| /external/chromium_org/third_party/icu/source/common/ |
| uresbund.c | [all...] |
