Lines Matching defs:this
5 * License, v. 2.0. If a copy of the MPL was not distributed with this
98 * written, as the LAST thing done to the file. Writing this last (with
357 * node lock and isc_refcount for node references. In this case, we don't have
448 * If this is the top header for an rdataset, 'next' points
451 * at this header.
457 * this rdataset.
462 * Monotonously increased every time this rdataset is bound so that
527 #undef IGNORE /* WIN32 winbase.h defines this. */
565 * There is a tradeoff issue about configuring this value: if this is too
566 * small, it may cause heavier contention between threads; if this is too large,
568 * The default value should work well for most environments, but this can
652 /* Locks the data in this struct */
947 * We don't lock this as we don't care about simultaneous updates.
960 * If a routine is going to lock more than one lock in this module, then
970 * Failure to follow this hierarchy can result in deadlock.
1102 * It's possible the rbtdb is not a cache. If this is the case,
1950 * If this is a NONEXISTENT rdataset, we can delete it.
1992 * Though this may be wasteful, it has to be done before
2082 if (noderefs == 1) { /* this is the first reference to the node */
2109 * impossible for this node to be referenced by others.
2274 * Attempt to switch to a write lock on the tree. If this fails,
2275 * we will add this node to a linked list of nodes in this locking
2310 * If this node is the only one in the level it's in, deleting
2311 * this node may recursively make its parent the only node in
2313 * the parent node, this is almost the only opportunity to
2344 * XXX: this is a weird situation. We could
2345 * ignore this error case, but then the stale
2394 * most the maximum number of domain name labels, i.e, 127. In practice, this
2474 * a given rdataset. We keep this list
2747 * records that were changed in this
2794 * We're rolling back this transaction.
2808 * to this version and it can be cleaned up.
2822 * Is this the least open version?
2901 * expensive, but this event should be rare enough
3076 * Always try to add the policy zone data, because this node might
3171 * Is this a "this rdataset doesn't
3239 * this is the best answer and the search should
3258 * There is no zonecut at this node which is active in this
3261 * If this is a "wild" node and the caller hasn't disabled
3659 * this version, we're done. If not, then we next check to see
3660 * if the ancestor is active in this version. If so, then there
3674 * First we try to figure out if this node is active in
3675 * the search's version. We do this now, even though we
3701 * Construct the wildcard name for this level.
3883 * Since this was the first loop, finding the
4009 * Is this a "this rdataset doesn't
4021 * active rdataset at this node.
4051 * Note: for this to really be the right
4054 * cut have been removed; we assume this is
4321 * Is this a "this rdataset doesn't
4333 * rdataset at this node.
4459 * this node doesn't exist in the desired version, and that
4576 * by a dynamic update. If the caller cares about this, they
4689 * to this work. Periodical cleaning will
5008 * Connect this RBTDB to the response policy zone summary data for the view.
5025 * Enable this RBTDB as a response policy zone.
5158 * non-stale rdataset at this node.
5225 * extant rdatasets. That means that this node doesn't
5243 * If there is an NS rdataset at this node, then this is the
5619 * We may not need write access, but this code path is not performance
5797 * Is this a "this rdataset doesn't
6017 * Is this a "this rdataset doesn't
6047 * Is this a "this rdataset
6153 * being made to this node, because it's harmless and
6182 * only rdataset that can be found at this
6335 * We don't know this, however, so we leave it
6556 * this node.
6963 * this is deferred until closeversion() is called.
7174 * this is deferred until closeversion() is called.
7231 * this is deferred until closeversion() is called.
7547 * TODO CKB: since this is read-write (had to be to add nodes later)
7828 * Write out a zeroed header as a placeholder. Doing this ensures
8210 rdatasetheader_t *header = NULL, *this;
8221 this = isc_heap_element(rbtdb->heaps[i], 1);
8222 if (this == NULL) {
8228 header = this;
8229 else if (resign_sooner(this, header)) {
8233 header = this;
8288 * be restored if we backout of this change.
8487 * extension which allows the user to specify this value on creation.
8623 * to the origin name, but this is expensive. Also, we don't know the
9116 * Is this a "this rdataset doesn't exist"
9191 * Is this a "this rdataset doesn't
9769 UNUSED(qtype); /* we do not use this value at least for now */
10043 UNUSED(qtype); /* we do not use this value at least for now */
10292 * in the LRU-list. From the LRU management point of view, this function is
10294 * however, this may cause a non-negligible performance penalty because a
10296 * If DNS_RBTDB_LIMITLRUUPDATE is defined to be non 0 at compilation time, this
10349 /* To be checked: can we really assume this? XXXMLG */
10359 * under an overmem condition. To recover from this condition quickly, up to
10393 * Unlink the entry at this point to avoid checking it
10395 * cannot be purged at this moment. This entry won't be