sl@0: /* Copyright (c) 2009 The Khronos Group Inc. sl@0: * Portions copyright (c) 2009-2010 Nokia Corporation and/or its subsidiary(-ies) sl@0: * sl@0: * Permission is hereby granted, free of charge, to any person obtaining a sl@0: * copy of this software and/or associated documentation files (the sl@0: * "Materials"), to deal in the Materials without restriction, including sl@0: * without limitation the rights to use, copy, modify, merge, publish, sl@0: * distribute, sublicense, and/or sell copies of the Materials, and to sl@0: * permit persons to whom the Materials are furnished to do so, subject to sl@0: * the following conditions: sl@0: * sl@0: * The above copyright notice and this permission notice shall be included sl@0: * in all copies or substantial portions of the Materials. sl@0: * sl@0: * THE MATERIALS ARE PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, sl@0: * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF sl@0: * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. sl@0: * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY sl@0: * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, sl@0: * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE sl@0: * MATERIALS OR THE USE OR OTHER DEALINGS IN THE MATERIALS. sl@0: */ sl@0: sl@0: sl@0: #ifdef __cplusplus sl@0: extern "C" sl@0: { sl@0: #endif sl@0: sl@0: sl@0: #include sl@0: #include sl@0: sl@0: #include "owfmemory.h" sl@0: #include "owflinkedlist.h" sl@0: #include "owftypes.h" sl@0: #include "owfpool.h" sl@0: sl@0: sl@0: sl@0: sl@0: OWF_API_CALL OWF_NODE* sl@0: OWF_Node_Create(OWF_POOL* pool, void* data) sl@0: { sl@0: OWF_NODE* node; sl@0: sl@0: node = (OWF_NODE*)OWF_Pool_GetObject(pool); sl@0: if (node) sl@0: { sl@0: node->data = data; sl@0: } sl@0: return node; sl@0: } sl@0: sl@0: OWF_API_CALL void sl@0: OWF_Node_Destroy(OWF_NODE* node) sl@0: { sl@0: OWF_Pool_PutObject(node); sl@0: } sl@0: sl@0: OWF_API_CALL OWF_NODE* sl@0: OWF_List_Tail(OWF_NODE* root) sl@0: { sl@0: if (root) sl@0: { sl@0: while (root->next) sl@0: { sl@0: root = root->next; sl@0: } sl@0: } sl@0: return root; sl@0: } sl@0: sl@0: OWF_API_CALL OWF_NODE* sl@0: OWF_List_Append(OWF_NODE* root, OWF_NODE* node) sl@0: { sl@0: OWF_NODE* tail; sl@0: sl@0: tail = OWF_List_Tail(root); sl@0: if (tail) sl@0: { sl@0: tail->next = node; sl@0: } sl@0: else sl@0: { sl@0: root = node; sl@0: } sl@0: return root; sl@0: } sl@0: sl@0: OWF_API_CALL OWF_NODE* sl@0: OWF_List_Insert(OWF_NODE* root, OWF_NODE* node) sl@0: { sl@0: if (root) sl@0: { sl@0: node->next = root; sl@0: } sl@0: root = node; sl@0: return root; sl@0: } sl@0: sl@0: OWF_API_CALL void sl@0: OWF_List_InsertAfter(OWF_NODE* pred, OWF_NODE* succ) sl@0: { sl@0: if (pred && succ) sl@0: { sl@0: succ->next = pred->next; sl@0: pred->next = succ; sl@0: } sl@0: } sl@0: sl@0: OWF_API_CALL OWF_NODE* sl@0: OWF_List_Contains(OWF_NODE* root, void* data) sl@0: { sl@0: while (root) sl@0: { sl@0: if (root->data == data) sl@0: { sl@0: break; sl@0: } sl@0: root = root->next; sl@0: } sl@0: sl@0: return root; sl@0: } sl@0: sl@0: OWF_API_CALL OWF_NODE* sl@0: OWF_List_Remove(OWF_NODE* root, OWF_NODE* node) sl@0: { sl@0: OWF_NODE* iter = NULL; sl@0: sl@0: if (root) sl@0: { sl@0: if (node != root) sl@0: { sl@0: iter = root; sl@0: while (iter) sl@0: { sl@0: if (iter->next == node) sl@0: { sl@0: iter->next = node->next; sl@0: break; sl@0: } sl@0: iter = iter->next; sl@0: } sl@0: } sl@0: else sl@0: { sl@0: root = root->next; sl@0: } sl@0: } sl@0: sl@0: return root; sl@0: } sl@0: sl@0: OWF_API_CALL OWF_NODE* sl@0: OWF_List_Clear(OWF_NODE* root) sl@0: { sl@0: OWF_NODE* next = NULL; sl@0: while (root) sl@0: { sl@0: next = root->next; sl@0: OWF_Node_Destroy(root); sl@0: root = next; sl@0: } sl@0: return root; sl@0: } sl@0: sl@0: #ifdef __cplusplus sl@0: } sl@0: #endif