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 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385
|
/*
*
* WKTRaster - Raster Types for PostGIS
* http://trac.osgeo.org/postgis/wiki/WKTRaster
*
* Copyright (C) 2011-2013 Regents of the University of California
* <bkpark@ucdavis.edu>
* Copyright (C) 2010-2011 Jorge Arevalo <jorge.arevalo@deimos-space.com>
* Copyright (C) 2010-2011 David Zwarg <dzwarg@azavea.com>
* Copyright (C) 2009-2011 Pierre Racine <pierre.racine@sbf.ulaval.ca>
* Copyright (C) 2009-2011 Mateusz Loskot <mateusz@loskot.net>
* Copyright (C) 2008-2009 Sandro Santilli <strk@kbt.io>
*
* 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 2
* 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, write to the Free Software Foundation,
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
*/
#include <ctype.h> /* for isspace */
#include <postgres.h> /* for palloc */
#include <executor/spi.h>
#include "rtpg_internal.h"
/* string replacement function taken from
* http://ubuntuforums.org/showthread.php?s=aa6f015109fd7e4c7e30d2fd8b717497&t=141670&page=3
*/
/* ---------------------------------------------------------------------------
Name : replace - Search & replace a substring by another one.
Creation : Thierry Husson, Sept 2010
Parameters :
str : Big string where we search
oldstr : Substring we are looking for
newstr : Substring we want to replace with
count : Optional pointer to int (input / output value). NULL to ignore.
Input: Maximum replacements to be done. NULL or < 1 to do all.
Output: Number of replacements done or -1 if not enough memory.
Returns : Pointer to the new string or NULL if error.
Notes :
- Case sensitive - Otherwise, replace functions "strstr" by "strcasestr"
- Always allocates memory for the result.
--------------------------------------------------------------------------- */
char*
rtpg_strreplace(
const char *str,
const char *oldstr, const char *newstr,
int *count
) {
const char *tmp = str;
char *result;
int found = 0;
int length, reslen;
int oldlen = strlen(oldstr);
int newlen = strlen(newstr);
int limit = (count != NULL && *count > 0) ? *count : -1;
tmp = str;
while ((tmp = strstr(tmp, oldstr)) != NULL && found != limit)
found++, tmp += oldlen;
length = strlen(str) + found * (newlen - oldlen);
if ((result = (char *) palloc(length + 1)) == NULL) {
fprintf(stderr, "Not enough memory\n");
found = -1;
}
else {
tmp = str;
limit = found; /* Countdown */
reslen = 0; /* length of current result */
/* Replace each old string found with new string */
while ((limit-- > 0) && (tmp = strstr(tmp, oldstr)) != NULL) {
length = (tmp - str); /* Number of chars to keep intouched */
strncpy(result + reslen, str, length); /* Original part keeped */
strcpy(result + (reslen += length), newstr); /* Insert new string */
reslen += newlen;
tmp += oldlen;
str = tmp;
}
strcpy(result + reslen, str); /* Copies last part and ending null char */
}
if (count != NULL) *count = found;
return result;
}
char *
rtpg_strtoupper(char * str) {
int j;
for (j = strlen(str) - 1; j >= 0; j--)
str[j] = toupper(str[j]);
return str;
}
char*
rtpg_chartrim(const char *input, char *remove) {
char *rtn = NULL;
char *ptr = NULL;
uint32_t offset = 0;
if (!input)
return NULL;
else if (!*input)
return (char *) input;
/* trim left */
while (strchr(remove, *input) != NULL)
input++;
/* trim right */
ptr = ((char *) input) + strlen(input);
while (strchr(remove, *--ptr) != NULL)
offset++;
rtn = palloc(sizeof(char) * (strlen(input) - offset + 1));
if (rtn == NULL) {
fprintf(stderr, "Not enough memory\n");
return NULL;
}
strncpy(rtn, input, strlen(input) - offset);
rtn[strlen(input) - offset] = '\0';
return rtn;
}
/* split a string based on a delimiter */
char**
rtpg_strsplit(const char *str, const char *delimiter, uint32_t *n) {
char *tmp = NULL;
char **rtn = NULL;
char *token = NULL;
*n = 0;
if (!str)
return NULL;
/* copy str to tmp as strtok will mangle the string */
tmp = palloc(sizeof(char) * (strlen(str) + 1));
if (NULL == tmp) {
fprintf(stderr, "Not enough memory\n");
return NULL;
}
strcpy(tmp, str);
if (!strlen(tmp) || !delimiter || !strlen(delimiter)) {
*n = 1;
rtn = (char **) palloc(*n * sizeof(char *));
if (NULL == rtn) {
fprintf(stderr, "Not enough memory\n");
return NULL;
}
rtn[0] = (char *) palloc(sizeof(char) * (strlen(tmp) + 1));
if (NULL == rtn[0]) {
fprintf(stderr, "Not enough memory\n");
return NULL;
}
strcpy(rtn[0], tmp);
pfree(tmp);
return rtn;
}
token = strtok(tmp, delimiter);
while (token != NULL) {
if (*n < 1) {
rtn = (char **) palloc(sizeof(char *));
}
else {
rtn = (char **) repalloc(rtn, (*n + 1) * sizeof(char *));
}
if (NULL == rtn) {
fprintf(stderr, "Not enough memory\n");
return NULL;
}
rtn[*n] = NULL;
rtn[*n] = (char *) palloc(sizeof(char) * (strlen(token) + 1));
if (NULL == rtn[*n]) {
fprintf(stderr, "Not enough memory\n");
return NULL;
}
strcpy(rtn[*n], token);
*n = *n + 1;
token = strtok(NULL, delimiter);
}
pfree(tmp);
return rtn;
}
char *
rtpg_removespaces(char *str) {
char *rtn;
char *tmp;
rtn = rtpg_strreplace(str, " ", "", NULL);
tmp = rtpg_strreplace(rtn, "\n", "", NULL);
pfree(rtn);
rtn = rtpg_strreplace(tmp, "\t", "", NULL);
pfree(tmp);
tmp = rtpg_strreplace(rtn, "\f", "", NULL);
pfree(rtn);
rtn = rtpg_strreplace(tmp, "\r", "", NULL);
pfree(tmp);
return rtn;
}
char*
rtpg_trim(const char *input) {
char *rtn;
char *ptr;
uint32_t offset = 0;
int inputlen = 0;
if (!input)
return NULL;
else if (!*input)
return (char *) input;
/* trim left */
while (isspace(*input) && *input != '\0')
input++;
/* trim right */
inputlen = strlen(input);
if (inputlen) {
ptr = ((char *) input) + inputlen;
while (isspace(*--ptr))
offset++;
}
rtn = palloc(sizeof(char) * (inputlen - offset + 1));
if (rtn == NULL) {
fprintf(stderr, "Not enough memory\n");
return NULL;
}
strncpy(rtn, input, inputlen - offset);
rtn[inputlen - offset] = '\0';
return rtn;
}
/*
* reverse string search function from
* http://stackoverflow.com/a/1634398
*/
char *
rtpg_strrstr(const char *s1, const char *s2) {
int s1len = strlen(s1);
int s2len = strlen(s2);
char *s;
if (s2len > s1len)
return NULL;
s = (char *) (s1 + s1len - s2len);
for (; s >= s1; --s)
if (strncmp(s, s2, s2len) == 0)
return s;
return NULL;
}
char*
rtpg_getSR(int srid) {
int i = 0;
int len = 0;
char *sql = NULL;
int spi_result;
TupleDesc tupdesc;
SPITupleTable *tuptable = NULL;
HeapTuple tuple;
char *tmp = NULL;
char *srs = NULL;
/*
SELECT
CASE
WHEN (upper(auth_name) = 'EPSG' OR upper(auth_name) = 'EPSGA') AND length(COALESCE(auth_srid::text, '')) > 0
THEN upper(auth_name) || ':' || auth_srid
WHEN length(COALESCE(auth_name, '') || COALESCE(auth_srid::text, '')) > 0
THEN COALESCE(auth_name, '') || COALESCE(auth_srid::text, '')
ELSE ''
END,
proj4text,
srtext
FROM spatial_ref_sys
WHERE srid = X
LIMIT 1
*/
len = sizeof(char) * (strlen("SELECT CASE WHEN (upper(auth_name) = 'EPSG' OR upper(auth_name) = 'EPSGA') AND length(COALESCE(auth_srid::text, '')) > 0 THEN upper(auth_name) || ':' || auth_srid WHEN length(COALESCE(auth_name, '') || COALESCE(auth_srid::text, '')) > 0 THEN COALESCE(auth_name, '') || COALESCE(auth_srid::text, '') ELSE '' END, proj4text, srtext FROM spatial_ref_sys WHERE srid = LIMIT 1") + MAX_INT_CHARLEN + 1);
sql = (char *) palloc(len);
if (NULL == sql) {
elog(ERROR, "rtpg_getSR: Could not allocate memory for sql\n");
return NULL;
}
spi_result = SPI_connect();
if (spi_result != SPI_OK_CONNECT) {
pfree(sql);
elog(ERROR, "rtpg_getSR: Could not connect to database using SPI\n");
return NULL;
}
/* execute query */
snprintf(sql, len, "SELECT CASE WHEN (upper(auth_name) = 'EPSG' OR upper(auth_name) = 'EPSGA') AND length(COALESCE(auth_srid::text, '')) > 0 THEN upper(auth_name) || ':' || auth_srid WHEN length(COALESCE(auth_name, '') || COALESCE(auth_srid::text, '')) > 0 THEN COALESCE(auth_name, '') || COALESCE(auth_srid::text, '') ELSE '' END, proj4text, srtext FROM spatial_ref_sys WHERE srid = %d LIMIT 1", srid);
POSTGIS_RT_DEBUGF(4, "SRS query: %s", sql);
spi_result = SPI_execute(sql, TRUE, 0);
SPI_pfree(sql);
if (spi_result != SPI_OK_SELECT || SPI_tuptable == NULL || SPI_processed != 1) {
if (SPI_tuptable) SPI_freetuptable(tuptable);
SPI_finish();
elog(ERROR, "rtpg_getSR: Cannot find SRID (%d) in spatial_ref_sys", srid);
return NULL;
}
tupdesc = SPI_tuptable->tupdesc;
tuptable = SPI_tuptable;
tuple = tuptable->vals[0];
/* which column to use? */
for (i = 1; i < 4; i++) {
tmp = SPI_getvalue(tuple, tupdesc, i);
/* value AND GDAL supports this SR */
if (
SPI_result != SPI_ERROR_NOATTRIBUTE &&
SPI_result != SPI_ERROR_NOOUTFUNC &&
tmp != NULL &&
strlen(tmp) &&
rt_util_gdal_supported_sr(tmp)
) {
POSTGIS_RT_DEBUGF(4, "Value for column %d is %s", i, tmp);
len = strlen(tmp) + 1;
srs = SPI_palloc(sizeof(char) * len);
if (NULL == srs) {
pfree(tmp);
if (SPI_tuptable) SPI_freetuptable(tuptable);
SPI_finish();
elog(ERROR, "rtpg_getSR: Could not allocate memory for spatial reference text\n");
return NULL;
}
strncpy(srs, tmp, len);
pfree(tmp);
break;
}
if (tmp != NULL)
pfree(tmp);
continue;
}
if (SPI_tuptable) SPI_freetuptable(tuptable);
SPI_finish();
/* unable to get SR info */
if (srs == NULL) {
if (SPI_tuptable) SPI_freetuptable(tuptable);
SPI_finish();
elog(ERROR, "rtpg_getSR: Could not find a viable spatial reference for SRID (%d)", srid);
return NULL;
}
return srs;
}
|