b_node 1510 lib/pengine/pe_actions.c const char *b_node = crm_element_value(xml_b, XML_LRM_ATTR_TARGET); b_node 1520 lib/pengine/pe_actions.c if (a_node == NULL || b_node == NULL) { b_node 1524 lib/pengine/pe_actions.c same_node = pcmk__str_eq(a_node, b_node, pcmk__str_casei); b_node 167 maint/gnulib/lib/gl_anyrbtree_list2.h rotate_left (gl_list_node_t b_node, gl_list_node_t d_node) b_node 169 maint/gnulib/lib/gl_anyrbtree_list2.h gl_list_node_t a_node = b_node->left; b_node 173 maint/gnulib/lib/gl_anyrbtree_list2.h b_node->right = c_node; b_node 174 maint/gnulib/lib/gl_anyrbtree_list2.h d_node->left = b_node; b_node 176 maint/gnulib/lib/gl_anyrbtree_list2.h d_node->parent = b_node->parent; b_node 177 maint/gnulib/lib/gl_anyrbtree_list2.h b_node->parent = d_node; b_node 179 maint/gnulib/lib/gl_anyrbtree_list2.h c_node->parent = b_node; b_node 181 maint/gnulib/lib/gl_anyrbtree_list2.h b_node->branch_size = b_node 185 maint/gnulib/lib/gl_anyrbtree_list2.h b_node->branch_size + 1 + (e_node != NULL ? e_node->branch_size : 0); b_node 201 maint/gnulib/lib/gl_anyrbtree_list2.h rotate_right (gl_list_node_t b_node, gl_list_node_t d_node) b_node 203 maint/gnulib/lib/gl_anyrbtree_list2.h gl_list_node_t a_node = b_node->left; b_node 204 maint/gnulib/lib/gl_anyrbtree_list2.h gl_list_node_t c_node = b_node->right; b_node 208 maint/gnulib/lib/gl_anyrbtree_list2.h b_node->right = d_node; b_node 210 maint/gnulib/lib/gl_anyrbtree_list2.h b_node->parent = d_node->parent; b_node 211 maint/gnulib/lib/gl_anyrbtree_list2.h d_node->parent = b_node; b_node 218 maint/gnulib/lib/gl_anyrbtree_list2.h b_node->branch_size = b_node 221 maint/gnulib/lib/gl_anyrbtree_list2.h return b_node; b_node 77 maint/gnulib/lib/gl_rbtree_ordered.h rotate_left (NODE_T b_node, NODE_T d_node) b_node 81 maint/gnulib/lib/gl_rbtree_ordered.h b_node->right = c_node; b_node 82 maint/gnulib/lib/gl_rbtree_ordered.h d_node->left = b_node; b_node 84 maint/gnulib/lib/gl_rbtree_ordered.h d_node->parent = b_node->parent; b_node 85 maint/gnulib/lib/gl_rbtree_ordered.h b_node->parent = d_node; b_node 87 maint/gnulib/lib/gl_rbtree_ordered.h c_node->parent = b_node; b_node 103 maint/gnulib/lib/gl_rbtree_ordered.h rotate_right (NODE_T b_node, NODE_T d_node) b_node 105 maint/gnulib/lib/gl_rbtree_ordered.h NODE_T c_node = b_node->right; b_node 108 maint/gnulib/lib/gl_rbtree_ordered.h b_node->right = d_node; b_node 110 maint/gnulib/lib/gl_rbtree_ordered.h b_node->parent = d_node->parent; b_node 111 maint/gnulib/lib/gl_rbtree_ordered.h d_node->parent = b_node; b_node 115 maint/gnulib/lib/gl_rbtree_ordered.h return b_node;