/* * Copyright (c) 2003 Apple Computer, Inc. All rights reserved. * * @APPLE_LICENSE_HEADER_START@ * * The contents of this file constitute Original Code as defined in and * are subject to the Apple Public Source License Version 1.1 (the * "License"). You may not use this file except in compliance with the * License. Please obtain a copy of the License at * http://www.apple.com/publicsource and read it before using this file. * * This Original Code and all software distributed under the License are * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the * License for the specific language governing rights and limitations * under the License. * * @APPLE_LICENSE_HEADER_END@ */ #include #include #include #include #include #include "ptrlist.h" static __inline__ void ptrlist_print(ptrlist_t * list) { printf("ptrlist count %d, size %d\n", list->count, list->size); if (list->count > 0) { int i; for (i = 0; i < list->count; i++) printf("%d. %x\n", i, (unsigned int)list->array[i]); } return; } __private_extern__ void ptrlist_init(ptrlist_t * list) { bzero(list, sizeof(*list)); return; } __private_extern__ void ptrlist_init_size(ptrlist_t * list, int size) { bzero(list, sizeof(*list)); if (size > 0) { list->size = size; list->array = malloc(sizeof(*list->array) * list->size); if (list->array == NULL) { list->size = 0; } } return; } __private_extern__ void ptrlist_free(ptrlist_t * list) { if (list->array) free(list->array); ptrlist_init(list); return; } __private_extern__ int ptrlist_index(ptrlist_t * list, void * element) { int i; for (i = 0; i < ptrlist_count(list); i++) { if (ptrlist_element(list, i) == element) return (i); } return (-1); } __private_extern__ int ptrlist_count(ptrlist_t * list) { if (list == NULL || list->array == NULL) return (0); return (list->count); } __private_extern__ void * ptrlist_element(ptrlist_t * list, int i) { if (list->array == NULL) return (NULL); if (i < list->count) return (list->array[i]); return (NULL); } __private_extern__ boolean_t ptrlist_remove(ptrlist_t * list, int i, void * * ret) { int nmove; if (list->array == NULL || i >= list->count || i < 0) return (FALSE); if (ret) *ret = list->array[i]; nmove = (list->count - 1) - i; if (nmove > 0) { bcopy(list->array + (i + 1), list->array + i, nmove * sizeof(*list->array)); } list->count--; return (TRUE); } static boolean_t ptrlist_grow(ptrlist_t * list) { if (list->array == NULL) { if (list->size == 0) list->size = PTRLIST_NUMBER; list->count = 0; list->array = malloc(sizeof(*list->array) * list->size); } else if (list->size == list->count) { list->size *= 2; list->array = realloc(list->array, sizeof(*list->array) * list->size); } if (list->array == NULL) return (FALSE); return (TRUE); } __private_extern__ boolean_t ptrlist_add(ptrlist_t * list, void * element) { if (ptrlist_grow(list) == FALSE) return (FALSE); list->array[list->count++] = element; return (TRUE); } __private_extern__ boolean_t ptrlist_insert(ptrlist_t * list, void * element, int where) { if (where < 0) return (FALSE); if (where >= list->count) return (ptrlist_add(list, element)); if (ptrlist_grow(list) == FALSE) return (FALSE); /* open up a space for 1 element */ bcopy(list->array + where, list->array + where + 1, (list->count - where) * sizeof(*list->array)); list->array[where] = element; list->count++; return (TRUE); } __private_extern__ boolean_t ptrlist_dup(ptrlist_t * dest, ptrlist_t * source) { ptrlist_init(dest); dest->size = dest->count = source->count; if (source->count == 0) return (TRUE); dest->array = malloc(sizeof(*dest->array) * dest->size); if (dest->array == NULL) return (FALSE); bcopy(source->array, dest->array, sizeof(*dest->array) * dest->size); return (TRUE); } /* concatenates extra onto list */ __private_extern__ boolean_t ptrlist_concat(ptrlist_t * list, ptrlist_t * extra) { if (extra->count == 0) return (TRUE); if ((extra->count + list->count) > list->size) { list->size = extra->count + list->count; if (list->array == NULL) list->array = malloc(sizeof(*list->array) * list->size); else list->array = realloc(list->array, sizeof(*list->array) * list->size); } if (list->array == NULL) return (FALSE); bcopy(extra->array, list->array + list->count, extra->count * sizeof(*list->array)); list->count += extra->count; return (TRUE); }