Searched refs:prev (Results 51 - 75 of 693) sorted by relevance

1234567891011>>

/freebsd-10.1-release/contrib/unbound/iterator/
H A Diter_scrub.c64 struct rrset_parse* prev, struct rrset_parse** rrset)
73 if(prev)
74 prev->rrset_all_next = (*rrset)->rrset_all_next;
77 msg->rrset_last = prev;
236 struct rrset_parse* rrset, struct rrset_parse* prev,
275 if(prev)
276 prev->rrset_all_next = cn;
336 struct rrset_parse* rrset, *prev, *nsset=NULL; local
348 prev = NULL;
379 prev
63 remove_rrset(const char* str, sldns_buffer* pkt, struct msg_parse* msg, struct rrset_parse* prev, struct rrset_parse** rrset) argument
234 synth_cname_rrset(uint8_t** sname, size_t* snamelen, uint8_t* alias, size_t aliaslen, struct regional* region, struct msg_parse* msg, struct rrset_parse* rrset, struct rrset_parse* prev, struct rrset_parse* nx, sldns_buffer* pkt) argument
604 struct rrset_parse* rrset, *prev; local
[all...]
H A Diter_priv.c213 struct rr_parse* prev, struct rr_parse** rr, struct sockaddr_storage* addr, socklen_t addrlen)
220 if(prev)
221 prev->next = (*rr)->next;
224 rrset->rr_last = prev;
245 struct rr_parse* rr, *prev = NULL; local
257 prev = rr;
264 if(remove_rr("sanitize: removing public name with private address", pkt, rrset, prev, &rr, &addr, len))
268 prev = rr;
280 prev = rr;
287 if(remove_rr("sanitize: removing public name with private address", pkt, rrset, prev,
212 remove_rr(const char* str, sldns_buffer* pkt, struct rrset_parse* rrset, struct rr_parse* prev, struct rr_parse** rr, struct sockaddr_storage* addr, socklen_t addrlen) argument
[all...]
/freebsd-10.1-release/sys/geom/sched/
H A Dsubr_disk.c194 struct bio *cur, *prev; local
208 prev = NULL;
213 prev = head->insert_point;
218 prev = cur;
222 if (prev == NULL)
225 TAILQ_INSERT_AFTER(&head->queue, prev, bp, bio_queue);
/freebsd-10.1-release/contrib/texinfo/info/
H A Dwindow.c202 if (win->prev)
203 win->first_row = (win->prev->first_row + win->prev->height) + 1;
242 if (win->prev)
244 (win->prev->first_row + win->prev->height) + 1;
320 window->prev = active_window->prev;
321 active_window->prev = window;
323 if (window->prev)
379 register WINDOW *win, *prev, *next; local
615 WINDOW *next, *prev, *window_to_fix; local
[all...]
/freebsd-10.1-release/contrib/less/
H A Dlinenum.c44 struct linenum_info *prev; /* Line to previous in the list */ member in struct:linenum_info
46 POSITION gap; /* Gap between prev and next */
94 anchor.next = anchor.prev = &anchor;
115 p->gap = p->next->pos - p->prev->pos;
143 prevp = p->prev;
168 new->prev = prevp;
172 nextp->prev = new;
202 spare->next->prev = spare->prev;
203 spare->prev
[all...]
/freebsd-10.1-release/contrib/unbound/services/
H A Doutbound_list.h64 /** prev in list */
65 struct outbound_entry* prev; member in struct:outbound_entry
/freebsd-10.1-release/contrib/wpa/src/ap/
H A Dap_list.c26 /* AP list is a double linked list with head->prev pointing to the end of the
67 ap->prev = iface->ap_list->prev;
68 iface->ap_list->prev = ap;
70 ap->prev = ap;
81 ap->prev->next = ap->next;
84 ap->next->prev = ap->prev;
86 iface->ap_list->prev = ap->prev;
160 struct ap_info *ap, *prev; local
[all...]
H A Dpmksa_cache_auth.c54 struct rsn_pmksa_cache_entry *pos, *prev; local
59 prev = NULL;
62 if (prev != NULL) {
63 prev->hnext = pos->hnext;
70 prev = pos;
75 prev = NULL;
78 if (prev != NULL)
79 prev->next = pos->next;
84 prev = pos;
190 struct rsn_pmksa_cache_entry *pos, *prev; local
332 struct rsn_pmksa_cache_entry *entry, *prev; local
[all...]
/freebsd-10.1-release/sys/contrib/ia64/libuwx/src/
H A Duwx_str.c90 struct uwx_str_pool *prev; local
94 prev = 0;
96 prev = pool;
114 prev->next = pool;
/freebsd-10.1-release/sys/dev/drm/
H A Di915_mem.c78 list[(unsigned)list[i].next].prev = list[i].prev;
79 list[(unsigned)list[i].prev].next = list[i].next;
83 list[i].prev = nr;
85 list[(unsigned)list[nr].next].prev = i;
107 newblock->prev = p;
108 p->next->prev = newblock;
124 newblock->prev = p;
125 p->next->prev = newblock;
173 p->next->prev
[all...]
H A Dradeon_mem.c57 newblock->prev = p;
58 p->next->prev = newblock;
74 newblock->prev = p;
75 p->next->prev = newblock;
123 p->next->prev = p;
127 if (p->prev->file_priv == NULL) {
128 struct mem_block *q = p->prev;
131 q->next->prev = q;
154 blocks->next = blocks->prev = *heap;
158 (*heap)->next = (*heap)->prev
[all...]
/freebsd-10.1-release/sys/dev/tws/
H A Dtws_services.c225 req->next = req->prev = NULL;
241 req->prev = NULL;
242 sc->q_head[q_type]->prev = req;
258 req->prev = sc->q_tail[q_type];
277 if ( r->next == NULL && r->prev == NULL ) {
282 r->next->prev = NULL;
284 r->prev = NULL;
300 if ( r->next == NULL && r->prev == NULL ) {
304 sc->q_tail[q_type] = r->prev;
305 r->prev
[all...]
/freebsd-10.1-release/contrib/llvm/tools/lldb/include/lldb/Core/
H A DRangeMap.h215 typename Collection::const_iterator pos, end, prev; local
218 for (pos = m_entries.begin(), end = m_entries.end(), prev = end; pos != end; prev = pos++)
220 if (prev != end && *pos < *prev)
238 typename Collection::iterator prev; local
242 for (pos = m_entries.begin(), end = m_entries.end(), prev = end; pos != end; prev = pos++)
244 if (prev != end && prev
495 typename Collection::const_iterator pos, end, prev; local
518 typename Collection::iterator prev; local
828 typename Collection::const_iterator pos, end, prev; local
848 typename Collection::iterator prev; local
1089 typename Collection::const_iterator pos, end, prev; local
1109 typename Collection::iterator prev; local
1413 typename Collection::const_iterator pos, end, prev; local
[all...]
/freebsd-10.1-release/lib/libthr/thread/
H A Dthr_clean.c59 newbuf->prev = curthread->cleanup;
70 curthread->cleanup = old->prev;
91 newbuf->prev = curthread->cleanup;
/freebsd-10.1-release/sys/dev/twa/
H A Dtw_cl_share.h215 struct tw_cl_link *prev; member in struct:tw_cl_link
270 (head)->prev = (head)->next = head; \
277 (item)->prev = head; \
278 (head)->next->prev = item; \
286 (item)->prev = (head)->prev; \
287 (head)->prev->next = item; \
288 (head)->prev = item; \
294 (item)->prev->next = (item)->next; \
295 (item)->next->prev
[all...]
/freebsd-10.1-release/sys/dev/drm2/radeon/
H A Dradeon_mem.c56 newblock->prev = p;
57 p->next->prev = newblock;
73 newblock->prev = p;
74 p->next->prev = newblock;
122 p->next->prev = p;
126 if (p->prev->file_priv == NULL) {
127 struct mem_block *q = p->prev;
130 q->next->prev = q;
154 blocks->next = blocks->prev = *heap;
157 (*heap)->next = (*heap)->prev
[all...]
/freebsd-10.1-release/contrib/ofed/libmlx4/src/
H A Ddbrec.c45 struct mlx4_db_page *prev, *next; member in struct:mlx4_db_page
81 page->prev = NULL;
85 page->next->prev = page;
141 if (page->prev)
142 page->prev->next = page->next;
146 page->next->prev = page->prev;
/freebsd-10.1-release/contrib/wpa/src/utils/
H A Deloop_none.c116 struct eloop_timeout *timeout, *tmp, *prev; local
138 prev = NULL;
143 prev = tmp;
147 if (prev == NULL) {
151 timeout->next = prev->next;
152 prev->next = timeout;
162 struct eloop_timeout *timeout, *prev, *next; local
165 prev = NULL;
175 if (prev == NULL)
178 prev
370 struct eloop_timeout *timeout, *prev; local
[all...]
/freebsd-10.1-release/contrib/ntp/lib/isc/
H A Dstats.c196 isc_int32_t prev; local
208 prev = isc_atomic_xadd((isc_int32_t *)&stats->counters[counter].lo, 1);
217 if (prev == (isc_int32_t)0xffffffff)
220 UNUSED(prev);
223 UNUSED(prev);
234 isc_int32_t prev; local
241 prev = isc_atomic_xadd((isc_int32_t *)&stats->counters[counter].lo, -1);
242 if (prev == 0)
246 UNUSED(prev);
249 UNUSED(prev);
[all...]
/freebsd-10.1-release/contrib/binutils/binutils/
H A Darsup.c75 bfd *prev = arch; local
83 function (head, prev);
85 prev = head;
213 ar_addlib_doer (bfd *abfd, bfd *prev) argument
216 if (prev != NULL)
217 prev->archive_next = abfd->archive_next;
295 bfd **prev = &(obfd->archive_head); local
302 *prev = member->archive_next;
306 prev = &(member->archive_next);
357 bfd **prev local
[all...]
/freebsd-10.1-release/contrib/wpa/src/rsn_supp/
H A Dpmksa_cache.c127 struct rsn_pmksa_cache_entry *entry, *pos, *prev; local
151 prev = NULL;
163 if (prev == NULL)
166 prev->next = pos->next;
180 prev = pos;
210 prev = NULL;
214 prev = pos;
217 if (prev == NULL) {
222 entry->next = prev->next;
223 prev
241 struct rsn_pmksa_cache_entry *entry, *prev = NULL, *tmp; local
273 struct rsn_pmksa_cache_entry *entry, *prev; local
[all...]
/freebsd-10.1-release/crypto/heimdal/base/
H A Ddict.c39 struct hashentry **prev; member in struct:hashentry
215 h->prev = tabptr;
217 h->next->prev = &h->next;
241 if ((*(h->prev) = h->next) != NULL)
242 h->next->prev = h->prev;
/freebsd-10.1-release/sys/kern/
H A Dsubr_disk.c235 struct bio *cur, *prev; local
249 prev = NULL;
254 prev = head->insert_point;
259 prev = cur;
263 if (prev == NULL)
266 TAILQ_INSERT_AFTER(&head->queue, prev, bp, bio_queue);
/freebsd-10.1-release/sys/net80211/
H A Dieee80211_ageq.c194 struct mbuf *m, **prev, *ohead; local
199 prev = &aq->aq_head;
201 while ((m = *prev) != NULL) {
203 prev = &m->m_nextpkt;
221 aq->aq_tail = (struct mbuf *)((uintptr_t)prev -
225 *prev = m->m_nextpkt;
/freebsd-10.1-release/contrib/jemalloc/src/
H A Dchunk.c217 extent_node_t *xnode, *node, *prev, *xprev, key; local
229 /* Use xprev to implement conditional deferred deallocation of prev. */
268 prev = extent_tree_ad_prev(chunks_ad, node);
269 if (prev != NULL && (void *)((uintptr_t)prev->addr + prev->size) ==
276 extent_tree_szad_remove(chunks_szad, prev);
277 extent_tree_ad_remove(chunks_ad, prev);
280 node->addr = prev->addr;
281 node->size += prev
[all...]

Completed in 598 milliseconds

1234567891011>>