pj_gridlist.c
9.03 KB
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
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
/******************************************************************************
* $Id: pj_gridlist.c,v 1.5 2006/11/17 22:16:30 mloskot Exp $
*
* Project: PROJ.4
* Purpose: Code to manage the list of currently loaded (cached) PJ_GRIDINFOs
* See pj_gridinfo.c for details of loading individual grids.
* Author: Frank Warmerdam, warmerdam@pobox.com
*
******************************************************************************
* Copyright (c) 2000, Frank Warmerdam <warmerdam@pobox.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
******************************************************************************
*
* $Log: pj_gridlist.c,v $
* Revision 1.5 2006/11/17 22:16:30 mloskot
* Uploaded PROJ.4 port for Windows CE.
*
* Revision 1.4 2005/11/01 05:56:13 fwarmerdam
* improved error handling if gridcount is zero
*
* Revision 1.3 2003/03/18 16:26:58 warmerda
* clear error if missing file is not required
*
* Revision 1.2 2003/03/17 19:45:47 warmerda
* support '@' marker for optional grids
*
* Revision 1.1 2003/03/15 06:01:18 warmerda
* New
*
*/
#define PJ_LIB__
#include "projects.h"
#include <string.h>
#include <math.h>
#ifdef _WIN32_WCE
/* assert.h includes all Windows API headers and causes 'LP' name clash.
* Here assert we disable assert() for Windows CE.
* TODO - mloskot: re-implement porting friendly assert
*/
# define assert(exp) ((void)0)
#else
# include <assert.h>
#endif /* _WIN32_WCE */
static PJ_GRIDINFO *grid_list = NULL;
/* used only by pj_load_nadgrids() and pj_deallocate_grids() */
static int last_nadgrids_max = 0;
static int last_nadgrids_count = 0;
static PJ_GRIDINFO **last_nadgrids_list = NULL;
static char *last_nadgrids = NULL;
/************************************************************************/
/* pj_deallocate_grids() */
/* */
/* Deallocate all loaded grids. */
/************************************************************************/
void pj_deallocate_grids()
{
while( grid_list != NULL )
{
PJ_GRIDINFO *item = grid_list;
grid_list = grid_list->next;
item->next = NULL;
pj_gridinfo_free( item );
}
if( last_nadgrids != NULL )
{
pj_dalloc( last_nadgrids );
last_nadgrids = NULL;
pj_dalloc( last_nadgrids_list );
last_nadgrids_list = NULL;
last_nadgrids_count = 0;
last_nadgrids_max = 0;
}
}
/************************************************************************/
/* pj_gridlist_merge_grid() */
/* */
/* Find/load the named gridfile and merge it into the */
/* last_nadgrids_list. */
/************************************************************************/
static int pj_gridlist_merge_gridfile( const char *gridname )
{
int i, got_match=0;
PJ_GRIDINFO *this_grid, *tail = NULL;
/* -------------------------------------------------------------------- */
/* Try to find in the existing list of loaded grids. Add all */
/* matching grids as with NTv2 we can get many grids from one */
/* file (one shared gridname). */
/* -------------------------------------------------------------------- */
for( this_grid = grid_list; this_grid != NULL; this_grid = this_grid->next)
{
if( strcmp(this_grid->gridname,gridname) == 0 )
{
got_match = 1;
/* dont add to the list if it is invalid. */
if( this_grid->ct == NULL )
return 0;
/* do we need to grow the list? */
if( last_nadgrids_count >= last_nadgrids_max - 2 )
{
PJ_GRIDINFO **new_list;
int new_max = last_nadgrids_max + 20;
new_list = (PJ_GRIDINFO **) pj_malloc(sizeof(void*) * new_max);
if( last_nadgrids_list != NULL )
{
memcpy( new_list, last_nadgrids_list,
sizeof(void*) * last_nadgrids_max );
pj_dalloc( last_nadgrids_list );
}
last_nadgrids_list = new_list;
last_nadgrids_max = new_max;
}
/* add to the list */
last_nadgrids_list[last_nadgrids_count++] = this_grid;
last_nadgrids_list[last_nadgrids_count] = NULL;
}
tail = this_grid;
}
if( got_match )
return 1;
/* -------------------------------------------------------------------- */
/* Try to load the named grid. */
/* -------------------------------------------------------------------- */
this_grid = pj_gridinfo_init( gridname );
if( this_grid == NULL )
{
/* we should get at least a stub grid with a missing "ct" member */
assert( FALSE );
return 0;
}
if( tail != NULL )
tail->next = this_grid;
else
grid_list = this_grid;
/* -------------------------------------------------------------------- */
/* Recurse to add the grid now that it is loaded. */
/* -------------------------------------------------------------------- */
return pj_gridlist_merge_gridfile( gridname );
}
/************************************************************************/
/* pj_gridlist_from_nadgrids() */
/* */
/* This functions loads the list of grids corresponding to a */
/* particular nadgrids string into a list, and returns it. The */
/* list is kept around till a request is made with a different */
/* string in order to cut down on the string parsing cost, and */
/* the cost of building the list of tables each time. */
/************************************************************************/
PJ_GRIDINFO **pj_gridlist_from_nadgrids( const char *nadgrids, int *grid_count)
{
const char *s;
pj_errno = 0;
*grid_count = 0;
if( last_nadgrids != NULL
&& strcmp(nadgrids,last_nadgrids) == 0 )
{
*grid_count = last_nadgrids_count;
if( *grid_count == 0 )
pj_errno = -38;
return last_nadgrids_list;
}
/* -------------------------------------------------------------------- */
/* Free old one, if any, and make space for new list. */
/* -------------------------------------------------------------------- */
if( last_nadgrids != NULL )
{
pj_dalloc(last_nadgrids);
}
last_nadgrids = (char *) pj_malloc(strlen(nadgrids)+1);
strcpy( last_nadgrids, nadgrids );
last_nadgrids_count = 0;
/* -------------------------------------------------------------------- */
/* Loop processing names out of nadgrids one at a time. */
/* -------------------------------------------------------------------- */
for( s = nadgrids; *s != '\0'; )
{
int end_char;
int required = 1;
char name[128];
if( *s == '@' )
{
required = 0;
s++;
}
for( end_char = 0;
s[end_char] != '\0' && s[end_char] != ',';
end_char++ ) {}
if( end_char > sizeof(name) )
{
pj_errno = -38;
return NULL;
}
strncpy( name, s, end_char );
name[end_char] = '\0';
s += end_char;
if( *s == ',' )
s++;
if( !pj_gridlist_merge_gridfile( name ) && required )
{
pj_errno = -38;
return NULL;
}
else
pj_errno = 0;
}
if( last_nadgrids_count > 0 )
{
*grid_count = last_nadgrids_count;
return last_nadgrids_list;
}
else
return NULL;
}