i2p/haiku-beta6
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

kernel: Fix style issues

Browse Source
This commit is contained in:
Pawel Dziepak
2013-10-08 20:15:21 +02:00
parent 94f4574d78
commit 346e789a21
1 changed files with 8 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/system/kernel/scheduler/scheduler_simple.cpp
+8 -8
View File
@@ -92,7 +92,7 @@ dump_queue(RunQueue<Thread, THREAD_MAX_SET_PRIORITY>::ConstIterator& iterator)
else { else {
kprintf("thread id priority penalty name\n"); kprintf("thread id priority penalty name\n");
while (iterator.HasNext()) { while (iterator.HasNext()) {
Thread *thread = iterator.Next(); Thread* thread = iterator.Next();
scheduler_thread_data* schedulerThreadData scheduler_thread_data* schedulerThreadData
= reinterpret_cast<scheduler_thread_data*>( = reinterpret_cast<scheduler_thread_data*>(
thread->scheduler_data); thread->scheduler_data);
@@ -105,7 +105,7 @@ dump_queue(RunQueue<Thread, THREAD_MAX_SET_PRIORITY>::ConstIterator& iterator)
static int static int
dump_run_queue(int argc, char **argv) dump_run_queue(int argc, char** argv)
{ {
RunQueue<Thread, THREAD_MAX_SET_PRIORITY>::ConstIterator iterator; RunQueue<Thread, THREAD_MAX_SET_PRIORITY>::ConstIterator iterator;
kprintf("Current run queue:\n"); kprintf("Current run queue:\n");
@@ -129,7 +129,7 @@ simple_yield(Thread* thread)
static inline int32 static inline int32
simple_get_effective_priority(Thread *thread) simple_get_effective_priority(Thread* thread)
{ {
if (thread->priority == B_IDLE_PRIORITY) if (thread->priority == B_IDLE_PRIORITY)
return thread->priority; return thread->priority;
@@ -157,7 +157,7 @@ simple_get_effective_priority(Thread *thread)
static inline void static inline void
simple_increase_penalty(Thread *thread) simple_increase_penalty(Thread* thread)
{ {
if (thread->priority <= B_LOWEST_ACTIVE_PRIORITY) if (thread->priority <= B_LOWEST_ACTIVE_PRIORITY)
return; return;
@@ -181,7 +181,7 @@ simple_increase_penalty(Thread *thread)
static inline void static inline void
simple_cancel_penalty(Thread *thread) simple_cancel_penalty(Thread* thread)
{ {
scheduler_thread_data* schedulerThreadData scheduler_thread_data* schedulerThreadData
= reinterpret_cast<scheduler_thread_data*>(thread->scheduler_data); = reinterpret_cast<scheduler_thread_data*>(thread->scheduler_data);
@@ -200,7 +200,7 @@ simple_cancel_penalty(Thread *thread)
Note: thread lock must be held when entering this function Note: thread lock must be held when entering this function
*/ */
static void static void
simple_enqueue_in_run_queue(Thread *thread) simple_enqueue_in_run_queue(Thread* thread)
{ {
thread->state = thread->next_state = B_THREAD_READY; thread->state = thread->next_state = B_THREAD_READY;
@@ -243,7 +243,7 @@ simple_enqueue_in_run_queue(Thread *thread)
Note: thread lock must be held when entering this function Note: thread lock must be held when entering this function
*/ */
static void static void
simple_set_thread_priority(Thread *thread, int32 priority) simple_set_thread_priority(Thread* thread, int32 priority)
{ {
if (priority == thread->priority) if (priority == thread->priority)
return; return;
@@ -290,7 +290,7 @@ simple_estimate_max_scheduling_latency(Thread* thread)
static int32 static int32
reschedule_event(timer *unused) reschedule_event(timer* /* unused */)
{ {
// This function is called as a result of the timer event set by the // This function is called as a result of the timer event set by the
// scheduler. Make sure the reschedule() is invoked. // scheduler. Make sure the reschedule() is invoked.