| /src/usr.sbin/acpitools/aml/ |
| aml_name.h | 45 struct aml_name *brother; member in struct:aml_name
|
| aml_name.h | 45 struct aml_name *brother; member in struct:aml_name
|
| aml_name.h | 45 struct aml_name *brother; member in struct:aml_name
|
| /src/common/lib/libc/gen/ |
| rb.c | 617 * brother.
627 * Have our son/standin adopt his brother as his new son.
823 struct rb_node *brother = parent->rb_nodes[other]; local in function:rb_tree_removal_rebalance
827 KASSERT(!RB_SENTINEL_P(brother));
829 * For cases 1, 2a, and 2b, our brother's children must
833 && RB_BLACK_P(brother->rb_left)
834 && RB_BLACK_P(brother->rb_right)) {
835 if (RB_RED_P(brother)) {
837 * Case 1: Our brother is red, swap its
849 brother = parent->rb_nodes[other]
1132 const struct rb_node *brother; local in function:rb_tree_check_node
[all...] |
| rb.c | 617 * brother.
627 * Have our son/standin adopt his brother as his new son.
823 struct rb_node *brother = parent->rb_nodes[other]; local in function:rb_tree_removal_rebalance
827 KASSERT(!RB_SENTINEL_P(brother));
829 * For cases 1, 2a, and 2b, our brother's children must
833 && RB_BLACK_P(brother->rb_left)
834 && RB_BLACK_P(brother->rb_right)) {
835 if (RB_RED_P(brother)) {
837 * Case 1: Our brother is red, swap its
849 brother = parent->rb_nodes[other]
1132 const struct rb_node *brother; local in function:rb_tree_check_node
[all...] |
| rb.c | 617 * brother.
627 * Have our son/standin adopt his brother as his new son.
823 struct rb_node *brother = parent->rb_nodes[other]; local in function:rb_tree_removal_rebalance
827 KASSERT(!RB_SENTINEL_P(brother));
829 * For cases 1, 2a, and 2b, our brother's children must
833 && RB_BLACK_P(brother->rb_left)
834 && RB_BLACK_P(brother->rb_right)) {
835 if (RB_RED_P(brother)) {
837 * Case 1: Our brother is red, swap its
849 brother = parent->rb_nodes[other]
1132 const struct rb_node *brother; local in function:rb_tree_check_node
[all...] |
| /src/sys/uvm/ |
| uvm_map.c | 412 struct vm_map_entry *brother; local in function:uvm_rb_fixup
425 brother = (struct vm_map_entry *)parent->rb_node.rb_nodes[which];
426 if (brother != NULL) {
427 KDASSERT(brother->gap == uvm_rb_gap(brother));
428 brother->maxgap = uvm_rb_maxgap(brother);
429 if (maxgap < brother->maxgap)
430 maxgap = brother->maxgap;
|
| uvm_map.c | 412 struct vm_map_entry *brother; local in function:uvm_rb_fixup
425 brother = (struct vm_map_entry *)parent->rb_node.rb_nodes[which];
426 if (brother != NULL) {
427 KDASSERT(brother->gap == uvm_rb_gap(brother));
428 brother->maxgap = uvm_rb_maxgap(brother);
429 if (maxgap < brother->maxgap)
430 maxgap = brother->maxgap;
|
| uvm_map.c | 412 struct vm_map_entry *brother; local in function:uvm_rb_fixup
425 brother = (struct vm_map_entry *)parent->rb_node.rb_nodes[which];
426 if (brother != NULL) {
427 KDASSERT(brother->gap == uvm_rb_gap(brother));
428 brother->maxgap = uvm_rb_maxgap(brother);
429 if (maxgap < brother->maxgap)
430 maxgap = brother->maxgap;
|
