diff options
author | Ralf Corsepius <ralf.corsepius@rtems.org> | 2011-05-24 02:44:58 +0000 |
---|---|---|
committer | Ralf Corsepius <ralf.corsepius@rtems.org> | 2011-05-24 02:44:58 +0000 |
commit | dacdda304b8a7a2a10bc03ae36b1d75b728ba149 (patch) | |
tree | b709b10d06bb4303fcf2f08511ca096ea2d5a0aa /cpukit/score/include | |
parent | 2011-05-23 Jennifer Averett <Jennifer.Averett@OARcorp.com> (diff) | |
download | rtems-dacdda304b8a7a2a10bc03ae36b1d75b728ba149.tar.bz2 |
Remove white-spaces.
Diffstat (limited to 'cpukit/score/include')
-rw-r--r-- | cpukit/score/include/rtems/score/percpu.h | 12 | ||||
-rw-r--r-- | cpukit/score/include/rtems/score/prioritybitmap.h | 8 | ||||
-rw-r--r-- | cpukit/score/include/rtems/score/rbtree.h | 28 | ||||
-rw-r--r-- | cpukit/score/include/rtems/score/schedulerpriority.h | 18 | ||||
-rw-r--r-- | cpukit/score/include/rtems/score/schedulersimple.h | 38 | ||||
-rw-r--r-- | cpukit/score/include/rtems/score/schedulersimplesmp.h | 12 | ||||
-rw-r--r-- | cpukit/score/include/rtems/score/smp.h | 2 | ||||
-rw-r--r-- | cpukit/score/include/rtems/score/smplock.h | 6 | ||||
-rw-r--r-- | cpukit/score/include/rtems/score/thread.h | 2 |
9 files changed, 63 insertions, 63 deletions
diff --git a/cpukit/score/include/rtems/score/percpu.h b/cpukit/score/include/rtems/score/percpu.h index 1ba5b3d6d2..2631235f06 100644 --- a/cpukit/score/include/rtems/score/percpu.h +++ b/cpukit/score/include/rtems/score/percpu.h @@ -13,7 +13,7 @@ * found in the file LICENSE in this distribution or at * http://www.rtems.com/license/LICENSE. * - * $Id$ + * $Id$ */ #ifndef _RTEMS_PERCPU_H @@ -64,7 +64,7 @@ typedef struct Thread_Control_struct Thread_Control; #endif typedef enum { - + /** * This defines the constant used to indicate that the cpu code is in * its initial powered up start. @@ -92,17 +92,17 @@ typedef enum { typedef struct { #if defined(RTEMS_SMP) /** This element is used to lock this structure */ - SMP_lock_spinlock_simple_Control lock; + SMP_lock_spinlock_simple_Control lock; /** This indicates that the CPU is online. */ - uint32_t state; + uint32_t state; /** * This is the request for the interrupt. - * + * * @note This may become a chain protected by atomic instructions. */ - uint32_t message; + uint32_t message; #endif #if (CPU_ALLOCATE_INTERRUPT_STACK == TRUE) || \ diff --git a/cpukit/score/include/rtems/score/prioritybitmap.h b/cpukit/score/include/rtems/score/prioritybitmap.h index bba5b428b6..e02992a1fe 100644 --- a/cpukit/score/include/rtems/score/prioritybitmap.h +++ b/cpukit/score/include/rtems/score/prioritybitmap.h @@ -20,8 +20,8 @@ #define _RTEMS_SCORE_PRIORITYBITMAP_H /** - * @addtogroup ScorePriority - * + * @addtogroup ScorePriority + * */ /**@{*/ @@ -38,8 +38,8 @@ extern "C" { #include <rtems/score/priority.h> -/* - * The Priority_bit_map_Control variables are instantiated only +/* + * The Priority_bit_map_Control variables are instantiated only * if using the bit map handler. */ diff --git a/cpukit/score/include/rtems/score/rbtree.h b/cpukit/score/include/rtems/score/rbtree.h index 8360c99497..623d787c48 100644 --- a/cpukit/score/include/rtems/score/rbtree.h +++ b/cpukit/score/include/rtems/score/rbtree.h @@ -83,12 +83,12 @@ extern "C" { /** * @brief macro to return the structure containing the @a node. * - * This macro returns a pointer of type @a container_type that points - * to the structure containing @a node, where @a node_field_name is the + * This macro returns a pointer of type @a container_type that points + * to the structure containing @a node, where @a node_field_name is the * field name of the RBTree_Node structure in @a container_type. * */ - + #define _RBTree_Container_of(node,container_type, node_field_name) \ ((container_type*) \ ((size_t)node - ((size_t)(&((container_type *)0)->node_field_name)))) @@ -107,12 +107,12 @@ extern "C" { * * @note This implementation does not require special checks for * manipulating the root element of the RBT. - * To accomplish this the @a RBTree_Control structure can be overlaid - * with a @ref RBTree_Node structure to act as a "dummy root", + * To accomplish this the @a RBTree_Control structure can be overlaid + * with a @ref RBTree_Node structure to act as a "dummy root", * which has a NULL parent and its left child is the root. */ - /* the RBTree_Control is actually part of the RBTree structure as an + /* the RBTree_Control is actually part of the RBTree structure as an * RBTree_Node. The mapping of fields from RBTree_Control to RBTree_Node are: * permanent_null == parent * root == left @@ -201,7 +201,7 @@ extern "C" { * @brief Check the min or max node on a rbtree * * This function returns a pointer to the min or max node of @a the_rbtree. - * If @a the_rbtree is empty, then NULL is returned. @a dir specifies + * If @a the_rbtree is empty, then NULL is returned. @a dir specifies * whether to return the min (0) or max (1). * * @return This method returns a pointer to a node. @@ -216,18 +216,18 @@ extern "C" { /** @brief Find the node with given value in the tree * - * This function returns a pointer to the node with value equal to @a value - * if it exists in the Red-Black Tree @a the_rbtree, and NULL if not. + * This function returns a pointer to the node with value equal to @a value + * if it exists in the Red-Black Tree @a the_rbtree, and NULL if not. */ RBTree_Node *_RBTree_Find( - RBTree_Control *the_rbtree, + RBTree_Control *the_rbtree, unsigned int value ); - /** @brief Find the control structure of the tree containing the given node + /** @brief Find the control structure of the tree containing the given node * - * This function returns a pointer to the control structure of the tree - * containing @a the_node, if it exists, and NULL if not. + * This function returns a pointer to the control structure of the tree + * containing @a the_node, if it exists, and NULL if not. */ RBTree_Control *_RBTree_Find_header( RBTree_Node *the_node @@ -239,7 +239,7 @@ extern "C" { * * @retval 0 Successfully inserted. * @retval -1 NULL @a the_node. - * @retval RBTree_Node* if one with equal value to @a the_node->value exists + * @retval RBTree_Node* if one with equal value to @a the_node->value exists * in @a the_rbtree. * * @note It does NOT disable interrupts to ensure the atomicity diff --git a/cpukit/score/include/rtems/score/schedulerpriority.h b/cpukit/score/include/rtems/score/schedulerpriority.h index 58ccc795e1..2cd2353204 100644 --- a/cpukit/score/include/rtems/score/schedulerpriority.h +++ b/cpukit/score/include/rtems/score/schedulerpriority.h @@ -68,19 +68,19 @@ typedef struct { void _Scheduler_priority_Initialize(void); /** - * This routine removes @a the_thread from the scheduling decision, + * This routine removes @a the_thread from the scheduling decision, * that is, removes it from the ready queue. It performs * any necessary scheduling operations including the selection of * a new heir thread. * * @param[in] the_thread is the thread to be blocked */ -void _Scheduler_priority_Block( - Thread_Control *the_thread +void _Scheduler_priority_Block( + Thread_Control *the_thread ); /** - * This kernel routine sets the heir thread to be the next ready thread + * This kernel routine sets the heir thread to be the next ready thread * by invoking the_scheduler->ready_queue->operations->first(). */ void _Scheduler_priority_Schedule(void); @@ -106,7 +106,7 @@ void _Scheduler_priority_Free( ); /** - * This routine updates @a the_thread->scheduler based on @a the_scheduler + * This routine updates @a the_thread->scheduler based on @a the_scheduler * structures and thread state. * * @param[in] the_thread will have its scheduler specific information @@ -117,14 +117,14 @@ void _Scheduler_priority_Update( ); /** - * This routine adds @a the_thread to the scheduling decision, - * that is, adds it to the ready queue and + * This routine adds @a the_thread to the scheduling decision, + * that is, adds it to the ready queue and * updates any appropriate scheduling variables, for example the heir thread. * * @param[in] the_thread will be unblocked */ void _Scheduler_priority_Unblock( - Thread_Control *the_thread + Thread_Control *the_thread ); /** @@ -150,7 +150,7 @@ void _Scheduler_priority_Enqueue( ); /** - * This routine puts @a the_thread to the head of the ready queue. + * This routine puts @a the_thread to the head of the ready queue. * For priority-based ready queues, the thread will be the first thread * at its priority level. * diff --git a/cpukit/score/include/rtems/score/schedulersimple.h b/cpukit/score/include/rtems/score/schedulersimple.h index 0e2187f10d..d81939e49c 100644 --- a/cpukit/score/include/rtems/score/schedulersimple.h +++ b/cpukit/score/include/rtems/score/schedulersimple.h @@ -53,7 +53,7 @@ extern "C" { void _Scheduler_simple_Initialize( void ); /** - * This routine sets the heir thread to be the next ready thread + * This routine sets the heir thread to be the next ready thread * on the ready queue by getting the first node in the scheduler * information. */ @@ -62,41 +62,41 @@ void _Scheduler_simple_Schedule( void ); /** * This routine is invoked when a thread wishes to voluntarily * transfer control of the processor to another thread in the queue. - * It will remove the running THREAD from the scheduler.informaiton - * (where the ready queue is stored) and place it immediately at the - * between the last entry of its priority and the next priority thread. - * Reset timeslice and yield the processor functions both use this routine, - * therefore if reset is true and this is the only thread on the queue then + * It will remove the running THREAD from the scheduler.informaiton + * (where the ready queue is stored) and place it immediately at the + * between the last entry of its priority and the next priority thread. + * Reset timeslice and yield the processor functions both use this routine, + * therefore if reset is true and this is the only thread on the queue then * the timeslice counter is reset. The heir THREAD will be updated if the * running is also the currently the heir. */ void _Scheduler_simple_Yield( void ); /** - * This routine removes @a the_thread from the scheduling decision, + * This routine removes @a the_thread from the scheduling decision, * that is, removes it from the ready queue. It performs * any necessary scheduling operations including the selection of * a new heir thread. * * @param[in] the_thread is the thread that is to be blocked */ -void _Scheduler_simple_Block( - Thread_Control *the_thread +void _Scheduler_simple_Block( + Thread_Control *the_thread ); /** - * This routine adds @a the_thread to the scheduling decision, - * that is, adds it to the ready queue and + * This routine adds @a the_thread to the scheduling decision, + * that is, adds it to the ready queue and * updates any appropriate scheduling variables, for example the heir thread. * * @param[in] the_thread is the thread that is to be unblocked */ void _Scheduler_simple_Unblock( - Thread_Control *the_thread + Thread_Control *the_thread ); /** - * This routine removes a specific thread from the specified + * This routine removes a specific thread from the specified * simple-based ready queue. * * @param[in] the_thread is the thread to be blocked @@ -115,7 +115,7 @@ void _Scheduler_simple_Enqueue( ); /** - * This routine puts @a the_thread to the head of the ready queue. + * This routine puts @a the_thread to the head of the ready queue. * The thread will be the first thread at its priority level. * * @param[in] the_thread is the thread to be blocked @@ -135,7 +135,7 @@ void _Scheduler_simple_Enqueue_first( * @return this routine returns -1 since this is just an empty placeholder * and the return value may be defined differently by each scheduler. */ -void *_Scheduler_simple_Allocate( +void *_Scheduler_simple_Allocate( Thread_Control *the_thread ); @@ -146,7 +146,7 @@ void *_Scheduler_simple_Allocate( * * @param[in] the_thread is the thread to be blocked */ -void _Scheduler_simple_Update( +void _Scheduler_simple_Update( Thread_Control *the_thread ); @@ -157,7 +157,7 @@ void _Scheduler_simple_Update( * * @param[in] the_thread is the thread to be blocked */ -void _Scheduler_simple_Free( +void _Scheduler_simple_Free( Thread_Control *the_thread ); @@ -166,7 +166,7 @@ void _Scheduler_simple_Free( * * This routine puts @a the_thread on the ready queue * at the end of its priority group. - * + * * @param[in] the_thread - pointer to a thread control block */ void _Scheduler_simple_Ready_queue_enqueue( @@ -178,7 +178,7 @@ void _Scheduler_simple_Ready_queue_enqueue( * * This routine puts @a the_thread on to the ready queue * at the beginning of its priority group. - * + * * @param[in] the_thread - pointer to a thread control block */ void _Scheduler_simple_Ready_queue_enqueue_first( diff --git a/cpukit/score/include/rtems/score/schedulersimplesmp.h b/cpukit/score/include/rtems/score/schedulersimplesmp.h index 0f57fcec9e..462eaf00e6 100644 --- a/cpukit/score/include/rtems/score/schedulersimplesmp.h +++ b/cpukit/score/include/rtems/score/schedulersimplesmp.h @@ -64,35 +64,35 @@ extern "C" { * * This routine allocates ready threads to individual cores in an SMP * system. If the allocation results in a new heir which requires - * a dispatch, then the dispatch needed flag for that core is set. + * a dispatch, then the dispatch needed flag for that core is set. */ void _Scheduler_simple_smp_Schedule( void ); /** * @brief Scheduler Simple SMP Block Method * - * This routine removes @a the_thread from the scheduling decision, + * This routine removes @a the_thread from the scheduling decision, * that is, removes it from the ready queue. It performs * any necessary scheduling operations including the selection of * a new heir thread. * * @param[in] the_thread is the thread that is to be blocked */ -void _Scheduler_simple_smp_Block( - Thread_Control *the_thread +void _Scheduler_simple_smp_Block( + Thread_Control *the_thread ); /** * @brief Scheduler Simple SMP Unblock Method * - * This routine adds @a the_thread to the scheduling decision, + * This routine adds @a the_thread to the scheduling decision, * that is, adds it to the ready queue and updates any appropriate * scheduling variables, for example the heir thread. * * @param[in] the_thread is the thread that is to be unblocked */ void _Scheduler_simple_smp_Unblock( - Thread_Control *the_thread + Thread_Control *the_thread ); #ifdef __cplusplus diff --git a/cpukit/score/include/rtems/score/smp.h b/cpukit/score/include/rtems/score/smp.h index 54e4300ec4..55545b66ac 100644 --- a/cpukit/score/include/rtems/score/smp.h +++ b/cpukit/score/include/rtems/score/smp.h @@ -77,7 +77,7 @@ SCORE_EXTERN uint32_t _SMP_Processor_count; * * This method is invoked by RTEMS when it needs to make a request * of the other CPUs. It should be implemented using some type of - * interprocessor interrupt. CPUs not including the originating + * interprocessor interrupt. CPUs not including the originating * CPU should receive the message. * * @param [in] message is message to send diff --git a/cpukit/score/include/rtems/score/smplock.h b/cpukit/score/include/rtems/score/smplock.h index 279df6ecd8..53e1e31a66 100644 --- a/cpukit/score/include/rtems/score/smplock.h +++ b/cpukit/score/include/rtems/score/smplock.h @@ -35,7 +35,7 @@ extern "C" { /** * This type is used to lock elements for atomic access. * This spinlock is a simple non-nesting spinlock, and - * may be used for short non-nesting accesses. + * may be used for short non-nesting accesses. */ typedef uint32_t SMP_lock_spinlock_simple_Control; @@ -106,9 +106,9 @@ void _SMP_lock_spinlock_nested_Initialize( * This method is used to obtain the lock at @a lock. ISR's are * disabled when this routine returns and it is the callers responsibility * to either: - * 1) Do something very short and then call + * 1) Do something very short and then call * _SMP_lock_spinlock_nested_Release or - * 2) Do something very sort, call isr enable, then when ready + * 2) Do something very sort, call isr enable, then when ready * call isr_disable and _SMP_lock_spinlock_nested_Release * * @param [in] lock is the address of the lock to obtain. diff --git a/cpukit/score/include/rtems/score/thread.h b/cpukit/score/include/rtems/score/thread.h index c3462024d9..8e469f4058 100644 --- a/cpukit/score/include/rtems/score/thread.h +++ b/cpukit/score/include/rtems/score/thread.h @@ -54,7 +54,7 @@ #if defined(RTEMS_SMP) || \ (CPU_INLINE_ENABLE_DISPATCH == FALSE) || \ - (__RTEMS_DO_NOT_INLINE_THREAD_ENABLE_DISPATCH__ == 1) + (__RTEMS_DO_NOT_INLINE_THREAD_ENABLE_DISPATCH__ == 1) #define __THREAD_DO_NOT_INLINE_ENABLE_DISPATCH__ #endif |