Function tpl_copy

app/wizard/tpllib.cpp:575–693

Recursive copy */

/* Recursive copy */
void tpl_copy(tpl_t* tpl, const tpl_t* srctpl)
{
    tpl_node_t **tail = &tpl->head;
    tpl_node_t *curr_node = srctpl->head;
    tpl_tcell_t **last_section = &tpl->first;
    tpl_tcell_t *curr_section = srctpl->first;

    for (; curr_section != NULL; curr_section = curr_section->next)
    {
        /* Copy text and fields until the current section's position */
        while (curr_node != *curr_section->preceding)
        {
            /* Text */
            if (curr_node->val != NULL)
            {
                *tail = create_node(curr_node->len);
                (void)memcpy((*tail)->val, curr_node->val, curr_node->len);
                (*tail)->val[curr_node->len] = 0;
            }
            /* Field */
            else
            {
                /* Create node and set fval to field cell */
                *tail = create_node(0);
                (*tail)->val = NULL;

                tpl_cpy_field((*tail)->fval, 
                              tpl,
                              curr_node->fval->key,
                              (int) strlen(curr_node->fval->key),
                              curr_node->fval->val,
                              curr_node->fval->len);

            }

            tail = &(*tail)->next;
            curr_node = curr_node->next;
        }

        /* Create emtpy section entry for current section */
        *last_section = tpl_make_section(tpl,
                                         curr_section->key,
                                         (int) strlen(curr_section->key));

        (*last_section)->preceding = tail;


        /* Consolidate added content into a single node in newly created
           section entry so that only one memory allocation is needed */
        if (curr_section->tpl->added_head != NULL)
        {
            tpl_node_t *some_node = curr_section->tpl->added_head;
            char *buffer;
            int len = 0;

            /* Get length of added content */
            for (; some_node!=NULL; some_node=some_node->next)
                len += some_node->len;