HomeSort by relevance Sort by last modified time
    Searched refs:next (Results 401 - 425 of 7540) sorted by null

<<11121314151617181920>>

  /external/javassist/src/main/javassist/compiler/
Lex.java 19 public Token next = null; field in class:Token
57 lookAheadTokens = lookAheadTokens.next;
63 * Looks at the next token.
73 tk.next = null;
77 for (; i-- > 0; tk = tk.next)
78 if (tk.next == null) {
80 tk.next = tk2 = new Token();
  /external/mesa3d/src/gallium/auxiliary/pipebuffer/
pb_bufmgr_cache.c 15 * next paragraph) shall be included in all copies or substantial portions
127 struct list_head *curr, *next; local
133 curr = mgr->delayed.next;
134 next = curr->next;
143 curr = next;
144 next = curr->next;
267 struct list_head *curr, *next; local
274 curr = mgr->delayed.next;
360 struct list_head *curr, *next; local
    [all...]
  /external/skia/src/core/
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/wpa_supplicant_8/src/eap_server/
eap_server_methods.c 28 for (m = eap_methods; m; m = m->next) {
48 for (m = eap_methods; m; m = m->next) {
113 for (m = eap_methods; m; m = m->next) {
122 last->next = method;
142 eap_methods = eap_methods->next;
166 for (m = eap_methods; m; m = m->next) {
  /frameworks/base/core/jni/android/graphics/
AutoDecodeCancel.cpp 36 AutoDecoderCancel* next = fNext; local
40 prev->fNext = next;
43 gAutoDecoderCancel = next;
45 if (next) {
46 SkASSERT(next->fPrev == this);
47 next->fPrev = prev;
  /system/core/sh/
nodes.h 88 union node *next; member in struct:nclist
96 union node *next; member in struct:narg
104 union node *next; member in struct:nfile
113 union node *next; member in struct:ndup
122 union node *next; member in struct:nhere
153 struct nodelist *next; member in struct:nodelist
  /external/chromium_org/net/disk_cache/
rankings.cc 267 node->Data()->next = my_head.value();
273 node->Data()->next = my_tail.value();
291 // y, prev is x and next is z):
296 // 4. r(0, 0), head(0), tail(0) next.Store()
300 // 2. a(x, r), r(a, b), b(a, y), head(x), tail(y) next.Store()
307 // 3. r(r, b), b(b, y), head(b), tail(y) next.Store()
314 // 4. a(x, a), r(0, 0), head(x), tail(a) next.Store()
317 node->Data()->next, node->Data()->prev, list);
322 Addr next_addr(node->Data()->next);
333 CacheRankingsBlock next(backend_->File(next_addr), next_addr)
    [all...]
  /external/chromium_org/third_party/yasm/source/patched-yasm/modules/preprocs/nasm/
nasm-pp.c 64 SMacro *next; member in struct:SMacro
84 * The `next' field is used for storing MMacros in hash tables; the
92 MMacro *next; member in struct:MMacro
118 Context *next; member in struct:Context
145 Token *next; member in struct:Token
181 Line *next; member in struct:Line
192 Include *next; member in struct:Include
210 Cond *next; member in struct:Cond
458 Blocks *next; member in struct:Blocks
475 static Token *new_Token(Token * next, int type, const char *text
497 struct TMEndItem *next; member in struct:TMEndItem
507 struct TStrucField *next; member in struct:TStrucField
512 struct TStruc *next; member in struct:TStruc
1012 Token *t, *prev, *next; local
1522 Token *next = t->next; local
    [all...]
  /external/chromium_org/sandbox/linux/seccomp-bpf/
instruction.h 30 : code(c), next(n), k(parm) {}
55 Instruction* next; member in union:sandbox::Instruction::__anon12984
  /external/chromium_org/third_party/WebKit/Source/core/dom/
NodeTraversal.h 34 // Does a pre-order traversal of the tree to find the next node after this one.
38 Node* next(const Node&);
39 Node* next(const Node&, const Node* stayWithin);
40 Node* next(const ContainerNode&);
41 Node* next(const ContainerNode&, const Node* stayWithin);
43 // Like next, but skips children and starts with the next sibling.
52 // Like previous, but skips children and starts with the next sibling.
55 // Like next, but visits parents after their children.
79 inline Node* next(const Node& current) { return traverseNextTemplate(current); function in namespace:WebCore::NodeTraversal
80 inline Node* next(const ContainerNode& current) { return traverseNextTemplate(current); } function in namespace:WebCore::NodeTraversal
93 inline Node* next(const Node& current, const Node* stayWithin) { return traverseNextTemplate(current, stayWithin); } function in namespace:WebCore::NodeTraversal
94 inline Node* next(const ContainerNode& current, const Node* stayWithin) { return traverseNextTemplate(current, stayWithin); } function in namespace:WebCore::NodeTraversal
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/rendering/
RenderLayerStackingNodeIterator.h 60 RenderLayerStackingNode* next();
80 RenderLayerStackingNode* next();
RenderTableCol.cpp 145 // If |this| is a column-group, the next column is the colgroup's first child column.
149 // Otherwise it's the next column along.
150 RenderObject* next = nextSibling();
152 // Failing that, the child is the last column in a column-group, so the next column is the next column/column-group after its column-group.
153 if (!next && parent()->isRenderTableCol())
154 next = parent()->nextSibling();
156 for (; next && !next->isRenderTableCol(); next = next->nextSibling()) {
    [all...]
  /external/chromium_org/third_party/WebKit/Tools/GardeningServer/scripts/ui/
actions_unittests.js 59 var next = new ui.actions.Next();
60 equal(next.makeDefault(), next);
61 equal(next.className, 'action next default');
68 new ui.actions.Next()
73 '<li><button class="action next">\u25B6</button></li>');
  /external/chromium_org/third_party/sqlite/src/src/
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/e2fsprogs/misc/
fsck.h 48 struct fs_info *next; member in struct:fs_info
66 struct fsck_instance *next; member in struct:fsck_instance
  /external/guava/guava-tests/test/com/google/common/collect/
UnmodifiableIteratorTest.java 44 public String next() {
53 assertEquals("a", iterator.next());
  /external/junit/src/org/junit/internal/runners/statements/
RunBefores.java 18 public RunBefores(Statement next, List<FrameworkMethod> befores, Object target) {
19 fNext= next;
  /external/openssh/
monitor_mm.h 32 RB_ENTRY(mm_share) next; member in struct:mm_share
46 RB_PROTOTYPE(mmtree, mm_share, next, mm_compare)
  /external/pixman/pixman/
pixman-timer.c 39 for (timer = timers; timer != NULL; timer = timer->next)
62 timer->next = timers;
  /external/qemu/
acl.c 80 QTAILQ_FOREACH(entry, &acl->entries, next) {
104 QTAILQ_FOREACH(entry, &acl->entries, next) {
105 QTAILQ_REMOVE(&acl->entries, entry, next);
123 QTAILQ_INSERT_TAIL(&acl->entries, entry, next);
149 QTAILQ_FOREACH(tmp, &acl->entries, next) {
152 QTAILQ_INSERT_BEFORE(tmp, entry, next);
167 QTAILQ_FOREACH(entry, &acl->entries, next) {
170 QTAILQ_REMOVE(&acl->entries, entry, next);
  /external/qemu/android/skin/
file.h 37 struct SkinButton* next; member in struct:SkinButton
45 struct SkinPart* next; member in struct:SkinPart
57 SkinButton* __button_next = __button->next; \
69 struct SkinLocation* next; member in struct:SkinLocation
73 struct SkinLayout* next; member in struct:SkinLayout
89 SkinLocation* __loc_next = (__loc)->next; \
113 SkinLayout* __layout_next = __layout->next; \
125 SkinPart* __part_next = __part->next; \
  /external/smack/src/org/jivesoftware/smackx/provider/
HeaderProvider.java 33 parser.next();
39 parser.next();
  /external/stlport/test/eh/
test_push_front.h 38 typename C::const_iterator next = c.begin(); local
40 EH_ASSERT( EH_STD::equal( original.begin(), original.end(), ++next ) );
  /external/wpa_supplicant_8/wpa_supplicant/
config_none.c 47 for (ssid = config->ssid; ssid; ssid = ssid->next) {
51 for (blob = config->blobs; blob; blob = blob->next) {
  /hardware/qcom/media/mm-video-legacy/vidc/vdec/inc/
Map.h 42 node* next; member in struct:Map::node
44 data(t), data2(t2), prev(p), next(n) {}
69 head=head->next;
86 tmp = tmp->next;
101 tmp = tmp->next;
124 tmp = tmp->next;
135 tmp = tmp->next;
146 tail->prev->next = tail;
179 tmp = tmp->next;
182 tempnode->next = NULL
    [all...]

Completed in 662 milliseconds

<<11121314151617181920>>