-
- len = gras_dynar_length(p_elm->sub);
-
- for (p = 0; p < len; p++) {
- int cmp = 0;
-
- _dict_child_cmp(p_elm, p, key, key_len, &o, &m, &cmp);
-
- if (m)
- break;
-
- o = *p_offset;
- m = 0;
- }
-
- *p_offset = o;
- *p_pos = p;
- *p_match = m;
- CDEBUG5(dict_search, "search [%.*s] in [%.*s] => %s",
- key_len, key,
- p_elm?p_elm->key_len:6, p_elm?p_elm->key:"(head)",
- ( m == 0 ? "no child have a common prefix" :
- ( m == 1 ? "selected child have exactly this key" :
- ( m == 2 ? "selected child constitutes a prefix" :
- ( m == 3 ? "key is a prefix of selected child" :
- (m == 4 ? "selected child share a prefix" :
- "internal error")))))
- );
-}
-
-/**
- * _gras_dictelm_change_value:
- *
- * Change the value of the dictelm, making sure to free the old one, if any.
- */
-static _GRAS_INLINE
-void
-_gras_dictelm_change_value(gras_dictelm_t *p_elm,
- void *data,
- void_f_pvoid_t *free_ctn) {
-
- if (p_elm->content && p_elm->free_ctn) {
- p_elm->free_ctn(p_elm->content);
- }
-
- p_elm->free_ctn = free_ctn;
- p_elm->content = data;
-}
-
-/**
- * _gras_dictelm_set_rec:
- *
- * @head: the head of the dict
- * @key: the key to set the new data
- * @offset: offset on key.
- * @data: the data to add in the dict
- * @Returns: a gras_error
- *
- * set the @data in the structure under the @key. The @key is destroyed
- * in the process. Think to strdup it before.
- *
- * This is a helper function to gras_dict_set which locks the struct and
- * strdup the key before action.
- */
-void
-_gras_dictelm_set_rec(gras_dictelm_t *p_head,
- char *key,
- int key_len,
- int offset,
- void *data,
- void_f_pvoid_t *free_ctn) {
- int match = 0;
- int pos = 0;
- const int old_offset = offset;
-
- CDEBUG6(dict_add, "--> Insert '%.*s' after '%.*s' (offset=%d) in tree %p",
- key_len, key,
- ((p_head && p_head->key) ? p_head->key_len : 6),
- ((p_head && p_head->key) ? p_head->key : "(head)"),
- offset, (void*)p_head);
-
- /*** The trivial cases first ***/
-
- /* there is no key (we did enough recursion), change the value of head */
- if (offset >= key_len) {
-
- CDEBUG0(dict_add, "--> Change the value of head");
-
- _gras_dictelm_change_value(p_head, data, free_ctn);
- gras_free(key); /* Keep the key used in the tree */
-
- return;
- }
-
- /*** Search where to add this child, and how ***/
- _gras_dictelm_child_search(p_head, key, key_len, &pos, &offset, &match);
-
- CDEBUG3(dict_add, "child_search => pos=%d, offset=%d, match=%d",
- pos, offset, match);
-
- switch (match) {
-
- case 0: /* no child have a common prefix */
- {
- gras_dictelm_t *p_child = NULL;
-
- _gras_dictelm_alloc(key, key_len, offset, data, free_ctn, &p_child);
- CDEBUG1(dict_add, "-> Add a child %p", (void*)p_child);
- gras_dynar_insert_at(p_head->sub, pos, &p_child);
-
- return;
- }
-
- case 1: /* A child have exactly this key => change its value*/
- {
- gras_dictelm_t *p_child = NULL;
-
- gras_dynar_get(p_head->sub, pos, &p_child);
- CDEBUG1(dict_add, "-> Change the value of the child %p", (void*)p_child);
- _gras_dictelm_change_value(p_child, data, free_ctn);
-
- gras_free(key);
-
- return;
- }
-
- case 2: /* A child constitutes a prefix of the key => recurse */
- {
- gras_dictelm_t *p_child = NULL;
-
- gras_dynar_get(p_head->sub, pos, &p_child);
- CDEBUG2(dict_add,"-> Recurse on %p (offset=%d)", (void*)p_child, offset);
-
- _gras_dictelm_set_rec(p_child, key, key_len,
- offset, data, free_ctn);
- return;
- }
-
- case 3: /* The key is a prefix of the child => child becomes child of p_new */
- {
- gras_dictelm_t *p_new = NULL;
- gras_dictelm_t *p_child = NULL;
-
- gras_dynar_get(p_head->sub, pos, &p_child);
- _gras_dictelm_alloc(key, key_len, old_offset, data, free_ctn, &p_new);
-
- CDEBUG2(dict_add, "-> The child %p become child of new dict (%p)",
- (void*)p_child, (void*)p_new);
-
- gras_dynar_push(p_new->sub, &p_child);
- p_child->offset = offset;
- gras_dynar_set(p_head->sub, pos, &p_new);
-
- return;
- }
-
- case 4: /* A child share a common prefix with this key => Common ancestor */
- {
- gras_dictelm_t *p_new = NULL;
- gras_dictelm_t *p_child = NULL;
- gras_dictelm_t *p_anc = NULL;
- char *anc_key = NULL;
- int anc_key_len = offset;
-
- _gras_dictelm_alloc(key, key_len, offset, data, free_ctn, &p_new);
- gras_dynar_get(p_head->sub, pos, &p_child);
-
- anc_key = gras_memdup(key, anc_key_len);
-
- _gras_dictelm_alloc(anc_key, anc_key_len, old_offset, NULL, NULL, &p_anc);
-
- CDEBUG3(dict_add, "-> Make a common ancestor %p (%.*s)",
- (void*)p_anc, anc_key_len, anc_key);
-
- if (key[offset] < p_child->key[offset]) {
- gras_dynar_push(p_anc->sub, &p_new);
- gras_dynar_push(p_anc->sub, &p_child);
- } else {
- gras_dynar_push(p_anc->sub, &p_child);
- gras_dynar_push(p_anc->sub, &p_new);
- }
-
- p_child->offset = offset;
-
- gras_dynar_set(p_head->sub, pos, &p_anc);
-
- return;
- }
-
- default:
- DIE_IMPOSSIBLE;
- }