Searched refs:successor (Results 1 - 5 of 5) sorted by path

/linux-master/fs/bcachefs/
H A Dbkey.c534 struct bkey_packed successor; local
537 BUG_ON(bkey_packed_successor(&successor, b, *out) &&
538 bkey_cmp_left_packed(b, &successor, &orig) < 0 &&
/linux-master/include/linux/
H A Drbtree_augmented.h257 struct rb_node *successor = child, *child2; local
262 * Case 2: node's successor is its right child
270 parent = successor;
271 child2 = successor->rb_right;
273 augment->copy(node, successor);
276 * Case 3: node's successor is leftmost under
290 parent = successor;
291 successor = tmp;
294 child2 = successor->rb_right;
296 WRITE_ONCE(successor
[all...]
/linux-master/include/net/
H A Daf_unix.h40 struct unix_sock *successor; member in struct:unix_edge
/linux-master/net/unix/
H A Dgarbage.c109 if (edge->successor->listener)
110 return unix_sk(edge->successor->listener)->vertex;
112 return edge->successor->vertex;
208 edge->successor = receiver;
242 receiver = fpl->edges[0].successor;
438 * the successor to vertex for the next iteration.
455 /* If the successor has a smaller scc_index, two vertices
463 * The successor is on vertex_stack, so two vertices are in
464 * the same SCC. If the successor has a smaller *scc_index*,
469 /* The successor wa
[all...]
/linux-master/tools/include/linux/
H A Drbtree_augmented.h220 struct rb_node *successor = child, *child2; local
225 * Case 2: node's successor is its right child
233 parent = successor;
234 child2 = successor->rb_right;
236 augment->copy(node, successor);
239 * Case 3: node's successor is leftmost under
253 parent = successor;
254 successor = tmp;
257 child2 = successor->rb_right;
259 WRITE_ONCE(successor
[all...]

Completed in 263 milliseconds