author | zautrix <zautrix> | 2005-07-04 19:21:19 (UTC) |
---|---|---|
committer | zautrix <zautrix> | 2005-07-04 19:21:19 (UTC) |
commit | 16898aecbedb978169efef1e1e0233578a42a46e (patch) (unidiff) | |
tree | a391b6c44fd2df62daf5f643393af03bf051f4f0 /libical | |
parent | 2710cddd5b0b69efc1c5a7f8516d5b451ff258f1 (diff) | |
download | kdepimpi-16898aecbedb978169efef1e1e0233578a42a46e.zip kdepimpi-16898aecbedb978169efef1e1e0233578a42a46e.tar.gz kdepimpi-16898aecbedb978169efef1e1e0233578a42a46e.tar.bz2 |
free ring buffer
-rw-r--r-- | libical/src/libical/icalmemory.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/libical/src/libical/icalmemory.c b/libical/src/libical/icalmemory.c index 3ed38ad..d22561e 100644 --- a/libical/src/libical/icalmemory.c +++ b/libical/src/libical/icalmemory.c | |||
@@ -1,168 +1,168 @@ | |||
1 | /* -*- Mode: C -*- | 1 | /* -*- Mode: C -*- |
2 | ====================================================================== | 2 | ====================================================================== |
3 | FILE: icalmemory.c | 3 | FILE: icalmemory.c |
4 | CREATOR: eric 30 June 1999 | 4 | CREATOR: eric 30 June 1999 |
5 | 5 | ||
6 | $Id$ | 6 | $Id$ |
7 | $Locker$ | 7 | $Locker$ |
8 | 8 | ||
9 | The contents of this file are subject to the Mozilla Public License | 9 | The contents of this file are subject to the Mozilla Public License |
10 | Version 1.0 (the "License"); you may not use this file except in | 10 | Version 1.0 (the "License"); you may not use this file except in |
11 | compliance with the License. You may obtain a copy of the License at | 11 | compliance with the License. You may obtain a copy of the License at |
12 | http://www.mozilla.org/MPL/ | 12 | http://www.mozilla.org/MPL/ |
13 | 13 | ||
14 | Software distributed under the License is distributed on an "AS IS" | 14 | Software distributed under the License is distributed on an "AS IS" |
15 | basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See | 15 | basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See |
16 | the License for the specific language governing rights and | 16 | the License for the specific language governing rights and |
17 | limitations under the License. | 17 | limitations under the License. |
18 | 18 | ||
19 | 19 | ||
20 | This program is free software; you can redistribute it and/or modify | 20 | This program is free software; you can redistribute it and/or modify |
21 | it under the terms of either: | 21 | it under the terms of either: |
22 | 22 | ||
23 | The LGPL as published by the Free Software Foundation, version | 23 | The LGPL as published by the Free Software Foundation, version |
24 | 2.1, available at: http://www.fsf.org/copyleft/lesser.html | 24 | 2.1, available at: http://www.fsf.org/copyleft/lesser.html |
25 | 25 | ||
26 | Or: | 26 | Or: |
27 | 27 | ||
28 | The Mozilla Public License Version 1.0. You may obtain a copy of | 28 | The Mozilla Public License Version 1.0. You may obtain a copy of |
29 | the License at http://www.mozilla.org/MPL/ | 29 | the License at http://www.mozilla.org/MPL/ |
30 | 30 | ||
31 | The Original Code is icalmemory.h | 31 | The Original Code is icalmemory.h |
32 | 32 | ||
33 | ======================================================================*/ | 33 | ======================================================================*/ |
34 | 34 | ||
35 | /** | 35 | /** |
36 | * @file icalmemory.c | 36 | * @file icalmemory.c |
37 | * @brief Common memory management routines. | 37 | * @brief Common memory management routines. |
38 | * | 38 | * |
39 | * libical often passes strings back to the caller. To make these | 39 | * libical often passes strings back to the caller. To make these |
40 | * interfaces simple, I did not want the caller to have to pass in a | 40 | * interfaces simple, I did not want the caller to have to pass in a |
41 | * memory buffer, but having libical pass out newly allocated memory | 41 | * memory buffer, but having libical pass out newly allocated memory |
42 | * makes it difficult to de-allocate the memory. | 42 | * makes it difficult to de-allocate the memory. |
43 | * | 43 | * |
44 | * The ring buffer in this scheme makes it possible for libical to pass | 44 | * The ring buffer in this scheme makes it possible for libical to pass |
45 | * out references to memory which the caller does not own, and be able | 45 | * out references to memory which the caller does not own, and be able |
46 | * to de-allocate the memory later. The ring allows libical to have | 46 | * to de-allocate the memory later. The ring allows libical to have |
47 | * several buffers active simultaneously, which is handy when creating | 47 | * several buffers active simultaneously, which is handy when creating |
48 | * string representations of components. | 48 | * string representations of components. |
49 | */ | 49 | */ |
50 | 50 | ||
51 | #define ICALMEMORY_C | 51 | #define ICALMEMORY_C |
52 | 52 | ||
53 | #ifdef HAVE_CONFIG_H | 53 | #ifdef HAVE_CONFIG_H |
54 | #include "config.h" | 54 | #include "config.h" |
55 | #endif | 55 | #endif |
56 | 56 | ||
57 | #ifdef DMALLOC | 57 | #ifdef DMALLOC |
58 | #include "dmalloc.h" | 58 | #include "dmalloc.h" |
59 | #endif | 59 | #endif |
60 | 60 | ||
61 | #include "icalmemory.h" | 61 | #include "icalmemory.h" |
62 | #include "icalerror.h" | 62 | #include "icalerror.h" |
63 | 63 | ||
64 | #include <stdio.h> /* for printf (debugging) */ | 64 | #include <stdio.h> /* for printf (debugging) */ |
65 | #include <stdlib.h> /* for malloc, realloc */ | 65 | #include <stdlib.h> /* for malloc, realloc */ |
66 | #include <string.h> /* for memset(), strdup */ | 66 | #include <string.h> /* for memset(), strdup */ |
67 | 67 | ||
68 | #ifdef WIN32 | 68 | #ifdef WIN32 |
69 | #include <windows.h> | 69 | #include <windows.h> |
70 | #endif | 70 | #endif |
71 | 71 | ||
72 | #define BUFFER_RING_SIZE 100 | 72 | #define BUFFER_RING_SIZE 25 |
73 | #define MIN_BUFFER_SIZE 64 | 73 | #define MIN_BUFFER_SIZE 64 |
74 | 74 | ||
75 | 75 | ||
76 | /* HACK. Not threadsafe */ | 76 | /* HACK. Not threadsafe */ |
77 | 77 | ||
78 | typedef struct { | 78 | typedef struct { |
79 | int pos; | 79 | int pos; |
80 | void *ring[BUFFER_RING_SIZE]; | 80 | void *ring[BUFFER_RING_SIZE]; |
81 | } buffer_ring; | 81 | } buffer_ring; |
82 | 82 | ||
83 | void icalmemory_free_tmp_buffer (void* buf); | 83 | void icalmemory_free_tmp_buffer (void* buf); |
84 | void icalmemory_free_ring_byval(buffer_ring *br); | 84 | void icalmemory_free_ring_byval(buffer_ring *br); |
85 | 85 | ||
86 | static buffer_ring* global_buffer_ring = 0; | 86 | static buffer_ring* global_buffer_ring = 0; |
87 | 87 | ||
88 | #ifdef HAVE_PTHREAD | 88 | #ifdef HAVE_PTHREAD |
89 | #include <pthread.h> | 89 | #include <pthread.h> |
90 | 90 | ||
91 | static pthread_key_t ring_key; | 91 | static pthread_key_t ring_key; |
92 | static pthread_once_t ring_key_once = PTHREAD_ONCE_INIT; | 92 | static pthread_once_t ring_key_once = PTHREAD_ONCE_INIT; |
93 | 93 | ||
94 | static void ring_destroy(void * buf) { | 94 | static void ring_destroy(void * buf) { |
95 | if (buf) icalmemory_free_ring_byval((buffer_ring *) buf); | 95 | if (buf) icalmemory_free_ring_byval((buffer_ring *) buf); |
96 | pthread_setspecific(ring_key, NULL); | 96 | pthread_setspecific(ring_key, NULL); |
97 | } | 97 | } |
98 | 98 | ||
99 | static void ring_key_alloc(void) { | 99 | static void ring_key_alloc(void) { |
100 | pthread_key_create(&ring_key, ring_destroy); | 100 | pthread_key_create(&ring_key, ring_destroy); |
101 | } | 101 | } |
102 | #endif | 102 | #endif |
103 | 103 | ||
104 | 104 | ||
105 | static buffer_ring * buffer_ring_new(void) { | 105 | static buffer_ring * buffer_ring_new(void) { |
106 | buffer_ring *br; | 106 | buffer_ring *br; |
107 | int i; | 107 | int i; |
108 | 108 | ||
109 | br = (buffer_ring *)malloc(sizeof(buffer_ring)); | 109 | br = (buffer_ring *)malloc(sizeof(buffer_ring)); |
110 | 110 | ||
111 | for(i=0; i<BUFFER_RING_SIZE; i++){ | 111 | for(i=0; i<BUFFER_RING_SIZE; i++){ |
112 | br->ring[i] = 0; | 112 | br->ring[i] = 0; |
113 | } | 113 | } |
114 | br->pos = 0; | 114 | br->pos = 0; |
115 | return(br); | 115 | return(br); |
116 | } | 116 | } |
117 | 117 | ||
118 | 118 | ||
119 | #ifdef HAVE_PTHREAD | 119 | #ifdef HAVE_PTHREAD |
120 | static buffer_ring* get_buffer_ring_pthread(void) { | 120 | static buffer_ring* get_buffer_ring_pthread(void) { |
121 | buffer_ring *br; | 121 | buffer_ring *br; |
122 | 122 | ||
123 | pthread_once(&ring_key_once, ring_key_alloc); | 123 | pthread_once(&ring_key_once, ring_key_alloc); |
124 | 124 | ||
125 | br = pthread_getspecific(ring_key); | 125 | br = pthread_getspecific(ring_key); |
126 | 126 | ||
127 | if (!br) { | 127 | if (!br) { |
128 | br = buffer_ring_new(); | 128 | br = buffer_ring_new(); |
129 | pthread_setspecific(ring_key, br); | 129 | pthread_setspecific(ring_key, br); |
130 | } | 130 | } |
131 | return(br); | 131 | return(br); |
132 | } | 132 | } |
133 | #endif | 133 | #endif |
134 | 134 | ||
135 | /* get buffer ring via a single global for a non-threaded program */ | 135 | /* get buffer ring via a single global for a non-threaded program */ |
136 | static buffer_ring* get_buffer_ring_global(void) { | 136 | static buffer_ring* get_buffer_ring_global(void) { |
137 | if (global_buffer_ring == 0) { | 137 | if (global_buffer_ring == 0) { |
138 | global_buffer_ring = buffer_ring_new(); | 138 | global_buffer_ring = buffer_ring_new(); |
139 | } | 139 | } |
140 | return(global_buffer_ring); | 140 | return(global_buffer_ring); |
141 | } | 141 | } |
142 | 142 | ||
143 | static buffer_ring *get_buffer_ring(void) { | 143 | static buffer_ring *get_buffer_ring(void) { |
144 | #ifdef HAVE_PTHREAD | 144 | #ifdef HAVE_PTHREAD |
145 | return(get_buffer_ring_pthread()); | 145 | return(get_buffer_ring_pthread()); |
146 | #else | 146 | #else |
147 | return get_buffer_ring_global(); | 147 | return get_buffer_ring_global(); |
148 | #endif | 148 | #endif |
149 | } | 149 | } |
150 | 150 | ||
151 | 151 | ||
152 | /** Add an existing buffer to the buffer ring */ | 152 | /** Add an existing buffer to the buffer ring */ |
153 | void icalmemory_add_tmp_buffer(void* buf) | 153 | void icalmemory_add_tmp_buffer(void* buf) |
154 | { | 154 | { |
155 | buffer_ring *br = get_buffer_ring(); | 155 | buffer_ring *br = get_buffer_ring(); |
156 | 156 | ||
157 | 157 | ||
158 | /* Wrap around the ring */ | 158 | /* Wrap around the ring */ |
159 | if(++(br->pos) == BUFFER_RING_SIZE){ | 159 | if(++(br->pos) == BUFFER_RING_SIZE){ |
160 | br->pos = 0; | 160 | br->pos = 0; |
161 | } | 161 | } |
162 | 162 | ||
163 | /* Free buffers as their slots are overwritten */ | 163 | /* Free buffers as their slots are overwritten */ |
164 | if ( br->ring[br->pos] != 0){ | 164 | if ( br->ring[br->pos] != 0){ |
165 | free( br->ring[br->pos]); | 165 | free( br->ring[br->pos]); |
166 | } | 166 | } |
167 | 167 | ||
168 | /* Assign the buffer to a slot */ | 168 | /* Assign the buffer to a slot */ |