Searched refs:table (Results 1 - 25 of 31) sorted by relevance

12

/bind-9.11.3/lib/isc/
H A Dresult.c181 resulttable *table; local
191 table = malloc(sizeof(*table));
192 if (table == NULL)
194 table->base = base;
195 table->last = base + nresults - 1;
196 table->text = text;
197 table->msgcat = msgcat;
198 table->set = set;
199 ISC_LINK_INIT(table, lin
247 resulttable *table; local
[all...]
H A Dsymtab.c42 eltlist_t * table; member in struct:isc_symtab
68 symtab->table = (eltlist_t *)isc_mem_get(mctx,
70 if (symtab->table == NULL) {
75 INIT_LIST(symtab->table[i]);
100 for (elt = HEAD(symtab->table[i]); elt != NULL; elt = nelt) {
110 isc_mem_put(symtab->mctx, symtab->table,
147 for (e = HEAD((s)->table[b]); e != NULL; e = NEXT(e, link)) { \
153 for (e = HEAD((s)->table[b]); e != NULL; e = NEXT(e, link)) { \
202 for (elt = HEAD(symtab->table[i]); elt != NULL; elt = nelt) {
207 UNLINK(symtab->table[
[all...]
H A Dht.c40 isc_ht_node_t **table; member in struct:isc_ht
70 ht->table = isc_mem_get(ht->mctx, ht->size * sizeof(isc_ht_node_t*));
71 if (ht->table == NULL) {
77 ht->table[i] = NULL;
99 isc_ht_node_t *node = ht->table[i];
112 isc_mem_put(ht->mctx, ht->table, ht->size * sizeof(isc_ht_node_t*));
129 node = ht->table[hash & ht->mask];
144 node->next = ht->table[hash & ht->mask];
148 ht->table[hash & ht->mask] = node;
164 node = ht->table[has
[all...]
/bind-9.11.3/unit/atf-src/tools/
H A Dtests-results.css83 table.summary {
92 table.summary th {
99 table.summary td {
105 table.summary td.numeric p {
109 table.summary td.numeric-error p {
114 table.summary td.numeric-warning p {
119 table.summary tr.group {
123 table.summary tr.entry td p {
127 table.tcs-summary {
137 table
[all...]
/bind-9.11.3/lib/dns/
H A Dssu.c33 #define VALID_SSUTABLE(table) ISC_MAGIC_VALID(table, SSUTABLEMAGIC)
36 #define VALID_SSURULE(table) ISC_MAGIC_VALID(table, SSURULEMAGIC)
62 dns_ssutable_t *table; local
67 table = isc_mem_get(mctx, sizeof(dns_ssutable_t));
68 if (table == NULL)
70 result = isc_mutex_init(&table->lock);
72 isc_mem_put(mctx, table, sizeof(dns_ssutable_t));
75 table
85 destroy(dns_ssutable_t *table) argument
131 dns_ssutable_t *table; local
152 dns_ssutable_addrule(dns_ssutable_t *table, isc_boolean_t grant, dns_name_t *identity, unsigned int matchtype, dns_name_t *name, unsigned int ntypes, dns_rdatatype_t *types) argument
341 dns_ssutable_checkrules(dns_ssutable_t *table, dns_name_t *signer, dns_name_t *name, isc_netaddr_t *addr, dns_rdatatype_t type, const dst_key_t *key) argument
352 dns_ssutable_checkrules2(dns_ssutable_t *table, dns_name_t *signer, dns_name_t *name, isc_netaddr_t *addr, isc_boolean_t tcp, const dns_aclenv_t *env, dns_rdatatype_t type, const dst_key_t *key) argument
589 dns_ssutable_firstrule(const dns_ssutable_t *table, dns_ssurule_t **rule) argument
613 dns_ssutable_t *table = NULL; local
[all...]
H A Dbadcache.c36 dns_bcentry_t **table; member in struct:dns_badcache
76 bc->table = isc_mem_get(bc->mctx, sizeof(*bc->table) * size);
77 if (bc->table == NULL) {
83 memset(bc->table, 0, bc->size * sizeof(dns_bcentry_t *));
110 isc_mem_put(bc->mctx, bc->table, sizeof(dns_bcentry_t *) * bc->size);
131 for (bad = bc->table[i]; bad != NULL; bad = next) {
142 bc->table[i] = NULL;
145 isc_mem_put(bc->mctx, bc->table, sizeof(*bc->table) * b
[all...]
H A Dforward.c29 dns_rbt_t *table; member in struct:dns_fwdtable
49 fwdtable->table = NULL;
50 result = dns_rbt_create(mctx, auto_detach, fwdtable, &fwdtable->table);
66 dns_rbt_destroy(&fwdtable->table);
105 result = dns_rbt_addname(fwdtable->table, name, forwarders);
156 result = dns_rbt_addname(fwdtable->table, name, forwarders);
181 result = dns_rbt_deletename(fwdtable->table, name, ISC_FALSE);
207 result = dns_rbt_findname(fwdtable->table, name, 0, foundname,
226 dns_rbt_destroy(&fwdtable->table);
H A Dcompress.c37 cctx->table[i] = NULL; \
67 while (cctx->table[i] != NULL) {
68 node = cctx->table[i];
69 cctx->table[i] = cctx->table[i]->next;
136 * Find the longest match of name in the table.
170 for (node = cctx->table[hash]; node != NULL; node = node->next)
284 node->next = cctx->table[hash];
285 cctx->table[hash] = node;
309 node = cctx->table[
[all...]
H A Drcode.c271 struct tbl *table, unsigned int max)
280 for (i = 0; table[i].name != NULL; i++) {
282 n = strlen(table[i].name);
284 (table[i].flags & TOTEXTONLY) == 0 &&
285 strncasecmp(source->base, table[i].name, n) == 0) {
286 *valuep = table[i].value;
295 struct tbl *table)
299 while (table[i].name != NULL) {
300 if (table[i].value == value) {
301 return (str_totext(table[
270 dns_mnemonic_fromtext(unsigned int *valuep, isc_textregion_t *source, struct tbl *table, unsigned int max) argument
294 dns_mnemonic_totext(unsigned int value, isc_buffer_t *target, struct tbl *table) argument
[all...]
H A Dzt.c43 dns_rbt_t *table; member in struct:dns_zt
78 zt->table = NULL;
79 result = dns_rbt_create(mctx, auto_detach, zt, &zt->table);
101 dns_rbt_destroy(&zt->table);
121 result = dns_rbt_addname(zt->table, name, zone);
141 result = dns_rbt_deletename(zt->table, name, ISC_FALSE);
163 result = dns_rbt_findname(zt->table, name, rbtoptions, foundname,
200 dns_rbt_destroy(&zt->table);
436 result = dns_rbtnodechain_first(&chain, zt->table, NULL, NULL);
460 result = dns_rbtnodechain_first(&chain, zt->table, NUL
[all...]
H A Dkeytable.c41 dns_rbt_t *table; member in struct:dns_keytable
76 keytable->table = NULL;
77 result = dns_rbt_create(mctx, free_keynode, mctx, &keytable->table);
111 dns_rbt_destroy(&keytable->table);
153 dns_rbt_destroy(&keytable->table);
181 result = dns_rbt_addnode(keytable->table, keyname, &node);
185 /* Key already in table? */
249 result = dns_rbt_findnode(keytable->table, keyname, NULL, &node, NULL,
253 result = dns_rbt_deletenode(keytable->table,
277 result = dns_rbt_findnode(keytable->table, keynam
[all...]
H A Dnta.c119 ntatable->table = NULL;
121 &ntatable->table);
141 dns_rbt_destroy(&ntatable->table);
186 dns_rbt_destroy(&ntatable->table);
363 result = dns_rbt_addnode(ntatable->table, name, &node);
402 result = dns_rbt_findnode(ntatable->table, name, NULL, &node, NULL,
406 result = dns_rbt_deletenode(ntatable->table,
452 result = dns_rbt_findnode(ntatable->table, name, foundname, &node, NULL,
525 result = dns_rbtnodechain_first(&chain, ntatable->table, NULL, NULL);
588 result = dns_rbtnodechain_first(&chain, ntatable->table, NUL
[all...]
/bind-9.11.3/bin/tests/system/checkconf/
H A Dbad-rate-limit-max-table-size.conf11 max-table-size 30; // less than min-table-size default of 500
/bind-9.11.3/lib/isccc/
H A Dsymtab.c55 eltlist_t * table; member in struct:isccc_symtab
77 symtab->table = malloc(size * sizeof(eltlist_t));
78 if (symtab->table == NULL) {
83 ISC_LIST_INIT(symtab->table[i]);
97 ISC_LIST_UNLINK(symtab->table[bucket], elt, link);
115 for (elt = ISC_LIST_HEAD(symtab->table[i]);
122 free(symtab->table);
168 for (e = ISC_LIST_HEAD((s)->table[b]); \
176 for (e = ISC_LIST_HEAD((s)->table[b]); \
223 ISC_LIST_UNLINK(symtab->table[bucke
[all...]
/bind-9.11.3/lib/dns/include/dns/
H A Dssu.h61 dns_ssutable_create(isc_mem_t *mctx, dns_ssutable_t **table);
63 * Creates a table that will be used to store simple-secure-update rules.
68 *\li 'table' is not NULL, and '*table' is NULL
79 * Create an SSU table that contains a dlzdatabase pointer, and a
81 * table is used by writeable DLZ drivers to offload authorization for
91 *\li 'source' is a valid SSU table
101 * Detach '*tablep' from its simple-secure-update rule table.
108 *\li If '*tablep' is the last reference to the SSU table, all
109 * resources used by the table wil
[all...]
H A Dnta.h49 dns_rbt_t *table; member in struct:dns_ntatable
60 * Create an NTA table in view 'view'.
72 *\li On success, *ntatablep is a valid, empty NTA table.
125 *\li If an NTA already exists in the table, its expiry time
178 * Dump the NTA table to buffer at 'buf'
181 * \li "ntatable" is a valid table.
189 * Dump the NTA table to the file opened as 'fp'.
195 * Save the NTA table to the file opened as 'fp', for later loading.
H A Dcompress.h59 /*% Global compression table. */
60 dns_compressnode_t *table[DNS_COMPRESS_TABLESIZE]; member in struct:dns_compress
61 /*% Preallocated nodes for the table. */
179 * Finds longest possible match of 'name' in the global compression table.
198 * Add compression pointers for 'name' to the compression table,
215 * Remove any compression pointers from global table >= offset.
/bind-9.11.3/bin/tests/system/rrl/
H A Dbroken.conf30 min-table-size 0;
31 max-table-size 0;
/bind-9.11.3/contrib/sdb/pgsql/
H A Dpgsqldb.c37 * The table must contain the fields "name", "rdtype", and "rdata", and
39 * creates such a table.
47 char *table; member in struct:dbinfo
135 "lower(NAME) = lower('%s')", dbi->table, canonname);
190 dbi->table);
234 * argv[1] is the name of the table
257 dbi->table = NULL;
272 STRDUP_OR_FAIL(dbi->table, argv[1]);
306 if (dbi->table != NULL)
307 isc_mem_free(ns_g_mctx, dbi->table);
[all...]
/bind-9.11.3/contrib/sdb/sqlite/
H A Dsqlitedb.c35 * The table must contain the fields "name", "rdtype", and "rdata", and
37 * creates such a table.
45 char *table; member in struct:_dbinfo
131 dbi->table, name);
202 dbi->table);
228 if (dbi->table != NULL)
229 isc_mem_free(ns_g_mctx, dbi->table);
251 * argv[1] is the name of the table
272 dbi->table = NULL;
275 STRDUP_OR_FAIL(dbi->table, arg
[all...]
H A Dzone2sqlite.c36 * Generate an SQLite table from a zone.
42 char *table; member in struct:_dbinfo
123 dbi.table,
164 dbi.table = argv[4];
200 sql = sqlite3_mprintf("DROP TABLE %Q ", dbi.table);
207 dbi.table, errmsg);
225 dbi.table);
231 dbi.table, errmsg);
/bind-9.11.3/bin/tests/system/rrl/ns2/
H A Dnamed.conf30 // small enough to force a table expansion
31 min-table-size 75;
/bind-9.11.3/bin/tests/system/rrl/ns3/
H A Dnamed.conf35 max-table-size 1000;
37 min-table-size 0;
/bind-9.11.3/bin/tests/system/rrl/ns4/
H A Dnamed.conf31 // small enough to force a table expansion
32 min-table-size 75;
/bind-9.11.3/contrib/idn/idnkit-1.0-src/util/
H A DSparseMap.pm495 my @table = @{$maps[-1]};
502 foreach my $a (@table) {
533 foreach my $a (@table) {

Completed in 63 milliseconds

12