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
|
/*
* object.c
*
* Copyright (C) 2006-2008 Simon Wunderlich <dotslash@packetmixer.de>
*
* This file is part of s3dosm, a gps card application for s3d.
* See http://s3d.berlios.de/ for more updates.
*
* s3dosm 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 2 of the License, or
* (at your option) any later version.
*
* s3dosm 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 s3dosm; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "s3dosm.h"
#include <stdlib.h> /* malloc() */
/* ########### object ############### */
void object_free(object_t *obj)
{
int i;
for (i = 0;i < obj->tag_n;i++)
tag_free(&(obj->tag_p[i]));
}
void object_init(object_t *nobj)
{
nobj->bal = 0;
nobj->left = NULL;
nobj->right = NULL;
nobj->id = 0;
nobj->oid = -1;
nobj->layerid = -1;
nobj->tagid = -1;
nobj->tag_n = 0;
nobj->tag_p = NULL;
nobj->type = T_OBJECT;
}
object_t* object_new(int key)
{
object_t *nobj = (object_t*)malloc(sizeof(object_t));
object_init(nobj);
nobj->id = key;
return (nobj);
}
/* ########### node ############### */
void node_init(node_t *nnode)
{
object_init((object_t *)nnode);
OBJECT_T(nnode)->type = T_NODE;
nnode->lat = 0;
nnode->lon = 0;
nnode->alt = 0;
nnode->visible = 1;
nnode->vid = -1;
nnode->adj_n = 0;
nnode->adj_p = NULL;
}
node_t* node_new(void)
{
node_t *nnode = (node_t*)malloc(sizeof(node_t));
node_init(nnode);
return(nnode);
}
void node_free(node_t *node)
{
free(node);
}
/* ########### segment ############### */
void segment_init(segment_t *nsegment)
{
object_init((object_t *)nsegment);
OBJECT_T(nsegment)->type = T_SEGMENT;
nsegment->from = 0;
nsegment->to = 0;
}
segment_t* segment_new(void)
{
segment_t *nsegment = (segment_t*)malloc(sizeof(segment_t));
segment_init(nsegment);
return(nsegment);
}
void segment_free(segment_t *segment)
{
free(segment);
}
/* ########### way ############### */
void way_init(way_t *nway)
{
object_init((object_t *)nway);
OBJECT_T(nway)->type = T_WAY;
nway->seg_n = 0;
nway->seg_p = NULL;
}
way_t* way_new(void)
{
way_t *nway = (way_t*)malloc(sizeof(way_t));
way_init(nway);
return(nway);
}
void way_free(way_t *way)
{
if (way->seg_n > 0)
free(way->seg_p);
free(way);
}
/* ########### layer ############### */
layer_t* layer_new(void)
{
layer_t *nlayer = (layer_t*)malloc(sizeof(layer_t));
nlayer->tree = NULL;
nlayer->visible = 0;
return(nlayer);
}
/* ########### layerset ############### */
layerset_t layerset = {0, NULL};
void layerset_add(layer_t *layer)
{
if (layer == NULL) return;
layerset.n++;
layerset.p = (layer_t**)realloc(layerset.p, sizeof(layer_t *) * layerset.n);
layerset.p[layerset.n-1] = layer;
}
|
