Michael Clark | f0d0888 | 2007-03-13 08:26:18 +0000 | [diff] [blame] | 1 | /* |
Michael Clark | f6a6e48 | 2007-03-13 08:26:23 +0000 | [diff] [blame] | 2 | * $Id: arraylist.c,v 1.4 2006/01/26 02:16:28 mclark Exp $ |
Michael Clark | f0d0888 | 2007-03-13 08:26:18 +0000 | [diff] [blame] | 3 | * |
Michael Clark | f6a6e48 | 2007-03-13 08:26:23 +0000 | [diff] [blame] | 4 | * Copyright (c) 2004, 2005 Metaparadigm Pte. Ltd. |
Michael Clark | f0d0888 | 2007-03-13 08:26:18 +0000 | [diff] [blame] | 5 | * Michael Clark <michael@metaparadigm.com> |
| 6 | * |
Michael Clark | f6a6e48 | 2007-03-13 08:26:23 +0000 | [diff] [blame] | 7 | * This library is free software; you can redistribute it and/or modify |
| 8 | * it under the terms of the MIT license. See COPYING for details. |
Michael Clark | f0d0888 | 2007-03-13 08:26:18 +0000 | [diff] [blame] | 9 | * |
| 10 | */ |
| 11 | |
Michael Clark | 4504df7 | 2007-03-13 08:26:20 +0000 | [diff] [blame] | 12 | #include "config.h" |
| 13 | |
Mateusz Loskot | a6f39a3 | 2012-05-21 23:22:36 +0100 | [diff] [blame] | 14 | #ifdef STDC_HEADERS |
Michael Clark | 4504df7 | 2007-03-13 08:26:20 +0000 | [diff] [blame] | 15 | # include <stdlib.h> |
| 16 | # include <string.h> |
| 17 | #endif /* STDC_HEADERS */ |
| 18 | |
Mateusz Loskot | a6f39a3 | 2012-05-21 23:22:36 +0100 | [diff] [blame] | 19 | #if defined(HAVE_STRINGS_H) && !defined(_STRING_H) && !defined(__USE_BSD) |
Michael Clark | 4504df7 | 2007-03-13 08:26:20 +0000 | [diff] [blame] | 20 | # include <strings.h> |
| 21 | #endif /* HAVE_STRINGS_H */ |
Michael Clark | f0d0888 | 2007-03-13 08:26:18 +0000 | [diff] [blame] | 22 | |
| 23 | #include "bits.h" |
| 24 | #include "arraylist.h" |
| 25 | |
Michael Clark | f0d0888 | 2007-03-13 08:26:18 +0000 | [diff] [blame] | 26 | struct array_list* |
| 27 | array_list_new(array_list_free_fn *free_fn) |
| 28 | { |
Michael Clark | 266a3fd | 2009-02-25 01:55:31 +0000 | [diff] [blame] | 29 | struct array_list *arr; |
Michael Clark | f0d0888 | 2007-03-13 08:26:18 +0000 | [diff] [blame] | 30 | |
Michael Clark | aaec1ef | 2009-02-25 02:31:32 +0000 | [diff] [blame] | 31 | arr = (struct array_list*)calloc(1, sizeof(struct array_list)); |
| 32 | if(!arr) return NULL; |
Michael Clark | 266a3fd | 2009-02-25 01:55:31 +0000 | [diff] [blame] | 33 | arr->size = ARRAY_LIST_DEFAULT_SIZE; |
| 34 | arr->length = 0; |
| 35 | arr->free_fn = free_fn; |
Michael Clark | aaec1ef | 2009-02-25 02:31:32 +0000 | [diff] [blame] | 36 | if(!(arr->array = (void**)calloc(sizeof(void*), arr->size))) { |
Michael Clark | 266a3fd | 2009-02-25 01:55:31 +0000 | [diff] [blame] | 37 | free(arr); |
Michael Clark | f0d0888 | 2007-03-13 08:26:18 +0000 | [diff] [blame] | 38 | return NULL; |
| 39 | } |
Michael Clark | 266a3fd | 2009-02-25 01:55:31 +0000 | [diff] [blame] | 40 | return arr; |
Michael Clark | f0d0888 | 2007-03-13 08:26:18 +0000 | [diff] [blame] | 41 | } |
| 42 | |
| 43 | extern void |
Michael Clark | 266a3fd | 2009-02-25 01:55:31 +0000 | [diff] [blame] | 44 | array_list_free(struct array_list *arr) |
Michael Clark | f0d0888 | 2007-03-13 08:26:18 +0000 | [diff] [blame] | 45 | { |
| 46 | int i; |
Michael Clark | 266a3fd | 2009-02-25 01:55:31 +0000 | [diff] [blame] | 47 | for(i = 0; i < arr->length; i++) |
| 48 | if(arr->array[i]) arr->free_fn(arr->array[i]); |
| 49 | free(arr->array); |
| 50 | free(arr); |
Michael Clark | f0d0888 | 2007-03-13 08:26:18 +0000 | [diff] [blame] | 51 | } |
| 52 | |
| 53 | void* |
Michael Clark | 266a3fd | 2009-02-25 01:55:31 +0000 | [diff] [blame] | 54 | array_list_get_idx(struct array_list *arr, int i) |
Michael Clark | f0d0888 | 2007-03-13 08:26:18 +0000 | [diff] [blame] | 55 | { |
Michael Clark | 266a3fd | 2009-02-25 01:55:31 +0000 | [diff] [blame] | 56 | if(i >= arr->length) return NULL; |
| 57 | return arr->array[i]; |
Michael Clark | f0d0888 | 2007-03-13 08:26:18 +0000 | [diff] [blame] | 58 | } |
| 59 | |
Michael Clark | 266a3fd | 2009-02-25 01:55:31 +0000 | [diff] [blame] | 60 | static int array_list_expand_internal(struct array_list *arr, int max) |
Michael Clark | f0d0888 | 2007-03-13 08:26:18 +0000 | [diff] [blame] | 61 | { |
| 62 | void *t; |
| 63 | int new_size; |
| 64 | |
Michael Clark | 266a3fd | 2009-02-25 01:55:31 +0000 | [diff] [blame] | 65 | if(max < arr->size) return 0; |
Michael Clark | 7fb9b03 | 2009-07-25 00:13:44 +0000 | [diff] [blame] | 66 | new_size = json_max(arr->size << 1, max); |
Michael Clark | 266a3fd | 2009-02-25 01:55:31 +0000 | [diff] [blame] | 67 | if(!(t = realloc(arr->array, new_size*sizeof(void*)))) return -1; |
Michael Clark | aaec1ef | 2009-02-25 02:31:32 +0000 | [diff] [blame] | 68 | arr->array = (void**)t; |
Michael Clark | 266a3fd | 2009-02-25 01:55:31 +0000 | [diff] [blame] | 69 | (void)memset(arr->array + arr->size, 0, (new_size-arr->size)*sizeof(void*)); |
| 70 | arr->size = new_size; |
Michael Clark | f0d0888 | 2007-03-13 08:26:18 +0000 | [diff] [blame] | 71 | return 0; |
| 72 | } |
| 73 | |
| 74 | int |
Michael Clark | 266a3fd | 2009-02-25 01:55:31 +0000 | [diff] [blame] | 75 | array_list_put_idx(struct array_list *arr, int idx, void *data) |
Michael Clark | f0d0888 | 2007-03-13 08:26:18 +0000 | [diff] [blame] | 76 | { |
OBI-1 | b6ff1c2 | 2012-05-09 13:52:17 +0300 | [diff] [blame] | 77 | if(array_list_expand_internal(arr, idx+1)) return -1; |
Michael Clark | 266a3fd | 2009-02-25 01:55:31 +0000 | [diff] [blame] | 78 | if(arr->array[idx]) arr->free_fn(arr->array[idx]); |
| 79 | arr->array[idx] = data; |
| 80 | if(arr->length <= idx) arr->length = idx + 1; |
Michael Clark | f0d0888 | 2007-03-13 08:26:18 +0000 | [diff] [blame] | 81 | return 0; |
| 82 | } |
| 83 | |
| 84 | int |
Michael Clark | 266a3fd | 2009-02-25 01:55:31 +0000 | [diff] [blame] | 85 | array_list_add(struct array_list *arr, void *data) |
Michael Clark | f0d0888 | 2007-03-13 08:26:18 +0000 | [diff] [blame] | 86 | { |
Michael Clark | 266a3fd | 2009-02-25 01:55:31 +0000 | [diff] [blame] | 87 | return array_list_put_idx(arr, arr->length, data); |
Michael Clark | f0d0888 | 2007-03-13 08:26:18 +0000 | [diff] [blame] | 88 | } |
| 89 | |
Frederik Deweerdt | c43871c | 2011-10-07 21:07:18 +0200 | [diff] [blame] | 90 | void |
| 91 | array_list_sort(struct array_list *arr, int(*sort_fn)(const void *, const void *)) |
| 92 | { |
| 93 | qsort(arr->array, arr->length, sizeof(arr->array[0]), |
| 94 | (int (*)(const void *, const void *))sort_fn); |
| 95 | } |
| 96 | |
Michael Clark | f0d0888 | 2007-03-13 08:26:18 +0000 | [diff] [blame] | 97 | int |
Michael Clark | 266a3fd | 2009-02-25 01:55:31 +0000 | [diff] [blame] | 98 | array_list_length(struct array_list *arr) |
Michael Clark | f0d0888 | 2007-03-13 08:26:18 +0000 | [diff] [blame] | 99 | { |
Michael Clark | 266a3fd | 2009-02-25 01:55:31 +0000 | [diff] [blame] | 100 | return arr->length; |
Michael Clark | f0d0888 | 2007-03-13 08:26:18 +0000 | [diff] [blame] | 101 | } |