Lines Matching refs:stack

658 	Stk->stack = my_malloc(DEF_MAXCALL * sizeof (*Stk->stack), NULL);  in make_lwp_stack()
701 free(Stk->stack); in make_lwp_stack()
732 Stk->stack = my_malloc(DEF_MAXCALL * sizeof (*Stk->stack), NULL); in make_thr_stack()
752 free(Stk->stack); in make_thr_stack()
800 Stk->stack = my_malloc( in find_lwp_stack()
801 DEF_MAXCALL * sizeof (*Stk->stack), NULL); in find_lwp_stack()
842 Stk->stack = my_malloc(DEF_MAXCALL * sizeof (*Stk->stack), in find_stack()
863 Stk->stack = my_malloc(DEF_MAXCALL * sizeof (*Stk->stack), in find_stack()
904 Stk->stack = my_malloc(DEF_MAXCALL * sizeof (*Stk->stack), in find_stack()
1044 Stk->stack = my_realloc(Stk->stack, in callstack_info()
1045 Stk->maxcall * sizeof (*Stk->stack), NULL); in callstack_info()
1092 free(Stk->stack); in reset_breakpoints()
1462 if (sp >= Stk->stack[i].sp) { in function_entry()
1464 if (sp == Stk->stack[i].sp) in function_entry()
1478 Stk->stack[Stk->ncall].sp = sp; /* record it anyeay */ in function_entry()
1479 Stk->stack[Stk->ncall].pc = rpc; in function_entry()
1480 Stk->stack[Stk->ncall].fcn = Bp; in function_entry()
1513 if (sp <= Stk->stack[i].sp && fp > Stk->stack[i].sp) { in function_return()
1526 if (sp <= Stk->stack[i].sp && in function_return()
1527 fp > Stk->stack[i].sp) { in function_return()
1538 Stk, Stk->stack[i].fcn->dyn, Stk->stack[i].fcn); in function_return()
1613 Stk->stack[Stk->ncall].sp = sp; in trap_one_stack()
1614 Stk->stack[Stk->ncall].pc = rpc; in trap_one_stack()
1615 Stk->stack[Stk->ncall].fcn = Bp; in trap_one_stack()