| /src/external/mpl/bind/dist/lib/dns/ |
| forward.c | 122 result = dns_qp_insert(qp, forwarders, 0);
154 result = dns_qp_insert(qp, forwarders, 0);
|
| nametree.c | 203 result = dns_qp_insert(qp, new, count);
237 result = dns_qp_insert(qp, new, count);
|
| nta.c | 327 result = dns_qp_insert(qp, nta, 0);
336 result = dns_qp_insert(qp, nta, 0);
|
| zt.c | 146 result = dns_qp_insert(qp, zone, 0);
|
| keytable.c | 294 result = dns_qp_insert(qp, newnode, 0);
369 result = dns_qp_insert(qp, newnode, 0);
|
| qpzone.c | 650 result = dns_qp_insert(qp, qpdb->origin, 0);
663 result = dns_qp_insert(qp, qpdb->nsec3_origin, 0);
1609 result = dns_qp_insert(loadctx->nsec3, node, 0);
1628 result = dns_qp_insert(loadctx->tree, node, 0);
1640 * If dns_qp_insert() fails, it means there's already an NSEC
1647 (void)dns_qp_insert(loadctx->nsec, nsecnode, 0);
2035 result = dns_qp_insert(qp, node, 0);
2506 result = dns_qp_insert(qp, node, 0);
4832 (void)dns_qp_insert(nsec, nsecnode, 0);
|
| qpcache.c | 2690 result = dns_qp_insert(qpdb->tree, node, 0);
3535 result = dns_qp_insert(qpdb->nsec, nsecnode, 0);
|
| qp.c | 1658 dns_qp_insert(dns_qp_t *qp, void *pval, uint32_t ival) { function
2325 * Like `dns_qp_insert()`, we must find a leaf. However, we don't make a
|
| rpz.c | 1437 result = dns_qp_insert(qp, data, 0);
|
| /src/external/mpl/bind/dist/tests/dns/ |
| qpmulti_test.c | 177 assert_int_equal(dns_qp_insert(qp, &item[i], i), ISC_R_SUCCESS);
298 result = dns_qp_insert(qpw, &item[i], i);
|
| qp_test.c | 240 if (dns_qp_insert(qp, pval, ival) == ISC_R_EXISTS) {
435 result = dns_qp_insert(qp, (void *)pval, 0);
|
| /src/external/mpl/bind/dist/fuzz/ |
| dns_qp.c | 165 result = dns_qp_insert(qp, &item[i], i);
|
| /src/external/mpl/bind/dist/lib/dns/include/dns/ |
| qp.h | 581 dns_qp_insert(dns_qp_t *qp, void *pval, uint32_t ival);
|
| /src/external/mpl/bind/dist/tests/bench/ |
| qp-dump.c | 216 result = dns_qp_insert(qp, pval, ival);
|
| qplookups.c | 182 result = dns_qp_insert(qp, pval, ival);
|
| qpmulti.c | 148 INSIST(dns_qp_insert(qp, &item[i], i) == ISC_R_SUCCESS);
313 dns_qp_insert(qp, &item[i], i);
387 INSIST(dns_qp_insert(qp, &item[i], i) == ISC_R_SUCCESS);
|
| load-names.c | 388 isc_result_t result = dns_qp_insert(qp, &item[count], count);
|
