| /external/iproute2/misc/ |
| lnstat.h | 25 struct lnstat_file *next; member in struct:lnstat_file
|
| /external/iproute2/tc/ |
| m_ematch.h | 18 struct bstr *next; member in struct:bstr
49 return b->next;
64 struct ematch *next; member in struct:ematch
91 struct ematch_util *next; member in struct:ematch_util
|
| tc_util.h | 28 struct qdisc_util *next; member in struct:qdisc_util
41 struct filter_util *next; member in struct:filter_util
50 struct action_util *next; member in struct:action_util
|
| /external/ipsec-tools/src/racoon/ |
| evt.h | 69 TAILQ_ENTRY(evt) next; member in struct:evt
|
| isakmp_unity.h | 66 struct unity_netentry *next; member in struct:unity_netentry
|
| /external/iptables/extensions/ |
| libip6t_hbh.c | 60 char *buffer, *cp, *next, *range; local
66 for (cp=buffer, i=0; cp && i<IP6T_OPTS_OPTSNR; cp=next,i++)
68 next=strchr(cp, ',');
69 if (next) *next++='\0';
|
| /external/jmonkeyengine/engine/src/android/com/jme3/util/ |
| RingBuffer.java | 17 private int indexIn = 0; // index of next available slot
69 public T next() { method in class:RingBuffer.RingBufferIterator
|
| /external/jsilver/src/com/google/clearsilver/jsilver/data/ |
| UniqueStack.java | 69 public T next() { method in class:UniqueStack.ImmutableIterator
70 return iterator.next();
|
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
| Node.java | 49 s.append(i.next());
|
| /external/junit/src/org/junit/runner/notification/ |
| RunNotifier.java | 41 notifyListener(all.next());
151 * Ask that the tests run stop before starting the next test. Phrased politely because
|
| /external/kernel-headers/original/linux/ |
| file.h | 42 struct fdtable *next; member in struct:fdtable
|
| /external/libppp/src/ |
| timer.c | 105 for (t = TimerList; t; t = t->next) {
122 tp->next = t;
124 pt->next = tp;
142 * A RUNNING timer must be removed from TimerList (->next list).
143 * A STOPPED timer isn't in any list, but may have a bogus [e]next field.
151 for (t = TimerList; t != tp && t != NULL; t = t->next)
156 pt->next = t->next;
158 TimerList = t->next;
162 if (t->next) {
192 struct pppTimer *tp, *exp, *next; local
[all...] |
| /external/libsepol/include/sepol/policydb/ |
| ebitmap.h | 31 struct ebitmap_node *next; member in struct:ebitmap_node
58 if ((bit == ((*n)->startbit + MAPSIZE - 1)) && (*n)->next) {
59 *n = (*n)->next;
|
| /external/libvpx/libvpx/third_party/googletest/src/samples/ |
| sample3-inl.h | 47 // type E and a pointer to the next node.
56 // Gets the next node in the queue.
57 QueueNode* next() { return next_; } function in class:QueueNode
58 const QueueNode* next() const { return next_; } function in class:QueueNode
61 // Creates a node with a given element value. The next pointer is
88 QueueNode<E>* next = node->next(); local
91 node = next;
93 next = node->next();
[all...] |
| /external/libvpx/libvpx/vpx_mem/include/ |
| vpx_mem_tracker.h | 32 * next; member in struct:mem_block
|
| /external/libvpx/libvpx/vpx_mem/memory_manager/ |
| hmm_base.c | 29 to_remove->prev->next = to_remove->next;
31 if (to_remove->next)
32 to_remove->next->prev = to_remove->prev;
57 ptr_rec_ptr->next = bin_front_ptr->next;
58 bin_front_ptr->next = ptr_rec_ptr;
60 if (ptr_rec_ptr->next)
61 ptr_rec_ptr->next->prev = ptr_rec_ptr;
64 ptr_rec_ptr->next = 0
150 ptr_record *next = ptr_rec_ptr->next; variable
[all...] |
| /external/linux-tools-perf/ |
| builtin-annotate.c | 119 struct rb_node *nd = rb_first(&self->entries), *next; local
143 next = rb_next(nd);
146 next = rb_prev(nd);
152 if (next != NULL)
153 nd = next;
|
| /external/linux-tools-perf/util/ |
| strlist.c | 176 struct rb_node *next = rb_first(&self->entries); local
178 while (next) {
179 pos = rb_entry(next, struct str_node, rb_node);
180 next = rb_next(&pos->rb_node);
|
| /external/llvm/include/llvm/Support/ |
| CrashRecoveryContext.h | 117 CrashRecoveryContextCleanup *prev, *next; member in class:llvm::CrashRecoveryContextCleanup
|
| /external/mesa3d/src/gallium/auxiliary/draw/ |
| draw_pipe_validate.c | 15 * next paragraph) shall be included in all copies or substantial portions
161 struct draw_stage *next = draw->pipeline.rasterize; local
167 /* Set the validate's next stage to the rasterize stage, so that it
170 stage->next = next;
196 draw->pipeline.aaline->next = next;
197 next = draw->pipeline.aaline;
202 draw->pipeline.aapoint->next = next;
[all...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_double_list.h | 23 * next paragraph) shall be included in all copies or substantial portions
48 struct list_head *next; member in struct:list_head
54 item->next = item;
60 item->next = list->next;
61 list->next->prev = item;
62 list->next = item;
67 item->next = list;
69 list->prev->next = item;
76 to->next = from->next
[all...] |
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| lp_state_setup.h | 13 struct lp_setup_variant_list_item *next, *prev; member in struct:lp_setup_variant_list_item
|
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_target.cpp | 175 !fi.end(); fi.next()) {
208 for (IteratorRef it = func->cfg.iteratorCFG(); !it->end(); it->next())
215 Instruction *i, *next; local
246 for (i = bb->getEntry(); i; i = next) {
247 next = i->next;
250 if (next && i->encSize < 8)
253 if ((nShort & 1) && next && getMinEncodingSize(next) == 4) {
254 if (i->isCommutationLegal(i->next)) {
[all...] |
| /external/mesa3d/src/gallium/drivers/r300/ |
| r300_fs.h | 13 * The above copyright notice and this permission notice (including the next
56 struct r300_fragment_shader_code* next; member in struct:r300_fragment_shader_code
|
| /external/mesa3d/src/gallium/state_trackers/d3d1x/dxgi/src/ |
| dxgi_loader.cpp | 75 const char *cur, *next; local
80 next = strchr(cur, ':');
81 len = (next) ? next - cur : strlen(cur);
86 cur = (next) ? next + 1 : NULL;
|
