1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
|
/*
* frame.c
*
* Colloquium - A tiny presentation program
*
* Copyright (c) 2012 Thomas White <taw@bitwiz.org.uk>
*
* 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 <http://www.gnu.org/licenses/>.
*
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <assert.h>
#include <stdlib.h>
#include <string.h>
#include "storycode.h"
#include "frame.h"
static int alloc_ro(struct frame *fr)
{
struct frame **new_ro;
new_ro = realloc(fr->children,
fr->max_children*sizeof(struct frame *));
if ( new_ro == NULL ) return 1;
fr->children = new_ro;
return 0;
}
struct frame *frame_new()
{
struct frame *n;
n = calloc(1, sizeof(struct frame));
if ( n == NULL ) return NULL;
n->children = NULL;
n->max_children = 32;
alloc_ro(n);
n->num_children = 0;
n->pl = NULL;
n->contents = NULL;
return n;
}
struct frame *add_subframe(struct frame *fr)
{
struct frame *n;
n = frame_new();
if ( n == NULL ) return NULL;
if ( fr->num_children == fr->max_children ) {
fr->max_children += 32;
if ( alloc_ro(fr) ) return NULL;
}
fr->children[fr->num_children++] = n;
return n;
}
static void show_heirarchy(struct frame *fr, const char *t)
{
int i;
char tn[1024];
strcpy(tn, t);
strcat(tn, " |-> ");
printf("%s%p %s\n", t, fr, fr->sc);
for ( i=0; i<fr->num_children; i++ ) {
if ( fr->children[i] != fr ) {
show_heirarchy(fr->children[i], tn);
} else {
printf("%s<this frame>\n", tn);
}
}
}
static void recursive_unpack(struct frame *fr, const char *sc)
{
SCBlockList *bl;
SCBlockListIterator *iter;
struct scblock *b;
bl = sc_find_blocks(sc, "f");
for ( b = sc_block_list_first(bl, &iter);
b != NULL;
b = sc_block_list_next(bl, iter) )
{
struct frame *sfr;
sfr = add_subframe(fr);
sfr->sc = remove_blocks(b->contents, "f");
recursive_unpack(sfr, b->contents);
}
sc_block_list_free(bl);
}
/* Unpack level 2 StoryCode (content + subframes) into frames */
struct frame *sc_unpack(const char *sc)
{
struct frame *fr;
fr = frame_new();
if ( fr == NULL ) return NULL;
fr->sc = remove_blocks(sc, "f");
recursive_unpack(fr, sc);
show_heirarchy(fr, "");
return fr;
}
|
