1 files changed, 10 insertions, 10 deletions

diff --git a/engines/agi/list.h b/engines/agi/list.h
index 999c591ce0..440536362a 100644
--- a/engines/agi/list.h
+++ b/engines/agi/list.h
@@ -4,8 +4,8 @@
  * List management macros from the Linux kernel
  */
 
-#ifndef _LINUX_LIST_H
-#define _LINUX_LIST_H
+#ifndef AGI_IST_H
+#define AGI_LIST_H
 
 #include "agi/agi.h"
 
@@ -40,7 +40,7 @@ struct list_head {
  * This is only for internal list manipulation where we know
  * the prev/next entries already!
  */
-static INLINE void __list_add(struct list_head *tnew, struct list_head *prev, struct list_head *next) {
+static FORCEINLINE void __list_add(struct list_head *tnew, struct list_head *prev, struct list_head *next) {
 	next->prev = tnew;
 	tnew->next = next;
 	tnew->prev = prev;
@@ -55,7 +55,7 @@ static INLINE void __list_add(struct list_head *tnew, struct list_head *prev, st
  * @param new new entry to be added
  * @param head list head to add it after
  */
-static INLINE void list_add(struct list_head *tnew, struct list_head *head) {
+static FORCEINLINE void list_add(struct list_head *tnew, struct list_head *head) {
 	__list_add(tnew, head, head->next);
 }
 
@@ -67,7 +67,7 @@ static INLINE void list_add(struct list_head *tnew, struct list_head *head) {
  * @new: new entry to be added
  * @head: list head to add it before
  */
-static INLINE void list_add_tail(struct list_head *tnew, struct list_head *head) {
+static FORCEINLINE void list_add_tail(struct list_head *tnew, struct list_head *head) {
 	__list_add(tnew, head->prev, head);
 }
 
@@ -77,7 +77,7 @@ static INLINE void list_add_tail(struct list_head *tnew, struct list_head *head)
  * This is only for internal list manipulation where we know
  * the prev/next entries already!
  */
-static INLINE void __list_del(struct list_head *prev, struct list_head *next) {
+static FORCEINLINE void __list_del(struct list_head *prev, struct list_head *next) {
 	next->prev = prev;
 	prev->next = next;
 }
@@ -86,7 +86,7 @@ static INLINE void __list_del(struct list_head *prev, struct list_head *next) {
  * deletes entry from list.
  * @param entry the element to delete from the list.
  */
-static INLINE void list_del(struct list_head *entry) {
+static FORCEINLINE void list_del(struct list_head *entry) {
 	__list_del(entry->prev, entry->next);
 }
 
@@ -94,7 +94,7 @@ static INLINE void list_del(struct list_head *entry) {
  * tests whether a list is empty
  * @param head the list to test.
  */
-static INLINE int list_empty(struct list_head *head) {
+static FORCEINLINE int list_empty(struct list_head *head) {
 	return head->next == head;
 }
 
@@ -103,7 +103,7 @@ static INLINE int list_empty(struct list_head *head) {
  * @param list the new list to add.
  * @param head the place to add it in the first list.
  */
-static INLINE void list_splice(struct list_head *list, struct list_head *head) {
+static FORCEINLINE void list_splice(struct list_head *list, struct list_head *head) {
 	struct list_head *first = list->next;
 
 	if (first != list) {
@@ -137,4 +137,4 @@ static INLINE void list_splice(struct list_head *list, struct list_head *head) {
 
 }                             // End of namespace Agi
 
-#endif
+#endif				/* AGI_LIST_H */