HomeSort by relevance Sort by last modified time
    Searched refs:Rec (Results 1 - 25 of 127) sorted by null

1 2 3 4 5 6

  /external/chromium_org/third_party/skia/include/core/
SkTDStack.h 25 Rec* rec = fRec; local
26 while (rec != &fInitialRec) {
27 Rec* next = rec->fNext;
28 sk_free(rec);
29 rec = next;
40 Rec* rec = (Rec*)sk_malloc_throw(sizeof(Rec)) local
83 Rec* rec = fRec->fNext; local
    [all...]
SkMetaData.h 128 struct Rec;
150 Rec* fRec;
154 struct Rec {
155 Rec* fNext;
165 static Rec* Alloc(size_t);
166 static void Free(Rec*);
168 Rec* fRec;
170 const Rec* find(const char name[], Type) const;
  /external/skia/include/core/
SkTDStack.h 25 Rec* rec = fRec; local
26 while (rec != &fInitialRec) {
27 Rec* next = rec->fNext;
28 sk_free(rec);
29 rec = next;
40 Rec* rec = (Rec*)sk_malloc_throw(sizeof(Rec)) local
83 Rec* rec = fRec->fNext; local
    [all...]
SkMetaData.h 128 struct Rec;
150 Rec* fRec;
154 struct Rec {
155 Rec* fNext;
165 static Rec* Alloc(size_t);
166 static void Free(Rec*);
168 Rec* fRec;
170 const Rec* find(const char name[], Type) const;
  /external/chromium_org/third_party/skia/src/core/
SkResourceCache.h 60 struct Rec {
63 Rec() {}
64 virtual ~Rec() {}
73 static const Key& GetKey(const Rec& rec) { return rec.getKey(); }
76 Rec* fNext;
77 Rec* fPrev;
82 typedef const Rec* ID;
86 * specified Key, and will pass in the corresponding Rec, along with a caller-specifie
    [all...]
SkMetaData.cpp 46 Rec* rec = fRec; local
47 while (rec) {
48 if (kPtr_Type == rec->fType) {
49 PtrPair* pair = (PtrPair*)rec->data();
54 Rec* next = rec->fNext;
55 Rec::Free(rec);
56 rec = next
65 const Rec* rec = src.fRec; local
120 Rec* rec = Rec::Alloc(sizeof(Rec) + dataSize * count + len + 1); local
147 const Rec* rec = this->find(name, kS32_Type); local
160 const Rec* rec = this->find(name, kScalar_Type); local
173 const Rec* rec = this->find(name, kScalar_Type); local
186 const Rec* rec = this->find(name, kPtr_Type); local
203 const Rec* rec = this->find(name, kString_Type); local
210 const Rec* rec = this->find(name, kBool_Type); local
222 const Rec* rec = this->find(name, kData_Type); local
235 const Rec* rec = fRec; local
246 Rec* rec = fRec; local
    [all...]
SkTypefaceCache.h 92 struct Rec {
97 SkTDArray<Rec> fArray;
SkTypefaceCache.cpp 19 const Rec* curr = fArray.begin();
20 const Rec* stop = fArray.end();
38 Rec* rec = fArray.append(); local
39 rec->fFace = face;
40 rec->fRequestedStyle = requestedStyle;
41 rec->fStrong = strong;
50 const Rec* curr = fArray.begin();
51 const Rec* stop = fArray.end();
62 const Rec* curr = fArray.begin()
    [all...]
SkResourceCache.cpp 35 public SkTDynamicHash<SkResourceCache::Rec, SkResourceCache::Key> {};
91 bool SkOneShotDiscardablePixelRef::onNewLockPixels(LockRec* rec) {
112 rec->fPixels = fDM->data();
113 rec->fColorTable = NULL;
114 rec->fRowBytes = fRB;
179 Rec* rec = fHead; local
180 while (rec) {
181 Rec* next = rec->fNext
191 Rec* rec = fHash->find(key); local
245 Rec* rec = fTail; local
349 const Rec* rec = fHead; local
    [all...]
SkTextToPathIter.h 25 struct Rec {
  /external/skia/include/effects/
SkLayerDrawLooper.h 80 virtual bool asABlurShadow(BlurShadowRec* rec) const SK_OVERRIDE;
94 struct Rec {
95 Rec* fNext;
99 Rec* fRecs;
100 Rec* fTopRec;
112 Rec* fCurrRec;
157 Rec* fRecs;
158 Rec* fTopRec;
  /external/skia/src/core/
SkScaledImageCache.h 175 struct Rec;
178 Rec* fHead;
179 Rec* fTail;
193 Rec* findAndLock(uint32_t generationID, SkScalar sx, SkScalar sy,
195 Rec* findAndLock(const Key& key);
196 ID* addAndLock(Rec* rec);
198 void purgeRec(Rec*);
202 void moveToHead(Rec*);
203 void addToHead(Rec*);
    [all...]
SkMetaData.cpp 46 Rec* rec = fRec; local
47 while (rec) {
48 if (kPtr_Type == rec->fType) {
49 PtrPair* pair = (PtrPair*)rec->data();
54 Rec* next = rec->fNext;
55 Rec::Free(rec);
56 rec = next
65 const Rec* rec = src.fRec; local
120 Rec* rec = Rec::Alloc(sizeof(Rec) + dataSize * count + len + 1); local
147 const Rec* rec = this->find(name, kS32_Type); local
160 const Rec* rec = this->find(name, kScalar_Type); local
173 const Rec* rec = this->find(name, kScalar_Type); local
186 const Rec* rec = this->find(name, kPtr_Type); local
203 const Rec* rec = this->find(name, kString_Type); local
210 const Rec* rec = this->find(name, kBool_Type); local
222 const Rec* rec = this->find(name, kData_Type); local
235 const Rec* rec = fRec; local
246 Rec* rec = fRec; local
    [all...]
SkScaledImageCache.cpp 24 static inline SkScaledImageCache::ID* rec_to_id(SkScaledImageCache::Rec* rec) {
25 return reinterpret_cast<SkScaledImageCache::ID*>(rec);
28 static inline SkScaledImageCache::Rec* id_to_rec(SkScaledImageCache::ID* id) {
29 return reinterpret_cast<SkScaledImageCache::Rec*>(id);
102 struct SkScaledImageCache::Rec {
103 Rec(const Key& key, const SkBitmap& bm) : fKey(key), fBitmap(bm) {
108 Rec(const Key& key, const SkMipMap* mip) : fKey(key) {
114 ~Rec() {
118 static const Key& GetKey(const Rec& rec) { return rec.fKey;
152 SkScaledImageCache::Rec* rec = head; local
307 Rec* rec = fHead; local
335 Rec* rec = fHash->find(key); local
337 Rec* rec = find_rec_in_list(fHead, key); local
364 Rec* rec = this->findAndLock(genID, SK_Scalar1, SK_Scalar1, local
382 Rec* rec = this->findAndLock(orig.getGenerationID(), scaleX, local
394 Rec* rec = this->findAndLock(orig.getGenerationID(), 0, 0, local
437 Rec* rec = SkNEW_ARGS(Rec, (key, bitmap)); local
454 Rec* rec = SkNEW_ARGS(Rec, (key, scaled)); local
465 Rec* rec = SkNEW_ARGS(Rec, (key, mip)); local
475 Rec* rec = fHead; local
486 Rec* rec = id_to_rec(id); local
512 Rec* rec = fTail; local
631 const Rec* rec = fHead; local
657 const Rec* rec = fHead; local
    [all...]
SkTypefaceCache.h 92 struct Rec {
97 SkTDArray<Rec> fArray;
SkTypefaceCache.cpp 19 const Rec* curr = fArray.begin();
20 const Rec* stop = fArray.end();
38 Rec* rec = fArray.append(); local
39 rec->fFace = face;
40 rec->fRequestedStyle = requestedStyle;
41 rec->fStrong = strong;
50 const Rec* curr = fArray.begin();
51 const Rec* stop = fArray.end();
62 const Rec* curr = fArray.begin()
    [all...]
SkTextToPathIter.h 25 struct Rec {
  /external/chromium_org/third_party/skia/include/effects/
SkLayerDrawLooper.h 80 virtual bool asABlurShadow(BlurShadowRec* rec) const SK_OVERRIDE;
100 struct Rec {
101 Rec* fNext;
105 Rec* fRecs;
106 Rec* fTopRec;
118 Rec* fCurrRec;
163 Rec* fRecs;
164 Rec* fTopRec;
  /external/chromium_org/third_party/skia/experimental/PdfViewer/src/
SkTDStackNester.h 43 Rec* rec = fRec; local
44 while (rec != &fInitialRec) {
45 Rec* next = rec->fNext;
46 delete rec;
47 rec = next;
121 Rec* rec = new Rec(); local
173 Rec* rec = fRec->fNext; local
    [all...]
  /external/skia/experimental/PdfViewer/src/
SkTDStackNester.h 43 Rec* rec = fRec; local
44 while (rec != &fInitialRec) {
45 Rec* next = rec->fNext;
46 delete rec;
47 rec = next;
121 Rec* rec = new Rec(); local
173 Rec* rec = fRec->fNext; local
    [all...]
  /external/chromium_org/third_party/skia/include/views/
SkTouchGesture.h 53 struct Rec {
60 SkTDArray<Rec> fTouches;
72 float computePinch(const Rec&, const Rec&);
  /external/skia/include/views/
SkTouchGesture.h 53 struct Rec {
60 SkTDArray<Rec> fTouches;
72 float computePinch(const Rec&, const Rec&);
  /external/llvm/utils/TableGen/
PseudoLoweringEmitter.cpp 55 unsigned addDagOperandMapping(Record *Rec, DagInit *Dag,
74 addDagOperandMapping(Record *Rec, DagInit *Dag, CodeGenInstruction &Insn,
93 if (DI->getDef() != Insn.Operands[BaseIdx + i].Rec)
94 PrintFatalError(Rec->getLoc(),
97 Insn.Operands[BaseIdx + i].Rec->getName() + "'");
112 addDagOperandMapping(Rec, SubDag, Insn, OperandMap, BaseIdx + i);
122 void PseudoLoweringEmitter::evaluateExpansion(Record *Rec) {
123 DEBUG(dbgs() << "Pseudo definition: " << Rec->getName() << "\n");
127 DagInit *Dag = Rec->getValueAsDag("ResultInst");
133 PrintFatalError(Rec->getLoc(), Rec->getName()
    [all...]
  /external/chromium_org/third_party/skia/src/pdf/
SkPDFCatalog.h 92 struct Rec {
93 Rec(SkPDFObject* object, bool onFirstPage)
114 SkTDArray<struct Rec> fCatalog;
  /external/skia/src/pdf/
SkPDFCatalog.h 92 struct Rec {
93 Rec(SkPDFObject* object, bool onFirstPage)
114 SkTDArray<struct Rec> fCatalog;

Completed in 436 milliseconds

1 2 3 4 5 6