mirror of
https://git.osgeo.org/gitea/postgis/postgis
synced 2024-10-24 17:12:35 +00:00
1751 lines
37 KiB
C
1751 lines
37 KiB
C
/*
|
|
* Written by Ralph Mason ralph.mason<at>telogis.com
|
|
*
|
|
* Copyright Telogis 2004
|
|
* www.telogis.com
|
|
*
|
|
*/
|
|
#include <string.h>
|
|
#include <stdio.h>
|
|
/* Solaris9 does not provide stdint.h */
|
|
/* #include <stdint.h> */
|
|
#include <inttypes.h>
|
|
|
|
#include "liblwgeom.h"
|
|
#include "wktparse.h"
|
|
#include "wktparse.tab.h"
|
|
|
|
/*
|
|
* To get byte order
|
|
#include <sys/types.h>
|
|
#include <netinet/in.h>
|
|
#include <netinet/in_systm.h>
|
|
#include <netinet/ip.h>
|
|
*/
|
|
|
|
void set_zm(char z, char m);
|
|
void close_parser(void);
|
|
|
|
typedef uint32_t int4;
|
|
|
|
typedef struct tag_tuple tuple;
|
|
|
|
struct tag_outputstate
|
|
{
|
|
uchar* pos;
|
|
};
|
|
|
|
typedef struct tag_outputstate output_state;
|
|
typedef void (*output_func)(tuple* this, output_state* out);
|
|
typedef void (*read_col_func)(const char **f);
|
|
|
|
|
|
|
|
/* Globals */
|
|
|
|
int srid=-1;
|
|
|
|
static int parser_ferror_occured;
|
|
static allocator local_malloc;
|
|
static report_error error_func;
|
|
|
|
struct tag_tuple
|
|
{
|
|
output_func of;
|
|
union union_tag
|
|
{
|
|
double points[4];
|
|
int4 pointsi[4];
|
|
|
|
struct struct_tag
|
|
{
|
|
tuple* stack_next;
|
|
int type;
|
|
int num;
|
|
int size_here;
|
|
int parse_location;
|
|
}
|
|
nn;
|
|
|
|
} uu;
|
|
struct tag_tuple *next;
|
|
};
|
|
|
|
struct
|
|
{
|
|
int type;
|
|
int flags;
|
|
int srid;
|
|
int ndims;
|
|
int hasZ;
|
|
int hasM;
|
|
|
|
int4 alloc_size;
|
|
|
|
/*
|
|
linked list of all tuples
|
|
*/
|
|
tuple* first;
|
|
tuple* last;
|
|
|
|
/*
|
|
stack of open geometries
|
|
*/
|
|
tuple* stack;
|
|
|
|
}
|
|
the_geom;
|
|
|
|
tuple* free_list=0;
|
|
|
|
|
|
/*
|
|
* Parser current instance check flags - a bitmap of flags that determine which checks are enabled during the current parse
|
|
* (see liblwgeom.h for the related PARSER_CHECK constants)
|
|
*/
|
|
int current_parser_check_flags;
|
|
|
|
/*
|
|
* Parser current instance result structure - the result structure being used for the current parse
|
|
*/
|
|
LWGEOM_PARSER_RESULT *current_lwg_parser_result;
|
|
|
|
|
|
/*
|
|
* This indicates if the number of points in the geometry is required to
|
|
* be odd (one) or even (zero, currently not enforced) or whatever (-one)
|
|
*/
|
|
double *first_point=NULL;
|
|
double *last_point=NULL;
|
|
|
|
|
|
/*
|
|
* Parser error messages
|
|
*
|
|
* IMPORTANT: Make sure the order of these messages matches the PARSER_ERROR constants in liblwgeom.h!
|
|
* The 0th element should always be empty since it is unused (error constants start from -1)
|
|
*/
|
|
|
|
const char *parser_error_messages[] =
|
|
{
|
|
"",
|
|
"geometry requires more points",
|
|
"geometry must have an odd number of points",
|
|
"geometry contains non-closed rings",
|
|
"can not mix dimensionality in a geometry",
|
|
"parse error - invalid geometry",
|
|
"invalid WKB type",
|
|
"incontinuous compound curve",
|
|
"triangle must have exactly 4 points"
|
|
};
|
|
|
|
/* Macro to return the error message and the current position within WKT */
|
|
#define LWGEOM_WKT_VALIDATION_ERROR(errcode, parse_location) \
|
|
do { \
|
|
if (!parser_ferror_occured) { \
|
|
parser_ferror_occured = -1 * errcode; \
|
|
current_lwg_parser_result->message = parser_error_messages[errcode]; \
|
|
current_lwg_parser_result->errlocation = parse_location; \
|
|
} \
|
|
} while (0);
|
|
|
|
|
|
/* Macro to return the error message and the current position within WKT */
|
|
#define LWGEOM_WKT_PARSER_ERROR(errcode) \
|
|
do { \
|
|
if (!parser_ferror_occured) { \
|
|
parser_ferror_occured = -1 * errcode; \
|
|
current_lwg_parser_result->message = parser_error_messages[errcode]; \
|
|
current_lwg_parser_result->errlocation = lwg_parse_yylloc.last_column; \
|
|
} \
|
|
} while (0);
|
|
|
|
|
|
/* Macro to return the error message and the current position within WKB
|
|
NOTE: the position is handled automatically by strhex_readbyte */
|
|
#define LWGEOM_WKB_PARSER_ERROR(errcode) \
|
|
do { \
|
|
if (!parser_ferror_occured) { \
|
|
parser_ferror_occured = -1 * errcode; \
|
|
current_lwg_parser_result->message = parser_error_messages[errcode]; \
|
|
} \
|
|
} while (0);
|
|
|
|
|
|
/* External functions */
|
|
extern void init_parser(const char *);
|
|
|
|
/* Prototypes */
|
|
tuple* alloc_tuple(output_func of,size_t size);
|
|
void free_tuple(tuple* to_free);
|
|
void inc_num(void);
|
|
void alloc_stack_tuple(int type,output_func of,size_t size);
|
|
void check_dims(int num);
|
|
void WRITE_DOUBLES(output_state* out,double* points, int cnt);
|
|
#ifdef SHRINK_INTS
|
|
void WRITE_INT4(output_state * out,int4 val);
|
|
#endif
|
|
void empty_stack(tuple* this,output_state* out);
|
|
void alloc_lwgeom(int srid);
|
|
void write_point_2(tuple* this,output_state* out);
|
|
void write_point_3(tuple* this,output_state* out);
|
|
void write_point_4(tuple* this,output_state* out);
|
|
void write_point_2i(tuple* this,output_state* out);
|
|
void write_point_3i(tuple* this,output_state* out);
|
|
void write_point_4i(tuple* this,output_state* out);
|
|
void alloc_point_2d(double x,double y);
|
|
void alloc_point_3d(double x,double y,double z);
|
|
void alloc_point_4d(double x,double y,double z,double m);
|
|
void write_type(tuple* this,output_state* out);
|
|
void write_count(tuple* this,output_state* out);
|
|
void write_type_count(tuple* this,output_state* out);
|
|
void alloc_point(void);
|
|
void alloc_linestring(void);
|
|
void alloc_linestring_closed(void);
|
|
void alloc_circularstring(void);
|
|
void alloc_circularstring_closed(void);
|
|
void alloc_compoundcurve(void);
|
|
void alloc_compoundcurve_closed(void);
|
|
void alloc_curvepolygon(void);
|
|
void alloc_polygon(void);
|
|
void alloc_triangle(void);
|
|
void alloc_multipoint(void);
|
|
void alloc_multilinestring(void);
|
|
void alloc_multicurve(void);
|
|
void alloc_multipolygon(void);
|
|
void alloc_multisurface(void);
|
|
void alloc_polyhedralsurface(void);
|
|
void alloc_tin(void);
|
|
void alloc_geomertycollection(void);
|
|
void alloc_counter(void);
|
|
void alloc_empty(void);
|
|
void check_compoundcurve(void);
|
|
void check_closed_compoundcurve(void);
|
|
void check_linestring(void);
|
|
void check_closed_linestring(void);
|
|
void check_circularstring(void);
|
|
void check_closed_circularstring(void);
|
|
void check_polygon(void);
|
|
void check_triangle(void);
|
|
void check_triangle_points(void);
|
|
void check_curvepolygon(void);
|
|
void check_compoundcurve_continuity(void);
|
|
void check_compoundcurve_closed(void);
|
|
void check_linestring_closed(void);
|
|
void check_circularstring_closed(void);
|
|
void check_polygon_closed(void);
|
|
void check_polygon_minpoints(void);
|
|
void check_curvepolygon_minpoints(void);
|
|
void check_compoundcurve_minpoints(void);
|
|
void check_linestring_minpoints(void);
|
|
void check_circularstring_minpoints(void);
|
|
void check_circularstring_isodd(void);
|
|
void check_polyhedralsurface_patch(void);
|
|
void check_polyhedralsurface_patch_minpoints(void);
|
|
void check_ring_closed_3D(void);
|
|
void make_serialized_lwgeom(LWGEOM_PARSER_RESULT *lwg_parser_result);
|
|
uchar strhex_readbyte(const char *in);
|
|
uchar read_wkb_byte(const char **in);
|
|
void read_wkb_bytes(const char **in, uchar* out, int cnt);
|
|
int4 read_wkb_int(const char **in);
|
|
double read_wkb_double(const char **in);
|
|
void read_wkb_point(const char **b);
|
|
void read_wkb_polygon(const char **b);
|
|
void read_wkb_triangle(const char **b);
|
|
void read_wkb_linestring(const char **b);
|
|
void read_wkb_circstring(const char **b);
|
|
void read_wkb_ordinate_array(const char **b);
|
|
void read_collection(const char **b, read_col_func f);
|
|
void parse_wkb(const char **b);
|
|
void alloc_wkb(const char *parser);
|
|
int parse_it(LWGEOM_PARSER_RESULT *lwg_parser_result, const char* geometry, int flags, allocator allocfunc, report_error errfunc);
|
|
int parse_lwg(LWGEOM_PARSER_RESULT *lwg_parser_result, const char* geometry, int flags, allocator allocfunc, report_error errfunc);
|
|
|
|
void
|
|
set_srid(double d_srid)
|
|
{
|
|
if ( d_srid >= 0 )
|
|
d_srid+=0.1;
|
|
else
|
|
d_srid-=0.1;
|
|
|
|
|
|
srid=(int)(d_srid+0.1);
|
|
}
|
|
|
|
/*
|
|
* Begin alloc / free functions
|
|
*/
|
|
|
|
|
|
tuple *
|
|
alloc_tuple(output_func of,size_t size)
|
|
{
|
|
tuple* ret = free_list;
|
|
|
|
if ( ! ret )
|
|
{
|
|
int toalloc = (ALLOC_CHUNKS /sizeof(tuple));
|
|
ret = malloc( toalloc *sizeof(tuple) );
|
|
|
|
free_list = ret;
|
|
|
|
while (--toalloc)
|
|
{
|
|
ret->next = ret+1;
|
|
ret++;
|
|
}
|
|
|
|
ret->next = NULL;
|
|
|
|
return alloc_tuple(of,size);
|
|
}
|
|
|
|
free_list = ret->next;
|
|
ret->of = of;
|
|
ret->next = NULL;
|
|
|
|
if ( the_geom.last )
|
|
{
|
|
the_geom.last->next = ret;
|
|
the_geom.last = ret;
|
|
}
|
|
else
|
|
{
|
|
the_geom.first = the_geom.last = ret;
|
|
}
|
|
|
|
LWDEBUGF(5, "alloc_tuple %p: parse_location = %d",
|
|
ret, lwg_parse_yylloc.last_column);
|
|
|
|
ret->uu.nn.parse_location = lwg_parse_yylloc.last_column;
|
|
|
|
the_geom.alloc_size += size;
|
|
return ret;
|
|
}
|
|
|
|
void
|
|
free_tuple(tuple* to_free)
|
|
{
|
|
|
|
tuple* list_end = to_free;
|
|
|
|
if ( !to_free)
|
|
return;
|
|
|
|
while (list_end->next)
|
|
{
|
|
list_end=list_end->next;
|
|
}
|
|
|
|
list_end->next = free_list;
|
|
free_list = to_free;
|
|
}
|
|
|
|
void
|
|
alloc_lwgeom(int srid)
|
|
{
|
|
LWDEBUGF(3, "alloc_lwgeom %d", srid);
|
|
|
|
the_geom.srid=srid;
|
|
the_geom.alloc_size=0;
|
|
the_geom.stack=NULL;
|
|
the_geom.ndims=0;
|
|
the_geom.hasZ=0;
|
|
the_geom.hasM=0;
|
|
|
|
/* Free if used already */
|
|
if ( the_geom.first )
|
|
{
|
|
free_tuple(the_geom.first);
|
|
the_geom.first=the_geom.last=NULL;
|
|
}
|
|
|
|
if ( srid != -1 )
|
|
{
|
|
the_geom.alloc_size+=4;
|
|
}
|
|
|
|
/* Setup up an empty tuple as the stack base */
|
|
the_geom.stack = alloc_tuple(empty_stack, 0);
|
|
}
|
|
|
|
void
|
|
alloc_point_2d(double x,double y)
|
|
{
|
|
tuple* p = alloc_tuple(write_point_2, 16);
|
|
p->uu.points[0] = x;
|
|
p->uu.points[1] = y;
|
|
|
|
LWDEBUGF(3, "alloc_point_2d %f,%f", x, y);
|
|
LWDEBUGF(5, " * %p", p);
|
|
|
|
/* keep track of point */
|
|
|
|
inc_num();
|
|
check_dims(2);
|
|
}
|
|
|
|
void
|
|
alloc_point_3d(double x,double y,double z)
|
|
{
|
|
tuple* p = alloc_tuple(write_point_3, 24);
|
|
p->uu.points[0] = x;
|
|
p->uu.points[1] = y;
|
|
p->uu.points[2] = z;
|
|
|
|
LWDEBUGF(3, "alloc_point_3d %f, %f, %f", x, y, z);
|
|
LWDEBUGF(5, " * %p", p);
|
|
|
|
inc_num();
|
|
check_dims(3);
|
|
}
|
|
|
|
void
|
|
alloc_point_4d(double x,double y,double z,double m)
|
|
{
|
|
tuple* p = alloc_tuple(write_point_4, 32);
|
|
p->uu.points[0] = x;
|
|
p->uu.points[1] = y;
|
|
p->uu.points[2] = z;
|
|
p->uu.points[3] = m;
|
|
|
|
LWDEBUGF(3, "alloc_point_4d %f, %f, %f, %f", x, y, z, m);
|
|
LWDEBUGF(5, " * %p", p);
|
|
|
|
inc_num();
|
|
check_dims(4);
|
|
}
|
|
|
|
|
|
|
|
void
|
|
inc_num(void)
|
|
{
|
|
the_geom.stack->uu.nn.num++;
|
|
}
|
|
|
|
/*
|
|
Allocate a 'counting' tuple
|
|
*/
|
|
void
|
|
alloc_stack_tuple(int type,output_func of,size_t size)
|
|
{
|
|
tuple* p;
|
|
inc_num();
|
|
|
|
LWDEBUGF(3, "alloc_stack_tuple: type = %d, size = %d", type, size);
|
|
|
|
p = alloc_tuple(of,size);
|
|
p->uu.nn.stack_next = the_geom.stack;
|
|
p->uu.nn.type = type;
|
|
p->uu.nn.size_here = the_geom.alloc_size;
|
|
p->uu.nn.num = 0;
|
|
p->uu.nn.parse_location = lwg_parse_yylloc.last_column;
|
|
|
|
the_geom.stack = p;
|
|
|
|
LWDEBUGF(4, "alloc_stack_tuple complete: %p", the_geom.stack);
|
|
}
|
|
|
|
/*
|
|
* Begin Check functions
|
|
*/
|
|
|
|
void check_compoundcurve(void)
|
|
{
|
|
check_compoundcurve_minpoints();
|
|
check_compoundcurve_continuity();
|
|
}
|
|
|
|
void check_closed_compoundcurve(void)
|
|
{
|
|
check_compoundcurve_closed();
|
|
check_compoundcurve();
|
|
}
|
|
|
|
void check_linestring(void)
|
|
{
|
|
check_linestring_minpoints();
|
|
}
|
|
|
|
void check_closed_linestring(void)
|
|
{
|
|
check_linestring_closed();
|
|
check_linestring();
|
|
}
|
|
|
|
void check_circularstring(void)
|
|
{
|
|
check_circularstring_minpoints();
|
|
check_circularstring_isodd();
|
|
}
|
|
|
|
void check_closed_circularstring(void)
|
|
{
|
|
check_linestring_closed();
|
|
check_circularstring();
|
|
}
|
|
|
|
void check_polygon(void)
|
|
{
|
|
check_polygon_minpoints();
|
|
check_polygon_closed();
|
|
}
|
|
|
|
void check_triangle(void)
|
|
{
|
|
check_triangle_points();
|
|
check_ring_closed_3D();
|
|
}
|
|
|
|
void check_curvepolygon(void)
|
|
{
|
|
check_curvepolygon_minpoints();
|
|
}
|
|
|
|
void
|
|
check_compoundcurve_continuity(void)
|
|
{
|
|
tuple* tp = the_geom.stack->next; /* Current tuple on the stack. */
|
|
int i, j; /* Loop counters */
|
|
int num, mum= 0; /* sub-geom and point counts */
|
|
tuple *last=NULL, *first=NULL; /* point tuples */
|
|
|
|
LWDEBUG(3, "compound_continuity_check");
|
|
num = tp->uu.nn.num;
|
|
for (i = 0; i < num; i++)
|
|
{
|
|
tp = tp->next->next;
|
|
mum = tp->uu.nn.num;
|
|
LWDEBUGF(5, "sub-geom %d of %d (%d points) at %p", i, num, mum, tp);
|
|
|
|
first = tp->next;
|
|
LWDEBUGF(5, "First point identified: %p", first);
|
|
if (i > 0)
|
|
{
|
|
if (the_geom.ndims > 3)
|
|
{
|
|
LWDEBUGF(5, "comparing points (%f,%f,%f,%f), (%f,%f,%f,%f)",
|
|
first->uu.points[0], first->uu.points[1],
|
|
first->uu.points[2], first->uu.points[3],
|
|
last->uu.points[0], last->uu.points[1],
|
|
last->uu.points[2], last->uu.points[3]);
|
|
}
|
|
else if (the_geom.ndims > 2)
|
|
{
|
|
LWDEBUGF(5, "comparing points (%f,%f,%f), (%f,%f,%f)",
|
|
first->uu.points[0], first->uu.points[1],
|
|
first->uu.points[2], last->uu.points[0],
|
|
last->uu.points[1], last->uu.points[2]);
|
|
}
|
|
else
|
|
{
|
|
LWDEBUGF(5, "comparing points (%f,%f), (%f,%f)",
|
|
first->uu.points[0], first->uu.points[1],
|
|
last->uu.points[0], last->uu.points[1]);
|
|
}
|
|
|
|
if (first->uu.points[0] != last->uu.points[0])
|
|
{
|
|
LWDEBUG(5, "x value mismatch");
|
|
LWGEOM_WKT_VALIDATION_ERROR(PARSER_ERROR_INCONTINUOUS, last->uu.nn.parse_location);
|
|
}
|
|
else if (first->uu.points[1] != last->uu.points[1])
|
|
{
|
|
LWDEBUG(5, "y value mismatch");
|
|
LWGEOM_WKT_VALIDATION_ERROR(PARSER_ERROR_INCONTINUOUS, last->uu.nn.parse_location);
|
|
}
|
|
else if (the_geom.ndims > 2 &&
|
|
first->uu.points[2] != last->uu.points[2])
|
|
{
|
|
LWDEBUG(5, "z/m value mismatch");
|
|
LWGEOM_WKT_VALIDATION_ERROR(PARSER_ERROR_INCONTINUOUS, last->uu.nn.parse_location);
|
|
}
|
|
else if (the_geom.ndims > 3 &&
|
|
first->uu.points[3] != last->uu.points[3])
|
|
{
|
|
LWDEBUG(5, "m value mismatch");
|
|
LWGEOM_WKT_VALIDATION_ERROR(PARSER_ERROR_INCONTINUOUS, last->uu.nn.parse_location);
|
|
}
|
|
}
|
|
for (j = 0; j < mum; j++)
|
|
{
|
|
tp = tp->next;
|
|
}
|
|
last = tp;
|
|
LWDEBUGF(5, "Last point identified: %p", last);
|
|
}
|
|
}
|
|
|
|
void check_circularstring_isodd(void)
|
|
{
|
|
tuple *tp = the_geom.stack->next;
|
|
int i, num;
|
|
|
|
LWDEBUG(3, "check_circularstring_isodd");
|
|
if (tp->uu.nn.num % 2 == 0)
|
|
{
|
|
num = tp->uu.nn.num;
|
|
LWDEBUGF(5, "Odd check failed: pointcount = %d", num);
|
|
for (i = 0; i < num; i++)
|
|
{
|
|
tp = tp->next;
|
|
}
|
|
LWGEOM_WKT_VALIDATION_ERROR(PARSER_ERROR_ODDPOINTS, the_geom.stack->next->uu.nn.parse_location);
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Determines if the compound curve is closed or not. This is done by finding
|
|
* the first point tuple of the first sub-geometry then marching through the
|
|
* tuple list until the last point tuple of the last sub-geometry is found.
|
|
* The 2d values of these tuples are then compared.
|
|
*/
|
|
void
|
|
check_compoundcurve_closed(void)
|
|
{
|
|
tuple *tp = the_geom.stack; /* Current tuple */
|
|
int i, j; /* Loop counters */
|
|
int num, mum; /* sub-unit counts */
|
|
tuple *first, *last; /* First and last tuple of the compount curve */
|
|
|
|
LWDEBUG(3, "check_compount_closed");
|
|
/* tuple counting subgeometries */
|
|
tp = tp->next;
|
|
num = tp->uu.nn.num;
|
|
|
|
LWDEBUGF(5, "Found %d subgeoms.", num);
|
|
|
|
/* counting tuple -> subgeom tuple -> counting tuple -> first point*/
|
|
first = tp->next->next->next;
|
|
for (i = 0; i < num; i++)
|
|
{
|
|
/* Advance to the next subgeometry's counting tuple */
|
|
tp = tp->next->next;
|
|
mum = tp->uu.nn.num;
|
|
|
|
LWDEBUGF(5, "Subgeom %d at %p has %d points.", i, tp, mum);
|
|
for (j = 0; j < mum; j++)
|
|
{
|
|
tp = tp->next;
|
|
}
|
|
}
|
|
last = tp;
|
|
if (first->uu.points[0] != last->uu.points[0] ||
|
|
first->uu.points[1] != last->uu.points[1])
|
|
{
|
|
LWDEBUGF(4, "Unclosed geometry: (%f, %f) != (%f, %f)",
|
|
first->uu.points[0], first->uu.points[1],
|
|
last->uu.points[0], last->uu.points[1]);
|
|
LWDEBUGF(5, "First %p, last %p", first, last);
|
|
LWGEOM_WKT_VALIDATION_ERROR(PARSER_ERROR_UNCLOSED, the_geom.stack->next->uu.nn.parse_location);
|
|
}
|
|
else
|
|
{
|
|
LWDEBUG(5, "Compound Curve found closed.");
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Determines if the current linestring is closed and raises an error if it
|
|
* is not.
|
|
* This is done by walking through the tuple list and identifying the first
|
|
* and last point tuples, then comparing their 2d values.
|
|
*/
|
|
void
|
|
check_linestring_closed(void)
|
|
{
|
|
tuple *tp = the_geom.stack; /* Current tuple */
|
|
int i; /* Loop counter */
|
|
int num; /* point count */
|
|
tuple *first, *last; /* First and last tuple of the compount curve */
|
|
|
|
/* tuple counting points */
|
|
tp = tp->next;
|
|
if (tp->uu.nn.num > 0)
|
|
{
|
|
first = tp->next;
|
|
num = tp->uu.nn.num;
|
|
for (i = 0; i < num; i++)
|
|
{
|
|
tp = tp->next;
|
|
}
|
|
last = tp;
|
|
if (first->uu.points[0] != last->uu.points[0] ||
|
|
first->uu.points[1] != last->uu.points[1])
|
|
{
|
|
LWDEBUGF(4, "Unclosed geometry: (%f, %f) != (%f, %f)",
|
|
first->uu.points[0], first->uu.points[1],
|
|
last->uu.points[0], last->uu.points[1]);
|
|
LWDEBUGF(5, "First %p, last %p", first, last);
|
|
LWGEOM_WKT_VALIDATION_ERROR(PARSER_ERROR_UNCLOSED, the_geom.stack->next->uu.nn.parse_location);
|
|
}
|
|
else
|
|
{
|
|
LWDEBUG(5, "Geometry found closed.");
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Determines if all rings of the current polygon are closed. This is done
|
|
* by marching through the tuple list finding the first and last point tuples
|
|
* of each ring and comparing their 2d values.
|
|
*/
|
|
void
|
|
check_polygon_closed(void)
|
|
{
|
|
tuple *tp = the_geom.stack; /* Current tuple */
|
|
int i, j; /* Loop counters */
|
|
int num, mum; /* sub-unit counts */
|
|
tuple *first, *last; /* First and last tuple of the current ring. */
|
|
|
|
LWDEBUG(3, "check_polygon_closed");
|
|
/* tuple counting rings */
|
|
tp = tp->next;
|
|
num = tp->uu.nn.num;
|
|
for (i = 0; i < num; i++)
|
|
{
|
|
/* ring tuple counting points */
|
|
tp = tp->next;
|
|
mum = tp->uu.nn.num;
|
|
first = tp->next;
|
|
for (j = 0; j < mum; j++)
|
|
{
|
|
tp = tp->next;
|
|
}
|
|
last = tp;
|
|
if (first->uu.points[0] != last->uu.points[0] ||
|
|
first->uu.points[1] != last->uu.points[1])
|
|
{
|
|
LWDEBUGF(4, "Unclosed geometry: (%f, %f) != (%f, %f)",
|
|
first->uu.points[0], first->uu.points[1],
|
|
last->uu.points[0], last->uu.points[1]);
|
|
LWDEBUGF(5, "First %p, last %p", first, last);
|
|
LWGEOM_WKT_VALIDATION_ERROR(PARSER_ERROR_UNCLOSED, the_geom.stack->next->uu.nn.parse_location);
|
|
}
|
|
else
|
|
{
|
|
LWDEBUGF(5, "Ring %d found closed.", i);
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Checks to ensure that each ring of the current polygon contains the
|
|
* given number of points. The given number should be four, but
|
|
* lets keep things generic here for now.
|
|
*/
|
|
void
|
|
check_polygon_minpoints(void)
|
|
{
|
|
tuple *tp = the_geom.stack->next; /* Current tuple */
|
|
int i, j; /* Loop counters */
|
|
int num, mum; /* ring / point count */
|
|
int minpoints = 4;
|
|
|
|
LWDEBUG(3, "check_polygon_minpoints");
|
|
|
|
num = tp->uu.nn.num;
|
|
|
|
/* Check each ring for minpoints */
|
|
for (i = 0; i < num; i++)
|
|
{
|
|
/* Step into the point counter tuple */
|
|
tp = tp->next;
|
|
mum = tp->uu.nn.num;
|
|
|
|
/* Skip the point tuples */
|
|
for (j = 0; j < mum; j++)
|
|
{
|
|
tp = tp->next;
|
|
}
|
|
|
|
if (mum < minpoints)
|
|
{
|
|
LWDEBUGF(5, "Minpoint check failed: needed %d, got %d",
|
|
minpoints, mum);
|
|
LWDEBUGF(5, "tuple = %p; parse_location = %d; parser reported column = %d",
|
|
tp, tp->uu.nn.parse_location, lwg_parse_yylloc.last_column);
|
|
LWGEOM_WKT_VALIDATION_ERROR(PARSER_ERROR_MOREPOINTS, the_geom.stack->next->uu.nn.parse_location);
|
|
}
|
|
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Checks to ensure that current face of the Triangle contains the
|
|
* given number of points.
|
|
* NOTA: same test as check_polygon_minpoints except that we need
|
|
* here exactly 4 points.
|
|
*/
|
|
void
|
|
check_triangle_points(void)
|
|
{
|
|
tuple *tp = the_geom.stack->next; /* Current tuple */
|
|
int num = tp->uu.nn.num; /* point count */
|
|
int points = 4;
|
|
|
|
LWDEBUG(3, "check_triangle_points");
|
|
|
|
if (num != points)
|
|
{
|
|
LWDEBUGF(5, "point check failed: needed %d, got %d", points, num);
|
|
LWDEBUGF(5, "tuple = %p; parse_location = %d; parser reported column = %d",
|
|
tp, tp->uu.nn.parse_location, lwg_parse_yylloc.last_column);
|
|
LWGEOM_WKT_VALIDATION_ERROR(PARSER_ERROR_TRIANGLEPOINTS,
|
|
the_geom.stack->next->uu.nn.parse_location);
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Checks to ensure that each ring of the curved polygon (itself a proper
|
|
* geometry) contains the minimum number of points.
|
|
*/
|
|
void
|
|
check_curvepolygon_minpoints()
|
|
{
|
|
tuple *tp = the_geom.stack->next; /* Current tuple */
|
|
int i, j, k; /* Loop counters */
|
|
int num, mum, lum; /* subgeom, point counts */
|
|
int minpoints;
|
|
int count = 0; /* Running counter for compound curve */
|
|
num = tp->uu.nn.num;
|
|
|
|
LWDEBUG(3, "check_curvepolygon_minpoints");
|
|
|
|
/* Check each sub-geom for minpoints */
|
|
for (i = 0; i < num; i++)
|
|
{
|
|
minpoints = 3;
|
|
tp = tp->next;
|
|
LWDEBUGF(5, "Subgeom type %d: %p", tp->uu.nn.type, tp);
|
|
switch (TYPE_GETTYPE(tp->uu.nn.type))
|
|
{
|
|
case COMPOUNDTYPE:
|
|
/* sub-geom counter */
|
|
tp = tp->next;
|
|
mum = tp->uu.nn.num;
|
|
|
|
/* sub-geom loop */
|
|
for (j = 0; j < mum; j++)
|
|
{
|
|
tp = tp->next->next;
|
|
lum = tp->uu.nn.num;
|
|
if (j == 0) count += lum;
|
|
else count += lum - 1;
|
|
for (k = 0; k < lum; k++)
|
|
{
|
|
tp = tp->next;
|
|
}
|
|
}
|
|
if (count < minpoints)
|
|
{
|
|
LWDEBUGF(5, "Minpoint check failed: needed %d, got %d",
|
|
minpoints, count);
|
|
LWGEOM_WKT_VALIDATION_ERROR(PARSER_ERROR_MOREPOINTS, the_geom.stack->next->uu.nn.parse_location);
|
|
}
|
|
break;
|
|
case LINETYPE:
|
|
minpoints = 4;
|
|
case CIRCSTRINGTYPE:
|
|
tp = tp->next;
|
|
mum = tp->uu.nn.num;
|
|
for (j = 0; j < mum; j++)
|
|
{
|
|
tp = tp->next;
|
|
}
|
|
if (mum < minpoints)
|
|
{
|
|
LWDEBUGF(5, "Minpoint check failed: needed %d, got %d",
|
|
minpoints, mum);
|
|
LWGEOM_WKT_VALIDATION_ERROR(PARSER_ERROR_MOREPOINTS, the_geom.stack->next->uu.nn.parse_location);
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Determines if the compound curve contains the required minimum number of
|
|
* points. This cannot push off to sub-geometries, as it isn't just a matter
|
|
* counting their points. The first point of all but the first geometry are
|
|
* redundant and shall not be counted.
|
|
*/
|
|
void
|
|
check_compoundcurve_minpoints()
|
|
{
|
|
tuple *tp = the_geom.stack->next; /* Current tuple */
|
|
int i, j; /* Loop counters */
|
|
int num, mum; /* sub-geom / point count */
|
|
int count = 0; /* Running count of points */
|
|
int minpoints = 2;
|
|
|
|
LWDEBUG(3, "check_compoundcurve_minpoints");
|
|
num = tp->uu.nn.num;
|
|
LWDEBUGF(5, "subgeom count %d: %p", num, tp);
|
|
|
|
for (i = 0; i < num; i++)
|
|
{
|
|
LWDEBUG(5, "loop start");
|
|
/* Step into the sub-geometry's counting tuple */
|
|
tp = tp->next->next;
|
|
mum = tp->uu.nn.num;
|
|
LWDEBUGF(5, "subgeom %d of %d type %d, point count %d: %p", i, num, tp->uu.nn.type, mum, tp);
|
|
if (i == 0) count += mum;
|
|
else count += mum - 1;
|
|
|
|
/* Skip the sub-geoms point tuples */
|
|
for (j = 0; j < mum; j++)
|
|
{
|
|
tp = tp->next;
|
|
LWDEBUGF(5, "skipping point tuple %p", tp);
|
|
}
|
|
}
|
|
LWDEBUG(5, "loop exit");
|
|
LWDEBUGF(5, "comparison %d", minpoints);
|
|
LWDEBUGF(5, "comparison %d", count);
|
|
|
|
if (count < minpoints)
|
|
{
|
|
LWDEBUGF(5, "Minpoint check failed: needed %d, got %d",
|
|
minpoints, count);
|
|
LWGEOM_WKT_VALIDATION_ERROR(PARSER_ERROR_MOREPOINTS, the_geom.stack->next->uu.nn.parse_location);
|
|
}
|
|
LWDEBUG(4, "check_compoundcurve_minpoints complete");
|
|
}
|
|
|
|
void
|
|
check_linestring_minpoints()
|
|
{
|
|
tuple *tp = the_geom.stack->next; /* Current counting tuple */
|
|
int i, num;
|
|
int minpoints = 2;
|
|
|
|
LWDEBUG(3, "check_linestring_minpoints");
|
|
if (tp->uu.nn.num < minpoints)
|
|
{
|
|
num = tp->uu.nn.num;
|
|
for (i = 0; i < num; i++)
|
|
{
|
|
tp = tp->next;
|
|
}
|
|
LWDEBUGF(5, "Minpoint check failed: needed %d, got %d",
|
|
minpoints, tp->uu.nn.num);
|
|
LWGEOM_WKT_VALIDATION_ERROR(PARSER_ERROR_MOREPOINTS, the_geom.stack->next->uu.nn.parse_location);
|
|
}
|
|
}
|
|
|
|
void check_circularstring_minpoints()
|
|
{
|
|
check_linestring_minpoints();
|
|
}
|
|
|
|
void check_polyhedralsurface_patch(void)
|
|
{
|
|
check_polyhedralsurface_patch_minpoints();
|
|
check_ring_closed_3D();
|
|
}
|
|
|
|
|
|
/*
|
|
* Determines if the current face is closed and raises an error if it
|
|
* is not.
|
|
* This is done by walking through the tuple list and identifying the first
|
|
* and last point tuples, then comparing their X,Y and even Z values.
|
|
*
|
|
* NOTA: the only difference beetween this test and check_polygon_closed
|
|
* is the Z value check.
|
|
*/
|
|
void
|
|
check_ring_closed_3D(void)
|
|
{
|
|
tuple *tp = the_geom.stack; /* Current tuple */
|
|
int i; /* Loop counter */
|
|
int num; /* point count */
|
|
tuple *first, *last; /* First and last tuple of the ring */
|
|
|
|
LWDEBUG(3, "check_3d_ring_closed");
|
|
|
|
/* tuple counting points */
|
|
tp = tp->next;
|
|
if (tp->uu.nn.num > 0)
|
|
{
|
|
first = tp->next;
|
|
num = tp->uu.nn.num;
|
|
for (i = 0; i < num; i++)
|
|
tp = tp->next;
|
|
last = tp;
|
|
if ( first->uu.points[0] != last->uu.points[0]
|
|
|| first->uu.points[1] != last->uu.points[1]
|
|
|| (the_geom.hasZ &&
|
|
first->uu.points[2] != last->uu.points[2] ))
|
|
{
|
|
LWDEBUGF(4, "Unclosed geometry: (%f, %f, %f) != (%f, %f, %f)",
|
|
first->uu.points[0], first->uu.points[1], first->uu.points[2],
|
|
last->uu.points[0], last->uu.points[1], last->uu.points[2]);
|
|
LWDEBUGF(5, "First %p, last %p", first, last);
|
|
LWGEOM_WKT_VALIDATION_ERROR(PARSER_ERROR_UNCLOSED,
|
|
the_geom.stack->next->uu.nn.parse_location);
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Checks to ensure that current face of the Polyhedron contains the
|
|
* given number of points.
|
|
*/
|
|
void
|
|
check_polyhedralsurface_patch_minpoints(void)
|
|
{
|
|
tuple *tp = the_geom.stack->next; /* Current tuple */
|
|
int num = tp->uu.nn.num; /* point count */
|
|
int minpoints = 4;
|
|
|
|
LWDEBUG(3, "check_polyhedralsurface_patch_minpoints");
|
|
|
|
if (num < minpoints)
|
|
{
|
|
LWDEBUGF(5, "Minpoint check failed: needed %d, got %d",
|
|
minpoints, num);
|
|
LWDEBUGF(5, "tuple = %p; parse_location = %d; parser reported column = %d",
|
|
tp, tp->uu.nn.parse_location, lwg_parse_yylloc.last_column);
|
|
LWGEOM_WKT_VALIDATION_ERROR(PARSER_ERROR_MOREPOINTS,
|
|
the_geom.stack->next->uu.nn.parse_location);
|
|
}
|
|
}
|
|
|
|
|
|
void
|
|
pop(void)
|
|
{
|
|
LWDEBUGF(3, "pop: type= %d, tuple= %p", the_geom.stack->uu.nn.type,
|
|
the_geom.stack);
|
|
|
|
/* If popping a counting tuple or an empty tuple, update the parse_location to give
|
|
give better location context */
|
|
if (the_geom.stack->uu.nn.type == 0 || the_geom.stack->uu.nn.type == 0xff)
|
|
the_geom.stack->uu.nn.parse_location = lwg_parse_yylloc.last_column;
|
|
|
|
the_geom.stack = the_geom.stack->uu.nn.stack_next;
|
|
}
|
|
|
|
void
|
|
check_dims(int num)
|
|
{
|
|
LWDEBUGF(3, "check_dims the_geom.ndims = %d, num = %d", the_geom.ndims, num);
|
|
|
|
if ( the_geom.ndims != num)
|
|
{
|
|
if (the_geom.ndims)
|
|
{
|
|
LWGEOM_WKT_PARSER_ERROR(PARSER_ERROR_MIXDIMS);
|
|
}
|
|
else
|
|
{
|
|
|
|
LWDEBUGF(3, "check_dims: setting dim %d", num);
|
|
|
|
the_geom.ndims = num;
|
|
if ( num > 2 ) the_geom.hasZ = 1;
|
|
if ( num > 3 ) the_geom.hasM = 1;
|
|
}
|
|
}
|
|
}
|
|
|
|
#define WRITE_INT4_REAL(x,y) { memcpy(x->pos,&y,4); x->pos+=4;}
|
|
#define WRITE_INT4_REAL_MULTIPLE(x,y,z) { memcpy(x->pos,&y,z*4); x->pos+=(z*4);}
|
|
|
|
/*
|
|
we can shrink ints to one byte if they are less than 127
|
|
by setting the extra bit. Because if the different byte
|
|
ordering possibilities we need to set the lsb on little
|
|
endian to show a packed one and the msb on a big endian
|
|
machine
|
|
*/
|
|
#ifdef SHRINK_INTS
|
|
void
|
|
WRITE_INT4(output_state * out,int4 val)
|
|
{
|
|
if ( val <= 0x7f )
|
|
{
|
|
if ( getMachineEndian() == NDR )
|
|
{
|
|
val = (val<<1) | 1;
|
|
}
|
|
else
|
|
{
|
|
val |=0x80;
|
|
}
|
|
|
|
*out->pos++ = (uchar)val;
|
|
the_geom.alloc_size-=3;
|
|
}
|
|
else
|
|
{
|
|
if ( getMachineEndian() == NDR )
|
|
{
|
|
val <<=1;
|
|
}
|
|
WRITE_INT4_REAL(out,val);
|
|
}
|
|
}
|
|
#else
|
|
#define WRITE_INT4 WRITE_INT4_REAL
|
|
#endif
|
|
|
|
|
|
void
|
|
WRITE_DOUBLES(output_state* out,double* points, int cnt)
|
|
{
|
|
memcpy(out->pos,points,sizeof(double)*cnt);
|
|
out->pos+=sizeof(double)*cnt;
|
|
}
|
|
|
|
void
|
|
empty_stack(tuple *this,output_state* out)
|
|
{
|
|
/* Do nothing but provide an empty base for the geometry stack */
|
|
}
|
|
void
|
|
write_point_2(tuple* this,output_state* out)
|
|
{
|
|
WRITE_DOUBLES(out,this->uu.points,2);
|
|
}
|
|
|
|
void
|
|
write_point_3(tuple* this,output_state* out)
|
|
{
|
|
WRITE_DOUBLES(out,this->uu.points,3);
|
|
}
|
|
|
|
void
|
|
write_point_4(tuple* this,output_state* out)
|
|
{
|
|
WRITE_DOUBLES(out,this->uu.points,4);
|
|
}
|
|
|
|
void
|
|
write_point_2i(tuple* this,output_state* out)
|
|
{
|
|
WRITE_INT4_REAL_MULTIPLE(out,this->uu.points,2);
|
|
}
|
|
|
|
void
|
|
write_point_3i(tuple* this,output_state* out)
|
|
{
|
|
WRITE_INT4_REAL_MULTIPLE(out,this->uu.points,3);
|
|
}
|
|
|
|
void
|
|
write_point_4i(tuple* this,output_state* out)
|
|
{
|
|
WRITE_INT4_REAL_MULTIPLE(out,this->uu.points,4);
|
|
}
|
|
void
|
|
write_type(tuple* this,output_state* out)
|
|
{
|
|
uchar type=0;
|
|
|
|
/* Empty handler - switch back */
|
|
if ( this->uu.nn.type == 0xff )
|
|
this->uu.nn.type = COLLECTIONTYPE;
|
|
|
|
type |= this->uu.nn.type;
|
|
|
|
if (the_geom.ndims) /* Support empty */
|
|
{
|
|
TYPE_SETZM(type, the_geom.hasZ, the_geom.hasM);
|
|
}
|
|
|
|
if ( the_geom.srid != -1 )
|
|
{
|
|
type |= 0x40;
|
|
}
|
|
|
|
*(out->pos)=type;
|
|
out->pos++;
|
|
|
|
if ( the_geom.srid != -1 )
|
|
{
|
|
/* Only the first geometry will have a srid attached */
|
|
WRITE_INT4(out,the_geom.srid);
|
|
the_geom.srid = -1;
|
|
}
|
|
}
|
|
|
|
void
|
|
write_count(tuple* this,output_state* out)
|
|
{
|
|
int num = this->uu.nn.num;
|
|
WRITE_INT4(out,num);
|
|
}
|
|
|
|
void
|
|
write_type_count(tuple* this,output_state* out)
|
|
{
|
|
write_type(this,out);
|
|
write_count(this,out);
|
|
}
|
|
|
|
void
|
|
alloc_point(void)
|
|
{
|
|
LWDEBUG(3, "alloc_point");
|
|
|
|
alloc_stack_tuple(POINTTYPE,write_type,1);
|
|
|
|
}
|
|
|
|
void
|
|
alloc_linestring(void)
|
|
{
|
|
LWDEBUG(3, "alloc_linestring");
|
|
|
|
alloc_stack_tuple(LINETYPE,write_type,1);
|
|
|
|
}
|
|
|
|
void alloc_linestring_closed(void)
|
|
{
|
|
LWDEBUG(3, "alloc_linestring_closed called.");
|
|
|
|
alloc_linestring();
|
|
}
|
|
|
|
void
|
|
alloc_circularstring(void)
|
|
{
|
|
LWDEBUG(3, "alloc_circularstring");
|
|
|
|
alloc_stack_tuple(CIRCSTRINGTYPE,write_type,1);
|
|
}
|
|
|
|
void alloc_circularstring_closed(void)
|
|
{
|
|
LWDEBUG(3, "alloc_circularstring_closed");
|
|
|
|
alloc_circularstring();
|
|
}
|
|
|
|
void
|
|
alloc_polygon(void)
|
|
{
|
|
LWDEBUG(3, "alloc_polygon");
|
|
|
|
alloc_stack_tuple(POLYGONTYPE, write_type,1);
|
|
}
|
|
|
|
void
|
|
alloc_triangle(void)
|
|
{
|
|
LWDEBUG(3, "alloc_triangle");
|
|
|
|
alloc_stack_tuple(TRIANGLETYPE, write_type,1);
|
|
}
|
|
|
|
void
|
|
alloc_curvepolygon(void)
|
|
{
|
|
LWDEBUG(3, "alloc_curvepolygon called.");
|
|
|
|
alloc_stack_tuple(CURVEPOLYTYPE, write_type, 1);
|
|
}
|
|
|
|
void
|
|
alloc_compoundcurve(void)
|
|
{
|
|
LWDEBUG(3, "alloc_compoundcurve called.");
|
|
|
|
alloc_stack_tuple(COMPOUNDTYPE, write_type, 1);
|
|
}
|
|
|
|
void
|
|
alloc_compoundcurve_closed(void)
|
|
{
|
|
LWDEBUG(3, "alloc_compoundcurve called.");
|
|
|
|
alloc_stack_tuple(COMPOUNDTYPE, write_type, 1);
|
|
}
|
|
|
|
void
|
|
alloc_multipoint(void)
|
|
{
|
|
LWDEBUG(3, "alloc_multipoint");
|
|
|
|
alloc_stack_tuple(MULTIPOINTTYPE,write_type,1);
|
|
}
|
|
|
|
void
|
|
alloc_multilinestring(void)
|
|
{
|
|
LWDEBUG(3, "alloc_multilinestring");
|
|
|
|
alloc_stack_tuple(MULTILINETYPE,write_type,1);
|
|
}
|
|
|
|
void
|
|
alloc_multicurve(void)
|
|
{
|
|
LWDEBUG(3, "alloc_multicurve");
|
|
|
|
alloc_stack_tuple(MULTICURVETYPE,write_type,1);
|
|
}
|
|
|
|
void
|
|
alloc_multipolygon(void)
|
|
{
|
|
LWDEBUG(3, "alloc_multipolygon");
|
|
|
|
alloc_stack_tuple(MULTIPOLYGONTYPE,write_type,1);
|
|
}
|
|
|
|
void
|
|
alloc_multisurface(void)
|
|
{
|
|
LWDEBUG(3, "alloc_multisurface called");
|
|
|
|
alloc_stack_tuple(MULTISURFACETYPE,write_type,1);
|
|
}
|
|
|
|
void
|
|
alloc_polyhedralsurface(void)
|
|
{
|
|
LWDEBUG(3, "alloc_polyhedralsurface called");
|
|
|
|
alloc_stack_tuple(POLYHEDRALSURFACETYPE,write_type,1);
|
|
}
|
|
|
|
void
|
|
alloc_tin(void)
|
|
{
|
|
LWDEBUG(3, "alloc_tin called");
|
|
|
|
alloc_stack_tuple(TINTYPE,write_type,1);
|
|
}
|
|
|
|
void
|
|
alloc_geomertycollection(void)
|
|
{
|
|
LWDEBUG(3, "alloc_geometrycollection");
|
|
|
|
alloc_stack_tuple(COLLECTIONTYPE,write_type,1);
|
|
}
|
|
|
|
void
|
|
alloc_counter(void)
|
|
{
|
|
LWDEBUG(3, "alloc_counter");
|
|
|
|
alloc_stack_tuple(0,write_count,4);
|
|
}
|
|
|
|
void
|
|
alloc_empty(void)
|
|
{
|
|
tuple* st = the_geom.stack;
|
|
|
|
LWDEBUG(3, "alloc_empty");
|
|
|
|
/* Find the last geometry */
|
|
while (st->uu.nn.type == 0)
|
|
{
|
|
st =st->uu.nn.stack_next;
|
|
}
|
|
|
|
/* Reclaim memory */
|
|
free_tuple(st->next);
|
|
|
|
/* Put an empty geometry collection on the top of the stack */
|
|
st->next=NULL;
|
|
the_geom.stack=st;
|
|
the_geom.alloc_size=st->uu.nn.size_here;
|
|
|
|
/* Mark as a empty stop */
|
|
if (st->uu.nn.type != 0xFF)
|
|
{
|
|
st->uu.nn.type=0xFF;
|
|
st->of = write_type_count;
|
|
the_geom.alloc_size+=4;
|
|
st->uu.nn.size_here=the_geom.alloc_size;
|
|
}
|
|
|
|
st->uu.nn.num=0;
|
|
}
|
|
|
|
void
|
|
make_serialized_lwgeom(LWGEOM_PARSER_RESULT *lwg_parser_result)
|
|
{
|
|
uchar* out_c;
|
|
output_state out;
|
|
tuple* cur;
|
|
|
|
LWDEBUG(3, "make_serialized_lwgeom");
|
|
|
|
/* Allocate the LWGEOM itself */
|
|
out_c = (uchar*)local_malloc(the_geom.alloc_size);
|
|
out.pos = out_c;
|
|
cur = the_geom.first ;
|
|
|
|
while (cur)
|
|
{
|
|
cur->of(cur,&out);
|
|
cur=cur->next;
|
|
}
|
|
|
|
/* Setup the LWGEOM_PARSER_RESULT structure */
|
|
lwg_parser_result->serialized_lwgeom = out_c;
|
|
lwg_parser_result->size = the_geom.alloc_size;
|
|
|
|
return;
|
|
}
|
|
|
|
void
|
|
lwg_parse_yynotice(char* s)
|
|
{
|
|
lwnotice(s);
|
|
}
|
|
|
|
int
|
|
lwg_parse_yyerror(char* s)
|
|
{
|
|
LWGEOM_WKT_PARSER_ERROR(PARSER_ERROR_INVALIDGEOM);
|
|
return 1;
|
|
}
|
|
|
|
/*
|
|
Table below generated using this ruby.
|
|
|
|
a=(0..0xff).to_a.collect{|x|0xff};('0'..'9').each{|x|a[x[0]]=x[0]-'0'[0]}
|
|
('a'..'f').each{|x|v=x[0]-'a'[0]+10;a[x[0]]=a[x.upcase[0]]=v}
|
|
puts '{'+a.join(",")+'}'
|
|
|
|
*/
|
|
static const uchar to_hex[] =
|
|
{
|
|
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
|
|
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
|
|
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
|
|
0,1,2,3,4,5,6,7,8,9,255,255,255,255,255,255,255,10,11,12,13,14,
|
|
15,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
|
|
255,255,255,255,255,255,255,255,255,255,255,10,11,12,13,14,15,255,
|
|
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
|
|
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
|
|
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
|
|
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
|
|
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
|
|
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
|
|
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
|
|
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
|
|
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
|
|
255,255,255,255,255,255,255,255
|
|
};
|
|
|
|
uchar
|
|
strhex_readbyte(const char* in)
|
|
{
|
|
if ( *in == 0 )
|
|
{
|
|
if ( ! parser_ferror_occured)
|
|
{
|
|
LWGEOM_WKB_PARSER_ERROR(PARSER_ERROR_INVALIDGEOM);
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
if (!parser_ferror_occured)
|
|
{
|
|
lwg_parse_yylloc.last_column++;
|
|
return to_hex[(int)*in]<<4 | to_hex[(int)*(in+1)];
|
|
}
|
|
else
|
|
{
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
uchar
|
|
read_wkb_byte(const char** in)
|
|
{
|
|
uchar ret = strhex_readbyte(*in);
|
|
(*in)+=2;
|
|
return ret;
|
|
}
|
|
|
|
int swap_order;
|
|
|
|
void
|
|
read_wkb_bytes(const char** in, uchar* out, int cnt)
|
|
{
|
|
if ( ! swap_order )
|
|
{
|
|
while (cnt--) *out++ = read_wkb_byte(in);
|
|
}
|
|
else
|
|
{
|
|
out += (cnt-1);
|
|
while (cnt--) *out-- = read_wkb_byte(in);
|
|
}
|
|
}
|
|
|
|
int4
|
|
read_wkb_int(const char** in)
|
|
{
|
|
int4 ret=0;
|
|
read_wkb_bytes(in,(uchar*)&ret,4);
|
|
return ret;
|
|
}
|
|
|
|
double
|
|
read_wkb_double(const char** in)
|
|
{
|
|
double ret=0;
|
|
read_wkb_bytes(in,(uchar*)&ret,8);
|
|
return ret;
|
|
}
|
|
|
|
void
|
|
read_wkb_point(const char **b)
|
|
{
|
|
int i;
|
|
tuple* p = NULL;
|
|
|
|
switch (the_geom.ndims)
|
|
{
|
|
case 2:
|
|
p=alloc_tuple(write_point_2, 16);
|
|
break;
|
|
case 3:
|
|
p=alloc_tuple(write_point_3, 24);
|
|
break;
|
|
case 4:
|
|
p=alloc_tuple(write_point_4, 32);
|
|
break;
|
|
}
|
|
|
|
for (i=0; i<the_geom.ndims; i++)
|
|
{
|
|
p->uu.points[i]=read_wkb_double(b);
|
|
}
|
|
|
|
inc_num();
|
|
check_dims(the_geom.ndims);
|
|
}
|
|
|
|
void
|
|
read_wkb_polygon(const char **b)
|
|
{
|
|
/* Stack the number of ORDINATE_ARRAYs (rings) */
|
|
int4 cnt=read_wkb_int(b);
|
|
alloc_counter();
|
|
|
|
/* Read through each ORDINATE_ARRAY in turn */
|
|
while (cnt--)
|
|
{
|
|
if ( parser_ferror_occured ) return;
|
|
|
|
read_wkb_ordinate_array(b);
|
|
}
|
|
|
|
pop();
|
|
}
|
|
|
|
void
|
|
read_wkb_triangle(const char **b)
|
|
{
|
|
read_wkb_ordinate_array(b);
|
|
}
|
|
|
|
void
|
|
read_wkb_linestring(const char **b)
|
|
{
|
|
|
|
read_wkb_ordinate_array(b);
|
|
}
|
|
|
|
|
|
void
|
|
read_wkb_circstring(const char **b)
|
|
{
|
|
|
|
read_wkb_ordinate_array(b);
|
|
}
|
|
|
|
void
|
|
read_wkb_ordinate_array(const char **b)
|
|
{
|
|
/* Read through a WKB ordinate array */
|
|
int4 cnt=read_wkb_int(b);
|
|
alloc_counter();
|
|
|
|
while (cnt--)
|
|
{
|
|
if ( parser_ferror_occured ) return;
|
|
read_wkb_point(b);
|
|
}
|
|
|
|
/* Perform a check of the ordinate array */
|
|
pop();
|
|
}
|
|
|
|
void
|
|
read_collection(const char **b, read_col_func f)
|
|
{
|
|
/* Read through a COLLECTION or an EWKB */
|
|
int4 cnt=read_wkb_int(b);
|
|
alloc_counter();
|
|
|
|
while (cnt--)
|
|
{
|
|
if ( parser_ferror_occured ) return;
|
|
f(b);
|
|
}
|
|
|
|
pop();
|
|
}
|
|
|
|
void
|
|
parse_wkb(const char **b)
|
|
{
|
|
int4 type;
|
|
uchar xdr = read_wkb_byte(b);
|
|
int4 localsrid;
|
|
|
|
LWDEBUG(3, "parse_wkb");
|
|
|
|
swap_order=0;
|
|
|
|
if ( xdr != getMachineEndian() )
|
|
{
|
|
swap_order=1;
|
|
}
|
|
|
|
type = read_wkb_int(b);
|
|
|
|
/* quick exit on error */
|
|
if ( parser_ferror_occured ) return;
|
|
|
|
the_geom.ndims=2;
|
|
if (type & WKBZOFFSET)
|
|
{
|
|
the_geom.hasZ = 1;
|
|
the_geom.ndims++;
|
|
}
|
|
else the_geom.hasZ = 0;
|
|
if (type & WKBMOFFSET)
|
|
{
|
|
the_geom.hasM = 1;
|
|
the_geom.ndims++;
|
|
}
|
|
else the_geom.hasM = 0;
|
|
|
|
if (type & WKBSRIDFLAG )
|
|
{
|
|
/* local (in-EWKB) srid spec overrides SRID=#; */
|
|
localsrid = read_wkb_int(b);
|
|
if ( localsrid != -1 )
|
|
{
|
|
if ( the_geom.srid == -1 ) the_geom.alloc_size += 4;
|
|
the_geom.srid = localsrid;
|
|
}
|
|
}
|
|
|
|
type &=0x0f;
|
|
alloc_stack_tuple(type,write_type,1);
|
|
|
|
switch (type)
|
|
{
|
|
case POINTTYPE:
|
|
read_wkb_point(b);
|
|
break;
|
|
case LINETYPE:
|
|
read_wkb_linestring(b);
|
|
break;
|
|
case CIRCSTRINGTYPE:
|
|
read_wkb_circstring(b);
|
|
break;
|
|
case POLYGONTYPE:
|
|
read_wkb_polygon(b);
|
|
break;
|
|
case TRIANGLETYPE:
|
|
read_wkb_triangle(b);
|
|
break;
|
|
case COMPOUNDTYPE:
|
|
case CURVEPOLYTYPE:
|
|
case MULTIPOINTTYPE:
|
|
case MULTILINETYPE:
|
|
case MULTICURVETYPE:
|
|
case MULTIPOLYGONTYPE:
|
|
case MULTISURFACETYPE:
|
|
case POLYHEDRALSURFACETYPE:
|
|
case TINTYPE:
|
|
case COLLECTIONTYPE:
|
|
read_collection(b,parse_wkb);
|
|
break;
|
|
|
|
default:
|
|
LWGEOM_WKB_PARSER_ERROR(PARSER_ERROR_INVALIDWKBTYPE);
|
|
}
|
|
|
|
pop();
|
|
}
|
|
|
|
|
|
void
|
|
alloc_wkb(const char *parser)
|
|
{
|
|
LWDEBUG(3, "alloc_wkb");
|
|
|
|
parse_wkb(&parser);
|
|
}
|
|
|
|
/*
|
|
Parse a string and return a LW_GEOM
|
|
*/
|
|
int
|
|
parse_it(LWGEOM_PARSER_RESULT *lwg_parser_result, const char *geometry, int flags, allocator allocfunc, report_error errfunc)
|
|
{
|
|
LWDEBUGF(3, "parse_it: %s with parser flags %d", geometry, flags);
|
|
|
|
local_malloc = allocfunc;
|
|
error_func=errfunc;
|
|
|
|
parser_ferror_occured = 0;
|
|
|
|
/* Setup the inital parser flags and empty the return struct */
|
|
current_lwg_parser_result = lwg_parser_result;
|
|
current_parser_check_flags = flags;
|
|
lwg_parser_result->serialized_lwgeom = NULL;
|
|
lwg_parser_result->size = 0;
|
|
lwg_parser_result->wkinput = geometry;
|
|
|
|
init_parser(geometry);
|
|
|
|
lwg_parse_yyparse();
|
|
|
|
close_parser();
|
|
|
|
/* Return the parsed geometry */
|
|
make_serialized_lwgeom(lwg_parser_result);
|
|
|
|
return parser_ferror_occured;
|
|
}
|
|
|
|
int
|
|
parse_lwg(LWGEOM_PARSER_RESULT *lwg_parser_result, const char* geometry, int flags, allocator allocfunc, report_error errfunc)
|
|
{
|
|
return parse_it(lwg_parser_result, geometry, flags, allocfunc, errfunc);
|
|
}
|
|
|
|
void
|
|
set_zm(char z, char m)
|
|
{
|
|
LWDEBUGF(4, "set_zm %d, %d", z, m);
|
|
|
|
the_geom.hasZ = z;
|
|
the_geom.hasM = m;
|
|
the_geom.ndims = 2+z+m;
|
|
}
|
|
|