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