Searched refs:next (Results 51 - 75 of 2497) sorted by relevance

1234567891011>>

/freebsd-10.0-release/gnu/usr.bin/rcs/lib/
H A Drcsrev.c372 store1(store, next)
374 struct hshentry *next;
383 p->first = next;
399 register struct hshentry * next; local
407 if (!(next = Head)) {
416 while ((result=cmpnumfld(revno,next->num,1)) < 0) {
417 store1(&store, next);
418 next = next->next;
532 register struct hshentry * next, * trail; local
656 register struct assoc const *next; local
[all...]
/freebsd-10.0-release/crypto/heimdal/lib/hx509/
H A Denv.c68 n->next = NULL;
84 while (e->next)
85 e = e->next;
86 e->next = n;
119 n->next = NULL;
130 while (e->next)
131 e = e->next;
132 e->next = n;
161 env = env->next;
184 env = env->next;
218 hx509_env next = b->next; local
[all...]
/freebsd-10.0-release/sys/dev/drm/
H A Di915_mem.c16 * next paragraph) shall be included in all copies or substantial portions
78 list[(unsigned)list[i].next].prev = list[i].prev;
79 list[(unsigned)list[i].prev].next = list[i].next;
84 list[i].next = list[nr].next;
85 list[(unsigned)list[nr].next].prev = i;
86 list[nr].next = i;
106 newblock->next = p->next;
[all...]
H A Dradeon_mem.c16 * The above copyright notice and this permission notice (including the next
56 newblock->next = p->next;
58 p->next->prev = newblock;
59 p->next = newblock;
73 newblock->next = p->next;
75 p->next->prev = newblock;
76 p->next = newblock;
119 if (p->next
[all...]
/freebsd-10.0-release/contrib/xz/src/liblzma/common/
H A Dfilter_buffer_encoder.c27 lzma_next_coder next = LZMA_NEXT_CODER_INIT;
28 return_if_error(lzma_raw_encoder_init(&next, allocator, filters));
36 lzma_ret ret = next.code(next.coder, allocator, in, &in_pos, in_size,
38 lzma_next_end(&next, allocator);
H A Dfilter_buffer_decoder.c27 lzma_next_coder next = LZMA_NEXT_CODER_INIT;
28 return_if_error(lzma_raw_decoder_init(&next, allocator, filters));
36 lzma_ret ret = next.code(next.coder, allocator, in, in_pos, in_size,
68 (void)next.code(next.coder, allocator,
84 lzma_next_end(&next, allocator);
H A Dcommon.c91 lzma_next_filter_init(lzma_next_coder *next, lzma_allocator *allocator, argument
94 lzma_next_coder_init(filters[0].init, next, allocator);
95 next->id = filters[0].id;
97 ? LZMA_OK : filters[0].init(next, allocator, filters);
102 lzma_next_filter_update(lzma_next_coder *next, lzma_allocator *allocator, argument
107 // reversed_filters[0].id and next->id.
108 if (reversed_filters[0].id != next->id)
114 assert(next->update != NULL);
115 return next->update(next
120 lzma_next_end(lzma_next_coder *next, lzma_allocator *allocator) argument
[all...]
/freebsd-10.0-release/sys/contrib/ia64/libuwx/src/
H A Duwx_str.c58 pool->next = 0;
70 struct uwx_str_pool *next; local
75 pool = pool->next;
76 for (; pool != 0; pool = next) {
77 next = pool->next;
95 for (pool = env->string_pool; pool != 0; pool = pool->next) {
111 pool->next = 0;
114 prev->next = pool;
126 for (pool = env->string_pool; pool != 0; pool = pool->next)
[all...]
H A Duwx_scoreboard.c151 struct uwx_scoreboard *next; local
154 next = sb->nextstack;
159 sb = next;
174 struct uwx_scoreboard *next; local
203 next = new->nextstack;
207 new = next;
223 struct uwx_scoreboard *next; local
234 next = sb->nextstack;
235 while (next != 0) {
236 TRACE_B_COPY_FREE(next
299 struct uwx_scoreboard *next; local
[all...]
/freebsd-10.0-release/contrib/binutils/libiberty/
H A Dobjalloc.c61 struct objalloc_chunk *next; member in struct:objalloc_chunk
103 chunk->next = NULL;
141 chunk->next = (struct objalloc_chunk *) o->chunks;
155 chunk->next = (struct objalloc_chunk *) o->chunks;
177 struct objalloc_chunk *next; local
179 next = l->next;
181 l = next;
199 for (p = (struct objalloc_chunk *) o->chunks; p != NULL; p = p->next)
234 struct objalloc_chunk *next; local
276 struct objalloc_chunk *next; local
[all...]
/freebsd-10.0-release/contrib/gcclibs/libiberty/
H A Dobjalloc.c61 struct objalloc_chunk *next; member in struct:objalloc_chunk
103 chunk->next = NULL;
141 chunk->next = (struct objalloc_chunk *) o->chunks;
155 chunk->next = (struct objalloc_chunk *) o->chunks;
177 struct objalloc_chunk *next; local
179 next = l->next;
181 l = next;
199 for (p = (struct objalloc_chunk *) o->chunks; p != NULL; p = p->next)
234 struct objalloc_chunk *next; local
276 struct objalloc_chunk *next; local
[all...]
/freebsd-10.0-release/contrib/gdb/gdb/
H A Dbuildsym.c94 while (link->next) link = link->next;
95 link->next = free_pendings;
121 free_pendings = link->next;
128 link->next = *listhead;
162 list = list->next;
173 struct pending *next, *next1;
175 for (next = free_pendings; next; next
170 struct pending *next, *next1; local
228 struct pending *next, *next1; local
469 struct pending_block *next; local
[all...]
H A Dtracepoint.h27 struct action_line *next; member in struct:action_line
35 struct tracepoint *next; member in struct:tracepoint
128 #define ALL_TRACEPOINTS(t) for (t = tracepoint_chain; t; t = t->next)
132 t ? (tmp = t->next, 1) : 0;\
/freebsd-10.0-release/contrib/subversion/subversion/libsvn_wc/
H A Dtree_conflicts.c94 && skel->children->next->is_atom
95 && skel->children->next->next->is_atom
96 && skel->children->next->next->next->is_atom
97 && skel->children->next->next->next->next
[all...]
/freebsd-10.0-release/contrib/xz/src/liblzma/simple/
H A Dsimple_coder.c28 if (coder->next.code == NULL) {
37 // Call the next coder in the chain to provide us some data.
38 const lzma_ret ret = coder->next.code(
39 coder->next.coder, allocator,
117 // restarted if the next filter in the chain returns e.g.
141 // the next coder in the chain (if any) was successful.
203 lzma_next_end(&coder->next, allocator);
215 // No update support, just call the next filter in the chain.
217 &coder->next, allocator, reversed_filters + 1);
222 lzma_simple_coder_init(lzma_next_coder *next, lzma_allocato argument
[all...]
/freebsd-10.0-release/lib/libc/include/isc/
H A Dlist.h33 #define LINK(type) struct { type *prev, *next; }
37 (elt)->link.next = (type *)(-1); \
55 (elt)->link.next = (list).head; \
63 (list).tail->link.next = (elt); \
67 (elt)->link.next = NULL; \
74 if ((elt)->link.next != NULL) \
75 (elt)->link.next->link.prev = (elt)->link.prev; \
81 (elt)->link.prev->link.next = (elt)->link.next; \
84 (list).head = (elt)->link.next; \
[all...]
/freebsd-10.0-release/sys/dev/isci/scil/
H A Dsci_base_subject.c94 this_observer = this_observer->next;
105 observer->next = this_subject->observer_list;
127 current_observer = current_observer->next;
136 previous_observer->next = observer->next;
141 this_subject->observer_list = observer->next;
145 observer->next = NULL;
/freebsd-10.0-release/contrib/subversion/subversion/libsvn_fs_fs/
H A Dkey-gen.c81 svn_fs_fs__next_key(const char *this, apr_size_t *len, char *next)
111 next[i] = '0';
117 next[i] = 'a';
119 next[i] = ++c;
123 next[i] = c;
136 next[*len] = '\0';
141 memmove(next+1, next, olen);
142 next[0] = '1';
80 svn_fs_fs__next_key(const char *this, apr_size_t *len, char *next) argument
/freebsd-10.0-release/contrib/gcc/
H A Dtree-iterator.c95 head->next = NULL;
109 head->prev->next = head;
112 tail->next = cur;
119 head->prev->next = head;
171 head->next = NULL;
183 tail->next = cur->next;
184 if (tail->next)
185 tail->next->prev = tail;
189 cur->next
221 struct tree_statement_list_node *cur, *next, *prev; local
248 struct tree_statement_list_node *cur, *next; local
[all...]
H A Dgenmddeps.c29 struct filedep *next; member in struct:filedep
41 last = &n->next;
59 for (d = deps; d ; d = d->next)
65 for (d = deps; d ; d = d->next)
/freebsd-10.0-release/lib/libc/stdlib/
H A Dquick_exit.c38 struct quick_exit_handler *next; member in struct:quick_exit_handler
62 h->next = handlers;
77 for (h = handlers; NULL != h; h = h->next)
/freebsd-10.0-release/tools/tools/drm/radeon/mkregtable/
H A Dmkregtable.c39 * sometimes we already know the next/prev entries and we can
45 struct list_head *next, *prev; member in struct:list_head
55 list->next = list;
63 * the prev/next entries already!
67 struct list_head *prev, struct list_head *next)
69 next->prev = new;
70 new->next = next;
72 prev->next = new;
76 struct list_head *prev, struct list_head *next);
66 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
112 __list_del(struct list_head *prev, struct list_head *next) argument
225 struct list_head *next = head->next; local
279 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument
[all...]
/freebsd-10.0-release/sys/dev/drm2/radeon/
H A Dradeon_mem.c16 * The above copyright notice and this permission notice (including the next
55 newblock->next = p->next;
57 p->next->prev = newblock;
58 p->next = newblock;
72 newblock->next = p->next;
74 p->next->prev = newblock;
75 p->next = newblock;
118 if (p->next
[all...]
/freebsd-10.0-release/contrib/llvm/lib/Analysis/
H A DPathProfileInfo.cpp125 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...]
/freebsd-10.0-release/bin/date/
H A Dvary.h31 struct vary *next; member in struct:vary

Completed in 213 milliseconds

1234567891011>>