aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorGlenn Elliott <gelliott@cs.unc.edu>2013-02-05 13:58:19 -0500
committerGlenn Elliott <gelliott@cs.unc.edu>2013-02-05 13:58:19 -0500
commitcd736578337f012c0acffa4b5296736c3902431e (patch)
tree7047869629f5e805515965ff3fd7c24c6dd508e1
parent2e5c4482a4104da4e7cda6b3588f840a2c598741 (diff)
change "nil/-1" to "null/0" to match prop. m-line
-rw-r--r--litmus/ikglp_lock.c62
-rw-r--r--litmus/locking.c12
-rw-r--r--litmus/nvidia_info.c18
-rw-r--r--litmus/rsm_lock.c28
-rw-r--r--litmus/rt_domain.c2
-rw-r--r--litmus/sched_cedf.c18
-rw-r--r--litmus/sched_gsn_edf.c18
-rw-r--r--litmus/sched_plugin.c4
8 files changed, 82 insertions, 80 deletions
diff --git a/litmus/ikglp_lock.c b/litmus/ikglp_lock.c
index fe242c789318..59d7ee4f9fd1 100644
--- a/litmus/ikglp_lock.c
+++ b/litmus/ikglp_lock.c
@@ -192,8 +192,8 @@ static void print_donees(struct ikglp_semaphore *sem, struct binheap_node *n, in
192 padding, 192 padding,
193 donee_node->task->comm, 193 donee_node->task->comm,
194 donee_node->task->pid, 194 donee_node->task->pid,
195 (donor) ? donor->comm : "nil", 195 (donor) ? donor->comm : "null",
196 (donor) ? donor->pid : -1, 196 (donor) ? donor->pid : 0,
197 ikglp_get_idx(sem, donee_node->fq)); 197 ikglp_get_idx(sem, donee_node->fq));
198 198
199 if(n->left) print_donees(sem, n->left, depth+1); 199 if(n->left) print_donees(sem, n->left, depth+1);
@@ -493,8 +493,8 @@ static void ikglp_refresh_owners_prio_decrease(struct fifo_queue *fq,
493 493
494 if(litmus->__compare(new_max_eff_prio, BASE, owner, BASE)) { 494 if(litmus->__compare(new_max_eff_prio, BASE, owner, BASE)) {
495 TRACE_CUR("%s/%d has greater base priority than base priority of owner (%s/%d) of fq %d.\n", 495 TRACE_CUR("%s/%d has greater base priority than base priority of owner (%s/%d) of fq %d.\n",
496 (new_max_eff_prio) ? new_max_eff_prio->comm : "nil", 496 (new_max_eff_prio) ? new_max_eff_prio->comm : "null",
497 (new_max_eff_prio) ? new_max_eff_prio->pid : -1, 497 (new_max_eff_prio) ? new_max_eff_prio->pid : 0,
498 owner->comm, 498 owner->comm,
499 owner->pid, 499 owner->pid,
500 ikglp_get_idx(sem, fq)); 500 ikglp_get_idx(sem, fq));
@@ -503,8 +503,8 @@ static void ikglp_refresh_owners_prio_decrease(struct fifo_queue *fq,
503 } 503 }
504 else { 504 else {
505 TRACE_CUR("%s/%d has lesser base priority than base priority of owner (%s/%d) of fq %d.\n", 505 TRACE_CUR("%s/%d has lesser base priority than base priority of owner (%s/%d) of fq %d.\n",
506 (new_max_eff_prio) ? new_max_eff_prio->comm : "nil", 506 (new_max_eff_prio) ? new_max_eff_prio->comm : "null",
507 (new_max_eff_prio) ? new_max_eff_prio->pid : -1, 507 (new_max_eff_prio) ? new_max_eff_prio->pid : 0,
508 owner->comm, 508 owner->comm,
509 owner->pid, 509 owner->pid,
510 ikglp_get_idx(sem, fq)); 510 ikglp_get_idx(sem, fq));
@@ -889,8 +889,8 @@ static void ikglp_enqueue_on_donor(struct ikglp_semaphore *sem,
889 } 889 }
890 else { 890 else {
891 TRACE_TASK(t, "No change in effective priority (it is %s/%d).\n", 891 TRACE_TASK(t, "No change in effective priority (it is %s/%d).\n",
892 (new_max_eff_prio) ? new_max_eff_prio->comm : "nil", 892 (new_max_eff_prio) ? new_max_eff_prio->comm : "null",
893 (new_max_eff_prio) ? new_max_eff_prio->pid : -1); 893 (new_max_eff_prio) ? new_max_eff_prio->pid : 0);
894 raw_spin_unlock(&tsk_rt(donee)->hp_blocked_tasks_lock); 894 raw_spin_unlock(&tsk_rt(donee)->hp_blocked_tasks_lock);
895 unlock_fine_irqrestore(&sem->lock, flags); 895 unlock_fine_irqrestore(&sem->lock, flags);
896 } 896 }
@@ -1078,9 +1078,9 @@ static ikglp_wait_state_t* ikglp_find_hp_waiter_to_steal(
1078 ikglp_get_idx(sem, &sem->fifo_queues[i]), 1078 ikglp_get_idx(sem, &sem->fifo_queues[i]),
1079 sem->fifo_queues[i].hp_waiter->comm, 1079 sem->fifo_queues[i].hp_waiter->comm,
1080 sem->fifo_queues[i].hp_waiter->pid, 1080 sem->fifo_queues[i].hp_waiter->pid,
1081 (fq) ? ikglp_get_idx(sem, fq) : -1, 1081 (fq) ? ikglp_get_idx(sem, fq) : 0,
1082 (fq) ? ((fq->hp_waiter) ? fq->hp_waiter->comm : "nil") : "nilXX", 1082 (fq) ? ((fq->hp_waiter) ? fq->hp_waiter->comm : "null") : "nullXX",
1083 (fq) ? ((fq->hp_waiter) ? fq->hp_waiter->pid : -1) : -2); 1083 (fq) ? ((fq->hp_waiter) ? fq->hp_waiter->pid : 0) : -2);
1084 1084
1085 fq = &sem->fifo_queues[i]; 1085 fq = &sem->fifo_queues[i];
1086 1086
@@ -1151,8 +1151,8 @@ static void ikglp_steal_to_fq(struct ikglp_semaphore *sem,
1151 fq_steal->hp_waiter = ikglp_find_hp_waiter(fq_steal, NULL); 1151 fq_steal->hp_waiter = ikglp_find_hp_waiter(fq_steal, NULL);
1152 TRACE_TASK(t, "New hp_waiter for fq %d is %s/%d!\n", 1152 TRACE_TASK(t, "New hp_waiter for fq %d is %s/%d!\n",
1153 ikglp_get_idx(sem, fq_steal), 1153 ikglp_get_idx(sem, fq_steal),
1154 (fq_steal->hp_waiter) ? fq_steal->hp_waiter->comm : "nil", 1154 (fq_steal->hp_waiter) ? fq_steal->hp_waiter->comm : "null",
1155 (fq_steal->hp_waiter) ? fq_steal->hp_waiter->pid : -1); 1155 (fq_steal->hp_waiter) ? fq_steal->hp_waiter->pid : 0);
1156 } 1156 }
1157 1157
1158 1158
@@ -1450,8 +1450,8 @@ int ikglp_unlock(struct litmus_lock* l)
1450 other_fq->hp_waiter = ikglp_find_hp_waiter(other_fq, NULL); 1450 other_fq->hp_waiter = ikglp_find_hp_waiter(other_fq, NULL);
1451 TRACE_TASK(t, "New hp_waiter for fq %d is %s/%d!\n", 1451 TRACE_TASK(t, "New hp_waiter for fq %d is %s/%d!\n",
1452 ikglp_get_idx(sem, other_fq), 1452 ikglp_get_idx(sem, other_fq),
1453 (other_fq->hp_waiter) ? other_fq->hp_waiter->comm : "nil", 1453 (other_fq->hp_waiter) ? other_fq->hp_waiter->comm : "null",
1454 (other_fq->hp_waiter) ? other_fq->hp_waiter->pid : -1); 1454 (other_fq->hp_waiter) ? other_fq->hp_waiter->pid : 0);
1455 1455
1456 ikglp_refresh_owners_prio_decrease(other_fq, sem, flags); // unlocks sem->lock. reacquire it. 1456 ikglp_refresh_owners_prio_decrease(other_fq, sem, flags); // unlocks sem->lock. reacquire it.
1457 lock_fine_irqsave(&sem->lock, flags); // there should be no contention!!!! 1457 lock_fine_irqsave(&sem->lock, flags); // there should be no contention!!!!
@@ -1489,8 +1489,8 @@ int ikglp_unlock(struct litmus_lock* l)
1489 1489
1490 TRACE_TASK(t, "New hp_waiter for fq %d is %s/%d!\n", 1490 TRACE_TASK(t, "New hp_waiter for fq %d is %s/%d!\n",
1491 ikglp_get_idx(sem, fq), 1491 ikglp_get_idx(sem, fq),
1492 (fq->hp_waiter) ? fq->hp_waiter->comm : "nil", 1492 (fq->hp_waiter) ? fq->hp_waiter->comm : "null",
1493 (fq->hp_waiter) ? fq->hp_waiter->pid : -1); 1493 (fq->hp_waiter) ? fq->hp_waiter->pid : 0);
1494 } 1494 }
1495 } 1495 }
1496 else { 1496 else {
@@ -1536,8 +1536,8 @@ wake_kludge:
1536 fq->hp_waiter = ikglp_find_hp_waiter(fq, NULL); 1536 fq->hp_waiter = ikglp_find_hp_waiter(fq, NULL);
1537 TRACE_TASK(next, "New hp_waiter for fq %d is %s/%d!\n", 1537 TRACE_TASK(next, "New hp_waiter for fq %d is %s/%d!\n",
1538 ikglp_get_idx(sem, fq), 1538 ikglp_get_idx(sem, fq),
1539 (fq->hp_waiter) ? fq->hp_waiter->comm : "nil", 1539 (fq->hp_waiter) ? fq->hp_waiter->comm : "null",
1540 (fq->hp_waiter) ? fq->hp_waiter->pid : -1); 1540 (fq->hp_waiter) ? fq->hp_waiter->pid : 0);
1541 1541
1542 fq->nest.hp_waiter_eff_prio = (fq->hp_waiter) ? 1542 fq->nest.hp_waiter_eff_prio = (fq->hp_waiter) ?
1543 effective_priority(fq->hp_waiter) : NULL; 1543 effective_priority(fq->hp_waiter) : NULL;
@@ -1568,8 +1568,8 @@ wake_kludge:
1568 * waiter's priority. */ 1568 * waiter's priority. */
1569 TRACE_TASK(next, "is not hp_waiter of replica %d. hp_waiter is %s/%d\n", 1569 TRACE_TASK(next, "is not hp_waiter of replica %d. hp_waiter is %s/%d\n",
1570 ikglp_get_idx(sem, fq), 1570 ikglp_get_idx(sem, fq),
1571 (fq->hp_waiter) ? fq->hp_waiter->comm : "nil", 1571 (fq->hp_waiter) ? fq->hp_waiter->comm : "null",
1572 (fq->hp_waiter) ? fq->hp_waiter->pid : -1); 1572 (fq->hp_waiter) ? fq->hp_waiter->pid : 0);
1573 1573
1574 raw_spin_lock(&tsk_rt(next)->hp_blocked_tasks_lock); 1574 raw_spin_lock(&tsk_rt(next)->hp_blocked_tasks_lock);
1575 1575
@@ -2166,8 +2166,8 @@ out:
2166 2166
2167 TRACE_CUR("Candidate victim from fq %d is %s/%d. aff improvement = %d.\n", 2167 TRACE_CUR("Candidate victim from fq %d is %s/%d. aff improvement = %d.\n",
2168 replica, 2168 replica,
2169 (wait) ? wait->task->comm : "nil", 2169 (wait) ? wait->task->comm : "null",
2170 (wait) ? wait->task->pid : -1, 2170 (wait) ? wait->task->pid : 0,
2171 max_improvement); 2171 max_improvement);
2172 2172
2173 return wait; 2173 return wait;
@@ -2284,11 +2284,11 @@ static ikglp_donee_heap_node_t* pick_donee(struct ikglp_affinity* aff,
2284// "(mth_highest != fq->owner) = %d " 2284// "(mth_highest != fq->owner) = %d "
2285// "(mth_highest > fq->owner) = %d\n", 2285// "(mth_highest > fq->owner) = %d\n",
2286// ikglp_get_idx(sem, fq), 2286// ikglp_get_idx(sem, fq),
2287// (fq->owner) ? fq->owner->comm : "nil", 2287// (fq->owner) ? fq->owner->comm : "null",
2288// (fq->owner) ? fq->owner->pid : -1, 2288// (fq->owner) ? fq->owner->pid : 0,
2289// (fq->owner) ? (int)get_deadline(fq->owner) - now : -999, 2289// (fq->owner) ? (int)get_deadline(fq->owner) - now : -999,
2290// (fq->donee_heap_node.donor_info) ? fq->donee_heap_node.donor_info->task->comm : "nil", 2290// (fq->donee_heap_node.donor_info) ? fq->donee_heap_node.donor_info->task->comm : "null",
2291// (fq->donee_heap_node.donor_info) ? fq->donee_heap_node.donor_info->task->pid : -1, 2291// (fq->donee_heap_node.donor_info) ? fq->donee_heap_node.donor_info->task->pid : 0,
2292// (mth_highest != fq->owner), 2292// (mth_highest != fq->owner),
2293// (litmus->__compare(mth_highest, BASE, fq->owner, BASE))); 2293// (litmus->__compare(mth_highest, BASE, fq->owner, BASE)));
2294 2294
@@ -2308,8 +2308,8 @@ static ikglp_donee_heap_node_t* pick_donee(struct ikglp_affinity* aff,
2308// dist_from_head, 2308// dist_from_head,
2309// wait->task->comm, wait->task->pid, 2309// wait->task->comm, wait->task->pid,
2310// (int)get_deadline(wait->task) - now, 2310// (int)get_deadline(wait->task) - now,
2311// (wait->donee_heap_node.donor_info) ? wait->donee_heap_node.donor_info->task->comm : "nil", 2311// (wait->donee_heap_node.donor_info) ? wait->donee_heap_node.donor_info->task->comm : "null",
2312// (wait->donee_heap_node.donor_info) ? wait->donee_heap_node.donor_info->task->pid : -1, 2312// (wait->donee_heap_node.donor_info) ? wait->donee_heap_node.donor_info->task->pid : 0,
2313// (mth_highest != wait->task), 2313// (mth_highest != wait->task),
2314// (litmus->__compare(mth_highest, BASE, wait->task, BASE))); 2314// (litmus->__compare(mth_highest, BASE, wait->task, BASE)));
2315 2315
@@ -2342,8 +2342,8 @@ out:
2342 2342
2343 TRACE_CUR("Candidate donee for fq %d is %s/%d (dist_from_head = %d)\n", 2343 TRACE_CUR("Candidate donee for fq %d is %s/%d (dist_from_head = %d)\n",
2344 ikglp_get_idx(sem, fq), 2344 ikglp_get_idx(sem, fq),
2345 (donee) ? (donee)->comm : "nil", 2345 (donee) ? (donee)->comm : "null",
2346 (donee) ? (donee)->pid : -1, 2346 (donee) ? (donee)->pid : 0,
2347 *dist_from_head); 2347 *dist_from_head);
2348 2348
2349 return donee_node; 2349 return donee_node;
diff --git a/litmus/locking.c b/litmus/locking.c
index 81a1fc9bdd12..58b5edd9df32 100644
--- a/litmus/locking.c
+++ b/litmus/locking.c
@@ -218,12 +218,12 @@ void print_hp_waiters(struct binheap_node* n, int depth)
218 218
219 TRACE("%s+-> %s/%d [waiter = %s/%d] [waiter's inh = %s/%d] (lock = %d)\n", 219 TRACE("%s+-> %s/%d [waiter = %s/%d] [waiter's inh = %s/%d] (lock = %d)\n",
220 padding, 220 padding,
221 (node_prio) ? node_prio->comm : "nil", 221 (node_prio) ? node_prio->comm : "null",
222 (node_prio) ? node_prio->pid : -1, 222 (node_prio) ? node_prio->pid : 0,
223 (hp) ? hp->comm : "nil", 223 (hp) ? hp->comm : "null",
224 (hp) ? hp->pid : -1, 224 (hp) ? hp->pid : 0,
225 (hp_eff) ? hp_eff->comm : "nil", 225 (hp_eff) ? hp_eff->comm : "null",
226 (hp_eff) ? hp_eff->pid : -1, 226 (hp_eff) ? hp_eff->pid : 0,
227 l->ident); 227 l->ident);
228 228
229 if(n->left) print_hp_waiters(n->left, depth+1); 229 if(n->left) print_hp_waiters(n->left, depth+1);
diff --git a/litmus/nvidia_info.c b/litmus/nvidia_info.c
index ab62ca1b5b11..f5364df6fd69 100644
--- a/litmus/nvidia_info.c
+++ b/litmus/nvidia_info.c
@@ -517,11 +517,13 @@ struct task_struct* get_nv_max_device_owner(u32 target_device_id)
517 517
518 reg = &NV_DEVICE_REG[target_device_id]; 518 reg = &NV_DEVICE_REG[target_device_id];
519 519
520#ifdef CONFIG_SCHED_DEBUG_TRACE
520 if (!binheap_empty(&reg->owners)) { 521 if (!binheap_empty(&reg->owners)) {
521 struct task_struct *hp = container_of(binheap_top_entry(&reg->owners, struct rt_param, gpu_owner_node), 522 struct task_struct *hp = container_of(binheap_top_entry(&reg->owners, struct rt_param, gpu_owner_node),
522 struct task_struct, rt_param); 523 struct task_struct, rt_param);
523 TRACE_CUR("hp: %s/%d\n", hp->comm, hp->pid); 524 TRACE_CUR("hp: %s/%d\n", hp->comm, hp->pid);
524 } 525 }
526#endif
525 527
526 return(owner); 528 return(owner);
527} 529}
@@ -555,8 +557,8 @@ static int gpu_klmirqd_increase_priority(struct task_struct *klmirqd, struct tas
555 557
556 TRACE_CUR("Increasing priority of %s/%d to %s/%d.\n", 558 TRACE_CUR("Increasing priority of %s/%d to %s/%d.\n",
557 klmirqd->comm, klmirqd->pid, 559 klmirqd->comm, klmirqd->pid,
558 (hp) ? hp->comm : "nil", 560 (hp) ? hp->comm : "null",
559 (hp) ? hp->pid : -1); 561 (hp) ? hp->pid : 0);
560 562
561 /* the klmirqd thread should never attempt to hold a litmus-level real-time 563 /* the klmirqd thread should never attempt to hold a litmus-level real-time
562 * so nested support is not required */ 564 * so nested support is not required */
@@ -571,8 +573,8 @@ static int gpu_klmirqd_decrease_priority(struct task_struct *klmirqd, struct tas
571 573
572 TRACE_CUR("Decreasing priority of %s/%d to %s/%d.\n", 574 TRACE_CUR("Decreasing priority of %s/%d to %s/%d.\n",
573 klmirqd->comm, klmirqd->pid, 575 klmirqd->comm, klmirqd->pid,
574 (hp) ? hp->comm : "nil", 576 (hp) ? hp->comm : "null",
575 (hp) ? hp->pid : -1); 577 (hp) ? hp->pid : 0);
576 578
577 /* the klmirqd thread should never attempt to hold a litmus-level real-time 579 /* the klmirqd thread should never attempt to hold a litmus-level real-time
578 * so nested support is not required */ 580 * so nested support is not required */
@@ -685,10 +687,10 @@ long disable_gpu_owner(struct task_struct *t)
685 TRACE_CUR("%s/%d is no longer hp on GPU %d; new hp = %s/%d (eff_prio = %s/%d).\n", 687 TRACE_CUR("%s/%d is no longer hp on GPU %d; new hp = %s/%d (eff_prio = %s/%d).\n",
686 t->comm, t->pid, 688 t->comm, t->pid,
687 gpu, 689 gpu,
688 (new_hp) ? new_hp->comm : "nil", 690 (new_hp) ? new_hp->comm : "null",
689 (new_hp) ? new_hp->pid : -1, 691 (new_hp) ? new_hp->pid : 0,
690 (to_inh) ? to_inh->comm : "nil", 692 (to_inh) ? to_inh->comm : "null",
691 (to_inh) ? to_inh->pid : -1); 693 (to_inh) ? to_inh->pid : 0);
692 694
693 retval = gpu_klmirqd_decrease_priority(reg->thread, to_inh); 695 retval = gpu_klmirqd_decrease_priority(reg->thread, to_inh);
694 } 696 }
diff --git a/litmus/rsm_lock.c b/litmus/rsm_lock.c
index dcf44a848cbb..beb2aa1a4f54 100644
--- a/litmus/rsm_lock.c
+++ b/litmus/rsm_lock.c
@@ -679,8 +679,8 @@ void rsm_mutex_propagate_decrease_inheritance(struct litmus_lock* l,
679 //if(__edf_higher_prio(new_max_eff_prio, BASE, owner, BASE)) { 679 //if(__edf_higher_prio(new_max_eff_prio, BASE, owner, BASE)) {
680 if(litmus->__compare(new_max_eff_prio, BASE, owner, BASE)) { 680 if(litmus->__compare(new_max_eff_prio, BASE, owner, BASE)) {
681 TRACE_CUR("%s/%d has greater base priority than base priority of owner (%s/%d) of lock %d.\n", 681 TRACE_CUR("%s/%d has greater base priority than base priority of owner (%s/%d) of lock %d.\n",
682 (new_max_eff_prio) ? new_max_eff_prio->comm : "nil", 682 (new_max_eff_prio) ? new_max_eff_prio->comm : "null",
683 (new_max_eff_prio) ? new_max_eff_prio->pid : -1, 683 (new_max_eff_prio) ? new_max_eff_prio->pid : 0,
684 owner->comm, 684 owner->comm,
685 owner->pid, 685 owner->pid,
686 l->ident); 686 l->ident);
@@ -689,8 +689,8 @@ void rsm_mutex_propagate_decrease_inheritance(struct litmus_lock* l,
689 } 689 }
690 else { 690 else {
691 TRACE_CUR("%s/%d has lesser base priority than base priority of owner (%s/%d) of lock %d.\n", 691 TRACE_CUR("%s/%d has lesser base priority than base priority of owner (%s/%d) of lock %d.\n",
692 (new_max_eff_prio) ? new_max_eff_prio->comm : "nil", 692 (new_max_eff_prio) ? new_max_eff_prio->comm : "null",
693 (new_max_eff_prio) ? new_max_eff_prio->pid : -1, 693 (new_max_eff_prio) ? new_max_eff_prio->pid : 0,
694 owner->comm, 694 owner->comm,
695 owner->pid, 695 owner->pid,
696 l->ident); 696 l->ident);
@@ -812,26 +812,26 @@ static int rsm_proc_print(char *page, char **start, off_t off, int count, int *e
812 w = scnprintf(next, size, 812 w = scnprintf(next, size,
813 "owner: %s/%d (inh: %s/%d)\n", 813 "owner: %s/%d (inh: %s/%d)\n",
814 (mutex->owner) ? 814 (mutex->owner) ?
815 mutex->owner->comm : "nil", 815 mutex->owner->comm : "null",
816 (mutex->owner) ? 816 (mutex->owner) ?
817 mutex->owner->pid : -1, 817 mutex->owner->pid : 0,
818 (mutex->owner && tsk_rt(mutex->owner)->inh_task) ? 818 (mutex->owner && tsk_rt(mutex->owner)->inh_task) ?
819 tsk_rt(mutex->owner)->inh_task->comm : "nil", 819 tsk_rt(mutex->owner)->inh_task->comm : "null",
820 (mutex->owner && tsk_rt(mutex->owner)->inh_task) ? 820 (mutex->owner && tsk_rt(mutex->owner)->inh_task) ?
821 tsk_rt(mutex->owner)->inh_task->pid : -1); 821 tsk_rt(mutex->owner)->inh_task->pid : 0);
822 size -= w; 822 size -= w;
823 next += w; 823 next += w;
824 824
825 w = scnprintf(next, size, 825 w = scnprintf(next, size,
826 "hp waiter: %s/%d (inh: %s/%d)\n", 826 "hp waiter: %s/%d (inh: %s/%d)\n",
827 (mutex->hp_waiter) ? 827 (mutex->hp_waiter) ?
828 mutex->hp_waiter->comm : "nil", 828 mutex->hp_waiter->comm : "null",
829 (mutex->hp_waiter) ? 829 (mutex->hp_waiter) ?
830 mutex->hp_waiter->pid : -1, 830 mutex->hp_waiter->pid : 0,
831 (mutex->hp_waiter && tsk_rt(mutex->hp_waiter)->inh_task) ? 831 (mutex->hp_waiter && tsk_rt(mutex->hp_waiter)->inh_task) ?
832 tsk_rt(mutex->hp_waiter)->inh_task->comm : "nil", 832 tsk_rt(mutex->hp_waiter)->inh_task->comm : "null",
833 (mutex->hp_waiter && tsk_rt(mutex->hp_waiter)->inh_task) ? 833 (mutex->hp_waiter && tsk_rt(mutex->hp_waiter)->inh_task) ?
834 tsk_rt(mutex->hp_waiter)->inh_task->pid : -1); 834 tsk_rt(mutex->hp_waiter)->inh_task->pid : 0);
835 size -= w; 835 size -= w;
836 next += w; 836 next += w;
837 837
@@ -875,9 +875,9 @@ static int rsm_proc_print(char *page, char **start, off_t off, int count, int *e
875 "\n", 875 "\n",
876 blocked_task->comm, blocked_task->pid, 876 blocked_task->comm, blocked_task->pid,
877 (tsk_rt(blocked_task)->inh_task) ? 877 (tsk_rt(blocked_task)->inh_task) ?
878 tsk_rt(blocked_task)->inh_task->comm : "nil", 878 tsk_rt(blocked_task)->inh_task->comm : "null",
879 (tsk_rt(blocked_task)->inh_task) ? 879 (tsk_rt(blocked_task)->inh_task) ?
880 tsk_rt(blocked_task)->inh_task->pid : -1 880 tsk_rt(blocked_task)->inh_task->pid : 0
881#ifdef CONFIG_LITMUS_DGL_SUPPORT 881#ifdef CONFIG_LITMUS_DGL_SUPPORT
882 , enabled 882 , enabled
883#endif 883#endif
diff --git a/litmus/rt_domain.c b/litmus/rt_domain.c
index 54322e278a1e..4528c4362ecf 100644
--- a/litmus/rt_domain.c
+++ b/litmus/rt_domain.c
@@ -304,7 +304,7 @@ void __add_ready(rt_domain_t* rt, struct task_struct *new)
304 "[inh_task: %s/%d (%llu, %llu %llu)] " 304 "[inh_task: %s/%d (%llu, %llu %llu)] "
305 "rel=%llu to ready queue at %llu\n", 305 "rel=%llu to ready queue at %llu\n",
306 new->comm, new->pid, get_exec_cost(new), get_rt_period(new), get_rt_relative_deadline(new), 306 new->comm, new->pid, get_exec_cost(new), get_rt_period(new), get_rt_relative_deadline(new),
307 (tsk_rt(new)->inh_task) ? tsk_rt(new)->inh_task->comm : "(nil)", 307 (tsk_rt(new)->inh_task) ? tsk_rt(new)->inh_task->comm : "(null)",
308 (tsk_rt(new)->inh_task) ? tsk_rt(new)->inh_task->pid : 0, 308 (tsk_rt(new)->inh_task) ? tsk_rt(new)->inh_task->pid : 0,
309 (tsk_rt(new)->inh_task) ? get_exec_cost(tsk_rt(new)->inh_task) : 0, 309 (tsk_rt(new)->inh_task) ? get_exec_cost(tsk_rt(new)->inh_task) : 0,
310 (tsk_rt(new)->inh_task) ? get_rt_period(tsk_rt(new)->inh_task) : 0, 310 (tsk_rt(new)->inh_task) ? get_rt_period(tsk_rt(new)->inh_task) : 0,
diff --git a/litmus/sched_cedf.c b/litmus/sched_cedf.c
index 508a0596f9a7..df931de13e16 100644
--- a/litmus/sched_cedf.c
+++ b/litmus/sched_cedf.c
@@ -498,7 +498,7 @@ static void __do_lit_tasklet(struct tasklet_struct* tasklet, unsigned long flush
498 } 498 }
499 TRACE("%s: Invoking tasklet with owner pid = %d (flushed = %d).\n", 499 TRACE("%s: Invoking tasklet with owner pid = %d (flushed = %d).\n",
500 __FUNCTION__, 500 __FUNCTION__,
501 (tasklet->owner) ? tasklet->owner->pid : -1, 501 (tasklet->owner) ? tasklet->owner->pid : 0,
502 (tasklet->owner) ? 0 : 1); 502 (tasklet->owner) ? 0 : 1);
503 tasklet->func(tasklet->data); 503 tasklet->func(tasklet->data);
504 tasklet_unlock(tasklet); 504 tasklet_unlock(tasklet);
@@ -1269,8 +1269,8 @@ static int __increase_priority_inheritance(struct task_struct* t,
1269 "Occurance is likely okay: probably due to (hopefully safe) concurrent priority updates.\n", 1269 "Occurance is likely okay: probably due to (hopefully safe) concurrent priority updates.\n",
1270 t->comm, t->pid, 1270 t->comm, t->pid,
1271 effective_priority(t)->comm, effective_priority(t)->pid, 1271 effective_priority(t)->comm, effective_priority(t)->pid,
1272 (prio_inh) ? prio_inh->comm : "nil", 1272 (prio_inh) ? prio_inh->comm : "null",
1273 (prio_inh) ? prio_inh->pid : -1); 1273 (prio_inh) ? prio_inh->pid : 0);
1274 WARN_ON(!prio_inh); 1274 WARN_ON(!prio_inh);
1275 success = 0; 1275 success = 0;
1276 } 1276 }
@@ -1335,8 +1335,8 @@ static int __decrease_priority_inheritance(struct task_struct* t,
1335 if (prio_inh == tsk_rt(t)->inh_task) { 1335 if (prio_inh == tsk_rt(t)->inh_task) {
1336 /* relationship already established. */ 1336 /* relationship already established. */
1337 TRACE_TASK(t, "already inherits priority from %s/%d\n", 1337 TRACE_TASK(t, "already inherits priority from %s/%d\n",
1338 (prio_inh) ? prio_inh->comm : "(nil)", 1338 (prio_inh) ? prio_inh->comm : "(null)",
1339 (prio_inh) ? prio_inh->pid : -1); 1339 (prio_inh) ? prio_inh->pid : 0);
1340 goto out; 1340 goto out;
1341 } 1341 }
1342 1342
@@ -1400,8 +1400,8 @@ static int __decrease_priority_inheritance(struct task_struct* t,
1400 "Occurance is likely okay: probably due to (hopefully safe) concurrent priority updates.\n", 1400 "Occurance is likely okay: probably due to (hopefully safe) concurrent priority updates.\n",
1401 t->comm, t->pid, 1401 t->comm, t->pid,
1402 effective_priority(t)->comm, effective_priority(t)->pid, 1402 effective_priority(t)->comm, effective_priority(t)->pid,
1403 (prio_inh) ? prio_inh->comm : "nil", 1403 (prio_inh) ? prio_inh->comm : "null",
1404 (prio_inh) ? prio_inh->pid : -1); 1404 (prio_inh) ? prio_inh->pid : 0);
1405 success = 0; 1405 success = 0;
1406 } 1406 }
1407#endif 1407#endif
@@ -1418,8 +1418,8 @@ static void decrease_priority_inheritance(struct task_struct* t,
1418 raw_spin_lock(&cluster->cluster_lock); 1418 raw_spin_lock(&cluster->cluster_lock);
1419 1419
1420 TRACE_TASK(t, "to inherit from %s/%d (decrease)\n", 1420 TRACE_TASK(t, "to inherit from %s/%d (decrease)\n",
1421 (prio_inh) ? prio_inh->comm : "nil", 1421 (prio_inh) ? prio_inh->comm : "null",
1422 (prio_inh) ? prio_inh->pid : -1); 1422 (prio_inh) ? prio_inh->pid : 0);
1423 1423
1424 __decrease_priority_inheritance(t, prio_inh); 1424 __decrease_priority_inheritance(t, prio_inh);
1425 1425
diff --git a/litmus/sched_gsn_edf.c b/litmus/sched_gsn_edf.c
index 8a8a6f1c306b..e290aed53d4d 100644
--- a/litmus/sched_gsn_edf.c
+++ b/litmus/sched_gsn_edf.c
@@ -212,8 +212,8 @@ static noinline void link_task_to_cpu(struct task_struct* linked,
212 212
213 /* 213 /*
214 if (print) { 214 if (print) {
215 TRACE_CUR("linked = %s/%d\n", (linked) ? linked->comm : "(nil)", (linked)? linked->pid : 0); 215 TRACE_CUR("linked = %s/%d\n", (linked) ? linked->comm : "(null)", (linked)? linked->pid : 0);
216 TRACE_CUR("entry->linked = %s/%d\n", (entry->linked) ? entry->linked->comm : "(nil)", (entry->linked)? entry->linked->pid : 0); 216 TRACE_CUR("entry->linked = %s/%d\n", (entry->linked) ? entry->linked->comm : "(null)", (entry->linked)? entry->linked->pid : 0);
217 } 217 }
218 */ 218 */
219 219
@@ -481,7 +481,7 @@ static void __do_lit_tasklet(struct tasklet_struct* tasklet, unsigned long flush
481 } 481 }
482 TRACE("%s: Invoking tasklet with owner pid = %d (flushed = %d).\n", 482 TRACE("%s: Invoking tasklet with owner pid = %d (flushed = %d).\n",
483 __FUNCTION__, 483 __FUNCTION__,
484 (tasklet->owner) ? tasklet->owner->pid : -1, 484 (tasklet->owner) ? tasklet->owner->pid : 0,
485 (tasklet->owner) ? 0 : 1); 485 (tasklet->owner) ? 0 : 1);
486 tasklet->func(tasklet->data); 486 tasklet->func(tasklet->data);
487 tasklet_unlock(tasklet); 487 tasklet_unlock(tasklet);
@@ -639,7 +639,7 @@ static void __add_pai_tasklet(struct tasklet_struct* tasklet)
639 639
640 // insert tasklet right before step->next. 640 // insert tasklet right before step->next.
641 641
642 TRACE("%s: inserting tasklet for %d between %d and %d.\n", __FUNCTION__, tasklet->owner->pid, step->owner->pid, (step->next) ? step->next->owner->pid : -1); 642 TRACE("%s: inserting tasklet for %d between %d and %d.\n", __FUNCTION__, tasklet->owner->pid, step->owner->pid, (step->next) ? step->next->owner->pid : 0);
643 643
644 tasklet->next = step->next; 644 tasklet->next = step->next;
645 step->next = tasklet; 645 step->next = tasklet;
@@ -1232,8 +1232,8 @@ static int __increase_priority_inheritance(struct task_struct* t,
1232 "Occurance is likely okay: probably due to (hopefully safe) concurrent priority updates.\n", 1232 "Occurance is likely okay: probably due to (hopefully safe) concurrent priority updates.\n",
1233 t->comm, t->pid, 1233 t->comm, t->pid,
1234 effective_priority(t)->comm, effective_priority(t)->pid, 1234 effective_priority(t)->comm, effective_priority(t)->pid,
1235 (prio_inh) ? prio_inh->comm : "nil", 1235 (prio_inh) ? prio_inh->comm : "null",
1236 (prio_inh) ? prio_inh->pid : -1); 1236 (prio_inh) ? prio_inh->pid : 0);
1237 WARN_ON(!prio_inh); 1237 WARN_ON(!prio_inh);
1238 success = 0; 1238 success = 0;
1239 } 1239 }
@@ -1276,7 +1276,7 @@ static int __decrease_priority_inheritance(struct task_struct* t,
1276 if (prio_inh == tsk_rt(t)->inh_task) { 1276 if (prio_inh == tsk_rt(t)->inh_task) {
1277 /* relationship already established. */ 1277 /* relationship already established. */
1278 TRACE_TASK(t, "already inherits priority from %s/%d\n", 1278 TRACE_TASK(t, "already inherits priority from %s/%d\n",
1279 (prio_inh) ? prio_inh->comm : "(nil)", 1279 (prio_inh) ? prio_inh->comm : "(null)",
1280 (prio_inh) ? prio_inh->pid : 0); 1280 (prio_inh) ? prio_inh->pid : 0);
1281 goto out; 1281 goto out;
1282 } 1282 }
@@ -1341,8 +1341,8 @@ static int __decrease_priority_inheritance(struct task_struct* t,
1341 "Occurance is likely okay: probably due to (hopefully safe) concurrent priority updates.\n", 1341 "Occurance is likely okay: probably due to (hopefully safe) concurrent priority updates.\n",
1342 t->comm, t->pid, 1342 t->comm, t->pid,
1343 effective_priority(t)->comm, effective_priority(t)->pid, 1343 effective_priority(t)->comm, effective_priority(t)->pid,
1344 (prio_inh) ? prio_inh->comm : "nil", 1344 (prio_inh) ? prio_inh->comm : "null",
1345 (prio_inh) ? prio_inh->pid : -1); 1345 (prio_inh) ? prio_inh->pid : 0);
1346 success = 0; 1346 success = 0;
1347 } 1347 }
1348#endif 1348#endif
diff --git a/litmus/sched_plugin.c b/litmus/sched_plugin.c
index e1654da1ea6c..e870fc14d4d3 100644
--- a/litmus/sched_plugin.c
+++ b/litmus/sched_plugin.c
@@ -32,8 +32,8 @@ void preempt_if_preemptable(struct task_struct* t, int cpu)
32 int reschedule = 0; 32 int reschedule = 0;
33 33
34 TRACE_CUR("preempt_if_preemptable: %s/%d\n", 34 TRACE_CUR("preempt_if_preemptable: %s/%d\n",
35 (t) ? t->comm : "(nil)", 35 (t) ? t->comm : "null",
36 (t) ? t->pid : -1); 36 (t) ? t->pid : 0);
37 37
38 if (!t) { 38 if (!t) {
39 TRACE_CUR("unconditionally reschedule\n"); 39 TRACE_CUR("unconditionally reschedule\n");