/* * This is a software stack, so 'end' can be a valid stack pointer. * It just means the stack is empty.
*/ if (stack < begin || stack > end) returnfalse;
/* * This is a software stack, so 'end' can be a valid stack pointer. * It just means the stack is empty.
*/ if (stack < begin || stack > end) returnfalse;
int get_stack_info(unsignedlong *stack, struct task_struct *task, struct stack_info *info, unsignedlong *visit_mask)
{ if (!stack) goto unknown;
task = task ? : current;
if (in_task_stack(stack, task, info)) goto recursion_check;
if (task != current) goto unknown;
if (in_entry_stack(stack, info)) goto recursion_check;
if (in_hardirq_stack(stack, info)) goto recursion_check;
if (in_softirq_stack(stack, info)) goto recursion_check;
if (in_doublefault_stack(stack, info)) goto recursion_check;
goto unknown;
recursion_check: /* * Make sure we don't iterate through any given stack more than once. * If it comes up a second time then there's something wrong going on: * just break out and report an unknown stack type.
*/ if (visit_mask) { if (*visit_mask & (1UL << info->type)) {
printk_deferred_once(KERN_WARNING "WARNING: stack recursion on stack type %d\n", info->type); goto unknown;
}
*visit_mask |= 1UL << info->type;
}
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.