Searched defs:prev (Results 1 - 22 of 22) sorted by relevance

/bind-9.11.3/lib/dns/rdata/generic/
H A Dtalink_58.h17 dns_name_t prev; member in struct:dns_rdata_talink
H A Dtalink_58.c47 dns_name_t prev; local
55 dns_name_init(&prev, NULL);
61 dns_name_fromregion(&prev, &dregion);
62 isc_region_consume(&dregion, name_length(&prev));
67 sub = name_prefix(&prev, tctx->origin, &prefix);
78 dns_name_t prev; local
88 dns_name_init(&prev, NULL);
91 RETERR(dns_name_fromwire(&prev, source, dctx, options, target));
98 dns_name_t prev; local
108 dns_name_init(&prev, moffset
[all...]
/bind-9.11.3/lib/isc/alpha/include/isc/
H A Datomic.h113 isc_int32_t temp, prev; local
124 : "=&r"(temp), "+m"(*p), "=&r"(prev)
128 return (prev);
150 isc_int32_t temp, prev; local
164 : "=&r"(temp), "+m"(*p), "=&r"(prev)
168 return (prev);
/bind-9.11.3/lib/isc/ia64/include/isc/
H A Datomic.h31 isc_int32_t prev, swapped; local
33 for (prev = *(volatile isc_int32_t *)p; ; prev = swapped) {
34 swapped = prev + val;
39 : "r" (prev), "r" (swapped), "m" (*p)
41 if (swapped == prev)
45 return (prev);
/bind-9.11.3/lib/isc/x86_32/include/isc/
H A Datomic.h24 isc_int32_t prev = val; local
31 :"=q"(prev)
32 :"m"(*p), "0"(prev)
35 return (prev);
41 isc_int64_t prev = val; local
48 :"=q"(prev)
49 :"m"(*p), "0"(prev)
52 return (prev);
/bind-9.11.3/lib/isc/sparc64/include/isc/
H A Datomic.h62 isc_int32_t prev, swapped; local
64 for (prev = *(volatile isc_int32_t *)p; ; prev = swapped) {
65 swapped = prev + val;
69 : "r"(p), "n"(ASI_P), "r"(prev), "m"(*p));
70 if (swapped == prev)
74 return (prev);
82 isc_int32_t prev, swapped; local
84 for (prev = *(volatile isc_int32_t *)p; ; prev
[all...]
/bind-9.11.3/contrib/idn/idnkit-1.0-src/tools/idnconv/
H A Dselectiveencode.c92 char *prev = idn_utf8_findfirstbyte(start - 1, s); local
93 if (is_domain_delimiter(*prev))
95 start = prev;
/bind-9.11.3/contrib/idn/idnkit-1.0-src/lib/tests/
H A Dsetenv.c63 myenv_t *prev; member in struct:myenv
86 mye->next->prev = mye->prev;
87 if (mye->prev != NULL)
88 mye->prev->next = mye->next;
89 if (mye->next == NULL && mye->prev == NULL)
126 mye->prev = NULL;
128 myenvs->prev = mye;
/bind-9.11.3/lib/dns/include/dns/
H A Ddbiterator.h71 isc_result_t (*prev)(dns_dbiterator_t *iterator); member in struct:dns_dbiteratormethods
/bind-9.11.3/lib/isccc/
H A Dalist.c127 isccc_sexpr_t *car, *caar, *rest, *prev; local
131 prev = alist;
140 CDR(prev) = CDR(rest);
145 prev = rest;
/bind-9.11.3/contrib/idn/idnkit-1.0-src/wsock/common/
H A Dhook.c64 HOOKPTR prev; member in struct:_HOOK
76 if (hookList.prev == NULL || hookList.next == NULL) {
77 hookList.prev = &hookList;
96 HOOKPTR hp, prev, next; local
109 prev = hookList.prev;
110 next = prev->next;
111 prev->next = hp;
112 next->prev = hp;
114 hp->prev
122 HOOKPTR prev, next; local
[all...]
/bind-9.11.3/lib/isc/
H A Dht.c179 isc_ht_node_t *node, *prev; local
185 prev = NULL;
191 if (prev == NULL)
194 prev->next = node->next;
203 prev = node;
281 isc_ht_node_t *prev = NULL; local
305 prev = node;
310 if (prev == NULL)
313 prev->next = node->next;
H A Dstats.c243 isc_int32_t prev; local
256 prev = atomic_fetch_add_explicit(&stats->counters[counter].lo, 1,
259 prev = isc_atomic_xadd((isc_int32_t *)&stats->counters[counter].lo, 1);
269 if (prev == (isc_int32_t)0xffffffff) {
278 UNUSED(prev);
286 UNUSED(prev);
297 isc_int32_t prev; local
305 prev = atomic_fetch_sub_explicit(&stats->counters[counter].lo, 1,
308 prev = isc_atomic_xadd((isc_int32_t *)&stats->counters[counter].lo, -1);
310 if (prev
[all...]
H A Dlex.c361 char *curr, *prev; local
420 prev = NULL;
662 &curr, &prev);
697 &curr, &prev);
766 INSIST(prev != NULL);
767 *prev = '"';
791 &curr, &prev);
796 prev = curr;
841 &curr, &prev);
846 prev
[all...]
H A Dtask.c419 isc_event_t *event, *prev; local
444 event = prev) {
445 prev = PREV(event, ev_link);
/bind-9.11.3/unit/atf-src/atf-c/detail/
H A Dlist.c95 new_entry_and_link(void *object, bool managed, struct list_entry *prev, argument
102 le->m_prev = prev;
105 prev->m_next = le;
353 struct list_entry *le, *next, *prev; local
357 prev = next->m_prev;
358 le = new_entry_and_link(data, managed, prev, next);
/bind-9.11.3/lib/dns/
H A Dbadcache.c159 dns_bcentry_t *bad, *prev, *next; local
174 prev = NULL;
185 if (prev == NULL)
188 prev->next = bad->next;
193 prev = bad;
227 dns_bcentry_t *bad, *prev, *next; local
253 prev = NULL;
260 if (prev != NULL)
261 prev->next = bad->next;
276 prev
315 dns_bcentry_t *bad, *prev, *next; local
352 dns_bcentry_t *bad, *prev, *next; local
394 dns_bcentry_t *bad, *next, *prev; local
[all...]
H A Ddyndb.c387 dyndb_implementation_t *prev; local
394 prev = PREV(elem, link);
402 elem = prev;
H A Dnsec3.c512 dns_name_t *prev; local
536 prev = dns_fixedname_name(&fprev);
624 CHECK(dns_dbiterator_current(dbit, &node, prev));
672 CHECK(delnsec3(db, version, prev, nsec3param, diff));
683 CHECK(dns_difftuple_create(diff->mctx, DNS_DIFFOP_ADD, prev,
768 CHECK(dns_dbiterator_current(dbit, &node, prev));
791 CHECK(delnsec3(db, version, prev, nsec3param, diff));
804 prev, rdataset.ttl, &rdata,
1323 dns_name_t *prev; local
1343 prev
[all...]
H A Drbtdb.c3527 dns_name_t *prev; local
3549 prev = dns_fixedname_name(&fprev);
3581 result = dns_name_concatenate(&name, origin, prev, NULL);
3621 if ((check_prev && dns_name_issubdomain(prev, &rname)) ||
/bind-9.11.3/contrib/perftcpdns/
H A Dperftcpdns.c151 (elm)->prev = (headl); \
158 xlist[(elm)->next].prev = (elm)->prev; \
160 (headl) = (elm)->prev; \
161 *(elm)->prev = (elm)->next; \
181 int next, *prev; /* chaining */ member in struct:exchange
1063 x->prev = NULL;
1228 x->prev = NULL;
/bind-9.11.3/bin/dnssec/
H A Ddnssectool.c1343 struct nsec3_chain_fixed *first = NULL, *prev = NULL; local
1382 if (prev != NULL) {
1383 if (!checknext(prev, first))
1385 if (prev != first)
1386 free_element(mctx, prev);
1390 prev = first = e;
1393 if (!checknext(prev, e))
1395 if (prev != first)
1396 free_element(mctx, prev);
1397 prev
[all...]

Completed in 71 milliseconds