/external/clang/test/CodeGen/ |
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/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/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/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...] |
H A D | prof_err.c | 49 struct et_list *next; member in struct:et_list 70 for (end = list, et = *list; et; end = &et->next, et = et->next) 81 et->next = 0;
|
/external/webkit/Source/WebCore/platform/text/ |
H A D | BidiRunList.h | 101 Run* next = m_firstRun; local 102 while (next != run) { 103 current = next; 104 next = current->next(); 108 m_firstRun = run->next(); 125 Run* next = current->next(); local 126 while (next != run) { 127 current = next; 189 Run* next = curr->next(); local [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/webkit/Source/ThirdParty/ANGLE/src/compiler/preprocessor/ |
H A D | memory.c | 64 struct chunk *next; member in struct:chunk 68 struct cleanup *next; member in struct:cleanup 74 struct chunk *next; member in struct:MemoryPool_rec 91 pool->next = 0; 103 struct chunk *p, *next; local 105 for (cleanup = pool->cleanup; cleanup; cleanup = cleanup->next) { 108 for (p = (struct chunk *)pool; p; p = next) { 109 next = p->next; 136 ch->next [all...] |
/external/webkit/Source/WebCore/rendering/ |
H A D | CounterNode.cpp | 61 CounterNode* next; local 62 while (!(next = current->m_nextSibling)) { 67 return next; 72 if (CounterNode* next = m_firstChild) 73 return next; 168 m_rootRenderer->invalidate(); // This makes m_rootRenderer point to the next renderer if any since it disconnects the m_rootRenderer from this. 205 CounterNode* next; local 208 next = refChild->m_nextSibling; 211 next = m_firstChild; 219 newChild->m_nextSibling = next; 274 CounterNode* next = oldChild->m_nextSibling; local [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/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/valgrind/main/memcheck/tests/ |
H A D | leak-cases.c | 42 struct _Node* next; member in struct:_Node 48 Node* mk(Node* next) argument 53 x->next = next; 82 (p6->next)++; // 16/1 possibly lost 88 (p8->next)++; // 16/1 possibly lost 92 (p9->next)++; // 32(16d,16i)/1 definitely lost (double count!)
|
/external/webkit/Source/WebCore/html/parser/ |
H A D | HTMLInputStream.h | 35 // [--current--][--next--][--next--] ... [--next--] 90 void splitInto(SegmentedString& next) argument 92 next = m_first; 97 // the m_last string, |next| is now the last one. 98 m_last = &next; 102 void mergeFrom(SegmentedString& next) argument 104 m_first.append(next); 105 if (m_last == &next) { [all...] |
/external/smack/src/org/xbill/DNS/ |
H A D | NXTRecord.java | 21 private Name next; field in class:NXTRecord 33 * @param next The following name in an ordered list of the zone 37 NXTRecord(Name name, int dclass, long ttl, Name next, BitSet bitmap) { argument 39 this.next = checkName("next", next); 45 next = new Name(in); 58 next = st.getName(origin); 76 sb.append(next); 86 /** Returns the next nam [all...] |
/external/webkit/Source/WebCore/css/ |
H A D | CSSSelectorList.h | 45 static CSSSelector* next(CSSSelector*); 46 bool hasOneSelector() const { return m_selectorArray && !next(m_selectorArray); } 59 inline CSSSelector* CSSSelectorList::next(CSSSelector* current) function in class:WebCore::CSSSelectorList
|
/external/srec/seti/sltsEngine/src/ |
H A D | linklist_impl.c | 58 n->next = n->prev = 0; 74 (g_LNodeAllocArray[i].node).next = NULL; 134 (list->head)->next = NULL; 152 newnode->next = NULL; 153 (list->curr)->next = newnode; 162 newnode->next = list->head; 175 newnode->next = (list->curr)->next; 176 (list->curr)->next = newnode; 177 (newnode->next) [all...] |
/external/webkit/Source/WebCore/rendering/style/ |
H A D | FillLayer.cpp | 132 for (curr = this; curr && curr->isXPositionSet(); curr = curr->next()) { } 135 for (FillLayer* pattern = this; curr; curr = curr->next()) { 137 pattern = pattern->next(); 143 for (curr = this; curr && curr->isYPositionSet(); curr = curr->next()) { } 146 for (FillLayer* pattern = this; curr; curr = curr->next()) { 148 pattern = pattern->next(); 154 for (curr = this; curr && curr->isAttachmentSet(); curr = curr->next()) { } 157 for (FillLayer* pattern = this; curr; curr = curr->next()) { 159 pattern = pattern->next(); 165 for (curr = this; curr && curr->isClipSet(); curr = curr->next()) { } 235 FillLayer* next; local [all...] |
/external/llvm/lib/Analysis/ |
H A D | PathProfileInfo.cpp | 125 for( BLEdgeIterator next = node->succBegin(), 126 end = node->succEnd(); next != end; next++ ) { 127 if( (*next)->getType() != BallLarusEdge::BACKEDGE && // no backedges 128 (*next)->getType() != BallLarusEdge::SPLITEDGE && // no split edges 129 (*next)->getWeight() <= pathNumber && // weight must be <= pathNumber 130 (!best || (best->getWeight() < (*next)->getWeight())) ) // best one? 131 best = *next; 143 BallLarusEdge* next = getNextEdge(currentNode, increment); local 145 increment -= next 182 BallLarusEdge* next = getNextEdge(currentNode, increment); local [all...] |
/external/apache-xml/src/main/java/org/apache/xpath/axes/ |
H A D | SelfIteratorNoPredicate.java | 66 * Returns the next node in the set and advances the position of the 70 * @return The next <code>Node</code> in the set being iterated over, or 78 int next; 80 m_lastFetched = next = (DTM.NULL == m_lastFetched) 84 // m_lastFetched = next; 85 if (DTM.NULL != next) 89 return next;
|
/external/e2fsprogs/lib/et/test_cases/ |
H A D | continuation.c | 19 struct et_list *next; member in struct:et_list 40 for (end = list, et = *list; et; end = &et->next, et = et->next) 51 et->next = 0;
|
H A D | heimdal.c | 100 struct et_list *next; member in struct:et_list 121 for (end = list, et = *list; et; end = &et->next, et = et->next) 132 et->next = 0;
|