Lines Matching defs:be
121 * ISC_MAGIC_VALID cannot be used.
405 * to be 0 by default either with or without threads.
465 * should not be so crucial, no lock is set for the counter for
483 * character in the owner name needs to be AND'd with 0x20,
561 #define DEFAULT_NODE_LOCK_COUNT 7 /*%< Should be prime. */
567 * LRU purge algorithm won't work well (entries tend to be purged prematurely).
569 * also be configurable at compilation time via the
570 * DNS_RBTDB_CACHE_NODE_LOCK_COUNT variable. This value must be larger than
575 #error "DNS_RBTDB_CACHE_NODE_LOCK_COUNT must be larger than 1"
683 * be node_lock_count linked lists here. Nodes in bucket 1 will be
950 * Both init_count and header->count can be ISC_UINT32_MAX.
951 * The count on the returned rdataset however can't be as
961 * the locking must be done in the following order:
965 * Node Lock (Only one from the set may be locked at one time by
976 * For zone databases the node for the origin of the zone MUST NOT be deleted.
1152 * Work out how many nodes can be deleted in the time between two
1154 * as a estimate for the number of nodes to be deleted in the next
1232 * the overhead of unlinking all nodes here should be negligible.
1341 * We must be cleaning up after a failed zone loading.
1398 * may be nodes in use.
1576 * Caller must be holding the node lock if its reference must be
1609 * The caller must be holding the corresponding node lock.
1620 * the original DB node (in the callback arg), there should be no
1621 * acache entries when the node can be freed.
1757 * will be cleaned up; until that time, they will be ignored.
1817 * Caller must be holding the node lock.
1850 * Caller must be holding the node lock.
1940 * Note. The serial number of 'current' might be less than
1992 * Though this may be wasteful, it has to be done before
2073 * Caller must be holding the node lock.
2101 int count = 10; /* XXXJT: should be adjustable */
2108 * Since we're holding a tree write lock, it should be
2109 * impossible for this node to be referenced by others.
2144 * This function is assumed to be called when a node is newly referenced
2145 * and can be in the deadnode list. In that case the node must be retrieved
2146 * from the list because it is going to be used. In addition, if the caller
2150 * few cases where the node can be in the deadnode list (only empty nodes can
2197 * Caller must be holding the node lock; either the "strong", read or write
2198 * lock. Note that the lock must be held even when node references are
2200 * have to be protected, but we must avoid a race condition where multiple
2208 * will be immediately freed.
2315 * since the child and parent may be in different lock buckets,
2346 * node will unlikely be purged except via a
2350 * will be deleted later.
2395 * should be much smaller (only a few times), and even the worst case would be
2459 * Caller must be holding the database lock.
2483 * The caller must be holding the database lock.
2723 * The current version is going to be replaced.
2749 * may still be in use by an open
2760 * If the (soon to be former) current version
2781 * creation function below). This must be the only
2808 * to this version and it can be cleaned up.
2897 * sure that stale nodes will be removed in
2899 * those nodes could miss the chance to be removed
2901 * expensive, but this event should be rare enough
2949 * to be found in 'rbtdb'.
3036 * It would be nice to try to upgrade the lock instead of
3224 * search->zonecut_rdataset will still be valid later.
3248 * This may or may not be the best match. In case it
3284 * Caller must be holding the node reader lock.
3296 INSIST(rdataset->methods == NULL); /* We must be disassociated. */
3357 * The caller MUST NOT be holding any node locks.
3651 * Caller must be holding the tree lock and MUST NOT be holding
3661 * can be no possible wildcard match and again we're done. If not,
3930 * There should always be a node in the main tree with the
3980 * hope that the original node will be right much of the time.
4051 * Note: for this to really be the right
4190 * 'wild' will be true iff. we've matched a wildcard.
4272 * The node may be a zone cut itself. If it might be one,
4345 * still be valid later.
4355 * It is not clear if KEY should still be
4365 * could return would be glue. Return
4400 * We may be finding a CNAME instead
4559 * It is not clear if KEY should still be
4700 * header->down can be non-NULL if the
4776 * search->zonecut_rdataset will still be valid later.
4810 * Caller must be holding the tree lock.
5604 * Note that 'log' can be true IFF overmem is also true.
5605 * overmem can currently only be true for cache
5620 * sensitive, so it should be okay to always lock as a writer.
5630 * refcurrent(rbtnode) must be non-zero. This is so
5894 * because refcurrent(rbtnode) must be
6136 * Caller must be holding the node lock.
6182 * only rdataset that can be found at this
6196 * type so they can be marked stale later.
6267 * If header isn't NULL, we've found the right type. There may be
6397 * If we have will be replacing a NS RRset force its TTL
6398 * to be no more than the current NS RRset's TTL. This
6893 * be acquired but it will help purge stale entries more effectively.
7045 * If header isn't NULL, we've found the right type. There may be
7347 * Set the error condition to be returned.
7388 * NS record owners cannot legally be wild cards.
7393 * NSEC3 record owners cannot legally be wild cards.
7547 * TODO CKB: since this is read-write (had to be to add nodes later)
7789 * will be properly aligned when read back in.
7830 * writing fail or be interrupted.
7860 * itself that should be stored here.
8175 * if we are going to be restoring it by calling isc_heap_increased
8288 * be restored if we backout of this change.
8488 * Note that when specified for a cache DB it must be larger than 1
8585 * Must be initialized before free_rbtdb() is called.
8629 * the top-of-zone node can never be deleted, nor can its address
9291 * once. Only the last occurence will actually be deleted.
9923 count = total_count - current_count - 1; /* should be private data */
10229 unsigned char *bp, *be;
10231 be = bp + name->length;
10233 while (bp <= be - 4) {
10244 while (bp < be) {
10291 * See if a given cache entry that is being reused needs to be updated
10295 * writer lock will have to be acquired before updating the list.
10296 * If DNS_RBTDB_LIMITLRUUPDATE is defined to be non 0 at compilation time, this
10299 * experiments have shown that the former tends to be accessed relatively
10349 /* To be checked: can we really assume this? XXXMLG */
10360 * 2 entries will be purged. This process is triggered while adding a new
10395 * cannot be purged at this moment. This entry won't be