HomeSort by relevance Sort by last modified time
    Searched full:fnext (Results 1 - 25 of 234) sorted by null

1 2 3 4 5 6 7 8 910

  /external/chromium_org/third_party/skia/src/core/
SkRefDict.cpp 14 Impl* fNext;
35 rec = rec->fNext;
58 prev->fNext = rec->fNext;
60 fImpl = rec->fNext;
67 rec = rec->fNext;
76 rec->fNext = fImpl;
83 Impl* next = rec->fNext;
SkTLS.cpp 13 SkTLSRec* fNext;
45 SkTLSRec* next = rec->fNext;
65 } while ((rec = rec->fNext) != NULL);
71 rec->fNext = (SkTLSRec*)ptr;
94 } while ((rec = rec->fNext) != NULL);
109 SkTLSRec* next = curr->fNext;
112 prev->fNext = next;
SkRegion_rects.cpp 17 VEdge* fNext;
25 fPrev->fNext = fNext;
26 fNext->fPrev = fPrev;
35 prev->fPrev->fNext = next;
39 prev->fNext = next->fNext;
40 next->fNext->fPrev = prev;
41 next->fNext = prev;
110 edge = edge->fNext;
    [all...]
  /external/skia/src/core/
SkRefDict.cpp 14 Impl* fNext;
35 rec = rec->fNext;
58 prev->fNext = rec->fNext;
60 fImpl = rec->fNext;
67 rec = rec->fNext;
76 rec->fNext = fImpl;
83 Impl* next = rec->fNext;
SkTLS.cpp 13 SkTLSRec* fNext;
45 SkTLSRec* next = rec->fNext;
65 } while ((rec = rec->fNext) != NULL);
71 rec->fNext = (SkTLSRec*)ptr;
94 } while ((rec = rec->fNext) != NULL);
109 SkTLSRec* next = curr->fNext;
112 prev->fNext = next;
SkRegion_rects.cpp 17 VEdge* fNext;
25 fPrev->fNext = fNext;
26 fNext->fPrev = fPrev;
35 prev->fPrev->fNext = next;
39 prev->fNext = next->fNext;
40 next->fNext->fPrev = prev;
41 next->fNext = prev;
110 edge = edge->fNext;
    [all...]
  /frameworks/base/core/jni/android/graphics/
AutoDecodeCancel.cpp 19 fNext = gAutoDecoderCancel;
36 AutoDecoderCancel* next = fNext;
39 SkASSERT(prev->fNext == this);
40 prev->fNext = next;
66 pair = pair->fNext;
90 SkASSERT(curr->fPrev->fNext == curr);
92 if (curr->fNext) {
93 SkASSERT(curr->fNext->fPrev == curr);
95 curr = curr->fNext;
AutoDecodeCancel.h 15 AutoDecoderCancel* fNext;
  /external/junit/src/org/junit/internal/runners/statements/
RunBefores.java 12 private final Statement fNext;
19 fNext= next;
28 fNext.evaluate();
ExpectException.java 10 private Statement fNext;
14 fNext= next;
22 fNext.evaluate();
RunAfters.java 14 private final Statement fNext;
21 fNext= next;
30 fNext.evaluate();
  /external/antlr/antlr-3.4/runtime/ObjC/Framework/
ANTLRLinkBase.m 37 @synthesize fNext;
52 fNext = nil;
61 fNext = np;
72 if (fNext) [fNext dealloc];
83 copy.fNext = fNext;
90 node.fNext = (id<ANTLRLinkList>)self.fNext;
91 if (node.fNext != nil
    [all...]
  /external/chromium_org/third_party/skia/src/views/
SkTagList.cpp 24 rec = rec->fNext;
38 SkTagList* next = rec->fNext;
43 prev->fNext = next;
58 SkTagList* next = rec->fNext;
SkTagList.h 24 SkTagList* fNext;
32 fNext = NULL;
  /external/skia/src/views/
SkTagList.cpp 24 rec = rec->fNext;
38 SkTagList* next = rec->fNext;
43 prev->fNext = next;
58 SkTagList* next = rec->fNext;
SkTagList.h 24 SkTagList* fNext;
32 fNext = NULL;
  /external/chromium_org/third_party/skia/include/core/
SkTInternalLList.h 36 SkPtrWrapper<ClassName> fNext
53 T* next = entry->fNext;
56 prev->fNext = next;
67 entry->fNext = NULL;
75 SkASSERT(NULL == entry->fPrev && NULL == entry->fNext);
79 entry->fNext = fHead;
94 SkASSERT(NULL == entry->fPrev && NULL == entry->fNext);
98 entry->fNext = NULL;
100 fTail->fNext = entry;
126 newEntry->fNext = existingEntry
    [all...]
SkTDStack.h 18 fInitialRec.fNext = NULL;
27 Rec* next = rec->fNext;
41 rec->fNext = fRec;
83 Rec* rec = fRec->fNext;
102 Rec* fNext;
  /external/skia/include/core/
SkTInternalLList.h 36 SkPtrWrapper<ClassName> fNext
53 T* next = entry->fNext;
56 prev->fNext = next;
67 entry->fNext = NULL;
75 SkASSERT(NULL == entry->fPrev && NULL == entry->fNext);
79 entry->fNext = fHead;
94 SkASSERT(NULL == entry->fPrev && NULL == entry->fNext);
98 entry->fNext = NULL;
100 fTail->fNext = entry;
126 newEntry->fNext = existingEntry
    [all...]
SkTDStack.h 18 fInitialRec.fNext = NULL;
27 Rec* next = rec->fNext;
41 rec->fNext = fRec;
83 Rec* rec = fRec->fNext;
102 Rec* fNext;
  /external/chromium_org/third_party/skia/src/effects/gradients/
SkBitmapCache.cpp 14 Entry* fNext;
22 fNext(NULL),
48 Entry* next = entry->fNext;
57 entry->fPrev->fNext = entry->fNext;
60 fHead = entry->fNext;
62 if (entry->fNext) {
64 entry->fNext->fPrev = entry->fPrev;
74 entry->fNext = fHead;
97 entry = entry->fNext;
    [all...]
  /external/skia/src/effects/gradients/
SkBitmapCache.cpp 14 Entry* fNext;
22 fNext(NULL),
48 Entry* next = entry->fNext;
57 entry->fPrev->fNext = entry->fNext;
60 fHead = entry->fNext;
62 if (entry->fNext) {
64 entry->fNext->fPrev = entry->fPrev;
74 entry->fNext = fHead;
97 entry = entry->fNext;
    [all...]
  /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
ANTLRHashRule.m 62 fNext = nil;
70 fNext = nil;
81 if ( self.fNext != nil ) {
87 tmp = (ANTLRRuleMemo *)tmp.fNext;
133 if ( self.fNext != nil ) {
138 tmp = tmp.fNext;
147 if ( np.fNext != nil )
148 [self delete_chain:np.fNext];
191 aRule = aRule.fNext;
215 aRule.fNext = ptrBuffer[anIndex]
    [all...]
  /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
ANTLRHashRule.m 62 fNext = nil;
70 fNext = nil;
81 if ( self.fNext != nil ) {
87 tmp = (ANTLRRuleMemo *)tmp.fNext;
133 if ( self.fNext != nil ) {
138 tmp = tmp.fNext;
147 if ( np.fNext != nil )
148 [self delete_chain:np.fNext];
191 aRule = aRule.fNext;
215 aRule.fNext = ptrBuffer[anIndex]
    [all...]
  /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/
ANTLRHashRule.m 62 fNext = nil;
70 fNext = nil;
81 if ( self.fNext != nil ) {
87 tmp = (ANTLRRuleMemo *)tmp.fNext;
133 if ( self.fNext != nil ) {
138 tmp = tmp.fNext;
147 if ( np.fNext != nil )
148 [self delete_chain:np.fNext];
191 aRule = aRule.fNext;
215 aRule.fNext = ptrBuffer[anIndex]
    [all...]

Completed in 1809 milliseconds

1 2 3 4 5 6 7 8 910