]> code.delx.au - pulseaudio/blob - src/polypcore/dynarray.c
unhide padsp
[pulseaudio] / src / polypcore / dynarray.c
1 /* $Id$ */
2
3 /***
4 This file is part of polypaudio.
5
6 polypaudio is free software; you can redistribute it and/or modify
7 it under the terms of the GNU Lesser General Public License as
8 published by the Free Software Foundation; either version 2.1 of the
9 License, or (at your option) any later version.
10
11 polypaudio is distributed in the hope that it will be useful, but
12 WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 Lesser General Public License for more details.
15
16 You should have received a copy of the GNU Lesser General Public
17 License along with polypaudio; if not, write to the Free Software
18 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
19 USA.
20 ***/
21
22 #ifdef HAVE_CONFIG_H
23 #include <config.h>
24 #endif
25
26 #include <string.h>
27 #include <assert.h>
28 #include <stdlib.h>
29
30 #include <polyp/xmalloc.h>
31
32 #include "dynarray.h"
33
34 /* If the array becomes to small, increase its size by 100 entries */
35 #define INCREASE_BY 100
36
37 struct pa_dynarray {
38 void **data;
39 unsigned n_allocated, n_entries;
40 };
41
42 pa_dynarray* pa_dynarray_new(void) {
43 pa_dynarray *a;
44 a = pa_xnew(pa_dynarray, 1);
45 a->data = NULL;
46 a->n_entries = 0;
47 a->n_allocated = 0;
48 return a;
49 }
50
51 void pa_dynarray_free(pa_dynarray* a, void (*func)(void *p, void *userdata), void *userdata) {
52 unsigned i;
53 assert(a);
54
55 if (func)
56 for (i = 0; i < a->n_entries; i++)
57 if (a->data[i])
58 func(a->data[i], userdata);
59
60 pa_xfree(a->data);
61 pa_xfree(a);
62 }
63
64 void pa_dynarray_put(pa_dynarray*a, unsigned i, void *p) {
65 assert(a);
66
67 if (i >= a->n_allocated) {
68 unsigned n;
69
70 if (!p)
71 return;
72
73 n = i+INCREASE_BY;
74 a->data = pa_xrealloc(a->data, sizeof(void*)*n);
75 memset(a->data+a->n_allocated, 0, sizeof(void*)*(n-a->n_allocated));
76 a->n_allocated = n;
77 }
78
79 a->data[i] = p;
80
81 if (i >= a->n_entries)
82 a->n_entries = i+1;
83 }
84
85 unsigned pa_dynarray_append(pa_dynarray*a, void *p) {
86 unsigned i = a->n_entries;
87 pa_dynarray_put(a, i, p);
88 return i;
89 }
90
91 void *pa_dynarray_get(pa_dynarray*a, unsigned i) {
92 assert(a);
93 if (i >= a->n_allocated)
94 return NULL;
95
96 assert(a->data);
97 return a->data[i];
98 }
99
100 unsigned pa_dynarray_size(pa_dynarray*a) {
101 assert(a);
102 return a->n_entries;
103 }