1 /* ddt_new - creation/deletion of datatypes structs (private to this module)*/
\r
3 /* Copyright (c) 2004, 2005, 2006, 2007, 2009, 2010. The SimGrid Team.
\r
4 * All rights reserved. */
\r
6 /* This program is free software; you can redistribute it and/or modify it
\r
7 * under the terms of the license (GNU LGPL) which comes with this package. */
\r
9 #include "xbt/misc.h" /* min()/max() */
\r
11 #include "gras/DataDesc/datadesc_private.h"
\r
13 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(gras_ddt_create, gras_ddt,
\r
14 "Creating new datadescriptions");
\r
16 /*** prototypes ***/
\r
17 static gras_dd_cat_field_t
\r
18 gras_dd_find_field(gras_datadesc_type_t type, const char *field_name);
\r
22 * gime that memory back, dude. I mean it.
\r
24 void gras_ddt_freev(void *ddt)
\r
26 gras_datadesc_type_t type = (gras_datadesc_type_t) ddt;
\r
29 gras_datadesc_free(&type);
\r
33 static gras_datadesc_type_t gras_ddt_new(const char *name)
\r
35 gras_datadesc_type_t res;
\r
37 XBT_IN1("(%s)", name);
\r
38 res = xbt_new0(s_gras_datadesc_type_t, 1);
\r
40 res->name = (char *) strdup(name);
\r
41 res->name_len = strlen(name);
\r
44 xbt_set_add(gras_datadesc_set_local, (xbt_set_elm_t) res, gras_ddt_freev);
\r
49 /** @brief retrieve an existing message type from its name (or NULL if it does not exist). */
\r
50 gras_datadesc_type_t gras_datadesc_by_name_or_null(const char *name)
\r
53 gras_datadesc_type_t res = NULL;
\r
56 res = gras_datadesc_by_name(name);
\r
65 * Search the given datadesc (or raises an exception if it can't be found)
\r
67 gras_datadesc_type_t gras_datadesc_by_name(const char *name)
\r
70 gras_datadesc_type_t res = NULL;
\r
71 volatile int found = 0;
\r
74 (gras_datadesc_type_t) xbt_set_get_by_name(gras_datadesc_set_local,
\r
78 if (e.category != not_found_error)
\r
83 THROW1(not_found_error, 0, "No registred datatype of that name: %s",
\r
90 * Retrieve a type from its code (or NULL if not found)
\r
92 gras_datadesc_type_t gras_datadesc_by_id(long int code)
\r
95 gras_datadesc_type_t res = NULL;
\r
98 (gras_datadesc_type_t) xbt_set_get_by_id(gras_datadesc_set_local, code);
\r
100 if (e.category != not_found_error)
\r
109 * Create a new scalar and give a pointer to it
\r
111 gras_datadesc_type_t
\r
112 gras_datadesc_scalar(const char *name,
\r
113 gras_ddt_scalar_type_t type,
\r
114 enum e_gras_dd_scalar_encoding encoding)
\r
117 gras_datadesc_type_t res;
\r
121 res = gras_datadesc_by_name_or_null(name);
\r
123 xbt_assert1(res->category_code == e_gras_datadesc_type_cat_scalar,
\r
124 "Redefinition of type %s does not match", name);
\r
125 xbt_assert1(res->category.scalar_data.encoding == encoding,
\r
126 "Redefinition of type %s does not match", name);
\r
127 xbt_assert1(res->category.scalar_data.type == type,
\r
128 "Redefinition of type %s does not match", name);
\r
129 VERB1("Discarding redefinition of %s", name);
\r
132 res = gras_ddt_new(name);
\r
134 for (arch = 0; arch < gras_arch_count; arch++) {
\r
135 res->size[arch] = gras_arches[arch].sizeofs[type];
\r
136 res->alignment[arch] = gras_arches[arch].boundaries[type];
\r
137 res->aligned_size[arch] =
\r
138 ddt_aligned(res->size[arch], res->alignment[arch]);
\r
141 res->category_code = e_gras_datadesc_type_cat_scalar;
\r
142 res->category.scalar_data.encoding = encoding;
\r
143 res->category.scalar_data.type = type;
\r
150 /** Frees one struct or union field */
\r
151 void gras_dd_cat_field_free(void *f)
\r
153 gras_dd_cat_field_t field = *(gras_dd_cat_field_t *) f;
\r
163 /** \brief Declare a new structure description */
\r
164 gras_datadesc_type_t gras_datadesc_struct(const char *name)
\r
167 gras_datadesc_type_t res;
\r
170 XBT_IN1("(%s)", name);
\r
171 res = gras_datadesc_by_name_or_null(name);
\r
173 /* FIXME: Check that field redefinition matches */
\r
174 xbt_assert1(res->category_code == e_gras_datadesc_type_cat_struct,
\r
175 "Redefinition of type %s does not match", name);
\r
176 VERB1("Discarding redefinition of %s", name);
\r
179 res = gras_ddt_new(name);
\r
181 for (arch = 0; arch < gras_arch_count; arch++) {
\r
182 res->size[arch] = 0;
\r
183 res->alignment[arch] = 0;
\r
184 res->aligned_size[arch] = 0;
\r
186 res->category_code = e_gras_datadesc_type_cat_struct;
\r
187 res->category.struct_data.fields =
\r
188 xbt_dynar_new(sizeof(gras_dd_cat_field_t), gras_dd_cat_field_free);
\r
194 /** \brief Append a new field to a structure description */
\r
196 gras_datadesc_struct_append(gras_datadesc_type_t struct_type,
\r
197 const char *name, gras_datadesc_type_t field_type)
\r
200 gras_dd_cat_field_t field;
\r
203 xbt_assert2(field_type,
\r
204 "Cannot add the field '%s' into struct '%s': its type is NULL",
\r
205 name, struct_type->name);
\r
206 XBT_IN3("(%s %s.%s;)", field_type->name, struct_type->name, name);
\r
207 if (struct_type->category.struct_data.closed) {
\r
209 ("Ignoring request to add field to struct %s (closed. Redefinition?)",
\r
210 struct_type->name);
\r
214 xbt_assert1(field_type->size[GRAS_THISARCH] >= 0,
\r
215 "Cannot add a dynamically sized field in structure %s",
\r
216 struct_type->name);
\r
218 field = xbt_new(s_gras_dd_cat_field_t, 1);
\r
219 field->name = (char *) strdup(name);
\r
221 DEBUG0("----------------");
\r
222 DEBUG3("PRE s={size=%ld,align=%ld,asize=%ld}",
\r
223 struct_type->size[GRAS_THISARCH],
\r
224 struct_type->alignment[GRAS_THISARCH],
\r
225 struct_type->aligned_size[GRAS_THISARCH]);
\r
228 for (arch = 0; arch < gras_arch_count; arch++) {
\r
229 field->offset[arch] = ddt_aligned(struct_type->size[arch],
\r
230 field_type->alignment[arch]);
\r
232 struct_type->size[arch] = field->offset[arch] + field_type->size[arch];
\r
233 struct_type->alignment[arch] = max(struct_type->alignment[arch],
\r
234 field_type->alignment[arch]);
\r
235 struct_type->aligned_size[arch] = ddt_aligned(struct_type->size[arch],
\r
236 struct_type->alignment
\r
239 field->type = field_type;
\r
240 field->send = NULL;
\r
241 field->recv = NULL;
\r
243 xbt_dynar_push(struct_type->category.struct_data.fields, &field);
\r
245 DEBUG3("Push a %s into %s at offset %ld.",
\r
246 field_type->name, struct_type->name, field->offset[GRAS_THISARCH]);
\r
247 DEBUG3(" f={size=%ld,align=%ld,asize=%ld}",
\r
248 field_type->size[GRAS_THISARCH],
\r
249 field_type->alignment[GRAS_THISARCH],
\r
250 field_type->aligned_size[GRAS_THISARCH]);
\r
251 DEBUG3(" s={size=%ld,align=%ld,asize=%ld}",
\r
252 struct_type->size[GRAS_THISARCH],
\r
253 struct_type->alignment[GRAS_THISARCH],
\r
254 struct_type->aligned_size[GRAS_THISARCH]);
\r
258 /** \brief Close a structure description
\r
260 * No new field can be added afterward, and it is mandatory to close the structure before using it.
\r
262 void gras_datadesc_struct_close(gras_datadesc_type_t struct_type)
\r
266 struct_type->category.struct_data.closed = 1;
\r
267 for (arch = 0; arch < gras_arch_count; arch++) {
\r
268 struct_type->size[arch] = struct_type->aligned_size[arch];
\r
270 DEBUG4("structure %s closed. size=%ld,align=%ld,asize=%ld",
\r
272 struct_type->size[GRAS_THISARCH],
\r
273 struct_type->alignment[GRAS_THISARCH],
\r
274 struct_type->aligned_size[GRAS_THISARCH]);
\r
278 * gras_datadesc_cycle_set:
\r
280 * Tell GRAS that the pointers of the type described by ddt may present
\r
281 * some loop, and that the cycle detection mechanism is needed.
\r
283 * Note that setting this option when not needed have a rather bad effect
\r
284 * on the performance (several times slower on big data).
\r
286 void gras_datadesc_cycle_set(gras_datadesc_type_t ddt)
\r
292 * gras_datadesc_cycle_unset:
\r
294 * Tell GRAS that the pointers of the type described by ddt do not present
\r
295 * any loop and that cycle detection mechanism are not needed.
\r
298 void gras_datadesc_cycle_unset(gras_datadesc_type_t ddt)
\r
303 /** \brief Declare a new union description */
\r
304 gras_datadesc_type_t
\r
305 gras_datadesc_union(const char *name, gras_datadesc_type_cb_int_t selector)
\r
308 gras_datadesc_type_t res;
\r
311 XBT_IN1("(%s)", name);
\r
312 xbt_assert0(selector,
\r
313 "Attempt to creat an union without field_count function");
\r
315 res = gras_datadesc_by_name_or_null(name);
\r
317 /* FIXME: Check that field redefinition matches */
\r
318 xbt_assert1(res->category_code == e_gras_datadesc_type_cat_union,
\r
319 "Redefinition of type %s does not match", name);
\r
320 xbt_assert1(res->category.union_data.selector == selector,
\r
321 "Redefinition of type %s does not match", name);
\r
322 VERB1("Discarding redefinition of %s", name);
\r
326 res = gras_ddt_new(name);
\r
328 for (arch = 0; arch < gras_arch_count; arch++) {
\r
329 res->size[arch] = 0;
\r
330 res->alignment[arch] = 0;
\r
331 res->aligned_size[arch] = 0;
\r
334 res->category_code = e_gras_datadesc_type_cat_union;
\r
335 res->category.union_data.fields =
\r
336 xbt_dynar_new(sizeof(gras_dd_cat_field_t *), gras_dd_cat_field_free);
\r
337 res->category.union_data.selector = selector;
\r
342 /** \brief Append a new field to an union description */
\r
343 void gras_datadesc_union_append(gras_datadesc_type_t union_type,
\r
345 gras_datadesc_type_t field_type)
\r
348 gras_dd_cat_field_t field;
\r
351 XBT_IN3("(%s %s.%s;)", field_type->name, union_type->name, name);
\r
352 xbt_assert1(field_type->size[GRAS_THISARCH] >= 0,
\r
353 "Cannot add a dynamically sized field in union %s",
\r
356 if (union_type->category.union_data.closed) {
\r
357 VERB1("Ignoring request to add field to union %s (closed)",
\r
362 field = xbt_new0(s_gras_dd_cat_field_t, 1);
\r
364 field->name = (char *) strdup(name);
\r
365 field->type = field_type;
\r
366 /* All offset are left to 0 in an union */
\r
368 xbt_dynar_push(union_type->category.union_data.fields, &field);
\r
370 for (arch = 0; arch < gras_arch_count; arch++) {
\r
371 union_type->size[arch] = max(union_type->size[arch],
\r
372 field_type->size[arch]);
\r
373 union_type->alignment[arch] = max(union_type->alignment[arch],
\r
374 field_type->alignment[arch]);
\r
375 union_type->aligned_size[arch] = ddt_aligned(union_type->size[arch],
\r
376 union_type->alignment[arch]);
\r
381 /** \brief Close an union description
\r
383 * No new field can be added afterward, and it is mandatory to close the union before using it.
\r
385 void gras_datadesc_union_close(gras_datadesc_type_t union_type)
\r
387 union_type->category.union_data.closed = 1;
\r
390 /** \brief Copy a type under another name
\r
392 * This may reveal useful to circumvent parsing macro limitations
\r
394 gras_datadesc_type_t
\r
395 gras_datadesc_copy(const char *name, gras_datadesc_type_t copied)
\r
398 gras_datadesc_type_t res = gras_ddt_new(name);
\r
399 char *name_cpy = res->name;
\r
401 memcpy(res, copied, sizeof(s_gras_datadesc_type_t));
\r
402 res->name = name_cpy;
\r
406 /** \brief Declare a new type being a reference to the one passed in arg */
\r
407 gras_datadesc_type_t
\r
408 gras_datadesc_ref(const char *name, gras_datadesc_type_t referenced_type)
\r
411 gras_datadesc_type_t res;
\r
412 gras_datadesc_type_t pointer_type = gras_datadesc_by_name("data pointer");
\r
415 XBT_IN1("(%s)", name);
\r
416 res = gras_datadesc_by_name_or_null(name);
\r
418 xbt_assert1(res->category_code == e_gras_datadesc_type_cat_ref,
\r
419 "Redefinition of %s does not match", name);
\r
420 xbt_assert1(res->category.ref_data.type == referenced_type,
\r
421 "Redefinition of %s does not match", name);
\r
422 xbt_assert1(res->category.ref_data.selector == NULL,
\r
423 "Redefinition of %s does not match", name);
\r
424 VERB1("Discarding redefinition of %s", name);
\r
428 res = gras_ddt_new(name);
\r
430 xbt_assert0(pointer_type, "Cannot get the description of data pointer");
\r
432 for (arch = 0; arch < gras_arch_count; arch++) {
\r
433 res->size[arch] = pointer_type->size[arch];
\r
434 res->alignment[arch] = pointer_type->alignment[arch];
\r
435 res->aligned_size[arch] = pointer_type->aligned_size[arch];
\r
438 res->category_code = e_gras_datadesc_type_cat_ref;
\r
439 res->category.ref_data.type = referenced_type;
\r
440 res->category.ref_data.selector = NULL;
\r
445 /** \brief Declare a new type being a generic reference.
\r
447 * The callback passed in argument is to be used to select which type is currently used.
\r
448 * So, when GRAS wants to send a generic reference, it passes the current data to the selector
\r
449 * callback and expects it to return the type description to use.
\r
451 gras_datadesc_type_t
\r
452 gras_datadesc_ref_generic(const char *name, gras_datadesc_selector_t selector)
\r
455 gras_datadesc_type_t res;
\r
456 gras_datadesc_type_t pointer_type = gras_datadesc_by_name("data pointer");
\r
459 XBT_IN1("(%s)", name);
\r
460 res = gras_datadesc_by_name_or_null(name);
\r
463 xbt_assert1(res->category_code == e_gras_datadesc_type_cat_ref,
\r
464 "Redefinition of type %s does not match", name);
\r
465 xbt_assert1(res->category.ref_data.type == NULL,
\r
466 "Redefinition of type %s does not match", name);
\r
467 xbt_assert1(res->category.ref_data.selector == selector,
\r
468 "Redefinition of type %s does not match", name);
\r
469 VERB1("Discarding redefinition of %s", name);
\r
472 res = gras_ddt_new(name);
\r
474 xbt_assert0(pointer_type, "Cannot get the description of data pointer");
\r
476 for (arch = 0; arch < gras_arch_count; arch++) {
\r
477 res->size[arch] = pointer_type->size[arch];
\r
478 res->alignment[arch] = pointer_type->alignment[arch];
\r
479 res->aligned_size[arch] = pointer_type->aligned_size[arch];
\r
482 res->category_code = e_gras_datadesc_type_cat_ref;
\r
484 res->category.ref_data.type = NULL;
\r
485 res->category.ref_data.selector = selector;
\r
490 /** \brief Declare a new type being an array of fixed size and content */
\r
491 gras_datadesc_type_t
\r
492 gras_datadesc_array_fixed(const char *name,
\r
493 gras_datadesc_type_t element_type,
\r
494 long int fixed_size)
\r
497 gras_datadesc_type_t res;
\r
500 XBT_IN1("(%s)", name);
\r
501 res = gras_datadesc_by_name_or_null(name);
\r
503 xbt_assert1(res->category_code == e_gras_datadesc_type_cat_array,
\r
504 "Redefinition of type %s does not match", name);
\r
506 if (res->category.array_data.type != element_type) {
\r
507 ERROR1("Redefinition of type %s does not match: array elements differ",
\r
509 gras_datadesc_type_dump(res->category.array_data.type);
\r
510 gras_datadesc_type_dump(element_type);
\r
513 xbt_assert1(res->category.array_data.fixed_size == fixed_size,
\r
514 "Redefinition of type %s does not match", name);
\r
515 xbt_assert1(res->category.array_data.dynamic_size == NULL,
\r
516 "Redefinition of type %s does not match", name);
\r
517 VERB1("Discarding redefinition of %s", name);
\r
521 res = gras_ddt_new(name);
\r
523 xbt_assert1(fixed_size >= 0, "'%s' is a array of negative fixed size",
\r
525 for (arch = 0; arch < gras_arch_count; arch++) {
\r
526 res->size[arch] = fixed_size * element_type->aligned_size[arch];
\r
527 res->alignment[arch] = element_type->alignment[arch];
\r
528 res->aligned_size[arch] = res->size[arch];
\r
531 res->category_code = e_gras_datadesc_type_cat_array;
\r
533 res->category.array_data.type = element_type;
\r
534 res->category.array_data.fixed_size = fixed_size;
\r
535 res->category.array_data.dynamic_size = NULL;
\r
540 /** \brief Declare a new type being an array of fixed size, but accepting several content types. */
\r
541 gras_datadesc_type_t gras_datadesc_array_dyn(const char *name,
\r
542 gras_datadesc_type_t
\r
544 gras_datadesc_type_cb_int_t
\r
548 gras_datadesc_type_t res;
\r
551 XBT_IN1("(%s)", name);
\r
552 xbt_assert1(dynamic_size,
\r
553 "'%s' is a dynamic array without size discriminant", name);
\r
555 res = gras_datadesc_by_name_or_null(name);
\r
557 xbt_assert1(res->category_code == e_gras_datadesc_type_cat_array,
\r
558 "Redefinition of type %s does not match", name);
\r
559 xbt_assert1(res->category.array_data.type == element_type,
\r
560 "Redefinition of type %s does not match", name);
\r
561 xbt_assert1(res->category.array_data.fixed_size == -1,
\r
562 "Redefinition of type %s does not match", name);
\r
563 xbt_assert1(res->category.array_data.dynamic_size == dynamic_size,
\r
564 "Redefinition of type %s does not match", name);
\r
565 VERB1("Discarding redefinition of %s", name);
\r
570 res = gras_ddt_new(name);
\r
572 for (arch = 0; arch < gras_arch_count; arch++) {
\r
573 res->size[arch] = 0; /* make sure it indicates "dynamic" */
\r
574 res->alignment[arch] = element_type->alignment[arch];
\r
575 res->aligned_size[arch] = 0; /*FIXME: That was so in GS, but looks stupid */
\r
578 res->category_code = e_gras_datadesc_type_cat_array;
\r
580 res->category.array_data.type = element_type;
\r
581 res->category.array_data.fixed_size = -1;
\r
582 res->category.array_data.dynamic_size = dynamic_size;
\r
587 /** \brief Declare a new type being an array which size can be found with \ref gras_cbps_i_pop
\r
589 * Most of the time, you want to include a reference in your structure which
\r
590 * is a pointer to a dynamic array whose size is fixed by another field of
\r
593 * This case pops up so often that this function was created to take care of
\r
594 * this case. It creates a dynamic array type whose size is poped from the
\r
595 * current cbps, and then create a reference to it.
\r
597 * The name of the created datatype will be the name of the element type, with
\r
598 * '[]*' appended to it.
\r
600 * Then to use it, you just have to make sure that your structure pre-callback
\r
601 * does push the size of the array in the cbps (using #gras_cbps_i_push), and
\r
604 * But be remember that this is a stack. If you have two different pop_arr, you
\r
605 * should push the second one first, so that the first one is on the top of the
\r
606 * list when the first field gets transfered.
\r
609 gras_datadesc_type_t
\r
610 gras_datadesc_ref_pop_arr(gras_datadesc_type_t element_type)
\r
613 gras_datadesc_type_t res,ddt2;
\r
614 char *name = (char *) xbt_malloc(strlen(element_type->name) + 4);
\r
616 sprintf(name, "%s[]", element_type->name);
\r
617 /* Make sure we are not trying to redefine a ddt with the same name */
\r
618 ddt2 = gras_datadesc_by_name_or_null(name);
\r
622 name=bprintf("%s[]_%d",element_type->name,cpt++);
\r
623 ddt2=gras_datadesc_by_name_or_null(name);
\r
626 res = gras_datadesc_array_dyn(name, element_type, gras_datadesc_cb_pop);
\r
628 sprintf(name, "%s[]*", element_type->name);
\r
630 ddt2 = gras_datadesc_by_name_or_null(name);
\r
633 name=bprintf("%s[]*_%d",element_type->name,cpt++);
\r
634 ddt2=gras_datadesc_by_name_or_null(name);
\r
637 res = gras_datadesc_ref(name, res);
\r
646 *## Constructor of container datatypes
\r
650 static void gras_datadesc_dynar_cb(gras_datadesc_type_t typedesc,
\r
651 gras_cbps_t vars, void *data)
\r
653 gras_datadesc_type_t subtype;
\r
654 xbt_dynar_t dynar = (xbt_dynar_t) data;
\r
656 memcpy(&dynar->free_f, &typedesc->extra, sizeof(dynar->free_f));
\r
658 /* search for the elemsize in what we have. If elements are "int", typedesc got is "int[]*" */
\r
659 subtype = gras_dd_find_field(typedesc, "data")->type;
\r
661 /* this is now a ref to array of what we're looking for */
\r
662 subtype = subtype->category.ref_data.type;
\r
663 subtype = subtype->category.array_data.type;
\r
665 DEBUG1("subtype is %s", subtype->name);
\r
667 dynar->elmsize = subtype->size[GRAS_THISARCH];
\r
668 dynar->size = dynar->used;
\r
669 dynar->mutex = NULL;
\r
672 /** \brief Declare a new type being a dynar in which each elements are of the given type
\r
674 * The type gets registered under the name "dynar(%s)_s", where %s is the name of the subtype.
\r
675 * For example, a dynar of doubles will be called "dynar(double)_s" and a dynar of dynar of
\r
676 * strings will be called "dynar(dynar(string)_s)_s".
\r
678 * \param elm_t: the datadesc of the elements
\r
679 * \param free_func: the function to use to free the elements when the dynar gets freed
\r
681 gras_datadesc_type_t
\r
682 gras_datadesc_dynar(gras_datadesc_type_t elm_t, void_f_pvoid_t free_func)
\r
686 gras_datadesc_type_t res;
\r
688 asprintf(&buffname, "s_xbt_dynar_of_%s", elm_t->name);
\r
690 res = gras_datadesc_struct(buffname);
\r
692 gras_datadesc_struct_append(res, "size",
\r
693 gras_datadesc_by_name("unsigned long int"));
\r
695 gras_datadesc_struct_append(res, "used",
\r
696 gras_datadesc_by_name("unsigned long int"));
\r
698 gras_datadesc_struct_append(res, "elmsize",
\r
699 gras_datadesc_by_name("unsigned long int"));
\r
701 gras_datadesc_struct_append(res, "data", gras_datadesc_ref_pop_arr(elm_t));
\r
703 gras_datadesc_struct_append(res, "free_f",
\r
704 gras_datadesc_by_name("function pointer"));
\r
705 memcpy(res->extra, &free_func, sizeof(free_func));
\r
707 gras_datadesc_struct_append(res, "mutex",
\r
708 gras_datadesc_by_name("data pointer"));
\r
710 gras_datadesc_struct_close(res);
\r
712 gras_datadesc_cb_field_push(res, "used");
\r
713 gras_datadesc_cb_recv(res, &gras_datadesc_dynar_cb);
\r
715 /* build a ref to it */
\r
717 asprintf(&buffname, "xbt_dynar_of_%s", elm_t->name);
\r
718 res = gras_datadesc_ref(buffname, res);
\r
723 #include "xbt/matrix.h"
\r
724 static void gras_datadesc_matrix_cb(gras_datadesc_type_t typedesc,
\r
725 gras_cbps_t vars, void *data)
\r
727 gras_datadesc_type_t subtype;
\r
728 xbt_matrix_t matrix = (xbt_matrix_t) data;
\r
730 memcpy(&matrix->free_f, &typedesc->extra, sizeof(matrix->free_f));
\r
732 /* search for the elemsize in what we have. If elements are "int", typedesc got is "int[]*" */
\r
733 subtype = gras_dd_find_field(typedesc, "data")->type;
\r
735 /* this is now a ref to array of what we're looking for */
\r
736 subtype = subtype->category.ref_data.type;
\r
737 subtype = subtype->category.array_data.type;
\r
739 DEBUG1("subtype is %s", subtype->name);
\r
741 matrix->elmsize = subtype->size[GRAS_THISARCH];
\r
744 gras_datadesc_type_t
\r
745 gras_datadesc_matrix(gras_datadesc_type_t elm_t, void_f_pvoid_t const free_f)
\r
748 gras_datadesc_type_t res;
\r
750 asprintf(&buffname, "s_xbt_matrix_t(%s)", elm_t->name);
\r
751 res = gras_datadesc_struct(buffname);
\r
753 gras_datadesc_struct_append(res, "lines",
\r
754 gras_datadesc_by_name("unsigned int"));
\r
755 gras_datadesc_struct_append(res, "rows",
\r
756 gras_datadesc_by_name("unsigned int"));
\r
758 gras_datadesc_struct_append(res, "elmsize",
\r
759 gras_datadesc_by_name("unsigned long int"));
\r
761 gras_datadesc_struct_append(res, "data", gras_datadesc_ref_pop_arr(elm_t));
\r
762 gras_datadesc_struct_append(res, "free_f",
\r
763 gras_datadesc_by_name("function pointer"));
\r
764 gras_datadesc_struct_close(res);
\r
766 gras_datadesc_cb_field_push(res, "lines");
\r
767 gras_datadesc_cb_field_push_multiplier(res, "rows");
\r
769 gras_datadesc_cb_recv(res, &gras_datadesc_matrix_cb);
\r
770 memcpy(res->extra, &free_f, sizeof(free_f));
\r
772 /* build a ref to it */
\r
774 asprintf(&buffname, "xbt_matrix_t(%s)", elm_t->name);
\r
775 res = gras_datadesc_ref(buffname, res);
\r
780 gras_datadesc_type_t
\r
781 gras_datadesc_import_nws(const char *name,
\r
782 const DataDescriptor * desc, unsigned long howmany)
\r
784 THROW_UNIMPLEMENTED;
\r
788 * (useful to push the sizes of the upcoming arrays, for example)
\r
790 void gras_datadesc_cb_send(gras_datadesc_type_t type,
\r
791 gras_datadesc_type_cb_void_t send)
\r
797 * (useful to put the function pointers to the rigth value, for example)
\r
799 void gras_datadesc_cb_recv(gras_datadesc_type_t type,
\r
800 gras_datadesc_type_cb_void_t recv)
\r
806 * gras_dd_find_field:
\r
808 * Returns the type descriptor of the given field. Abort on error.
\r
810 static gras_dd_cat_field_t
\r
811 gras_dd_find_field(gras_datadesc_type_t type, const char *field_name)
\r
813 xbt_dynar_t field_array;
\r
815 gras_dd_cat_field_t field = NULL;
\r
816 unsigned int field_num;
\r
818 if (type->category_code == e_gras_datadesc_type_cat_union) {
\r
819 field_array = type->category.union_data.fields;
\r
820 } else if (type->category_code == e_gras_datadesc_type_cat_struct) {
\r
821 field_array = type->category.struct_data.fields;
\r
823 ERROR2("%s (%p) is not a struct nor an union. There is no field.",
\r
824 type->name, (void *) type);
\r
827 xbt_dynar_foreach(field_array, field_num, field) {
\r
828 if (!strcmp(field_name, field->name)) {
\r
832 ERROR2("No field named '%s' in '%s'", field_name, type->name);
\r
838 * The given datadesc must be a struct or union (abort if not).
\r
839 * (useful to push the sizes of the upcoming arrays, for example)
\r
841 void gras_datadesc_cb_field_send(gras_datadesc_type_t type,
\r
842 const char *field_name,
\r
843 gras_datadesc_type_cb_void_t send)
\r
846 gras_dd_cat_field_t field = gras_dd_find_field(type, field_name);
\r
847 field->send = send;
\r
852 * The value, which must be an int, unsigned int, long int or unsigned long int
\r
853 * is pushed to the stacks of sizes and can then be retrieved with
\r
854 * \ref gras_datadesc_ref_pop_arr or directly with \ref gras_cbps_i_pop.
\r
856 void gras_datadesc_cb_field_push(gras_datadesc_type_t type,
\r
857 const char *field_name)
\r
860 gras_dd_cat_field_t field = gras_dd_find_field(type, field_name);
\r
861 gras_datadesc_type_t sub_type = field->type;
\r
863 DEBUG3("add a PUSHy cb to '%s' field (type '%s') of '%s'",
\r
864 field_name, sub_type->name, type->name);
\r
865 if (!strcmp("int", sub_type->name)) {
\r
866 field->send = gras_datadesc_cb_push_int;
\r
867 } else if (!strcmp("unsigned int", sub_type->name)) {
\r
868 field->send = gras_datadesc_cb_push_uint;
\r
869 } else if (!strcmp("long int", sub_type->name)) {
\r
870 field->send = gras_datadesc_cb_push_lint;
\r
871 } else if (!strcmp("unsigned long int", sub_type->name)) {
\r
872 field->send = gras_datadesc_cb_push_ulint;
\r
875 ("Field %s is not an int, unsigned int, long int neither unsigned long int",
\r
882 * Any previously pushed value is poped and the field value is multiplied to
\r
883 * it. The result is then pushed back into the stack of sizes. It can then be
\r
884 * retrieved with \ref gras_datadesc_ref_pop_arr or directly with \ref
\r
887 * The field must be an int, unsigned int, long int or unsigned long int.
\r
889 void gras_datadesc_cb_field_push_multiplier(gras_datadesc_type_t type,
\r
890 const char *field_name)
\r
893 gras_dd_cat_field_t field = gras_dd_find_field(type, field_name);
\r
894 gras_datadesc_type_t sub_type = field->type;
\r
896 DEBUG3("add a MPUSHy cb to '%s' field (type '%s') of '%s'",
\r
897 field_name, sub_type->name, type->name);
\r
898 if (!strcmp("int", sub_type->name)) {
\r
899 field->send = gras_datadesc_cb_push_int_mult;
\r
900 } else if (!strcmp("unsigned int", sub_type->name)) {
\r
901 field->send = gras_datadesc_cb_push_uint_mult;
\r
902 } else if (!strcmp("long int", sub_type->name)) {
\r
903 field->send = gras_datadesc_cb_push_lint_mult;
\r
904 } else if (!strcmp("unsigned long int", sub_type->name)) {
\r
905 field->send = gras_datadesc_cb_push_ulint_mult;
\r
908 ("Field %s is not an int, unsigned int, long int neither unsigned long int",
\r
915 * The given datadesc must be a struct or union (abort if not).
\r
916 * (useful to put the function pointers to the right value, for example)
\r
918 void gras_datadesc_cb_field_recv(gras_datadesc_type_t type,
\r
919 const char *field_name,
\r
920 gras_datadesc_type_cb_void_t recv)
\r
923 gras_dd_cat_field_t field = gras_dd_find_field(type, field_name);
\r
924 field->recv = recv;
\r
928 * Free a datadesc. Should only be called at xbt_exit.
\r
930 void gras_datadesc_free(gras_datadesc_type_t * type)
\r
933 DEBUG1("Let's free ddt %s", (*type)->name);
\r
935 switch ((*type)->category_code) {
\r
936 case e_gras_datadesc_type_cat_scalar:
\r
937 case e_gras_datadesc_type_cat_ref:
\r
938 case e_gras_datadesc_type_cat_array:
\r
939 /* nothing to free in there */
\r
942 case e_gras_datadesc_type_cat_struct:
\r
943 xbt_dynar_free(&((*type)->category.struct_data.fields));
\r
946 case e_gras_datadesc_type_cat_union:
\r
947 xbt_dynar_free(&((*type)->category.union_data.fields));
\r
951 /* datadesc was invalid. Killing it is like euthanasy, I guess */
\r
954 free((*type)->name);
\r
960 * gras_datadesc_type_cmp:
\r
962 * Compares two datadesc types with the same semantic than strcmp.
\r
964 * This comparison does not take the set headers into account (name and ID),
\r
965 * but only the payload (actual type description).
\r
967 int gras_datadesc_type_cmp(const gras_datadesc_type_t d1,
\r
968 const gras_datadesc_type_t d2)
\r
972 gras_dd_cat_field_t field1, field2;
\r
973 gras_datadesc_type_t field_desc_1, field_desc_2;
\r
976 return 0; /* easy optimization */
\r
979 DEBUG0("ddt_cmp: !d1 && d2 => 1");
\r
983 DEBUG0("ddt_cmp: !d1 && !d2 => 0");
\r
987 DEBUG0("ddt_cmp: d1 && !d2 => -1");
\r
991 for (cpt = 0; cpt < gras_arch_count; cpt++) {
\r
992 if (d1->size[cpt] != d2->size[cpt]) {
\r
993 DEBUG5("ddt_cmp: %s->size=%ld != %s->size=%ld (on %s)",
\r
994 d1->name, d1->size[cpt], d2->name, d2->size[cpt],
\r
995 gras_arches[cpt].name);
\r
996 return d1->size[cpt] > d2->size[cpt] ? 1 : -1;
\r
999 if (d1->alignment[cpt] != d2->alignment[cpt]) {
\r
1000 DEBUG5("ddt_cmp: %s->alignment=%ld != %s->alignment=%ld (on %s)",
\r
1001 d1->name, d1->alignment[cpt], d2->name, d2->alignment[cpt],
\r
1002 gras_arches[cpt].name);
\r
1003 return d1->alignment[cpt] > d2->alignment[cpt] ? 1 : -1;
\r
1006 if (d1->aligned_size[cpt] != d2->aligned_size[cpt]) {
\r
1008 ("ddt_cmp: %s->aligned_size=%ld != %s->aligned_size=%ld (on %s)",
\r
1009 d1->name, d1->aligned_size[cpt], d2->name, d2->aligned_size[cpt],
\r
1010 gras_arches[cpt].name);
\r
1011 return d1->aligned_size[cpt] > d2->aligned_size[cpt] ? 1 : -1;
\r
1015 if (d1->category_code != d2->category_code) {
\r
1016 DEBUG4("ddt_cmp: %s->cat=%s != %s->cat=%s",
\r
1017 d1->name, gras_datadesc_cat_names[d1->category_code],
\r
1018 d2->name, gras_datadesc_cat_names[d2->category_code]);
\r
1019 return d1->category_code > d2->category_code ? 1 : -1;
\r
1022 if (d1->send != d2->send) {
\r
1023 DEBUG4("ddt_cmp: %s->send=%p != %s->send=%p",
\r
1024 d1->name, (void *) d1->send, d2->name, (void *) d2->send);
\r
1025 return 1; /* ISO C forbids ordered comparisons of pointers to functions */
\r
1028 if (d1->recv != d2->recv) {
\r
1029 DEBUG4("ddt_cmp: %s->recv=%p != %s->recv=%p",
\r
1030 d1->name, (void *) d1->recv, d2->name, (void *) d2->recv);
\r
1031 return 1; /* ISO C forbids ordered comparisons of pointers to functions */
\r
1034 switch (d1->category_code) {
\r
1035 case e_gras_datadesc_type_cat_scalar:
\r
1036 if (d1->category.scalar_data.encoding !=
\r
1037 d2->category.scalar_data.encoding)
\r
1038 return d1->category.scalar_data.encoding >
\r
1039 d2->category.scalar_data.encoding ? 1 : -1;
\r
1042 case e_gras_datadesc_type_cat_struct:
\r
1043 if (xbt_dynar_length(d1->category.struct_data.fields) !=
\r
1044 xbt_dynar_length(d2->category.struct_data.fields)) {
\r
1045 DEBUG4("ddt_cmp: %s (having %lu fields) != %s (having %lu fields)",
\r
1046 d1->name, xbt_dynar_length(d1->category.struct_data.fields),
\r
1047 d2->name, xbt_dynar_length(d2->category.struct_data.fields));
\r
1049 return xbt_dynar_length(d1->category.struct_data.fields) >
\r
1050 xbt_dynar_length(d2->category.struct_data.fields) ? 1 : -1;
\r
1052 xbt_dynar_foreach(d1->category.struct_data.fields, cpt, field1) {
\r
1055 xbt_dynar_get_as(d2->category.struct_data.fields, cpt,
\r
1056 gras_dd_cat_field_t);
\r
1057 field_desc_1 = field1->type;
\r
1058 field_desc_2 = field2->type;
\r
1059 ret = gras_datadesc_type_cmp(field_desc_1, field_desc_2);
\r
1061 DEBUG6("%s->field[%d]=%s != %s->field[%d]=%s",
\r
1062 d1->name, cpt, field1->name, d2->name, cpt, field2->name);
\r
1069 case e_gras_datadesc_type_cat_union:
\r
1070 if (d1->category.union_data.selector != d2->category.union_data.selector)
\r
1071 return 1; /* ISO C forbids ordered comparisons of pointers to functions */
\r
1073 if (xbt_dynar_length(d1->category.union_data.fields) !=
\r
1074 xbt_dynar_length(d2->category.union_data.fields))
\r
1075 return xbt_dynar_length(d1->category.union_data.fields) >
\r
1076 xbt_dynar_length(d2->category.union_data.fields) ? 1 : -1;
\r
1078 xbt_dynar_foreach(d1->category.union_data.fields, cpt, field1) {
\r
1081 xbt_dynar_get_as(d2->category.union_data.fields, cpt,
\r
1082 gras_dd_cat_field_t);
\r
1083 field_desc_1 = field1->type;
\r
1084 field_desc_2 = field2->type;
\r
1085 ret = gras_datadesc_type_cmp(field_desc_1, field_desc_2);
\r
1093 case e_gras_datadesc_type_cat_ref:
\r
1094 if (d1->category.ref_data.selector != d2->category.ref_data.selector)
\r
1095 return 1; /* ISO C forbids ordered comparisons of pointers to functions */
\r
1097 if (d1->category.ref_data.type != d2->category.ref_data.type)
\r
1098 return d1->category.ref_data.type > d2->category.ref_data.type ? 1 : -1;
\r
1101 case e_gras_datadesc_type_cat_array:
\r
1102 if (d1->category.array_data.type != d2->category.array_data.type)
\r
1103 return d1->category.array_data.type >
\r
1104 d2->category.array_data.type ? 1 : -1;
\r
1106 if (d1->category.array_data.fixed_size !=
\r
1107 d2->category.array_data.fixed_size)
\r
1108 return d1->category.array_data.fixed_size >
\r
1109 d2->category.array_data.fixed_size ? 1 : -1;
\r
1111 if (d1->category.array_data.dynamic_size !=
\r
1112 d2->category.array_data.dynamic_size)
\r
1113 return 1; /* ISO C forbids ordered comparisons of pointers to functions */
\r
1118 /* two stupidly created ddt are equally stupid ;) */
\r