Lines Matching defs:node
60 dns_compressnode_t *node;
68 node = cctx->table[i];
70 if ((node->offset & 0x8000) != 0)
71 isc_mem_put(cctx->mctx, node->r.base,
72 node->r.length);
73 if (node->count < DNS_COMPRESS_INITIALNODES)
75 isc_mem_put(cctx->mctx, node, sizeof(*node));
127 #define NODENAME(node, name) \
129 (name)->length = (node)->r.length; \
130 (name)->labels = (node)->labels; \
131 (name)->ndata = (node)->r.base; \
145 dns_compressnode_t *node = NULL;
170 for (node = cctx->table[hash]; node != NULL; node = node->next)
172 NODENAME(node, &nname);
181 if (node != NULL)
186 * If node == NULL, we found no match at all.
188 if (node == NULL)
196 *offset = (node->offset & 0x7fff);
216 dns_compressnode_t *node;
264 * Create a new node and add it.
267 node = &cctx->initialnodes[cctx->count];
269 node = isc_mem_get(cctx->mctx,
271 if (node == NULL)
274 node->count = cctx->count++;
276 * 'node->r.base' becomes 'tmp' when start == 0.
281 node->offset = toffset;
282 dns_name_toregion(&tname, &node->r);
283 node->labels = (isc_uint8_t)dns_name_countlabels(&tname);
284 node->next = cctx->table[hash];
285 cctx->table[hash] = node;
298 dns_compressnode_t *node;
309 node = cctx->table[i];
316 while (node != NULL && (node->offset & 0x7fff) >= offset) {
317 cctx->table[i] = node->next;
318 if ((node->offset & 0x8000) != 0)
319 isc_mem_put(cctx->mctx, node->r.base,
320 node->r.length);
321 if (node->count >= DNS_COMPRESS_INITIALNODES)
322 isc_mem_put(cctx->mctx, node, sizeof(*node));
324 node = cctx->table[i];