Rename microkernel struct field 'Tail' to 'tail'.

Rename field 'Tail' of the struct:
- 'k_tqhd' in the file kernel/microkernel/include/micro_private_types.h
- 'List' in the file include/misc/lists.h

Change-Id: If857235ab6ec83fb058e0e2857a2828b8bfd308a
Signed-off-by: Yonattan Louise <yonattan.a.louise.mendoza@intel.com>
This commit is contained in:
Yonattan Louise 2015-08-24 15:49:00 -05:00 committed by Anas Nashif
commit c2b3ab57e6
4 changed files with 13 additions and 13 deletions

View file

@ -49,7 +49,7 @@ struct Elem {
struct List { struct List {
struct list_elem *head; struct list_elem *head;
struct list_elem *Tail; struct list_elem *tail;
struct list_elem *TailPrev; struct list_elem *TailPrev;
}; };

View file

@ -45,9 +45,9 @@ Example code from list insertion etc
INLINE void InitList(struct list_head *list) INLINE void InitList(struct list_head *list)
{ {
list->head = (struct list_elem *)&list->Tail; list->head = (struct list_elem *)&list->tail;
list->TailPrev = (struct list_elem *)&list->head; list->TailPrev = (struct list_elem *)&list->head;
list->Tail = NULL; list->tail = NULL;
} }
INLINE unsigned int TestListEmpty(struct list_head *list) INLINE unsigned int TestListEmpty(struct list_head *list)
@ -90,7 +90,7 @@ INLINE struct list_elem *RemoveTail(struct list_head *list)
return NULL; /* empty list */ return NULL; /* empty list */
} }
list->TailPrev = tmpElem; list->TailPrev = tmpElem;
tmpElem->next = (struct list_elem *)&list->Tail; tmpElem->next = (struct list_elem *)&list->tail;
return ret_Elem; return ret_Elem;
} }
@ -111,7 +111,7 @@ INLINE void AddTail(struct list_head *list, struct list_elem *elem)
struct list_elem *tmpElem; struct list_elem *tmpElem;
struct list_elem *tailElem; struct list_elem *tailElem;
tmpElem = (struct list_elem *)&list->Tail; tmpElem = (struct list_elem *)&list->tail;
tailElem = tmpElem->prev; tailElem = tmpElem->prev;
tailElem->next = elem; tailElem->next = elem;
tmpElem->prev = elem; tmpElem->prev = elem;
@ -141,7 +141,7 @@ INLINE void InsertPrio(struct list_head *list, struct list_elem *newelem)
struct list_elem *tmpElem; struct list_elem *tmpElem;
tmpElem = (struct list_elem *)&list->head; tmpElem = (struct list_elem *)&list->head;
while ((tmpElem->next != (struct list_elem *)&list->Tail) && /* end of list */ while ((tmpElem->next != (struct list_elem *)&list->tail) && /* end of list */
(tmpElem->priority <= newelem->priority)) { (tmpElem->priority <= newelem->priority)) {
tmpElem = tmpElem->next; tmpElem = tmpElem->next;
} }

View file

@ -142,7 +142,7 @@ struct k_timer {
struct k_tqhd { struct k_tqhd {
struct k_task *head; struct k_task *head;
struct k_task *Tail; struct k_task *tail;
}; };
/* Monitor record */ /* Monitor record */

View file

@ -89,8 +89,8 @@ void _k_state_bit_reset(struct k_task *X, /* ptr to task */
struct k_tqhd *H = _k_task_priority_list + X->priority; struct k_tqhd *H = _k_task_priority_list + X->priority;
X->next = NULL; X->next = NULL;
H->Tail->next = X; H->tail->next = X;
H->Tail = X; H->tail = X;
_k_task_priority_bitmap[X->priority >> 5] |= (1 << (X->priority & 0x1F)); _k_task_priority_bitmap[X->priority >> 5] |= (1 << (X->priority & 0x1F));
} }
@ -167,8 +167,8 @@ void _k_state_bit_set(
cur_task->next = task_ptr->next; cur_task->next = task_ptr->next;
if (task_queue->Tail == task_ptr) { if (task_queue->tail == task_ptr) {
task_queue->Tail = cur_task; task_queue->tail = cur_task;
} }
/* /*
@ -552,8 +552,8 @@ void _k_task_yield(struct k_args *A)
ARG_UNUSED(A); ARG_UNUSED(A);
if (X && H->head == _k_current_task) { if (X && H->head == _k_current_task) {
_k_current_task->next = NULL; _k_current_task->next = NULL;
H->Tail->next = _k_current_task; H->tail->next = _k_current_task;
H->Tail = _k_current_task; H->tail = _k_current_task;
H->head = X; H->head = X;
} }
} }