/* This function is a callback from heap_insert() and is used to order the heap. In this case we order the heap in descending task start time.  */
static int started_after(void *p1, void *p2)
/* This function is a callback from heap_insert() and is used to order the heap. In this case we order the heap in descending task start time.  */
static int started_after(void *p1, void *p2)
{
	struct task_struct *t1 = p1;
	struct task_struct *t2 = p2;
	return started_after_time(t1, &t2->start_time, t2);
}