Updated ILibLinkedList verification checks

krayon007 · krayon007 · commit cd6353ac289e · 2020-12-10T13:54:08.000-08:00
diff --git a/microstack/ILibParsers.c b/microstack/ILibParsers.c
@@ -305,12 +305,8 @@ typedef struct ILibLinkedListNode_Root
 	void* Tag;
 	struct ILibLinkedListNode *Head;
 	struct ILibLinkedListNode *Tail;
-	void *ExtraMemory;
 }ILibLinkedListNode_Root;
 
-const int ILibLinkedListNode_SIZE = sizeof(ILibLinkedListNode);
-const int ILibLinkedListNodeRoot_Size = sizeof(ILibLinkedListNode_Root);
-
 struct ILibReaderWriterLock_Data
 {
 	ILibChain_PreSelect Pre;
@@ -7489,7 +7485,6 @@ void ILibLifeTime_Check(void *LifeTimeMonitorObject, fd_set *readset, fd_set *wr
 	int removed;
 	void *EventQueue;
 	long long CurrentTick;
-	struct ILibLinkedListNode_Root root;
 	struct LifeTimeMonitorData *EVT, *Temp = NULL;
 	struct ILibLifeTime *LifeTimeMonitor = (struct ILibLifeTime*)LifeTimeMonitorObject;
 
@@ -7514,9 +7509,7 @@ void ILibLifeTime_Check(void *LifeTimeMonitorObject, fd_set *readset, fd_set *wr
 	LifeTimeMonitor->NextTriggerTick = -1;
 
 	// This is an optimization. We are going to create the root of this linked list on the stack instead of the heap.
-	// This also fixes a crash with malloc returns NULL if this is created in the heap - No idea why this occurs.
-	memset(&root, 0, sizeof(struct ILibLinkedListNode_Root));
-	EventQueue = (void*)&root;
+	EventQueue = ILibMemory_AllocateA(sizeof(ILibLinkedListNode_Root));
 
 	ILibLinkedList_Lock(LifeTimeMonitor->Reserved);
 	ILibLinkedList_Lock(LifeTimeMonitor->ObjectList);
@@ -7827,10 +7820,8 @@ void* ILibLinkedList_GetNode_Search(void* LinkedList, ILibLinkedList_Comparer co
 void* ILibLinkedList_CreateEx(int userMemorySize)
 {
 	struct ILibLinkedListNode_Root *root;
-	void *mem;
 
-	ILibMemory_Allocate(sizeof(ILibLinkedListNode_Root), userMemorySize, (void**)&root, &mem);
-	root->ExtraMemory = mem;
+	root = ILibMemory_SmartAllocateEx(sizeof(ILibLinkedListNode_Root), userMemorySize);
 	ILibSpinLock_Init(&(root->LOCK));
 	return root;
 }
@@ -7861,7 +7852,7 @@ void* ILibLinkedList_GetTag(ILibLinkedList list)
 
 void* ILibLinkedList_AllocateNodeEx(void *LinkedList, size_t extraSize)
 {
-	void* newNode = ILibMemory_SmartAllocateEx(sizeof(ILibLinkedListNode), extraSize + ILibMemory_GetExtraMemorySize(((ILibLinkedListNode_Root*)LinkedList)->ExtraMemory));
+	void* newNode = ILibMemory_SmartAllocateEx(sizeof(ILibLinkedListNode), extraSize + ILibMemory_ExtraSize((ILibLinkedListNode_Root*)LinkedList));
 	return(newNode);
 }
 #define ILibLinkedList_AllocateNode(linkedList) ILibLinkedList_AllocateNodeEx(linkedList, 0)
@@ -7895,7 +7886,7 @@ void* ILibLinkedList_ShallowCopy(void *LinkedList)
 */
 void* ILibLinkedList_GetNode_Head(void *LinkedList)
 {
-	return(LinkedList != NULL ? ((struct ILibLinkedListNode_Root*)LinkedList)->Head : NULL);
+	return(ILibMemory_CanaryOK(LinkedList) ? ((struct ILibLinkedListNode_Root*)LinkedList)->Head : NULL);
 }
 
 /*! \fn ILibLinkedList_GetNode_Tail(void *LinkedList)
@@ -7905,7 +7896,7 @@ void* ILibLinkedList_GetNode_Head(void *LinkedList)
 */
 void* ILibLinkedList_GetNode_Tail(void *LinkedList)
 {
-	return(((struct ILibLinkedListNode_Root*)LinkedList)->Tail);
+	return(ILibMemory_CanaryOK(LinkedList) ? ((struct ILibLinkedListNode_Root*)LinkedList)->Tail : NULL);
 }
 
 /*! \fn ILibLinkedList_GetNextNode(void *LinkedList_Node)
@@ -7915,7 +7906,7 @@ void* ILibLinkedList_GetNode_Tail(void *LinkedList)
 */
 void* ILibLinkedList_GetNextNode(void *LinkedList_Node)
 {
-	return(((struct ILibLinkedListNode*)LinkedList_Node)->Next);
+	return(ILibMemory_CanaryOK(LinkedList_Node) ? ((struct ILibLinkedListNode*)LinkedList_Node)->Next : NULL);
 }
 
 /*! \fn ILibLinkedList_GetPreviousNode(void *LinkedList_Node)
@@ -7925,7 +7916,7 @@ void* ILibLinkedList_GetNextNode(void *LinkedList_Node)
 */
 void* ILibLinkedList_GetPreviousNode(void *LinkedList_Node)
 {
-	return(((struct ILibLinkedListNode*)LinkedList_Node)->Previous);
+	return(ILibMemory_CanaryOK(LinkedList_Node) ? ((struct ILibLinkedListNode*)LinkedList_Node)->Previous : NULL);
 }
 
 /*! \fn ILibLinkedList_GetDataFromNode(void *LinkedList_Node)
@@ -7935,7 +7926,7 @@ void* ILibLinkedList_GetPreviousNode(void *LinkedList_Node)
 */
 void *ILibLinkedList_GetDataFromNode(void *LinkedList_Node)
 {
-	return(LinkedList_Node != NULL ? (((struct ILibLinkedListNode*)LinkedList_Node)->Data) : NULL);
+	return(ILibMemory_CanaryOK(LinkedList_Node) ? (((struct ILibLinkedListNode*)LinkedList_Node)->Data) : NULL);
 }
 
 /*! \fn ILibLinkedList_InsertBefore(void *LinkedList_Node, void *data)
@@ -7946,6 +7937,7 @@ void *ILibLinkedList_GetDataFromNode(void *LinkedList_Node)
 */
 void* ILibLinkedList_InsertBefore(void *LinkedList_Node, void *data)
 {
+	if (!ILibMemory_CanaryOK(LinkedList_Node)) { return(NULL); }
 	struct ILibLinkedListNode_Root *r = ((struct ILibLinkedListNode*)LinkedList_Node)->Root;
 	struct ILibLinkedListNode *n = (struct ILibLinkedListNode*) LinkedList_Node;
 	struct ILibLinkedListNode *newNode;
@@ -7983,6 +7975,7 @@ void* ILibLinkedList_InsertBefore(void *LinkedList_Node, void *data)
 */
 void* ILibLinkedList_InsertAfter(void *LinkedList_Node, void *data)
 {
+	if (!ILibMemory_CanaryOK(LinkedList_Node)) { return(NULL); }
 	struct ILibLinkedListNode_Root *r = ((struct ILibLinkedListNode*)LinkedList_Node)->Root;
 	struct ILibLinkedListNode *n = (struct ILibLinkedListNode*) LinkedList_Node;
 	struct ILibLinkedListNode *newNode;
@@ -8090,6 +8083,7 @@ int ILibLinkedList_Remove_ByData(void *LinkedList, void *data)
 */
 void* ILibLinkedList_AddHead(void *LinkedList, void *data)
 {
+	if (!ILibMemory_CanaryOK(LinkedList)) { return(NULL); }
 	struct ILibLinkedListNode_Root *r = (struct ILibLinkedListNode_Root*)LinkedList;
 	struct ILibLinkedListNode *newNode;
 
@@ -8113,6 +8107,7 @@ void* ILibLinkedList_AddHead(void *LinkedList, void *data)
 */
 void* ILibLinkedList_AddTailEx(void *LinkedList, void *data, size_t additionalSize)
 {
+	if (!ILibMemory_CanaryOK(LinkedList)) { return(NULL); }
 	struct ILibLinkedListNode_Root *r = (struct ILibLinkedListNode_Root*)LinkedList;
 	struct ILibLinkedListNode *newNode;
 
@@ -8130,7 +8125,8 @@ void* ILibLinkedList_AddTailEx(void *LinkedList, void *data, size_t additionalSi
 }
 void* ILibLinkedList_Node_ResizeAdditional(void *node, size_t additionalSize)
 {
-	size_t baseSize = ILibMemory_GetExtraMemorySize(((ILibLinkedListNode*)node)->Root->ExtraMemory);
+	if (!ILibMemory_CanaryOK(node)) { return(NULL); }
+	size_t baseSize = ILibMemory_ExtraSize(((ILibLinkedListNode*)node)->Root);
 	ILibLinkedListNode* newNode = ILibMemory_SmartAllocateEx_ResizeExtra(node, baseSize + additionalSize);
 	if (newNode != node)
 	{
@@ -8184,9 +8180,12 @@ void ILibLinkedList_UnLock(void *LinkedList)
 */
 void ILibLinkedList_Destroy(void *LinkedList)
 {
-	struct ILibLinkedListNode_Root *r = (struct ILibLinkedListNode_Root*)LinkedList;
-	while (r->Head != NULL) ILibLinkedList_Remove(ILibLinkedList_GetNode_Head(LinkedList));
-	free(r);
+	if (ILibMemory_CanaryOK(LinkedList))
+	{
+		struct ILibLinkedListNode_Root *r = (struct ILibLinkedListNode_Root*)LinkedList;
+		while (r->Head != NULL) ILibLinkedList_Remove(ILibLinkedList_GetNode_Head(LinkedList));
+		ILibMemory_Free(r);
+	}
 }
 
 
@@ -8197,7 +8196,7 @@ void ILibLinkedList_Destroy(void *LinkedList)
 */
 long ILibLinkedList_GetCount(void *LinkedList)
 {
-	return(((struct ILibLinkedListNode_Root*)LinkedList)->count);
+	return(ILibMemory_CanaryOK(LinkedList) ? ((struct ILibLinkedListNode_Root*)LinkedList)->count : 0);
 }
 
 int ILibLinkedList_GetIndex(void *node)
diff --git a/microstack/ILibParsers.h b/microstack/ILibParsers.h
@@ -1146,7 +1146,6 @@ int ILibIsRunningOnChainThread(void* chain);
 		\param user Custom user state object
 	*/
 	typedef void(*ILibSparseArray_OnValue)(ILibSparseArray sender, int index, void *value, void *user);
-	extern const int ILibMemory_SparseArray_CONTAINERSIZE;
 	ILibSparseArray ILibSparseArray_CreateWithUserMemory(int numberOfBuckets, ILibSparseArray_Bucketizer bucketizer, int userMemorySize);
 	#define ILibSparseArray_Create(numberOfBuckets, bucketizer) ILibSparseArray_CreateWithUserMemory(numberOfBuckets, bucketizer, 0)
 	ILibSparseArray ILibSparseArray_CreateEx(ILibSparseArray source);
@@ -1267,9 +1266,6 @@ int ILibIsRunningOnChainThread(void* chain);
 	void ILibLinkedList_SetTag(ILibLinkedList list, void *tag);
 	void* ILibLinkedList_GetTag(ILibLinkedList list);
 	int ILibLinkedList_GetIndex(void *node);
-	extern const int ILibLinkedListNode_SIZE;
-	extern const int ILibLinkedListNodeRoot_Size;
-
 
 	//! Comparer delegate is called to compare two values. Mimics behavior of .NET IComparer..
 	//! obj2 == obj1	: 0

Original file line number	Diff line number	Diff line change
`@@ -305,12 +305,8 @@ typedef struct ILibLinkedListNode_Root`
`305`	`305`	`void* Tag;`
`306`	`306`	`struct ILibLinkedListNode *Head;`
`307`	`307`	`struct ILibLinkedListNode *Tail;`
`308`		`- void *ExtraMemory;`
`309`	`308`	`}ILibLinkedListNode_Root;`
`310`	`309`
`311`		`-const int ILibLinkedListNode_SIZE = sizeof(ILibLinkedListNode);`
`312`		`-const int ILibLinkedListNodeRoot_Size = sizeof(ILibLinkedListNode_Root);`
`313`		`-`
`314`	`310`	`struct ILibReaderWriterLock_Data`
`315`	`311`	`{`
`316`	`312`	`ILibChain_PreSelect Pre;`
`@@ -7489,7 +7485,6 @@ void ILibLifeTime_Check(void LifeTimeMonitorObject, fd_set readset, fd_set *wr`
`7489`	`7485`	`int removed;`
`7490`	`7486`	`void *EventQueue;`
`7491`	`7487`	`long long CurrentTick;`
`7492`		`- struct ILibLinkedListNode_Root root;`
`7493`	`7488`	`struct LifeTimeMonitorData EVT, Temp = NULL;`
`7494`	`7489`	`struct ILibLifeTime LifeTimeMonitor = (struct ILibLifeTime)LifeTimeMonitorObject;`
`7495`	`7490`
`@@ -7514,9 +7509,7 @@ void ILibLifeTime_Check(void LifeTimeMonitorObject, fd_set readset, fd_set *wr`
`7514`	`7509`	`LifeTimeMonitor->NextTriggerTick = -1;`
`7515`	`7510`
`7516`	`7511`	`// This is an optimization. We are going to create the root of this linked list on the stack instead of the heap.`
`7517`		`- // This also fixes a crash with malloc returns NULL if this is created in the heap - No idea why this occurs.`
`7518`		`- memset(&root, 0, sizeof(struct ILibLinkedListNode_Root));`
`7519`		`- EventQueue = (void*)&root;`
	`7512`	`+ EventQueue = ILibMemory_AllocateA(sizeof(ILibLinkedListNode_Root));`
`7520`	`7513`
`7521`	`7514`	`ILibLinkedList_Lock(LifeTimeMonitor->Reserved);`
`7522`	`7515`	`ILibLinkedList_Lock(LifeTimeMonitor->ObjectList);`
`@@ -7827,10 +7820,8 @@ void* ILibLinkedList_GetNode_Search(void* LinkedList, ILibLinkedList_Comparer co`
`7827`	`7820`	`void* ILibLinkedList_CreateEx(int userMemorySize)`
`7828`	`7821`	`{`
`7829`	`7822`	`struct ILibLinkedListNode_Root *root;`
`7830`		`- void *mem;`
`7831`	`7823`
`7832`		`- ILibMemory_Allocate(sizeof(ILibLinkedListNode_Root), userMemorySize, (void**)&root, &mem);`
`7833`		`- root->ExtraMemory = mem;`
	`7824`	`+ root = ILibMemory_SmartAllocateEx(sizeof(ILibLinkedListNode_Root), userMemorySize);`
`7834`	`7825`	`ILibSpinLock_Init(&(root->LOCK));`
`7835`	`7826`	`return root;`
`7836`	`7827`	`}`
`@@ -7861,7 +7852,7 @@ void* ILibLinkedList_GetTag(ILibLinkedList list)`
`7861`	`7852`
`7862`	`7853`	`void* ILibLinkedList_AllocateNodeEx(void *LinkedList, size_t extraSize)`
`7863`	`7854`	`{`
`7864`		`- void* newNode = ILibMemory_SmartAllocateEx(sizeof(ILibLinkedListNode), extraSize + ILibMemory_GetExtraMemorySize(((ILibLinkedListNode_Root*)LinkedList)->ExtraMemory));`
	`7855`	`+ void* newNode = ILibMemory_SmartAllocateEx(sizeof(ILibLinkedListNode), extraSize + ILibMemory_ExtraSize((ILibLinkedListNode_Root*)LinkedList));`
`7865`	`7856`	`return(newNode);`
`7866`	`7857`	`}`
`7867`	`7858`	`#define ILibLinkedList_AllocateNode(linkedList) ILibLinkedList_AllocateNodeEx(linkedList, 0)`
`@@ -7895,7 +7886,7 @@ void* ILibLinkedList_ShallowCopy(void *LinkedList)`
`7895`	`7886`	`*/`
`7896`	`7887`	`void* ILibLinkedList_GetNode_Head(void *LinkedList)`
`7897`	`7888`	`{`
`7898`		`- return(LinkedList != NULL ? ((struct ILibLinkedListNode_Root*)LinkedList)->Head : NULL);`
	`7889`	`+ return(ILibMemory_CanaryOK(LinkedList) ? ((struct ILibLinkedListNode_Root*)LinkedList)->Head : NULL);`
`7899`	`7890`	`}`
`7900`	`7891`
`7901`	`7892`	`/! \fn ILibLinkedList_GetNode_Tail(void LinkedList)`
`@@ -7905,7 +7896,7 @@ void* ILibLinkedList_GetNode_Head(void *LinkedList)`
`7905`	`7896`	`*/`
`7906`	`7897`	`void* ILibLinkedList_GetNode_Tail(void *LinkedList)`
`7907`	`7898`	`{`
`7908`		`- return(((struct ILibLinkedListNode_Root*)LinkedList)->Tail);`
	`7899`	`+ return(ILibMemory_CanaryOK(LinkedList) ? ((struct ILibLinkedListNode_Root*)LinkedList)->Tail : NULL);`
`7909`	`7900`	`}`
`7910`	`7901`
`7911`	`7902`	`/! \fn ILibLinkedList_GetNextNode(void LinkedList_Node)`
`@@ -7915,7 +7906,7 @@ void* ILibLinkedList_GetNode_Tail(void *LinkedList)`
`7915`	`7906`	`*/`
`7916`	`7907`	`void* ILibLinkedList_GetNextNode(void *LinkedList_Node)`
`7917`	`7908`	`{`
`7918`		`- return(((struct ILibLinkedListNode*)LinkedList_Node)->Next);`
	`7909`	`+ return(ILibMemory_CanaryOK(LinkedList_Node) ? ((struct ILibLinkedListNode*)LinkedList_Node)->Next : NULL);`
`7919`	`7910`	`}`
`7920`	`7911`
`7921`	`7912`	`/! \fn ILibLinkedList_GetPreviousNode(void LinkedList_Node)`
`@@ -7925,7 +7916,7 @@ void* ILibLinkedList_GetNextNode(void *LinkedList_Node)`
`7925`	`7916`	`*/`
`7926`	`7917`	`void* ILibLinkedList_GetPreviousNode(void *LinkedList_Node)`
`7927`	`7918`	`{`
`7928`		`- return(((struct ILibLinkedListNode*)LinkedList_Node)->Previous);`
	`7919`	`+ return(ILibMemory_CanaryOK(LinkedList_Node) ? ((struct ILibLinkedListNode*)LinkedList_Node)->Previous : NULL);`
`7929`	`7920`	`}`
`7930`	`7921`
`7931`	`7922`	`/! \fn ILibLinkedList_GetDataFromNode(void LinkedList_Node)`
`@@ -7935,7 +7926,7 @@ void* ILibLinkedList_GetPreviousNode(void *LinkedList_Node)`
`7935`	`7926`	`*/`
`7936`	`7927`	`void ILibLinkedList_GetDataFromNode(void LinkedList_Node)`
`7937`	`7928`	`{`
`7938`		`- return(LinkedList_Node != NULL ? (((struct ILibLinkedListNode*)LinkedList_Node)->Data) : NULL);`
	`7929`	`+ return(ILibMemory_CanaryOK(LinkedList_Node) ? (((struct ILibLinkedListNode*)LinkedList_Node)->Data) : NULL);`
`7939`	`7930`	`}`
`7940`	`7931`
`7941`	`7932`	`/! \fn ILibLinkedList_InsertBefore(void LinkedList_Node, void *data)`
`@@ -7946,6 +7937,7 @@ void ILibLinkedList_GetDataFromNode(void LinkedList_Node)`
`7946`	`7937`	`*/`
`7947`	`7938`	`void* ILibLinkedList_InsertBefore(void LinkedList_Node, void data)`
`7948`	`7939`	`{`
	`7940`	`+ if (!ILibMemory_CanaryOK(LinkedList_Node)) { return(NULL); }`
`7949`	`7941`	`struct ILibLinkedListNode_Root r = ((struct ILibLinkedListNode)LinkedList_Node)->Root;`
`7950`	`7942`	`struct ILibLinkedListNode n = (struct ILibLinkedListNode) LinkedList_Node;`
`7951`	`7943`	`struct ILibLinkedListNode *newNode;`
`@@ -7983,6 +7975,7 @@ void* ILibLinkedList_InsertBefore(void LinkedList_Node, void data)`
`7983`	`7975`	`*/`
`7984`	`7976`	`void* ILibLinkedList_InsertAfter(void LinkedList_Node, void data)`
`7985`	`7977`	`{`
	`7978`	`+ if (!ILibMemory_CanaryOK(LinkedList_Node)) { return(NULL); }`
`7986`	`7979`	`struct ILibLinkedListNode_Root r = ((struct ILibLinkedListNode)LinkedList_Node)->Root;`
`7987`	`7980`	`struct ILibLinkedListNode n = (struct ILibLinkedListNode) LinkedList_Node;`
`7988`	`7981`	`struct ILibLinkedListNode *newNode;`
`@@ -8090,6 +8083,7 @@ int ILibLinkedList_Remove_ByData(void LinkedList, void data)`
`8090`	`8083`	`*/`
`8091`	`8084`	`void* ILibLinkedList_AddHead(void LinkedList, void data)`
`8092`	`8085`	`{`
	`8086`	`+ if (!ILibMemory_CanaryOK(LinkedList)) { return(NULL); }`
`8093`	`8087`	`struct ILibLinkedListNode_Root r = (struct ILibLinkedListNode_Root)LinkedList;`
`8094`	`8088`	`struct ILibLinkedListNode *newNode;`
`8095`	`8089`
`@@ -8113,6 +8107,7 @@ void* ILibLinkedList_AddHead(void LinkedList, void data)`
`8113`	`8107`	`*/`
`8114`	`8108`	`void* ILibLinkedList_AddTailEx(void LinkedList, void data, size_t additionalSize)`
`8115`	`8109`	`{`
	`8110`	`+ if (!ILibMemory_CanaryOK(LinkedList)) { return(NULL); }`
`8116`	`8111`	`struct ILibLinkedListNode_Root r = (struct ILibLinkedListNode_Root)LinkedList;`
`8117`	`8112`	`struct ILibLinkedListNode *newNode;`
`8118`	`8113`
`@@ -8130,7 +8125,8 @@ void* ILibLinkedList_AddTailEx(void LinkedList, void data, size_t additionalSi`
`8130`	`8125`	`}`
`8131`	`8126`	`void* ILibLinkedList_Node_ResizeAdditional(void *node, size_t additionalSize)`
`8132`	`8127`	`{`
`8133`		`- size_t baseSize = ILibMemory_GetExtraMemorySize(((ILibLinkedListNode*)node)->Root->ExtraMemory);`
	`8128`	`+ if (!ILibMemory_CanaryOK(node)) { return(NULL); }`
	`8129`	`+ size_t baseSize = ILibMemory_ExtraSize(((ILibLinkedListNode*)node)->Root);`
`8134`	`8130`	`ILibLinkedListNode* newNode = ILibMemory_SmartAllocateEx_ResizeExtra(node, baseSize + additionalSize);`
`8135`	`8131`	`if (newNode != node)`
`8136`	`8132`	`{`
`@@ -8184,9 +8180,12 @@ void ILibLinkedList_UnLock(void *LinkedList)`
`8184`	`8180`	`*/`
`8185`	`8181`	`void ILibLinkedList_Destroy(void *LinkedList)`
`8186`	`8182`	`{`
`8187`		`- struct ILibLinkedListNode_Root r = (struct ILibLinkedListNode_Root)LinkedList;`
`8188`		`- while (r->Head != NULL) ILibLinkedList_Remove(ILibLinkedList_GetNode_Head(LinkedList));`
`8189`		`- free(r);`
	`8183`	`+ if (ILibMemory_CanaryOK(LinkedList))`
	`8184`	`+ {`
	`8185`	`+ struct ILibLinkedListNode_Root r = (struct ILibLinkedListNode_Root)LinkedList;`
	`8186`	`+ while (r->Head != NULL) ILibLinkedList_Remove(ILibLinkedList_GetNode_Head(LinkedList));`
	`8187`	`+ ILibMemory_Free(r);`
	`8188`	`+ }`
`8190`	`8189`	`}`
`8191`	`8190`
`8192`	`8191`
`@@ -8197,7 +8196,7 @@ void ILibLinkedList_Destroy(void *LinkedList)`
`8197`	`8196`	`*/`
`8198`	`8197`	`long ILibLinkedList_GetCount(void *LinkedList)`
`8199`	`8198`	`{`
`8200`		`- return(((struct ILibLinkedListNode_Root*)LinkedList)->count);`
	`8199`	`+ return(ILibMemory_CanaryOK(LinkedList) ? ((struct ILibLinkedListNode_Root*)LinkedList)->count : 0);`
`8201`	`8200`	`}`
`8202`	`8201`
`8203`	`8202`	`int ILibLinkedList_GetIndex(void *node)`