/external/chromium_org/third_party/mesa/src/src/glx/ |
H A D | glxconfig.c | 12 * The above copyright notice and this permission notice (including the next 228 struct glx_config **next; local 231 next = &base; 233 *next = (struct glx_config *) malloc(size); 234 if (*next == NULL) { 240 (void) memset(*next, 0, size); 241 (*next)->visualID = GLX_DONT_CARE; 242 (*next)->visualType = GLX_DONT_CARE; 243 (*next)->visualRating = GLX_NONE; 244 (*next) 270 struct glx_config *const next = configs->next; local [all...] |
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/windows/gdi/ |
H A D | wmesadef.h | 37 struct wmesa_framebuffer *next; member in struct:wmesa_framebuffer
|
/external/chromium_org/third_party/mesa/src/src/mesa/main/ |
H A D | simple_list.h | 45 struct simple_node *next; member in struct:simple_node 56 (elem)->next->prev = (elem)->prev; \ 57 (elem)->prev->next = (elem)->next; \ 69 (elem)->next = (list)->next; \ 70 (list)->next->prev = elem; \ 71 (list)->next = elem; \ 82 (elem)->next = list; \ 84 (list)->prev->next [all...] |
/external/chromium_org/third_party/npapi/npspy/extern/nspr/ |
H A D | prclist.h | 46 PRCList *next; member in struct:PRCListStr 55 (_e)->next = (_l); \ 57 (_l)->prev->next = (_e); \ 66 (_e)->next = (_l)->next; \ 68 (_l)->next->prev = (_e); \ 69 (_l)->next = (_e); \ 76 ((_e)->next) 94 #define PR_LIST_HEAD(_l) (_l)->next 102 (_e)->prev->next [all...] |
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkTLS.cpp | 45 SkTLSRec* next = rec->fNext; local 47 rec = next; 109 SkTLSRec* next = curr->fNext; local 112 prev->fNext = next; 115 SkTLS::PlatformSetSpecific(next); 121 curr = next;
|
/external/chromium_org/third_party/skia/src/effects/ |
H A D | SkBlurDrawLooper.cpp | 81 bool SkBlurDrawLooper::next(SkCanvas* canvas, SkPaint* paint) { function in class:SkBlurDrawLooper
|
/external/chromium_org/third_party/sqlite/src/src/ |
H A D | hash.h | 35 ** element pointed to plus the next _ht.count-1 elements in the list. 60 HashElem *next, *prev; /* Next and previous elements in the table */ member in struct:HashElem 86 #define sqliteHashNext(E) ((E)->next)
|
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
H A D | central_freelist.cc | 83 void *next = FL_Next(start); local 85 start = next; 291 Span* span = nonempty_.next;
|
/external/chromium_org/third_party/tcmalloc/vendor/src/ |
H A D | central_freelist.cc | 83 void *next = SLL_Next(start); local 85 start = next; 293 Span* span = nonempty_.next;
|
/external/chromium_org/third_party/tlslite/tlslite/ |
H A D | X509CertChain.py | 64 def next(self): member in class:X509CertChain.parseChain.PEMIterator 65 """Iterates and returns the next L{tlslite.X509.X509} 154 #next one
|
/external/chromium_org/v8/src/ |
H A D | unbound-queue-inl.h | 41 : value(value), next(NULL) { 45 Node* next; member in struct:v8::internal::UnboundQueue::Node 65 first_ = tmp->next; 73 Node* next = reinterpret_cast<Node*>(divider_)->next; 74 *rec = next->value; 75 Release_Store(÷r_, reinterpret_cast<AtomicWord>(next)); 82 Node*& next = reinterpret_cast<Node*>(last_)->next; local 83 next [all...] |
/external/clang/test/CodeGen/ |
H A D | 2002-02-14-EntryNodePreds.c | 11 struct edge_rec *next; member in struct:edge_rec 33 return (int)basel->next;
|
H A D | pragma-pack-1.c | 6 struct ref *next; member in struct:ref
|
H A D | types.c | 4 struct FileName *next; member in struct:FileName 9 struct ieeeExternal *next; member in struct:ieeeExternal
|
/external/dropbear/ |
H A D | svr-runopts.c | 99 char ** next = 0; local 142 if (next) { 143 *next = argv[i]; 144 if (*next == NULL) { 147 next = 0x00; 154 next = &svr_opts.bannerfile; 158 next = &svr_opts.dsskeyfile; 163 next = &svr_opts.rsakeyfile; 196 next = &svr_opts.pidfile;
|
/external/e2fsprogs/intl/ |
H A D | loadinfo.h | 75 struct loaded_l10nfile *next; member in struct:loaded_l10nfile 98 its ->next field denotes the chaining inside *L10NFILE_LIST, and
|
/external/guava/guava/src/com/google/common/base/ |
H A D | AbstractIterator.java | 40 private T next; field in class:AbstractIterator 64 next = computeNext(); 73 public final T next() { method in class:AbstractIterator 78 return next;
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | AbstractIterator.java | 46 * String s = in.next(); 71 /** We have computed the next element and haven't returned it yet. */ 84 private T next; field in class:AbstractIterator 87 * Returns the next element. <b>Note:</b> the implementation must call {@link 91 * <p>The initial invocation of {@link #hasNext()} or {@link #next()} calls 93 * next} following each successful call to {@code next}. Once the 98 * {@code hasNext} or {@code next} invocation that invoked this method. Any 103 * {@code next}, or {@link #peek()} methods on this instance; if it does, an 106 * @return the next elemen 152 public final T next() { method in class:AbstractIterator [all...] |
H A D | BstInOrderPath.java | 101 * Returns {@code true} if there is a next path in an in-order traversal in the given direction. 108 * Returns the next path in an in-order traversal in the given direction. 112 public BstInOrderPath<N> next(BstSide side) { method in class:BstInOrderPath
|
/external/icu4c/common/ |
H A D | bytestrieiterator.cpp | 100 BytesTrie::Iterator::next(UErrorCode &errorCode) { function in class:BytesTrie::Iterator 109 // Pop the state off the stack and continue with the next outbound edge of
|
H A D | ucharstrieiterator.cpp | 99 UCharsTrie::Iterator::next(UErrorCode &errorCode) { function in class:UCharsTrie::Iterator 108 // Pop the state off the stack and continue with the next outbound edge of 150 // next time.
|
/external/icu4c/layout/ |
H A D | LEInsertionList.cpp | 17 InsertionRecord *next; member in struct:InsertionRecord 41 head = head->next; 73 insertion->next = NULL; 74 tail->next = insertion; 78 insertion->next = head; 87 for (InsertionRecord *rec = head; rec != NULL; rec = rec->next) {
|
/external/iproute2/include/ |
H A D | xt-internal.h | 37 struct xtables_rule_match *next; member in struct:xtables_rule_match
|
/external/javassist/src/main/javassist/convert/ |
H A D | TransformFieldAccess.java | 33 public TransformFieldAccess(Transformer next, CtField field, argument 36 super(next);
|
H A D | TransformNew.java | 26 public TransformNew(Transformer next, argument 28 super(next);
|