Searched refs:uncle (Results 1 - 4 of 4) sorted by relevance

/freebsd-12-stable/contrib/ofed/libibverbs/
H A Dmemory.c287 struct ibv_mem_node *parent, *gp, *uncle; local
294 uncle = gp->right;
296 if (uncle && uncle->color == IBV_RED) {
298 uncle->color = IBV_BLACK;
315 uncle = gp->left;
317 if (uncle && uncle->color == IBV_RED) {
319 uncle->color = IBV_BLACK;
/freebsd-12-stable/contrib/unbound/util/
H A Drbtree.c160 rbnode_type *uncle; local
166 uncle = node->parent->parent->right;
168 /* If our uncle is red... */
169 if (uncle->color == RED) {
170 /* Paint the parent and the uncle black... */
172 uncle->color = BLACK;
179 } else { /* Our uncle is black... */
191 uncle = node->parent->parent->left;
193 /* If our uncle is red... */
194 if (uncle
[all...]
/freebsd-12-stable/contrib/ldns/
H A Drbtree.c168 ldns_rbnode_t *uncle; local
174 uncle = node->parent->parent->right;
176 /* If our uncle is red... */
177 if (uncle->color == RED) {
178 /* Paint the parent and the uncle black... */
180 uncle->color = BLACK;
187 } else { /* Our uncle is black... */
199 uncle = node->parent->parent->left;
201 /* If our uncle is red... */
202 if (uncle
[all...]
/freebsd-12-stable/contrib/libarchive/libarchive/
H A Darchive_rb.c281 struct archive_rb_node * uncle;
293 uncle = grandpa->rb_nodes[other];
295 if (RB_BLACK_P(uncle))
299 * Case 1: our uncle is red
301 * uncle and make our grandparent red. And
304 RB_MARK_BLACK(uncle);
325 * Case 2&3: our uncle is black.
329 * Case 2: we are on the same side as our uncle
337 * Case 3: we are opposite a child of a black uncle.
278 struct archive_rb_node * uncle; local

Completed in 77 milliseconds