Searched defs:cur (Results 1 - 13 of 13) sorted by relevance

/bind-9.11.3/lib/isc/
H A Dinet_ntop.c116 struct { int base, len; } best, cur; local
130 cur.base = -1;
131 cur.len = 0; /* silence compiler */
134 if (cur.base == -1)
135 cur.base = i, cur.len = 1;
137 cur.len++;
139 if (cur.base != -1) {
140 if (best.base == -1 || cur.len > best.len)
141 best = cur;
[all...]
H A Dht.c46 isc_ht_node_t *cur; member in struct:isc_ht_iter
222 it->cur = NULL;
254 it->cur = it->ht->table[it->i];
262 REQUIRE(it->cur != NULL);
264 it->cur = it->cur->next;
265 if (it->cur == NULL) {
271 it->cur = it->ht->table[it->i];
286 REQUIRE(it->cur != NULL);
287 to_delete = it->cur;
[all...]
H A Dradix.c471 int cur = radix->num_added_node; local
474 source->node_num[i] + cur;
524 int cur = radix->num_added_node; local
527 source->node_num[i] + cur;
/bind-9.11.3/lib/lwres/
H A Dlwinetntop.c109 struct { int base, len; } best, cur; local
123 cur.base = -1;
124 cur.len = 0;
127 if (cur.base == -1)
128 cur.base = i, cur.len = 1;
130 cur.len++;
132 if (cur.base != -1) {
133 if (best.base == -1 || cur.len > best.len)
134 best = cur;
[all...]
/bind-9.11.3/lib/dns/include/dns/
H A Ddispatch.h89 int cur; member in struct:dns_dispatchset
/bind-9.11.3/contrib/dnsperf-2.1.0.0-1/
H A Ddatafile.c173 const char *cur; local
179 cur = isc_buffer_current(&dfile->data);
180 curlen = strcspn(cur, "\n");
207 if (curlen > 0 && cur[0] != ';')
214 isc_buffer_putmem(lines, cur, curlen);
/bind-9.11.3/contrib/idn/idnkit-1.0-src/lib/
H A Dunormalize.c71 int cur; /* pointing now processing character */ member in struct:__anon91
122 assert(wb.cur == wb.last);
143 for (; wb.cur < wb.last; wb.cur++) {
144 if (wb.cur == 0) {
146 } else if (wb.class[wb.cur] > 0) {
172 if (wb.cur > 0 && wb.class[wb.cur] == 0) {
182 if (do_composition && wb.cur > 0 && wb.class[0] == 0) {
191 wb.cur
276 int cur; local
[all...]
/bind-9.11.3/contrib/queryperf/missing/
H A Dgetaddrinfo.c206 struct addrinfo *cur; local
215 cur = &sentinel;
354 GET_AI(cur->ai_next, afd, afd->a_addrany, port);
356 * GET_CANONNAME(cur->ai_next, "anyaddr");
359 GET_AI(cur->ai_next, afd, afd->a_loopback,
362 * GET_CANONNAME(cur->ai_next, "localhost");
365 cur = cur->ai_next;
452 struct addrinfo *cur; local
456 GET_AI(cur, af
481 struct addrinfo *cur; local
547 struct addrinfo *top, *cur; local
[all...]
/bind-9.11.3/bin/check/
H A Dcheck-tool.c185 struct addrinfo hints, *ai, *cur; local
226 cur = ai;
227 while (cur != NULL && cur->ai_canonname == NULL &&
228 cur->ai_next != NULL)
229 cur = cur->ai_next;
230 if (cur != NULL && cur->ai_canonname != NULL &&
231 strcasecmp(cur
386 struct addrinfo hints, *ai, *cur; local
472 struct addrinfo hints, *ai, *cur; local
[all...]
/bind-9.11.3/lib/dns/
H A Drdata.c1085 unsigned int cur; local
1102 cur = isc_buffer_usedlength(target);
1109 INSIST(u >= cur);
1110 isc_buffer_subtract(target, u - cur);
H A Drpz.c1093 dns_rpz_cidr_node_t *cur, *parent, *child, *new_parent, *sibling; local
1102 cur = rpzs->cidr;
1106 if (cur == NULL) {
1130 if ((cur->sum.client_ip & set.client_ip) == 0 &&
1131 (cur->sum.ip & set.ip) == 0 &&
1132 (cur->sum.nsip & set.nsip) == 0) {
1145 dbit = diff_keys(tgt_ip, tgt_prefix, &cur->ip, cur->prefix);
1147 * dbit <= tgt_prefix and dbit <= cur->prefix always.
1151 if (tgt_prefix == cur
1455 dns_rpz_cidr_node_t *cur, *child, *parent; local
[all...]
H A Dresolver.c3316 dns_adbaddrinfo_t *cur; local
3319 cur = ISC_LIST_HEAD(fctx->forwaddrs);
3320 while (cur != NULL && cur->srtt < ai->srtt)
3321 cur = ISC_LIST_NEXT(cur, publink);
3322 if (cur != NULL)
3323 ISC_LIST_INSERTBEFORE(fctx->forwaddrs, cur,
3418 dns_adbaddrinfo_t *cur; local
3420 cur
10147 dns_resolver_getclientsperquery(dns_resolver_t *resolver, isc_uint32_t *cur, isc_uint32_t *min, isc_uint32_t *max) argument
[all...]
/bind-9.11.3/bin/delv/
H A Ddelv.c773 struct addrinfo hints, *res, *cur; local
828 for (cur = res; cur != NULL; cur = cur->ai_next) {
829 if (cur->ai_family != AF_INET &&
830 cur->ai_family != AF_INET6)
839 memmove(&sa->type, cur->ai_addr, cur->ai_addrlen);
840 sa->length = (unsigned int)cur
[all...]

Completed in 63 milliseconds