Rev 2109 | Rev 2183 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2109 | Rev 2118 | ||
---|---|---|---|
Line 391... | Line 391... | ||
391 | printf("------ ---------- --- ---------- ---------- ---------- ------- " "------ ------>\n"); |
391 | printf("------ ---------- --- ---------- ---------- ---------- ------- " "------ ------>\n"); |
392 | 392 | ||
393 | for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; |
393 | for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; |
394 | cur = cur->next) { |
394 | cur = cur->next) { |
395 | btree_node_t *node; |
395 | btree_node_t *node; |
396 | int i; |
396 | unsigned int i; |
397 | 397 | ||
398 | node = list_get_instance(cur, btree_node_t, leaf_link); |
398 | node = list_get_instance(cur, btree_node_t, leaf_link); |
399 | for (i = 0; i < node->keys; i++) { |
399 | for (i = 0; i < node->keys; i++) { |
400 | task_t *t; |
400 | task_t *t; |
401 | int j; |
401 | int j; |