Searched refs:Rec (Results 1 - 25 of 127) sorted by relevance

123456

/external/chromium_org/third_party/skia/include/core/
H A DSkTDStack.h25 Rec* rec = fRec;
27 Rec* next = rec->fNext;
40 Rec* rec = (Rec*)sk_malloc_throw(sizeof(Rec));
83 Rec* rec = fRec->fNext;
98 struct Rec;
99 friend struct Rec;
101 struct Rec { struct in class:SkTDStack
102 Rec* fNex
[all...]
H A DSkMetaData.h128 struct Rec;
150 Rec* fRec;
154 struct Rec { struct in class:SkMetaData
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/
H A DSkTDStack.h25 Rec* rec = fRec;
27 Rec* next = rec->fNext;
40 Rec* rec = (Rec*)sk_malloc_throw(sizeof(Rec));
83 Rec* rec = fRec->fNext;
98 struct Rec;
99 friend struct Rec;
101 struct Rec { struct in class:SkTDStack
102 Rec* fNex
[all...]
H A DSkMetaData.h128 struct Rec;
150 Rec* fRec;
154 struct Rec { struct in class:SkMetaData
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/
H A DSkResourceCache.h60 struct Rec { struct in class:SkResourceCache
63 Rec() {} function in struct:SkResourceCache::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-specified
87 * context. The function can read the data in Rec, and copy whatever it likes into context
90 * The return value determines what the cache will do with the Rec
[all...]
H A DSkMetaData.cpp46 Rec* rec = fRec;
54 Rec* next = rec->fNext;
55 Rec::Free(rec);
65 const Rec* rec = src.fRec;
120 Rec* rec = Rec::Alloc(sizeof(Rec) + dataSize * count + len + 1);
147 const Rec* rec = this->find(name, kS32_Type);
160 const Rec* rec = this->find(name, kScalar_Type);
173 const Rec* re
[all...]
H A DSkTypefaceCache.h92 struct Rec { struct in class:SkTypefaceCache
97 SkTDArray<Rec> fArray;
H A DSkTypefaceCache.cpp19 const Rec* curr = fArray.begin();
20 const Rec* stop = fArray.end();
38 Rec* rec = fArray.append();
50 const Rec* curr = fArray.begin();
51 const Rec* stop = fArray.end();
62 const Rec* curr = fArray.begin();
63 const Rec* stop = fArray.end();
H A DSkResourceCache.cpp35 public SkTDynamicHash<SkResourceCache::Rec, SkResourceCache::Key> {};
179 Rec* rec = fHead;
181 Rec* next = rec->fNext;
191 Rec* rec = fHash->find(key);
204 void SkResourceCache::add(Rec* rec) {
207 Rec* existing = fHash->find(rec->getKey());
220 void SkResourceCache::remove(Rec* rec) {
245 Rec* rec = fTail;
251 Rec* prev = rec->fPrev;
268 void SkResourceCache::detach(Rec* re
[all...]
H A DSkTextToPathIter.h25 struct Rec { struct in class:SkTextToPathIter
/external/skia/src/core/
H A DSkScaledImageCache.h175 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*);
204 void detach(Rec*);
[all...]
H A DSkMetaData.cpp46 Rec* rec = fRec;
54 Rec* next = rec->fNext;
55 Rec::Free(rec);
65 const Rec* rec = src.fRec;
120 Rec* rec = Rec::Alloc(sizeof(Rec) + dataSize * count + len + 1);
147 const Rec* rec = this->find(name, kS32_Type);
160 const Rec* rec = this->find(name, kScalar_Type);
173 const Rec* re
[all...]
H A DSkScaledImageCache.cpp24 static inline SkScaledImageCache::ID* rec_to_id(SkScaledImageCache::Rec* rec) {
28 static inline SkScaledImageCache::Rec* id_to_rec(SkScaledImageCache::ID* id) {
29 return reinterpret_cast<SkScaledImageCache::Rec*>(id);
102 struct SkScaledImageCache::Rec { struct in class:SkScaledImageCache
103 Rec(const Key& key, const SkBitmap& bm) : fKey(key), fBitmap(bm) { function in struct:SkScaledImageCache::Rec
108 Rec(const Key& key, const SkMipMap* mip) : fKey(key) { function in struct:SkScaledImageCache::Rec
114 ~Rec() {
118 static const Key& GetKey(const Rec& rec) { return rec.fKey; }
125 Rec* fNext;
126 Rec* fPre
[all...]
H A DSkTypefaceCache.h92 struct Rec { struct in class:SkTypefaceCache
97 SkTDArray<Rec> fArray;
H A DSkTypefaceCache.cpp19 const Rec* curr = fArray.begin();
20 const Rec* stop = fArray.end();
38 Rec* rec = fArray.append();
50 const Rec* curr = fArray.begin();
51 const Rec* stop = fArray.end();
62 const Rec* curr = fArray.begin();
63 const Rec* stop = fArray.end();
H A DSkTextToPathIter.h25 struct Rec { struct in class:SkTextToPathIter
/external/chromium_org/third_party/skia/include/effects/
H A DSkLayerDrawLooper.h100 struct Rec { struct in class:SkLayerDrawLooper
101 Rec* fNext;
105 Rec* fRecs;
106 Rec* fTopRec;
118 Rec* fCurrRec;
163 Rec* fRecs;
164 Rec* fTopRec;
/external/skia/include/effects/
H A DSkLayerDrawLooper.h94 struct Rec { struct in class:SkLayerDrawLooper
95 Rec* fNext;
99 Rec* fRecs;
100 Rec* fTopRec;
112 Rec* fCurrRec;
157 Rec* fRecs;
158 Rec* fTopRec;
/external/chromium_org/third_party/skia/experimental/PdfViewer/src/
H A DSkTDStackNester.h43 Rec* rec = fRec;
45 Rec* next = rec->fNext;
121 Rec* rec = new Rec();
173 Rec* rec = fRec->fNext;
185 // Number of objects held per Rec. Storing multiple objects in one Rec
190 struct Rec { struct in class:SkTDStackNester
191 Rec* fNext;
195 // First Rec, requirin
[all...]
/external/skia/experimental/PdfViewer/src/
H A DSkTDStackNester.h43 Rec* rec = fRec;
45 Rec* next = rec->fNext;
121 Rec* rec = new Rec();
173 Rec* rec = fRec->fNext;
185 // Number of objects held per Rec. Storing multiple objects in one Rec
190 struct Rec { struct in class:SkTDStackNester
191 Rec* fNext;
195 // First Rec, requirin
[all...]
/external/chromium_org/third_party/skia/include/views/
H A DSkTouchGesture.h53 struct Rec { struct in class:SkTouchGesture
60 SkTDArray<Rec> fTouches;
72 float computePinch(const Rec&, const Rec&);
/external/skia/include/views/
H A DSkTouchGesture.h53 struct Rec { struct in class:SkTouchGesture
60 SkTDArray<Rec> fTouches;
72 float computePinch(const Rec&, const Rec&);
/external/llvm/utils/TableGen/
H A DPseudoLoweringEmitter.cpp55 unsigned addDagOperandMapping(Record *Rec, DagInit *Dag,
74 addDagOperandMapping(Record *Rec, DagInit *Dag, CodeGenInstruction &Insn, argument
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) { argument
123 DEBUG(dbgs() << "Pseudo definition: " << Rec->getName() << "\n");
127 DagInit *Dag = Rec->getValueAsDag("ResultInst");
133 PrintFatalError(Rec
[all...]
/external/chromium_org/third_party/skia/src/pdf/
H A DSkPDFCatalog.h92 struct Rec { struct in class:SkPDFCatalog
93 Rec(SkPDFObject* object, bool onFirstPage) function in struct:SkPDFCatalog::Rec
114 SkTDArray<struct Rec> fCatalog;
/external/skia/src/pdf/
H A DSkPDFCatalog.h92 struct Rec { struct in class:SkPDFCatalog
93 Rec(SkPDFObject* object, bool onFirstPage) function in struct:SkPDFCatalog::Rec
114 SkTDArray<struct Rec> fCatalog;

Completed in 311 milliseconds

123456