aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorGlenn Elliott <gelliott@cs.unc.edu>2012-04-04 23:11:47 -0400
committerGlenn Elliott <gelliott@cs.unc.edu>2012-04-04 23:11:47 -0400
commitf5c9f29c1d17131870ec113cc357b40d2f087bc2 (patch)
treef9d11be7fe7485080e168ad9b377d3d6c66b66d1
parent0ccecdaf12334b2241ee5185b04eda4f91f95fe2 (diff)
Cleanup use of binheap_entry().
The entry is already casted by the macro.
-rw-r--r--litmus/sched_gsn_edf.c12
1 files changed, 6 insertions, 6 deletions
diff --git a/litmus/sched_gsn_edf.c b/litmus/sched_gsn_edf.c
index 7e50445ad1a9..0050d375ab6c 100644
--- a/litmus/sched_gsn_edf.c
+++ b/litmus/sched_gsn_edf.c
@@ -1482,16 +1482,16 @@ typedef struct ikglp_heap_node
1482 1482
1483static int ikglp_edf_max_heap_base_priority_order(struct binheap_node *a, struct binheap_node *b) 1483static int ikglp_edf_max_heap_base_priority_order(struct binheap_node *a, struct binheap_node *b)
1484{ 1484{
1485 ikglp_heap_node_t *d_a = (ikglp_heap_node_t*)binheap_entry(a, ikglp_heap_node_t, node); 1485 ikglp_heap_node_t *d_a = binheap_entry(a, ikglp_heap_node_t, node);
1486 ikglp_heap_node_t *d_b = (ikglp_heap_node_t*)binheap_entry(b, ikglp_heap_node_t, node); 1486 ikglp_heap_node_t *d_b = binheap_entry(b, ikglp_heap_node_t, node);
1487 1487
1488 return __edf_higher_prio(d_a->task, BASE, d_b->task, BASE); 1488 return __edf_higher_prio(d_a->task, BASE, d_b->task, BASE);
1489} 1489}
1490 1490
1491static int ikglp_edf_min_heap_base_priority_order(struct binheap_node *a, struct binheap_node *b) 1491static int ikglp_edf_min_heap_base_priority_order(struct binheap_node *a, struct binheap_node *b)
1492{ 1492{
1493 ikglp_heap_node_t *d_a = (ikglp_heap_node_t*)binheap_entry(a, ikglp_heap_node_t, node); 1493 ikglp_heap_node_t *d_a = binheap_entry(a, ikglp_heap_node_t, node);
1494 ikglp_heap_node_t *d_b = (ikglp_heap_node_t*)binheap_entry(b, ikglp_heap_node_t, node); 1494 ikglp_heap_node_t *d_b = binheap_entry(b, ikglp_heap_node_t, node);
1495 1495
1496 return __edf_higher_prio(d_b->task, BASE, d_a->task, BASE); 1496 return __edf_higher_prio(d_b->task, BASE, d_a->task, BASE);
1497} 1497}
@@ -1541,8 +1541,8 @@ static int ikglp_edf_min_heap_donee_order(struct binheap_node *a, struct binheap
1541{ 1541{
1542 struct task_struct *prio_a, *prio_b; 1542 struct task_struct *prio_a, *prio_b;
1543 1543
1544 ikglp_donee_heap_node_t *d_a = (ikglp_donee_heap_node_t*)binheap_entry(a, ikglp_donee_heap_node_t, node); 1544 ikglp_donee_heap_node_t *d_a = binheap_entry(a, ikglp_donee_heap_node_t, node);
1545 ikglp_donee_heap_node_t *d_b = (ikglp_donee_heap_node_t*)binheap_entry(b, ikglp_donee_heap_node_t, node); 1545 ikglp_donee_heap_node_t *d_b = binheap_entry(b, ikglp_donee_heap_node_t, node);
1546 1546
1547 if(!d_a->donor_info) { 1547 if(!d_a->donor_info) {
1548 prio_a = d_a->task; 1548 prio_a = d_a->task;