--- /dev/null
+/** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** **\r
+ * This file is part of clib library\r
+ * Copyright (C) 2011 Avinash Dongre ( dongre.avinash@gmail.com )\r
+ *\r
+ * Permission is hereby granted, free of charge, to any person obtaining a copy\r
+ * of this software and associated documentation files (the "Software"), to deal\r
+ * in the Software without restriction, including without limitation the rights\r
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r
+ * copies of the Software, and to permit persons to whom the Software is\r
+ * furnished to do so, subject to the following conditions:\r
+ * \r
+ * The above copyright notice and this permission notice shall be included in\r
+ * all copies or substantial portions of the Software.\r
+ * \r
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r
+ * THE SOFTWARE.\r
+ ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** **/\r
+\r
+#include "c_lib.h"\r
+#include <string.h>\r
+#include <stdio.h>\r
+\r
+\r
+static struct clib_array* \r
+array_check_and_grow ( struct clib_array* pArray) {\r
+ if ( pArray->no_of_elements >= pArray->no_max_elements ) {\r
+ pArray->no_max_elements = 2 * pArray->no_max_elements;\r
+ pArray->pElements = (struct clib_object**) realloc ( pArray->pElements, \r
+ pArray->no_max_elements * sizeof ( struct clib_object*));\r
+ }\r
+ return pArray;\r
+}\r
+\r
+struct clib_array* \r
+new_clib_array(int array_size, clib_compare fn_c, clib_destroy fn_d) {\r
+\r
+ struct clib_array* pArray = (struct clib_array*)malloc(sizeof(struct clib_array));\r
+ if ( ! pArray )\r
+ return (struct clib_array*)0;\r
+\r
+ pArray->no_max_elements = array_size < 8 ? 8 : array_size;\r
+ pArray->pElements = (struct clib_object**) malloc(pArray->no_max_elements * sizeof(struct clib_object*));\r
+ if ( ! pArray->pElements ){\r
+ free ( pArray );\r
+ return (struct clib_array*)0;\r
+ }\r
+ pArray->compare_fn = fn_c;\r
+ pArray->destruct_fn = fn_d;\r
+ pArray->no_of_elements = 0;\r
+\r
+ return pArray;\r
+}\r
+\r
+static clib_error \r
+insert_clib_array ( struct clib_array* pArray, int index, void *elem, size_t elem_size) {\r
+\r
+ clib_error rc = CLIB_ERROR_SUCCESS;\r
+ struct clib_object* pObject = new_clib_object ( elem, elem_size );\r
+ if ( ! pObject )\r
+ return CLIB_ARRAY_INSERT_FAILED;\r
+\r
+ pArray->pElements[index] = pObject;\r
+ pArray->no_of_elements++;\r
+ return rc;\r
+}\r
+\r
+clib_error \r
+push_back_clib_array (struct clib_array* pArray, void *elem, size_t elem_size) {\r
+ clib_error rc = CLIB_ERROR_SUCCESS; \r
+\r
+ if ( ! pArray)\r
+ return CLIB_ARRAY_NOT_INITIALIZED;\r
+\r
+ array_check_and_grow ( pArray);\r
+\r
+ rc = insert_clib_array( pArray, pArray->no_of_elements, elem, elem_size);\r
+\r
+ return rc;\r
+}\r
+\r
+clib_error \r
+element_at_clib_array (struct clib_array* pArray, int index, void** elem) {\r
+ clib_error rc = CLIB_ERROR_SUCCESS;\r
+\r
+ if ( ! pArray )\r
+ return CLIB_ARRAY_NOT_INITIALIZED;\r
+\r
+ if ( index < 0 || index >= pArray->no_of_elements )\r
+ return CLIB_ARRAY_INDEX_OUT_OF_BOUND;\r
+\r
+ get_raw_clib_object ( pArray->pElements[index], elem );\r
+ return rc;\r
+}\r
+\r
+int\r
+size_clib_array ( struct clib_array* pArray ) {\r
+ if ( pArray == (struct clib_array*)0 )\r
+ return 0;\r
+ return pArray->no_of_elements;\r
+}\r
+\r
+int\r
+capacity_clib_array ( struct clib_array* pArray ) {\r
+ if ( pArray == (struct clib_array*)0 )\r
+ return 0;\r
+ return pArray->no_max_elements;\r
+}\r
+\r
+clib_bool \r
+empty_clib_array ( struct clib_array* pArray) {\r
+ if ( pArray == (struct clib_array*)0 )\r
+ return 0;\r
+ if ( pArray->no_of_elements == 0 )\r
+ return clib_true;\r
+ else\r
+ return clib_false;\r
+}\r
+\r
+clib_error \r
+reserve_clib_array ( struct clib_array* pArray, int new_size) {\r
+ if ( pArray == (struct clib_array*)0 )\r
+ return CLIB_ARRAY_NOT_INITIALIZED;\r
+\r
+ if ( new_size <= pArray->no_max_elements )\r
+ return CLIB_ERROR_SUCCESS;\r
+\r
+ array_check_and_grow ( pArray);\r
+ return CLIB_ERROR_SUCCESS;\r
+\r
+}\r
+\r
+clib_error \r
+front_clib_array ( struct clib_array* pArray,void *elem) {\r
+ return element_at_clib_array ( pArray, 0, elem );\r
+}\r
+\r
+clib_error \r
+back_clib_array ( struct clib_array* pArray,void *elem) {\r
+ return element_at_clib_array ( pArray, pArray->no_of_elements - 1, elem );\r
+}\r
+\r
+clib_error \r
+insert_at_clib_array ( struct clib_array* pArray, int index, void *elem, size_t elem_size) {\r
+ clib_error rc = CLIB_ERROR_SUCCESS;\r
+ if ( ! pArray )\r
+ return CLIB_ARRAY_NOT_INITIALIZED;\r
+\r
+ if ( index < 0 || index > pArray->no_max_elements )\r
+ return CLIB_ARRAY_INDEX_OUT_OF_BOUND;\r
+\r
+ array_check_and_grow ( pArray);\r
+\r
+ memmove ( &(pArray->pElements[index + 1]),\r
+ &pArray->pElements[index],\r
+ (pArray->no_of_elements - index ) * sizeof(struct clib_object*));\r
+\r
+ rc = insert_clib_array ( pArray, index, elem , elem_size);\r
+\r
+ return rc;\r
+}\r
+\r
+clib_error \r
+remove_clib_array ( struct clib_array* pArray, int index) {\r
+ clib_error rc = CLIB_ERROR_SUCCESS;\r
+\r
+ if ( ! pArray )\r
+ return rc;\r
+ if ( index < 0 || index >= pArray->no_of_elements )\r
+ return CLIB_ARRAY_INDEX_OUT_OF_BOUND;\r
+\r
+ if ( pArray->destruct_fn ) {\r
+ void *elem;\r
+ if ( CLIB_ERROR_SUCCESS == element_at_clib_array ( pArray, index , &elem ) ) {\r
+ pArray->destruct_fn(elem);\r
+ }\r
+ }\r
+ delete_clib_object ( pArray->pElements[index]);\r
+\r
+ if ( index != pArray->no_of_elements - 1 ) {\r
+ memmove ( &(pArray->pElements[index]),\r
+ &pArray->pElements[index + 1],\r
+ (pArray->no_of_elements - index ) * sizeof(struct clib_object*));\r
+ }\r
+ pArray->no_of_elements--;\r
+ return rc;\r
+}\r
+\r
+clib_error \r
+delete_clib_array( struct clib_array* pArray) {\r
+ clib_error rc = CLIB_ERROR_SUCCESS;\r
+ int i = 0;\r
+\r
+ if ( pArray == (struct clib_array*)0 )\r
+ return rc;\r
+\r
+ if ( pArray->destruct_fn ) {\r
+ for ( i = 0; i < pArray->no_of_elements; i++) {\r
+ void *elem;\r
+ if ( CLIB_ERROR_SUCCESS == element_at_clib_array ( pArray, i , &elem ) )\r
+ pArray->destruct_fn(elem);\r
+ }\r
+ }\r
+ for ( i = 0; i < pArray->no_of_elements; i++) \r
+ delete_clib_object ( pArray->pElements[i]); \r
+\r
+ free ( pArray->pElements);\r
+ free ( pArray );\r
+ return rc;\r
+}\r
+\r
+void \r
+swap_element_clib_array ( struct clib_array *pArray, int left, int right) {\r
+ struct clib_object *temp = pArray->pElements[left];\r
+ pArray->pElements[left] = pArray->pElements[right];\r
+ pArray->pElements[right] = temp;\r
+}\r
+\r
+void for_each_clib_array ( struct clib_array *pArray, void (*fn)(void*)) {\r
+ int size = pArray->no_of_elements;\r
+ int i = 0;\r
+ for ( i = 0; i < size; i++ ) {\r
+ void *elem;\r
+ element_at_clib_array ( pArray, i , &elem);\r
+ (fn)(elem);\r
+ free ( elem );\r
+ }\r
+}
\ No newline at end of file
projects / ccan / blobdiff