]> code.delx.au - pulseaudio/blob - polyp/dynarray.c
add simple hardware auto detection module
[pulseaudio] / polyp / 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 "dynarray.h"
31 #include "xmalloc.h"
32
33 /* If the array becomes to small, increase its size by 100 entries */
34 #define INCREASE_BY 100
35
36 struct pa_dynarray {
37 void **data;
38 unsigned n_allocated, n_entries;
39 };
40
41 pa_dynarray* pa_dynarray_new(void) {
42 pa_dynarray *a;
43 a = pa_xnew(pa_dynarray, 1);
44 a->data = NULL;
45 a->n_entries = 0;
46 a->n_allocated = 0;
47 return a;
48 }
49
50 void pa_dynarray_free(pa_dynarray* a, void (*func)(void *p, void *userdata), void *userdata) {
51 unsigned i;
52 assert(a);
53
54 if (func)
55 for (i = 0; i < a->n_entries; i++)
56 if (a->data[i])
57 func(a->data[i], userdata);
58
59 pa_xfree(a->data);
60 pa_xfree(a);
61 }
62
63 void pa_dynarray_put(pa_dynarray*a, unsigned i, void *p) {
64 assert(a);
65
66 if (i >= a->n_allocated) {
67 unsigned n;
68
69 if (!p)
70 return;
71
72 n = i+INCREASE_BY;
73 a->data = pa_xrealloc(a->data, sizeof(void*)*n);
74 memset(a->data+a->n_allocated, 0, sizeof(void*)*(n-a->n_allocated));
75 a->n_allocated = n;
76 }
77
78 a->data[i] = p;
79
80 if (i >= a->n_entries)
81 a->n_entries = i+1;
82 }
83
84 unsigned pa_dynarray_append(pa_dynarray*a, void *p) {
85 unsigned i = a->n_entries;
86 pa_dynarray_put(a, i, p);
87 return i;
88 }
89
90 void *pa_dynarray_get(pa_dynarray*a, unsigned i) {
91 assert(a);
92 if (i >= a->n_allocated)
93 return NULL;
94
95 assert(a->data);
96 return a->data[i];
97 }
98
99 unsigned pa_dynarray_size(pa_dynarray*a) {
100 assert(a);
101 return a->n_entries;
102 }