OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:fHead
(Results
1 - 16
of
16
) sorted by null
/external/skia/include/core/
SkRWBuffer.h
64
const SkBufferHead*
fHead
;
94
return sk_sp<SkROBuffer>(new SkROBuffer(
fHead
, fTotalUsed, fTail));
106
SkBufferHead*
fHead
;
SkStream.h
406
Block*
fHead
;
/external/skia/src/shaders/gradients/
SkGradientBitmapCache.h
27
mutable Entry*
fHead
;
/external/skia/src/core/
SkGlyphCache_Globals.h
33
fHead
= nullptr;
42
SkGlyphCache* cache =
fHead
;
52
SkGlyphCache* internalGetHead() const { return
fHead
; }
83
SkGlyphCache*
fHead
;
SkSinglyLinkedList.h
17
SkSinglyLinkedList() :
fHead
(nullptr), fTail(nullptr) {}
20
SkASSERT(
fHead
!= nullptr || nullptr == fTail);
22
Node* node =
fHead
;
29
fHead
= nullptr;
33
T* front() { return
fHead
? &
fHead
->fData : nullptr; }
34
bool empty() const { return
fHead
== nullptr; }
38
for (Node* node =
fHead
; node; node = node->fNext) {
45
if (Node* node =
fHead
) {
46
fHead
= node->fNext
[
all
...]
SkTInternalLList.h
44
:
fHead
(NULL)
49
SkASSERT(
fHead
&& fTail);
58
fHead
= next;
79
entry->fNext =
fHead
;
80
if (
fHead
) {
81
fHead
->fPrev = entry;
83
fHead
= entry;
103
if (NULL ==
fHead
) {
104
fHead
= entry;
131
SkASSERT(
fHead
== existingEntry)
[
all
...]
SkResourceCache.h
261
Rec*
fHead
;
SkStream.cpp
456
:
fHead
(nullptr), fTail(nullptr), fBytesWrittenBeforeTail(0)
464
Block* block =
fHead
;
470
fHead
= fTail = nullptr;
511
fHead
= fTail = block;
522
Block* block =
fHead
;
540
Block* block =
fHead
;
550
for (Block* block =
fHead
; block != nullptr; block = block->fNext) {
578
Block* block =
fHead
;
587
fHead
= fTail = nullptr;
595
for (Block* block =
fHead
; block != nullptr; )
[
all
...]
/external/skia/src/gpu/
GrMemoryPool.h
54
bool isEmpty() const { return fTail ==
fHead
&& !
fHead
->fLiveCount; }
64
size_t preallocSize() const { return
fHead
->fSize; }
107
BlockHeader*
fHead
;
GrResourceAllocator.h
99
while (
fHead
) {
100
Interval* temp =
fHead
;
101
fHead
= temp->fNext;
106
bool empty() const { return !SkToBool(
fHead
); }
107
const Interval* peekHead() const { return
fHead
; }
113
Interval*
fHead
= nullptr;
GrTessellator.cpp
236
VertexList() :
fHead
(nullptr), fTail(nullptr) {}
237
VertexList(Vertex* head, Vertex* tail) :
fHead
(head), fTail(tail) {}
238
Vertex*
fHead
;
241
list_insert<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, prev, next, &
fHead
, &fTail);
247
if (!list.
fHead
) {
251
fTail->fNext = list.
fHead
;
252
list.
fHead
->fPrev = fTail;
254
fHead
= list.
fHead
;
259
insert(v, nullptr,
fHead
);
[
all
...]
/external/skia/src/pathops/
SkOpCoincidence.h
137
:
fHead
(nullptr)
227
return !
fHead
&& !fTop;
293
SkCoincidentSpans*
fHead
;
SkOpContour.h
49
: &
fHead
;
64
SkOpSegment* segment = &
fHead
;
119
SkOpSegment* segment = &
fHead
;
136
const SkOpSegment* segment = &
fHead
;
178
return &
fHead
;
183
return &
fHead
;
206
SkOpSegment* segment = &
fHead
;
210
segment->joinEnds(next ? next : &
fHead
);
215
SkOpSegment* segment = &
fHead
;
224
SkOpSegment* segment = &
fHead
;
[
all
...]
SkOpSegment.h
82
angle->set(&
fHead
,
fHead
.next());
83
fHead
.setToAngle(angle);
224
return &
fHead
;
228
return &
fHead
;
269
fTail.ptT()->addOpp(start->
fHead
.ptT(), start->
fHead
.ptT());
429
SkOpSpan
fHead
; // the head span always has its t set to zero
SkPathOpsTSect.h
335
SkTSpan<TCurve, OppCurve>*
fHead
;
405
SkTSpan<TCurve, OppCurve>* next = prior ? prior->fNext :
fHead
;
412
fHead
= result;
874
fHead
= this->addOne();
875
SkDEBUGCODE(
fHead
->debugSetGlobalState(debugGlobalState));
876
fHead
->init(c);
942
if (sect2->
fHead
->contains(oppTTest)) {
976
SkTSpan<TCurve, OppCurve>* test =
fHead
;
977
SkTSpan<TCurve, OppCurve>* largest =
fHead
;
992
SkTSpan<TCurve, OppCurve>* first =
fHead
;
[
all
...]
/external/skia/tests/
OnFlushCallbackTest.cpp
282
op->setNext(header->
fHead
);
283
header->
fHead
= op;
355
for (AtlasedRectOp* op = lists[i]->
fHead
; op; op = op->next()) {
395
AtlasedRectOp*
fHead
;
410
header->
fHead
= nullptr;
Completed in 291 milliseconds