)]}' { "log": [ { "commit": "5522d5d5f70005faeffff3ffc0cfa8eec0155de4", "tree": "d05fc41d19b8a70102a0ad3ad7ed8f6fd2d1cf7d", "parents": [ "b9fa3df33f9166daf81bfa8253d339f5a7726122" ], "author": { "name": "Ingo Molnar", "email": "mingo@elte.hu", "time": "Mon Oct 15 17:00:12 2007 +0200" }, "committer": { "name": "Ingo Molnar", "email": "mingo@elte.hu", "time": "Mon Oct 15 17:00:12 2007 +0200" }, "message": "sched: mark scheduling classes as const\n\nmark scheduling classes as const. The speeds up the code\na bit and shrinks it:\n\n text data bss dec hex filename\n 40027 4018 292 44337 ad31 sched.o.before\n 40190 3842 292 44324 ad24 sched.o.after\n\nSigned-off-by: Ingo Molnar \u003cmingo@elte.hu\u003e\nReviewed-by: Thomas Gleixner \u003ctglx@linutronix.de\u003e\n" }, { "commit": "83b699ed20f5218580a1b7042064082e2e05f8c5", "tree": "544c42283f41065f22e96e02af0badb7ed70a371", "parents": [ "edcb60a309769a5f6e7c9e76d7c98b34d1757448" ], "author": { "name": "Srivatsa Vaddagiri", "email": "vatsa@linux.vnet.ibm.com", "time": "Mon Oct 15 17:00:08 2007 +0200" }, "committer": { "name": "Ingo Molnar", "email": "mingo@elte.hu", "time": "Mon Oct 15 17:00:08 2007 +0200" }, "message": "sched: revert recent removal of set_curr_task()\n\nRevert removal of set_curr_task.\nUse put_prev_task/set_curr_task when changing groups/policies\n\nSigned-off-by: Srivatsa Vaddagiri \u003c vatsa@linux.vnet.ibm.com\u003e\nSigned-off-by: Dhaval Giani \u003cdhaval@linux.vnet.ibm.com\u003e\nSigned-off-by: Ingo Molnar \u003cmingo@elte.hu\u003e\nSigned-off-by: Peter Zijlstra \u003ca.p.zijlstra@chello.nl\u003e\n" }, { "commit": "f6b53205e17c8ca481c69ed579a35a650a4b481a", "tree": "d7820281757e3a2c7cfff7e38275261dcd077eab", "parents": [ "4530d7ab0fb8d5056b68c376949e2d5c4db7817e" ], "author": { "name": "Dmitry Adamushko", "email": "dmitry.adamushko@gmail.com", "time": "Mon Oct 15 17:00:08 2007 +0200" }, "committer": { "name": "Ingo Molnar", "email": "mingo@elte.hu", "time": "Mon Oct 15 17:00:08 2007 +0200" }, "message": "sched: rework enqueue/dequeue_entity() to get rid of set_curr_task()\n\nrework enqueue/dequeue_entity() to get rid of \nsched_class::set_curr_task(). This simplifies sched_setscheduler(), \nrt_mutex_setprio() and sched_move_tasks().\n\n text data bss dec hex filename\n 24330 2734 20 27084 69cc sched.o.before\n 24233 2730 20 26983 6967 sched.o.after\n\nSigned-off-by: Dmitry Adamushko \u003cdmitry.adamushko@gmail.com\u003e\nSigned-off-by: Srivatsa Vaddagiri \u003cvatsa@linux.vnet.ibm.com\u003e\nSigned-off-by: Ingo Molnar \u003cmingo@elte.hu\u003e\nSigned-off-by: Peter Zijlstra \u003ca.p.zijlstra@chello.nl\u003e\nReviewed-by: Thomas Gleixner \u003ctglx@linutronix.de\u003e\n" }, { "commit": "29f59db3a74b0bdf78a1f5b53ef773caa82692dc", "tree": "5ac877639bac41d3749d08b7f624bd13052e5ec6", "parents": [ "119fe5e06800afc197781ebc8c2d8ca7d03497c8" ], "author": { "name": "Srivatsa Vaddagiri", "email": "vatsa@linux.vnet.ibm.com", "time": "Mon Oct 15 17:00:07 2007 +0200" }, "committer": { "name": "Ingo Molnar", "email": "mingo@elte.hu", "time": "Mon Oct 15 17:00:07 2007 +0200" }, "message": "sched: group-scheduler core\n\nAdd interface to control cpu bandwidth allocation to task-groups.\n\n(not yet configurable, due to missing CONFIG_CONTAINERS)\n\nSigned-off-by: Srivatsa Vaddagiri \u003cvatsa@linux.vnet.ibm.com\u003e\nSigned-off-by: Dhaval Giani \u003cdhaval@linux.vnet.ibm.com\u003e\nSigned-off-by: Ingo Molnar \u003cmingo@elte.hu\u003e\nSigned-off-by: Peter Zijlstra \u003ca.p.zijlstra@chello.nl\u003e\n" }, { "commit": "31ee529cc2254e8b62880535ec8f21a4c5e1c091", "tree": "df9a19be47c3111d0e34ce9f13498b236733a850", "parents": [ "ff95f3df54609d9d4b9572f8a67d09922a645043" ], "author": { "name": "Ingo Molnar", "email": "mingo@elte.hu", "time": "Thu Aug 09 11:16:49 2007 +0200" }, "committer": { "name": "Ingo Molnar", "email": "mingo@elte.hu", "time": "Thu Aug 09 11:16:49 2007 +0200" }, "message": "sched: remove the \u0027u64 now\u0027 parameter from -\u003eput_prev_task()\n\nremove the \u0027u64 now\u0027 parameter from -\u003eput_prev_task().\n\n( identity transformation that causes no change in functionality. )\n\nSigned-off-by: Ingo Molnar \u003cmingo@elte.hu\u003e\n" }, { "commit": "fb8d47240246e20f864f0724a23a7220cd1c59ac", "tree": "0c94ecb977355a2152655738bfcee6072c10f41e", "parents": [ "f02231e51a280f1a0fee4d03ad8f50048e06cced" ], "author": { "name": "Ingo Molnar", "email": "mingo@elte.hu", "time": "Thu Aug 09 11:16:48 2007 +0200" }, "committer": { "name": "Ingo Molnar", "email": "mingo@elte.hu", "time": "Thu Aug 09 11:16:48 2007 +0200" }, "message": "sched: remove the \u0027u64 now\u0027 parameter from -\u003epick_next_task()\n\nremove the \u0027u64 now\u0027 parameter from -\u003epick_next_task().\n\n( identity transformation that causes no change in functionality. )\n\nSigned-off-by: Ingo Molnar \u003cmingo@elte.hu\u003e\n" }, { "commit": "f02231e51a280f1a0fee4d03ad8f50048e06cced", "tree": "becd8bf748828e3dfe34f73df11d260fd6300026", "parents": [ "fd390f6a04f22fb457d6fd1855964f79536525de" ], "author": { "name": "Ingo Molnar", "email": "mingo@elte.hu", "time": "Thu Aug 09 11:16:48 2007 +0200" }, "committer": { "name": "Ingo Molnar", "email": "mingo@elte.hu", "time": "Thu Aug 09 11:16:48 2007 +0200" }, "message": "sched: remove the \u0027u64 now\u0027 parameter from -\u003edequeue_task()\n\nremove the \u0027u64 now\u0027 parameter from -\u003edequeue_task().\n\n( identity transformation that causes no change in functionality. )\n\nSigned-off-by: Ingo Molnar \u003cmingo@elte.hu\u003e\n" }, { "commit": "a4ac01c36e286dd1b9a1d5cd7422c5af51dc55f8", "tree": "0c275d58a4835a3d604d9cac4e1dd7c25714e150", "parents": [ "aea25401c3347d9f3a64ebdc81043be246a9f631" ], "author": { "name": "Peter Williams", "email": "pwil3058@bigpond.net.au", "time": "Thu Aug 09 11:16:46 2007 +0200" }, "committer": { "name": "Ingo Molnar", "email": "mingo@elte.hu", "time": "Thu Aug 09 11:16:46 2007 +0200" }, "message": "sched: fix bug in balance_tasks()\n\nThere are two problems with balance_tasks() and how it used:\n\n1. The variables best_prio and best_prio_seen (inherited from the old\nmove_tasks()) were only required to handle problems caused by the\nactive/expired arrays, the order in which they were processed and the\npossibility that the task with the highest priority could be on either.\n These issues are no longer present and the extra overhead associated\nwith their use is unnecessary (and possibly wrong).\n\n2. In the absence of CONFIG_FAIR_GROUP_SCHED being set, the same\nthis_best_prio variable needs to be used by all scheduling classes or\nthere is a risk of moving too much load. E.g. if the highest priority\ntask on this at the beginning is a fairly low priority task and the rt\nclass migrates a task (during its turn) then that moved task becomes the\nnew highest priority task on this_rq but when the sched_fair class\ninitializes its copy of this_best_prio it will get the priority of the\noriginal highest priority task as, due to the run queue locks being\nheld, the reschedule triggered by pull_task() will not have taken place.\n This could result in inappropriate overriding of skip_for_load and\nexcessive load being moved.\n\nThe attached patch addresses these problems by deleting all reference to\nbest_prio and best_prio_seen and making this_best_prio a reference\nparameter to the various functions involved.\n\nload_balance_fair() has also been modified so that this_best_prio is\nonly reset (in the loop) if CONFIG_FAIR_GROUP_SCHED is set. This should\npreserve the effect of helping spread groups\u0027 higher priority tasks\naround the available CPUs while improving system performance when\nCONFIG_FAIR_GROUP_SCHED isn\u0027t set.\n\nSigned-off-by: Peter Williams \u003cpwil3058@bigpond.net.au\u003e\nSigned-off-by: Ingo Molnar \u003cmingo@elte.hu\u003e\n" }, { "commit": "4301065920b0cbde3986519582347e883b166f3e", "tree": "415b8e3a2796709673015e100a3b5b28e556104a", "parents": [ "f1a438d813d416fa9f4be4e6dbd10b54c5938d89" ], "author": { "name": "Peter Williams", "email": "pwil3058@bigpond.net.au", "time": "Thu Aug 09 11:16:46 2007 +0200" }, "committer": { "name": "Ingo Molnar", "email": "mingo@elte.hu", "time": "Thu Aug 09 11:16:46 2007 +0200" }, "message": "sched: simplify move_tasks()\n\nThe move_tasks() function is currently multiplexed with two distinct\ncapabilities:\n\n1. attempt to move a specified amount of weighted load from one run\nqueue to another; and\n2. attempt to move a specified number of tasks from one run queue to\nanother.\n\nThe first of these capabilities is used in two places, load_balance()\nand load_balance_idle(), and in both of these cases the return value of\nmove_tasks() is used purely to decide if tasks/load were moved and no\nnotice of the actual number of tasks moved is taken.\n\nThe second capability is used in exactly one place,\nactive_load_balance(), to attempt to move exactly one task and, as\nbefore, the return value is only used as an indicator of success or failure.\n\nThis multiplexing of sched_task() was introduced, by me, as part of the\nsmpnice patches and was motivated by the fact that the alternative, one\nfunction to move specified load and one to move a single task, would\nhave led to two functions of roughly the same complexity as the old\nmove_tasks() (or the new balance_tasks()). However, the new modular\ndesign of the new CFS scheduler allows a simpler solution to be adopted\nand this patch addresses that solution by:\n\n1. adding a new function, move_one_task(), to be used by\nactive_load_balance(); and\n2. making move_tasks() a single purpose function that tries to move a\nspecified weighted load and returns 1 for success and 0 for failure.\n\nOne of the consequences of these changes is that neither move_one_task()\nor the new move_tasks() care how many tasks sched_class.load_balance()\nmoves and this enables its interface to be simplified by returning the\namount of load moved as its result and removing the load_moved pointer\nfrom the argument list. This helps simplify the new move_tasks() and\nslightly reduces the amount of work done in each of\nsched_class.load_balance()\u0027s implementations.\n\nFurther simplification, e.g. changes to balance_tasks(), are possible\nbut (slightly) complicated by the special needs of load_balance_fair()\nso I\u0027ve left them to a later patch (if this one gets accepted).\n\nNB Since move_tasks() gets called with two run queue locks held even\nsmall reductions in overhead are worthwhile.\n\n[ mingo@elte.hu ]\n\nthis change also reduces code size nicely:\n\n text data bss dec hex filename\n 39216 3618 24 42858 a76a sched.o.before\n 39173 3618 24 42815 a73f sched.o.after\n\nSigned-off-by: Peter Williams \u003cpwil3058@bigpond.net.au\u003e\nSigned-off-by: Ingo Molnar \u003cmingo@elte.hu\u003e\n" }, { "commit": "fa72e9e484c16f0c9aee23981917d8c8c03f0482", "tree": "2bcf45d83b9738af2b3455df0e3ada975a100306", "parents": [ "bb44e5d1c6b3b748e0facf8f516b3162009feb27" ], "author": { "name": "Ingo Molnar", "email": "mingo@elte.hu", "time": "Mon Jul 09 18:51:58 2007 +0200" }, "committer": { "name": "Ingo Molnar", "email": "mingo@elte.hu", "time": "Mon Jul 09 18:51:58 2007 +0200" }, "message": "sched: cfs core, kernel/sched_idletask.c\n\nadd kernel/sched_idletask.c - which implements the idle thread\nscheduling class. This further simplifies sched.c (under CFS),\nfor example a number of \u0027if (p \u003d\u003d rq-\u003eidle)\u0027 type of special-cases\ncan be removed from sched.c, and schedule() gets simpler too.\n\nSigned-off-by: Ingo Molnar \u003cmingo@elte.hu\u003e\n" } ] }