HomeSort by relevance Sort by last modified time
    Searched refs:next (Results 76 - 100 of 4218) sorted by null

1 2 34 5 6 7 8 91011>>

  /external/javassist/src/main/javassist/
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/
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/valgrind/main/memcheck/tests/
leak-cases.c 42 struct _Node* next; member in struct:_Node
48 Node* mk(Node* next)
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/
HTMLInputStream.h 35 // [--current--][--next--][--next--] ... [--next--]
90 void splitInto(SegmentedString& next)
92 next = m_first;
97 // the m_last string, |next| is now the last one.
98 m_last = &next;
102 void mergeFrom(SegmentedString& next)
104 m_first.append(next);
105 if (m_last == &next) {
    [all...]
  /external/bison/src/
reader.c 109 head.next = merge_functions;
110 for (syms = &head, n = 1; syms->next; syms = syms->next, n += 1)
111 if (UNIQSTR_EQ (name, syms->next->name))
113 if (syms->next == NULL)
115 syms->next = xmalloc (sizeof syms->next[0]);
116 syms->next->name = uniqstr_new (name);
117 syms->next->type = uniqstr_new (type);
118 syms->next->next = NULL
    [all...]
  /libcore/luni/src/main/java/libcore/util/
CollectionUtils.java 43 private T next; local
47 while (next == null && delegate.hasNext()) {
48 next = delegate.next().get();
49 if (trim && next == null) {
57 return next != null;
60 @Override public T next() { method
64 T result = next;
66 next = null;
  /external/webkit/Source/WebCore/css/
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/
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)->prev = newnode
    [all...]
  /system/extras/ext4_utils/
backed_block.c 28 struct data_block *next; member in struct:data_block
48 new_db->next = data_blocks;
55 there if the next block number is higher */
62 for (; db->next && db->next->block < new_db->block; db = db->next)
65 if (db->next == NULL) {
66 db->next = new_db;
68 new_db->next = db->next;
156 struct data_block *next = db->next; local
    [all...]
  /external/webkit/Source/WebCore/rendering/style/
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...]
  /libcore/json/src/test/java/org/json/
JSONTokenerTest.java 38 new JSONTokener(null).next();
44 new JSONTokener(null).next(3);
50 new JSONTokener(null).next('A');
108 assertEquals('\0', new JSONTokener("").next());
110 new JSONTokener("").next(3);
115 new JSONTokener("").next('A');
141 assertEquals('A', abcdeTokener.next());
142 assertEquals('B', abcdeTokener.next('B'));
143 assertEquals("CD", abcdeTokener.next(2));
145 abcdeTokener.next(2)
    [all...]
  /external/llvm/lib/Analysis/
PathProfileInfo.cpp 126 for( BLEdgeIterator next = node->succBegin(),
127 end = node->succEnd(); next != end; next++ ) {
128 if( (*next)->getType() != BallLarusEdge::BACKEDGE && // no backedges
129 (*next)->getType() != BallLarusEdge::SPLITEDGE && // no split edges
130 (*next)->getWeight() <= pathNumber && // weight must be <= pathNumber
131 (!best || (best->getWeight() < (*next)->getWeight())) ) // best one?
132 best = *next;
144 BallLarusEdge* next = getNextEdge(currentNode, increment); local
146 increment -= next->getWeight()
183 BallLarusEdge* next = getNextEdge(currentNode, increment); local
    [all...]
  /bionic/libc/kernel/common/linux/raid/
xor.h 20 struct xor_block_template *next; member in struct:xor_block_template
  /bionic/libc/stdlib/
atexit.h 34 struct atexit *next; /* next in list */ member in struct:atexit
35 int ind; /* next index in this table */
  /dalvik/vm/mterp/x86-atom/
OP_CONST_HIGH16.S 32 FFETCH_ADV 2, %eax # %eax<- next instruction hi; fetch, advance
35 FGETOP_JMP 2, %eax # jump to next instruction; getop, jmp
OP_LONG_TO_DOUBLE.S 34 FFETCH_ADV 1, %eax # %eax<- next instruction hi; fetch, advance
37 FGETOP_JMP 1, %eax # jump to next instruction; getop, jmp
OP_LONG_TO_FLOAT.S 34 FFETCH_ADV 1, %eax # %eax<- next instruction hi; fetch, advance
37 FGETOP_JMP 1, %eax # jump to next instruction; getop, jmp
OP_MOVE.S 35 FFETCH_ADV 1, %eax # %eax<- next instruction hi; fetch, advance
38 FGETOP_JMP 1, %eax # jump to next instruction; getop, jmp
OP_MOVE_16.S 33 FFETCH_ADV 3, %eax # %eax<- next instruction hi; fetch, advance
36 FGETOP_JMP 3, %eax # jump to next instruction; getop, jmp
OP_MOVE_FROM16.S 32 FFETCH_ADV 2, %eax # %eax<- next instruction hi; fetch, advance
35 FGETOP_JMP 2, %eax # jump to next instruction; getop, jmp
OP_MOVE_RESULT.S 35 FFETCH_ADV 1, %ecx # %ecx<- next instruction hi; fetch, advance
38 FGETOP_JMP 1, %ecx # jump to next instruction; getop, jmp
OP_MOVE_RESULT_WIDE.S 37 FFETCH_ADV 1, %edx # %edx<- next instruction hi; fetch, advance
38 FGETOP_JMP 1, %edx # jump to next instruction; getop, jmp
OP_MOVE_WIDE_16.S 33 FFETCH_ADV 3, %eax # %eax<- next instruction hi; fetch, advance
36 FGETOP_JMP 3, %eax # jump to next instruction; getop, jmp
OP_MOVE_WIDE_FROM16.S 31 FFETCH_ADV 2, %eax # %eax<- next instruction hi; fetch, advance
34 FGETOP_JMP 2, %eax # jump to next instruction; getop, jmp
  /development/ndk/platforms/android-3/include/linux/raid/
xor.h 20 struct xor_block_template *next; member in struct:xor_block_template

Completed in 2085 milliseconds

1 2 34 5 6 7 8 91011>>