3 /* cbps - persistant states for callbacks */
5 /* Copyright (c) 2003 Olivier Aumage. */
6 /* Copyright (c) 2003, 2004 Martin Quinson. */
7 /* All rights reserved. */
9 /* This program is free software; you can redistribute it and/or modify it
10 * under the terms of the license (GNU LGPL) which comes with this package. */
13 #include "gras/DataDesc/datadesc_private.h"
14 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(ddt_cbps,datadesc,"callback persistant state");
17 gras_datadesc_type_t type;
19 } s_gras_cbps_elm_t, *gras_cbps_elm_t;
21 typedef struct s_gras_cbps {
22 xbt_dynar_t lints; /* simple stack of long integers (easy interface) */
24 xbt_dict_t space; /* varname x dynar of gras_cbps_elm_t */
25 xbt_dynar_t frames; /* of dynar of names defined within this frame
26 (and to pop when we leave it) */
30 void free_string(void *d);
32 void free_string(void *d){
36 gras_cbps_t gras_cbps_new(void) {
39 res=xbt_new(s_gras_cbps_t,1);
41 res->lints = xbt_dynar_new(sizeof(int), NULL);
42 res->space = xbt_dict_new();
43 /* no leak, the content is freed manually on block_end */
44 res->frames = xbt_dynar_new(sizeof(xbt_dynar_t), NULL);
45 res->globals = xbt_dynar_new(sizeof(char*), NULL);
47 gras_cbps_block_begin(res);
52 void gras_cbps_free(gras_cbps_t *state) {
54 xbt_dynar_free( &( (*state)->lints ) );
56 gras_cbps_block_end(*state);
57 xbt_dict_free ( &( (*state)->space ) );
58 xbt_dynar_free( &( (*state)->frames ) );
59 xbt_dynar_free( &( (*state)->globals ) );
65 /** \brief Declare a new element in the PS, and give it a value.
67 * If an element of that
68 * name already exists, it is masked by the one given here, and will be
69 * seeable again only after a pop to remove the value this push adds.
72 gras_cbps_v_push(gras_cbps_t ps,
75 gras_datadesc_type_t ddt) {
77 xbt_dynar_t varstack,frame;
79 char *varname = (char*)strdup(name);
82 DEBUG2("push(%s,%p)",name,(void*)data);
85 varstack = xbt_dict_get(ps->space, name);
87 if (e.category == mismatch_error) {
88 DEBUG1("Create a new variable stack for '%s' into the space",name);
89 varstack = xbt_dynar_new(sizeof (gras_cbps_elm_t *), NULL);
90 xbt_dict_set(ps->space, varname, (void **)varstack, NULL);
92 /* leaking, you think? only if you do not close all the openned blocks ;)*/
98 var = xbt_new0(s_gras_cbps_elm_t,1);
102 xbt_dynar_push(varstack, &var);
104 xbt_dynar_pop(ps->frames, &frame);
105 DEBUG4("Push %s (%p @%p) into frame %p",varname,(void*)varname,(void*)&varname,(void*)frame);
106 xbt_dynar_push(frame, &varname);
107 xbt_dynar_push(ps->frames, &frame);
111 /** \brief Retrieve an element from the PS, and remove it from the PS.
114 * present in the current block, it will fail (with abort) and not search
115 * in upper blocks since this denotes a programmation error.
118 gras_cbps_v_pop (gras_cbps_t ps,
120 gras_datadesc_type_t *ddt,
122 xbt_dynar_t varstack,frame;
123 gras_cbps_elm_t var = NULL;
127 DEBUG1("pop(%s)",name);
129 varstack = xbt_dict_get(ps->space, name);
131 if (e.category == mismatch_error) {
133 THROW1(mismatch_error,1,"Asked to pop the non-existant %s",
138 xbt_dynar_pop(varstack, &var);
140 if (!xbt_dynar_length(varstack)) {
141 DEBUG1("Last incarnation of %s poped. Kill it",name);
142 xbt_dict_remove(ps->space, name);
143 xbt_dynar_free(&varstack);
152 xbt_dynar_pop(ps->frames, &frame);
154 int l = xbt_dynar_length(frame);
159 _name = xbt_dynar_get_as(frame, l, char*);
160 if (!strcmp(name, _name)) {
161 xbt_dynar_remove_at(frame, l, &_name);
167 xbt_dynar_push(ps->frames, &frame);
173 /** \brief Change the value of an element in the PS.
175 * If it's not present in the current block, look in the upper ones.
176 * If it's not present in any of them, modify in the globals
177 * If not present there neither, the code may segfault (Oli?).
179 * Once a reference to an element of that name is found somewhere in the PS,
180 * its value is changed.
183 gras_cbps_v_set (gras_cbps_t ps,
186 gras_datadesc_type_t ddt) {
188 xbt_dynar_t dynar = NULL;
189 gras_cbps_elm_t elm = NULL;
192 DEBUG1("set(%s)",name);
194 dynar = xbt_dict_get(ps->space, name);
196 if (e.category == mismatch_error) {
205 dynar = xbt_dynar_new(sizeof (gras_cbps_elm_t), NULL);
206 xbt_dict_set(ps->space, name, (void **)dynar, NULL);
208 elm = xbt_new0(s_gras_cbps_elm_t,1);
209 xbt_dynar_push(ps->globals, &name);
211 xbt_dynar_pop(dynar, &elm);
217 xbt_dynar_push(dynar, &elm);
221 /** \brief Get the value of an element in the PS without modifying it.
223 * (note that you get the content of the data struct and not a copy to it)
224 * If it's not present in the current block, look in the upper ones.
225 * If it's not present in any of them, look in the globals
226 * If not present there neither, the code may segfault (Oli?).
229 gras_cbps_v_get (gras_cbps_t ps,
231 /* OUT */gras_datadesc_type_t *ddt) {
233 xbt_dynar_t dynar = NULL;
234 gras_cbps_elm_t elm = NULL;
236 DEBUG1("get(%s)",name);
237 dynar = xbt_dict_get(ps->space, name);
238 xbt_dynar_pop(dynar, &elm);
239 xbt_dynar_push(dynar, &elm);
249 /** \brief Begins a new block.
251 * Blocks are usefull to remove a whole set of declarations you don't even know
253 * E.g., they constitute an elegent solution to recursive data structures.
255 * push/pop may be used in some cases for that, but if your recursive data
256 * struct contains other structs needing themselves callbacks, you have to
257 * use block_{begin,end} to do the trick.
261 gras_cbps_block_begin(gras_cbps_t ps) {
263 xbt_dynar_t dynar = NULL;
265 DEBUG0(">>> Block begin");
266 dynar = xbt_dynar_new(sizeof (char *), NULL);
267 xbt_dynar_push(ps->frames, &dynar);
270 /** \brief End the current block, and go back to the upper one. */
272 gras_cbps_block_end(gras_cbps_t ps) {
274 xbt_dynar_t frame = NULL;
278 xbt_assert0(xbt_dynar_length(ps->frames),
279 "More block_end than block_begin");
280 xbt_dynar_pop(ps->frames, &frame);
282 xbt_dynar_foreach(frame, cursor, name) {
284 xbt_dynar_t varstack = NULL;
285 gras_cbps_elm_t var = NULL;
287 DEBUG2("Get ride of %s (%p)",name,(void*)name);
288 varstack = xbt_dict_get(ps->space, name);
289 xbt_dynar_pop(varstack, &var);
291 if (!xbt_dynar_length(varstack)) {
292 xbt_dict_remove(ps->space, name);
293 xbt_dynar_free_container(&varstack); /*already empty, save a test ;) */
296 if (var->data) free(var->data);
300 xbt_dynar_free_container(&frame);/* we just emptied it */
301 DEBUG0("<<< Block end");
305 /** \brief Push a new integer value into the cbps. */
307 gras_cbps_i_push(gras_cbps_t ps,
309 DEBUG1("push %d as a size",val);
310 xbt_dynar_push_as(ps->lints,int,val);
312 /** \brief Pop the lastly pushed integer value from the cbps. */
314 gras_cbps_i_pop(gras_cbps_t ps) {
317 xbt_assert0(xbt_dynar_length(ps->lints) > 0,
318 "gras_cbps_i_pop: no value to pop");
319 ret = xbt_dynar_pop_as(ps->lints,int);
320 DEBUG1("pop %d as a size",ret);
324 /** \brief Generic cb returning the lastly pushed value
326 * Used by \ref gras_datadesc_ref_pop_arr
328 int gras_datadesc_cb_pop(gras_datadesc_type_t ignored, gras_cbps_t vars, void *data) {
329 return gras_cbps_i_pop(vars);
332 /** \brief Cb to push an integer. Must be attached to the field you want to push */
333 void gras_datadesc_cb_push_int(gras_datadesc_type_t ignored, gras_cbps_t vars, void *data) {
335 gras_cbps_i_push(vars, (int) *i);
338 /** \brief Cb to push an unsigned integer. Must be attached to the field you want to push */
339 void gras_datadesc_cb_push_uint(gras_datadesc_type_t ignored, gras_cbps_t vars, void *data) {
340 unsigned int *i = (unsigned int*)data;
341 gras_cbps_i_push(vars, (int) *i);
344 /** \brief Cb to push an long integer. Must be attached to the field you want to push
346 void gras_datadesc_cb_push_lint(gras_datadesc_type_t ignored, gras_cbps_t vars, void *data) {
347 long int *i = (long int*)data;
348 gras_cbps_i_push(vars, (int) *i);
350 /** \brief Cb to push an long integer. Must be attached to the field you want to push
352 void gras_datadesc_cb_push_ulint(gras_datadesc_type_t ignored, gras_cbps_t vars, void *data) {
353 unsigned long int *i = (unsigned long int*)data;
354 gras_cbps_i_push(vars, (int) *i);