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
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
|
/*
* frame.c
*
* Copyright © 2013 Thomas White <taw@bitwiz.org.uk>
*
* This file is part of Colloquium.
*
* Colloquium 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 "sc_parse.h"
#include "frame.h"
#include "wrap.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;
if ( alloc_ro(n) ) {
fprintf(stderr, "Couldn't allocate children\n");
free(n);
return NULL;
}
n->num_children = 0;
n->scblocks = NULL;
n->boxes = malloc(sizeof(struct wrap_line));
if ( n->boxes == NULL ) {
fprintf(stderr, "Failed to allocate boxes.\n");
free(n);
return NULL;
}
initialise_line(n->boxes);
return n;
}
void frame_free(struct frame *fr)
{
int i;
if ( fr == NULL ) return;
/* Free all lines */
for ( i=0; i<fr->n_lines; i++ ) {
wrap_line_free(&fr->lines[i]);
}
free(fr->lines);
/* Free paragraphs */
if ( fr->paragraphs != NULL ) {
for ( i=0; i<fr->n_paragraphs; i++ ) {
free(fr->paragraphs[i]->boxes);
free(fr->paragraphs[i]);
}
free(fr->paragraphs);
}
/* Free unwrapped boxes */
if ( fr->boxes != NULL ) {
free(fr->boxes->boxes);
free(fr->boxes);
}
/* Free all children */
for ( i=0; i<fr->num_children; i++ ) {
frame_free(fr->children[i]);
}
free(fr->children);
free(fr);
}
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;
}
void show_hierarchy(struct frame *fr, const char *t)
{
int i;
char tn[1024];
strcpy(tn, t);
strcat(tn, " ");
printf("%s%p (%.2f x %.2f)\n", t, fr, fr->w, fr->h);
for ( i=0; i<fr->num_children; i++ ) {
show_hierarchy(fr->children[i], tn);
}
}
static struct frame *find_parent(struct frame *fr, struct frame *search)
{
int i;
for ( i=0; i<fr->num_children; i++ ) {
if ( fr->children[i] == search ) {
return fr;
}
}
for ( i=0; i<fr->num_children; i++ ) {
struct frame *tt;
tt = find_parent(fr->children[i], search);
if ( tt != NULL ) return tt;
}
return NULL;
}
void delete_subframe(struct frame *top, struct frame *fr)
{
struct frame *parent;
int i, idx, found;
parent = find_parent(top, fr);
if ( parent == NULL ) {
fprintf(stderr, "Couldn't find parent when deleting frame.\n");
return;
}
found = 0;
for ( i=0; i<parent->num_children; i++ ) {
if ( parent->children[i] == fr ) {
idx = i;
found = 1;
break;
}
}
if ( !found ) {
fprintf(stderr, "Couldn't find child when deleting frame.\n");
return;
}
for ( i=idx; i<parent->num_children-1; i++ ) {
parent->children[i] = parent->children[i+1];
}
parent->num_children--;
}
|
