| /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;
|
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| 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...] |
| brw_vec4_reg_allocate.cpp | 11 * The above copyright notice and this permission notice (including the next
50 int next; local
72 next = hw_reg_mapping[0] + this->virtual_grf_sizes[0];
75 hw_reg_mapping[i] = next;
76 next += this->virtual_grf_sizes[i];
79 prog_data->total_grf = next;
|
| /external/mesa3d/src/mesa/program/ |
| prog_cache.c | 15 * next paragraph) shall be included in all copies or substantial portions
42 struct cache_item *next; member in struct:cache_item
85 struct cache_item *c, *next; local
95 for (c = cache->items[i]; c; c = next) {
96 next = c->next;
97 c->next = items[c->hash % size];
111 struct cache_item *c, *next; local
117 for (c = cache->items[i]; c; c = next) {
118 next = c->next
[all...] |
| /external/nist-sip/java/gov/nist/javax/sip/message/ |
| HeaderIterator.java | 49 public Object next() throws NoSuchElementException { method in class:HeaderIterator
|
| /external/nist-sip/java/gov/nist/javax/sip/parser/ims/ |
| PVisitedNetworkIDParser.java | 135 char next = this.lexer.getNextChar(); local
136 if (next == '\"') {
139 } else if (next == '\0') {
141 } else if (next == '\\') {
142 retval.append(next);
143 next = this.lexer.getNextChar();
144 retval.append(next);
146 retval.append(next);
|
| /external/openssh/ |
| monitor_mm.c | 58 RB_GENERATE(mmtree, mm_share, next, mm_compare)
121 struct mm_share *mms, *next; local
123 for (mms = RB_ROOT(head); mms; mms = next) {
124 next = RB_NEXT(mmtree, head, mms);
231 if (RB_LEFT(prev, next)) {
232 prev = RB_LEFT(prev, next);
233 while (RB_RIGHT(prev, next))
234 prev = RB_RIGHT(prev, next);
236 if (RB_PARENT(prev, next) &&
237 (prev == RB_RIGHT(RB_PARENT(prev, next), next))
[all...] |
| /external/openssl/crypto/pqueue/ |
| pqueue.c | 79 item->next = NULL;
113 pitem *curr, *next; local
121 for(curr = NULL, next = pq->items;
122 next != NULL;
123 curr = next, next = next->next)
127 int cmp = memcmp(next->priority, item->priority,8);
128 if (cmp > 0) /* next > item *
170 pitem *next; local
[all...] |
| /external/oprofile/libop/ |
| op_alloc_counter.c | 24 struct list_head next; member in struct:counter_arc_head
31 /** the next counter allowed for this event */
32 struct list_head next; member in struct:counter_arc
56 list_init(&ctr_arc[i].next);
69 list_add_tail(&arc->next, &ctr_arc[i].next);
90 list_for_each_safe(pos, pos2, &ctr_arc[i].next) {
91 counter_arc * arc = list_entry(pos, counter_arc, next);
92 list_del(&arc->next);
135 if((&ctr_arc[depth].next)->next == &ctr_arc[depth].next)
[all...] |
| /external/oprofile/libutil/ |
| op_list.h | 19 * sometimes we already know the next/prev entries and we can
25 struct list_head * next, * prev; member in struct:list_head
36 ptr->next = ptr;
44 * the prev/next entries already!
48 struct list_head * next)
50 next->prev = new_entry;
51 new_entry->next = next;
53 prev->next = new_entry;
66 __list_add(new_entry, head, head->next);
[all...] |
| /external/oprofile/opjitconv/ |
| opjitconv.h | 42 struct jitentry * next; member in struct:jitentry
64 struct jitentry_debug_line * next; member in struct:jitentry_debug_line
|
| /external/ppp/pppd/ |
| chap-new.h | 111 struct chap_digest_type *next; member in struct:chap_digest_type
|
| /external/proguard/src/proguard/optimize/peephole/ |
| ReachableCodeMarker.java | 44 private boolean next; field in class:ReachableCodeMarker
127 next = false;
141 next = false;
158 next = false;
178 next = false;
217 boolean oldNext = next;
221 next = oldNext;
230 boolean oldNext = next;
244 // By default, we'll assume we can continue with the next
246 next = true
[all...] |
| /external/protobuf/gtest/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/qemu/ |
| async.c | 124 QEMUBH *next; member in struct:QEMUBH
133 bh->next = async_context->first_bh;
144 for (bh = async_context->first_bh; bh; bh = bh->next) {
159 *bhp = bh->next;
162 bhp = &bh->next;
201 for (bh = async_context->first_bh; bh; bh = bh->next) {
|
| iohandler.c | 41 QLIST_ENTRY(IOHandlerRecord) next;
59 QLIST_FOREACH(ioh, &io_handlers, next) {
66 QLIST_FOREACH(ioh, &io_handlers, next) {
71 QLIST_INSERT_HEAD(&io_handlers, ioh, next);
95 QLIST_FOREACH(ioh, &io_handlers, next) {
118 QLIST_FOREACH_SAFE(ioh, &io_handlers, next, pioh) {
128 QLIST_REMOVE(ioh, next);
140 QLIST_ENTRY(ChildProcessRecord) next;
155 ChildProcessRecord *rec, *next; local
157 QLIST_FOREACH_SAFE(rec, &child_watches, next, next)
[all...] |
| /external/qemu/distrib/zlib-1.2.3/ |
| inftrees.c | 27 on return points to the next available entry's address. bits is the
54 code FAR *next; /* next available space in table */ local
151 filled is at next and has curr index bits. The code being used is huff
204 next = *table; /* current table to fill in */
235 min = fill; /* save offset to next table */
238 next[(huff >> drop) + fill] = this;
252 /* go to next symbol, update count, len */
266 next += min; /* here min is 1 << curr */
268 /* determine length of next table *
[all...] |
| /external/qemu/slirp/ |
| misc.h | 63 struct emu_t *next; member in struct:emu_t
|
