/* * storycode.c * * Copyright (c) 2012 Thomas White * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . * */ #ifdef HAVE_CONFIG_H #include #endif #include #include #include #include #include #include "storycode.h" struct _scblocklist { int n_blocks; int max_blocks; struct scblock *blocks; }; struct _scblocklistiterator { int pos; }; static int allocate_blocks(SCBlockList *bl) { struct scblock *blocks_new; blocks_new = realloc(bl->blocks, bl->max_blocks*sizeof(struct scblock)); if ( blocks_new == NULL ) { return 1; } bl->blocks = blocks_new; return 0; } SCBlockList *sc_block_list_new() { SCBlockList *bl; bl = calloc(1, sizeof(SCBlockList)); if ( bl == NULL ) return NULL; bl->n_blocks = 0; bl->max_blocks = 64; bl->blocks = NULL; if ( allocate_blocks(bl) ) { free(bl); return NULL; } return bl; } void sc_block_list_free(SCBlockList *bl) { int i; for ( i=0; in_blocks; i++ ) { free(bl->blocks[i].name); free(bl->blocks[i].options); free(bl->blocks[i].contents); } free(bl->blocks); free(bl); } struct scblock *sc_block_list_first(SCBlockList *bl, SCBlockListIterator **piter) { SCBlockListIterator *iter; if ( bl->n_blocks == 0 ) return NULL; iter = calloc(1, sizeof(SCBlockListIterator)); if ( iter == NULL ) return NULL; iter->pos = 0; *piter = iter; return &bl->blocks[0]; } struct scblock *sc_block_list_next(SCBlockList *bl, SCBlockListIterator *iter) { iter->pos++; if ( iter->pos == bl->n_blocks ) { free(iter); return NULL; } return &bl->blocks[iter->pos]; } static int sc_block_list_add(SCBlockList *bl, char *name, char *options, char *contents) { if ( bl->n_blocks == bl->max_blocks ) { bl->max_blocks += 64; if ( allocate_blocks(bl) ) return 1; } bl->blocks[bl->n_blocks].name = name; bl->blocks[bl->n_blocks].options = options; bl->blocks[bl->n_blocks].contents = contents; bl->n_blocks++; return 0; } static int get_subexpr(const char *sc, char *bk, char **pcontents, int *err) { size_t ml; int i; int bct = 1; int found = 0; char *contents; *err = 0; ml = strlen(sc); contents = malloc(ml+1); if ( contents == NULL ) { *err = -1; return 0; } *pcontents = contents; for ( i=0; iname == NULL ) { strcat(out, b->contents); } else { if ( strcmp(blockname, b->name) != 0 ) { strcat(out, "\\"); strcat(out, b->name); if ( b->options != NULL ) { strcat(out, "["); strcat(out, b->options); strcat(out, "]"); } if ( b->contents != NULL ) { strcat(out, "{"); strcat(out, b->contents); strcat(out, "}"); } if ( (b->options == NULL) && (b->contents == NULL) ) { strcat(out, " "); } } } } sc_block_list_free(bl); return out; }