Searched refs:prevp (Results 1 - 12 of 12) sorted by relevance
| /freebsd-13-stable/contrib/unbound/util/ |
| H A D | module.c | 131 struct inplace_cb** prevp; local
148 prevp = (struct inplace_cb**) &env->inplace_cb_lists[type];
150 while(*prevp != NULL)
151 prevp = &((*prevp)->next);
152 *prevp = callback;
|
| /freebsd-13-stable/usr.sbin/crunch/crunchide/ |
| H A D | crunchide.c | 148 struct keep *newp, *prevp, *curp; local
153 for(curp = keep_list, prevp = NULL; curp; prevp = curp, curp = curp->next)
167 if(prevp) prevp->next = newp;
|
| /freebsd-13-stable/usr.bin/gprof/ |
| H A D | printgprof.c | 414 arctype *prevp; local
422 * *prevp arc before the arc you are comparing.
432 for ( prevp = &sorted ;
433 prevp -> arc_childlist ;
434 prevp = prevp -> arc_childlist ) {
435 if ( arccmp( arcp , prevp -> arc_childlist ) != LESSTHAN ) {
439 arcp -> arc_childlist = prevp -> arc_childlist;
440 prevp -> arc_childlist = arcp;
454 arctype *prevp; local
[all...] |
| /freebsd-13-stable/contrib/less/ |
| H A D | linenum.c | 131 struct linenum_info *prevp; local
143 prevp = p->prev;
168 new->prev = prevp;
173 prevp->next = new;
180 calcgap(prevp);
|
| /freebsd-13-stable/contrib/unbound/util/data/ |
| H A D | msgreply.c | 952 struct edns_option** prevp; local
970 prevp = &edns->opt_list;
971 while(*prevp != NULL)
972 prevp = &((*prevp)->next);
973 *prevp = opt;
980 struct edns_option** prevp; local
998 prevp = list;
999 while(*prevp != NULL) {
1000 prevp
[all...] |
| /freebsd-13-stable/sys/sys/ |
| H A D | queue.h | 207 #define QMD_SLIST_CHECK_PREVPTR(prevp, elm) do { \
208 if (*(prevp) != (elm)) \
210 (prevp), *(prevp), (elm)); \
213 #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-13-stable/sys/contrib/openzfs/module/icp/core/ |
| H A D | kcf_sched.c | 916 kcf_areq_node_t *prevp = node->an_prev; local
919 nextp->an_prev = prevp;
921 gswq->gs_last = prevp;
923 if (prevp != NULL)
924 prevp->an_next = nextp;
1337 kcf_areq_node_t *nextp, *prevp; local
1347 prevp = areq->an_idprev;
1349 nextp->an_idprev = prevp;
1350 if (prevp != NULL)
1351 prevp
[all...] |
| /freebsd-13-stable/sys/contrib/ck/include/ |
| H A D | ck_queue.h | 183 #define CK_SLIST_INSERT_PREVPTR(prevp, slistelm, elm, field) do { \
186 ck_pr_store_ptr(prevp, elm); \
210 #define CK_SLIST_REMOVE_PREVPTR(prevp, elm, field) do { \
|
| /freebsd-13-stable/contrib/unbound/util/storage/ |
| H A D | lruhash.c | 170 struct lruhash_entry** prevp = &bin->overflow_list; local
173 *prevp = p->overflow_next;
176 prevp = &p->overflow_next;
|
| /freebsd-13-stable/contrib/ntp/lib/isc/ |
| H A D | lex.c | 72 grow_data(isc_lex_t *lex, size_t *remainingp, char **currp, char **prevp) { argument
80 if (*prevp != NULL)
81 *prevp = new + (*prevp - lex->data);
|
| /freebsd-13-stable/contrib/unbound/validator/ |
| H A D | autotrust.c | 1972 struct autr_ta* p, **prevp; local
1973 prevp = &tp->autr->keys;
1985 *prevp = np;
1992 prevp = &p->next;
|
| /freebsd-13-stable/sys/cddl/contrib/opensolaris/uts/common/dtrace/ |
| H A D | dtrace.c | 8098 dtrace_probe_t **nextp, **prevp;
8122 prevp = DTRACE_HASHPREV(hash, bucket->dthb_chain);
8123 ASSERT(*prevp == NULL);
8124 *prevp = new;
8167 dtrace_probe_t **prevp = DTRACE_HASHPREV(hash, probe);
8180 if (*prevp == NULL) {
8207 *(DTRACE_HASHNEXT(hash, *prevp)) = *nextp;
8211 *(DTRACE_HASHPREV(hash, *nextp)) = *prevp;
|
Completed in 216 milliseconds