Searched refs:prevp (Results 1 - 11 of 11) sorted by relevance
| /freebsd-current/usr.sbin/crunch/crunchide/ |
| H A D | crunchide.c | 144 struct keep *newp, *prevp, *curp; local
149 for(curp = keep_list, prevp = NULL; curp; prevp = curp, curp = curp->next)
163 if(prevp) prevp->next = newp;
|
| /freebsd-current/usr.bin/gprof/ |
| H A D | printgprof.c | 406 arctype *prevp; local
414 * *prevp arc before the arc you are comparing.
424 for ( prevp = &sorted ;
425 prevp -> arc_childlist ;
426 prevp = prevp -> arc_childlist ) {
427 if ( arccmp( arcp , prevp -> arc_childlist ) != LESSTHAN ) {
431 arcp -> arc_childlist = prevp -> arc_childlist;
432 prevp -> arc_childlist = arcp;
446 arctype *prevp; local
[all...] |
| /freebsd-current/contrib/less/ |
| H A D | linenum.c | 128 struct linenum_info *prevp; local
140 prevp = p->prev;
165 new->prev = prevp;
170 prevp->next = new;
177 calcgap(prevp);
|
| /freebsd-current/contrib/unbound/util/ |
| H A D | module.c | 300 struct inplace_cb** prevp; local
317 prevp = (struct inplace_cb**) &env->inplace_cb_lists[type];
319 while(*prevp != NULL)
320 prevp = &((*prevp)->next);
321 *prevp = callback;
|
| /freebsd-current/contrib/libarchive/unzip/ |
| H A D | la_queue.h | 175 #define QMD_SLIST_CHECK_PREVPTR(prevp, elm) do { \
176 if (*(prevp) != (elm)) \
178 (prevp), *(prevp), (elm)); \
181 #define QMD_SLIST_CHECK_PREVPTR(prevp, elm)
265 #define SLIST_REMOVE_PREVPTR(prevp, elm, field) do { \
266 QMD_SLIST_CHECK_PREVPTR(prevp, elm); \
267 *(prevp) = SLIST_NEXT(elm, field); \
|
| /freebsd-current/sys/sys/ |
| H A D | queue.h | 205 #define QMD_SLIST_CHECK_PREVPTR(prevp, elm) do { \
206 if (*(prevp) != (elm)) \
208 (prevp), *(prevp), (elm)); \
211 #define QMD_SLIST_CHECK_PREVPTR(prevp, elm)
297 #define SLIST_REMOVE_PREVPTR(prevp, elm, field) do { \
298 QMD_SLIST_CHECK_PREVPTR(prevp, elm); \
299 *(prevp) = SLIST_NEXT(elm, field); \
|
| /freebsd-current/sys/contrib/ck/include/ |
| H A D | ck_queue.h | 188 #define CK_SLIST_INSERT_PREVPTR(prevp, slistelm, elm, field) do { \
191 ck_pr_store_ptr(prevp, elm); \
215 #define CK_SLIST_REMOVE_PREVPTR(prevp, elm, field) do { \
|
| /freebsd-current/contrib/unbound/util/data/ |
| H A D | msgreply.c | 1073 struct edns_option** prevp; local
1092 prevp = list;
1093 while(*prevp != NULL)
1094 prevp = &((*prevp)->next);
1096 *prevp = opt;
1113 struct edns_option** prevp; local
1131 prevp = list;
1132 while(*prevp != NULL) {
1133 prevp
[all...] |
| /freebsd-current/contrib/unbound/util/storage/ |
| H A D | lruhash.c | 171 struct lruhash_entry** prevp = &bin->overflow_list; local
174 *prevp = p->overflow_next;
177 prevp = &p->overflow_next;
|
| /freebsd-current/contrib/unbound/validator/ |
| H A D | autotrust.c | 1984 struct autr_ta* p, **prevp; local
1985 prevp = &tp->autr->keys;
1997 *prevp = np;
2004 prevp = &p->next;
|
| /freebsd-current/sys/cddl/contrib/opensolaris/uts/common/dtrace/ |
| H A D | dtrace.c | 8108 dtrace_probe_t **nextp, **prevp;
8132 prevp = DTRACE_HASHPREV(hash, bucket->dthb_chain);
8133 ASSERT(*prevp == NULL);
8134 *prevp = new;
8177 dtrace_probe_t **prevp = DTRACE_HASHPREV(hash, probe);
8190 if (*prevp == NULL) {
8217 *(DTRACE_HASHNEXT(hash, *prevp)) = *nextp;
8221 *(DTRACE_HASHPREV(hash, *nextp)) = *prevp;
|
Completed in 265 milliseconds