ppr
sprout(tree **ppr, tree_t p_data, int *pi_balance,
if (!*ppr) {
*ppr = (tree *) memget(sizeof(tree));
if (*ppr) {
(*ppr)->left = NULL;
(*ppr)->right = NULL;
(*ppr)->bal = 0;
(*ppr)->data = p_data;
RET(*ppr);
cmp = (*pfi_compare)(p_data, (*ppr)->data);
sub = sprout(&(*ppr)->left, p_data, pi_balance,
switch ((*ppr)->bal) {
(*ppr)->bal = 0;
(*ppr)->bal = -1;
p1 = (*ppr)->left;
(*ppr)->left = p1->right;
p1->right = *ppr;
(*ppr)->bal = 0;
*ppr = p1;
(*ppr)->left = p2->right;
p2->right = *ppr;
(*ppr)->bal = 1;
(*ppr)->bal = 0;
*ppr = p2;
(*ppr)->bal = 0;
sub = sprout(&(*ppr)->right, p_data, pi_balance,
switch ((*ppr)->bal) {
(*ppr)->bal = 0;
(*ppr)->bal = 1;
p1 = (*ppr)->right;
(*ppr)->right = p1->left;
p1->left = *ppr;
(*ppr)->bal = 0;
*ppr = p1;
(*ppr)->right = p2->left;
p2->left = *ppr;
(*ppr)->bal = -1;
(*ppr)->bal = 0;
*ppr = p2;
(*ppr)->bal = 0;
(*pfv_delete)((*ppr)->data);
(*ppr)->data = p_data;
RET(*ppr)
ppr(&r->tmp, buf);
} ppr;
if (PRIO(vector) > PRIO(lapic->ppr)) {
data = lapic->ppr;
lapic->ppr = 0;
int isrvec, tpr, ppr;
ppr = tpr;
ppr = PRIO(isrvec);
vlapic->apic_page->ppr = ppr;
int ppr;
ppr = PRIO(vec);
lapic->ppr = ppr;