/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 | types.c | 4 struct FileName *next; member in struct:FileName 9 struct ieeeExternal *next; member in struct:ieeeExternal
|
/external/linux-tools-perf/util/include/linux/ |
H A D | types.h | 14 struct list_head *next, *prev; member in struct:list_head 22 struct hlist_node *next, **pprev; member in struct:hlist_node
|
/external/oprofile/opjitconv/ |
H A D | conversion.c | 20 struct jitentry * entry, * next; local 22 for (entry = jitentry_list; entry; entry = next) { 25 next = entry->next; 33 struct jitentry_debug_line * entry, * next; local 35 for (entry = jitentry_debug_line_list; entry; entry = next) { 36 next = entry->next;
|
/external/chromium_org/third_party/WebKit/Source/core/fetch/ |
H A D | ResourceClientWalker.h | 35 // Just keep calling next() on this. It's safe from deletions of items. 48 T* next() function in class:WebCore::ResourceClientWalker 52 ResourceClient* next = m_clientVector[m_index++]; local 53 if (m_clientSet.contains(next)) { 54 ASSERT(T::expectedType() == ResourceClient::expectedType() || next->resourceClientType() == T::expectedType()); 55 return static_cast<T*>(next);
|
/external/chromium_org/third_party/WebKit/Source/wtf/ |
H A D | TreeNode.h | 61 NodeType* next() const { return m_next; } function in class:WTF::TreeNode 74 ASSERT(!newChild->next()); 98 ASSERT(!child->next()); 122 m_firstChild = child->next(); 126 NodeType* oldNext = child->next(); 149 if (typename TreeNode<T>::NodeType* next = current->firstChild()) 150 return next; 153 if (typename TreeNode<T>::NodeType* next = current->next()) 154 return next; [all...] |
/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...] |
/external/mockito/src/org/mockito/internal/configuration/injection/filter/ |
H A D | TypeBasedCandidateFilter.java | 14 MockCandidateFilter next;
field in class:TypeBasedCandidateFilter 16 public TypeBasedCandidateFilter(MockCandidateFilter next) {
argument 17 this.next = next;
28 return next.filterCandidate(mockTypeMatches, field, fieldInstance);
|
/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/dri/i965/ |
H A D | brw_fs_cfg.cpp | 11 * The above copyright notice and this permission notice (including the next 81 fs_bblock *next; local 114 next = new_block(); 115 next->start = (fs_inst *)inst->next; 116 cur_if->add_successor(mem_ctx, next); 118 set_next_block(next); 124 next = new_block(); 125 next->start = (fs_inst *)inst->next; [all...] |
/external/mesa3d/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/mesa3d/src/mesa/drivers/dri/i965/ |
H A D | brw_fs_cfg.cpp | 11 * The above copyright notice and this permission notice (including the next 81 fs_bblock *next; local 114 next = new_block(); 115 next->start = (fs_inst *)inst->next; 116 cur_if->add_successor(mem_ctx, next); 118 set_next_block(next); 124 next = new_block(); 125 next->start = (fs_inst *)inst->next; [all...] |
/external/chromium_org/media/midi/ |
H A D | midi_message_queue.cc | 52 const uint8 next = queue_.front(); local 59 if (IsSystemRealTimeMessage(next)) { 60 message->push_back(next); 68 ((next_message_[0] == kSysEx && IsFirstStatusByte(next)) || 69 (next_message_[0] != kSysEx && !IsDataByte(next)))) { 76 if (IsFirstStatusByte(next)) { 77 next_message_.push_back(next); 88 next_message_.push_back(next); 91 if (next == kEndOfSysEx) { 99 DCHECK(IsDataByte(next)); [all...] |
/external/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_list.h | 39 x->next = 0; 43 x->next = 0; 44 last_->next = x; 52 x->next = 0; 56 x->next = first_; 64 first_ = first_->next; 80 l->last_->next = first_; 94 last_->next = l->first_; 107 for (Item *i = first_; ; i = i->next) { 112 CHECK_EQ(last_->next, [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/r600/ |
H A D | compute_memory_pool.c | 9 * The above copyright notice and this permission notice (including the next 136 for (item = pool->item_list; item; item = item->next) { 166 for (item = pool->item_list; item; item = item->next) { 167 if (item->next) { 169 && item->next->start_in_dw > start_in_dw) { 239 chunk.prev = chunk.next = NULL; 251 struct compute_memory_item *item, *next; local 258 for (item = pool->item_list; item; item = item->next) { 259 COMPUTE_DBG("list: %i %p\n", item->start_in_dw, item->next); 262 for (item = pool->item_list; item; item = next) { 353 struct compute_memory_item *item, *next; local [all...] |
/external/mesa3d/src/gallium/drivers/r600/ |
H A D | compute_memory_pool.c | 9 * The above copyright notice and this permission notice (including the next 136 for (item = pool->item_list; item; item = item->next) { 166 for (item = pool->item_list; item; item = item->next) { 167 if (item->next) { 169 && item->next->start_in_dw > start_in_dw) { 239 chunk.prev = chunk.next = NULL; 251 struct compute_memory_item *item, *next; local 258 for (item = pool->item_list; item; item = item->next) { 259 COMPUTE_DBG("list: %i %p\n", item->start_in_dw, item->next); 262 for (item = pool->item_list; item; item = next) { 353 struct compute_memory_item *item, *next; local [all...] |
/external/e2fsprogs/e2fsck/ |
H A D | region.c | 25 struct region_el *next; member in struct:region_el 49 struct region_el *r, *next; local 51 for (r = region->allocated; r; r = next) { 52 next = r->next; 61 struct region_el *r, *new_region, *prev, *next; local 77 for (r = region->allocated, prev=NULL; r; prev = r, r = r->next) { 87 if ((next = r->next)) { 88 if (end > next [all...] |
/external/chromium_org/native_client_sdk/src/libraries/third_party/pthreads-win32/ |
H A D | ptw32_MCS_lock.c | 165 node->next = 0; /* initially, no successor */ 174 pred->next = node; 195 ptw32_mcs_local_node_t *next = local 197 PTW32_INTERLOCKED_EXCHANGE_ADD_SIZE((PTW32_INTERLOCKED_SIZEPTR)&node->next, (PTW32_INTERLOCKED_SIZE)0); /* MBR fence */ 199 if (0 == next) 214 next = (ptw32_mcs_local_node_t *) 215 PTW32_INTERLOCKED_EXCHANGE_ADD_SIZE((PTW32_INTERLOCKED_SIZEPTR)&node->next, (PTW32_INTERLOCKED_SIZE)0); /* MBR fence */ 219 ptw32_mcs_flag_set(&next->readyFlag); 234 node->next = 0; /* initially, no successor */ 262 new_node->next [all...] |
/external/mksh/src/ |
H A D | lalloc.c | 40 ap->next = NULL; 59 while (ap->next != lp) 60 if ((ap = ap->next) == NULL) { 94 pp->next = lp->next; 105 lp->next = ap->next; 106 ap->next = lp; 119 pp->next = lp->next; [all...] |
/external/javassist/src/main/javassist/ |
H A D | CtMember.java | 23 CtMember next; // for internal use field in class:CtMember 54 fieldTail.next = this; 65 method.next = methodTail.next; 66 methodTail.next = method; 79 cons.next = consTail.next; 80 consTail.next = cons; 88 field.next = this; // or fieldTail.next 131 final CtMember next() { return next; } method in class:CtMember [all...] |
/external/chromium/net/disk_cache/ |
H A D | mem_rankings.cc | 30 MemEntryImpl* next = node->next(); local 33 head_ = next; 39 prev->set_next(next); 41 if (next) 42 next->set_prev(prev); 57 return node->next();
|
/external/chromium_org/net/disk_cache/ |
H A D | mem_rankings.cc | 30 MemEntryImpl* next = node->next(); local 33 head_ = next; 39 prev->set_next(next); 41 if (next) 42 next->set_prev(prev); 57 return node->next();
|
/external/chromium_org/third_party/WebKit/Source/core/html/parser/ |
H A D | HTMLInputStream.h | 36 // [--current--][--next--][--next--] ... [--next--] 93 void splitInto(SegmentedString& next) argument 95 next = m_first; 100 // the m_last string, |next| is now the last one. 101 m_last = &next; 105 void mergeFrom(SegmentedString& next) argument 107 m_first.append(next); 108 if (m_last == &next) { [all...] |
/external/chromium_org/third_party/freetype/src/cache/ |
H A D | ftcmru.c | 52 cnode = cnode->next; 59 last->next = node; 60 node->next = first; 65 node->next = node; 83 FTC_MruNode prev, next, last; local 93 cnode = cnode->next; 103 next = node->next; 105 prev->next = next; 126 FTC_MruNode prev, next; local 331 FTC_MruNode first, node, next; local [all...] |
/external/freetype/src/cache/ |
H A D | ftcmru.c | 52 cnode = cnode->next; 59 last->next = node; 60 node->next = first; 65 node->next = node; 83 FTC_MruNode prev, next, last; local 93 cnode = cnode->next; 103 next = node->next; 105 prev->next = next; 126 FTC_MruNode prev, next; local 331 FTC_MruNode first, node, next; local [all...] |