]> code.delx.au - pulseaudio/blob - src/pulsecore/dynarray.c
Remove unnecessary #includes
[pulseaudio] / src / pulsecore / dynarray.c
1 /***
2 This file is part of PulseAudio.
3
4 Copyright 2004-2008 Lennart Poettering
5
6 PulseAudio 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 PulseAudio 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 PulseAudio; 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 <stdlib.h>
28
29 #include <pulse/xmalloc.h>
30 #include <pulsecore/macro.h>
31
32 #include "dynarray.h"
33
34 /* If the array becomes to small, increase its size by 25 entries */
35 #define INCREASE_BY 25
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
45 a = pa_xnew(pa_dynarray, 1);
46 a->data = NULL;
47 a->n_entries = 0;
48 a->n_allocated = 0;
49
50 return a;
51 }
52
53 void pa_dynarray_free(pa_dynarray* a, pa_free2_cb_t free_func, void *userdata) {
54 unsigned i;
55 pa_assert(a);
56
57 if (free_func)
58 for (i = 0; i < a->n_entries; i++)
59 if (a->data[i])
60 free_func(a->data[i], userdata);
61
62 pa_xfree(a->data);
63 pa_xfree(a);
64 }
65
66 void pa_dynarray_put(pa_dynarray*a, unsigned i, void *p) {
67 pa_assert(a);
68
69 if (i >= a->n_allocated) {
70 unsigned n;
71
72 if (!p)
73 return;
74
75 n = i+INCREASE_BY;
76 a->data = pa_xrealloc(a->data, sizeof(void*)*n);
77 memset(a->data+a->n_allocated, 0, sizeof(void*)*(n-a->n_allocated));
78 a->n_allocated = n;
79 }
80
81 a->data[i] = p;
82
83 if (i >= a->n_entries)
84 a->n_entries = i+1;
85 }
86
87 unsigned pa_dynarray_append(pa_dynarray*a, void *p) {
88 unsigned i;
89
90 pa_assert(a);
91
92 i = a->n_entries;
93 pa_dynarray_put(a, i, p);
94
95 return i;
96 }
97
98 void *pa_dynarray_get(pa_dynarray*a, unsigned i) {
99 pa_assert(a);
100
101 if (i >= a->n_entries)
102 return NULL;
103
104 pa_assert(a->data);
105 return a->data[i];
106 }
107
108 unsigned pa_dynarray_size(pa_dynarray*a) {
109 pa_assert(a);
110
111 return a->n_entries;
112 }