2 * $Header: /cvsroot/pgsql/src/test/regress/regress.c,v 1.19 1998/01/06 18:53:02 momjian Exp $
5 #include <float.h> /* faked on sunos */
7 #include <string.h> /* for MemSet() */
11 #include "utils/geo_decls.h" /* includes <math.h> */
12 #include "executor/executor.h" /* For GetAttributeByName */
21 extern double *regress_dist_ptpath(Point *pt, PATH *path);
22 extern double *regress_path_dist(PATH *p1, PATH *p2);
23 extern PATH *poly2path(POLYGON *poly);
24 extern Point *interpt_pp(PATH *p1, PATH *p2);
25 extern void regress_lseg_construct(LSEG *lseg, Point *pt1, Point *pt2);
26 extern char overpaid(TUPLE tuple);
27 extern int boxarea(BOX *box);
28 extern char *reverse_c16(char *string);
31 ** Distance from a point to a path
34 regress_dist_ptpath(pt, path)
46 result = PALLOCTYPE(double);
47 *result = Abs((double) DBL_MAX); /* +infinity */
50 result = point_distance(pt, &path->p[0]);
55 * the distance from a point to a path is the smallest
56 * distance from the point to any of its constituent segments.
58 Assert(path->npts > 1);
59 result = PALLOCTYPE(double);
60 for (i = 0; i < path->npts - 1; ++i)
62 regress_lseg_construct(&lseg, &path->p[i], &path->p[i + 1]);
63 tmp = dist_ps(pt, &lseg);
64 if (i == 0 || *tmp < *result)
74 /* this essentially does a cartesian product of the lsegs in the
75 two paths, and finds the min distance between any two lsegs */
77 regress_path_dist(p1, p2)
88 regress_lseg_construct(&seg1, &p1->p[0], &p1->p[1]);
89 regress_lseg_construct(&seg2, &p2->p[0], &p2->p[1]);
90 min = lseg_distance(&seg1, &seg2);
92 for (i = 0; i < p1->npts - 1; i++)
93 for (j = 0; j < p2->npts - 1; j++)
95 regress_lseg_construct(&seg1, &p1->p[i], &p1->p[i + 1]);
96 regress_lseg_construct(&seg2, &p2->p[j], &p2->p[j + 1]);
98 if (*min < *(tmp = lseg_distance(&seg1, &seg2)))
111 char *output = (char *) PALLOC(2 * (P_MAXDIG + 1) * poly->npts + 64);
112 char buf[2 * (P_MAXDIG) + 20];
114 sprintf(output, "(1, %*d", P_MAXDIG, poly->npts);
116 for (i = 0; i < poly->npts; i++)
118 sprintf(buf, ",%*g,%*g", P_MAXDIG, poly->p[i].x, P_MAXDIG, poly->p[i].y);
122 sprintf(buf, "%c", RDELIM);
124 return (path_in(output));
127 /* return the point where two paths intersect. Assumes that they do. */
144 bool found; /* We've found the intersection */
146 found = false; /* Haven't found it yet */
148 for (i = 0; i < p1->npts - 1 && !found; i++)
149 for (j = 0; j < p2->npts - 1 && !found; j++)
151 regress_lseg_construct(&seg1, &p1->p[i], &p1->p[i + 1]);
152 regress_lseg_construct(&seg2, &p2->p[j], &p2->p[j + 1]);
153 if (lseg_intersect(&seg1, &seg2))
158 ln = line_construct_pp(&seg2.p[0], &seg2.p[1]);
159 retval = interpt_sl(&seg1, ln);
161 retval = lseg_interpt(&seg1, &seg2);
167 /* like lseg_construct, but assume space already allocated */
169 regress_lseg_construct(lseg, pt1, pt2)
174 lseg->p[0].x = pt1->x;
175 lseg->p[0].y = pt1->y;
176 lseg->p[1].x = pt2->x;
177 lseg->p[1].y = pt2->y;
178 lseg->m = point_sl(pt1, pt2);
189 salary = (long) GetAttributeByName(tuple, "salary", &isnull);
190 return (salary > 699);
194 * This used to be "circle", but I added circle to builtins,
195 * so needed to make sure the names do not collide. - tgl 97/04/21
204 WIDGET *widget_in(char *str);
205 char *widget_out(WIDGET * widget);
206 int pt_in_widget(Point *point, WIDGET * widget);
222 for (i = 0, p = str; *p && i < NARGS && *p != RDELIM; p++)
223 if (*p == ',' || (*p == LDELIM && !i))
227 result = (WIDGET *) palloc(sizeof(WIDGET));
228 result->center.x = atof(coord[0]);
229 result->center.y = atof(coord[1]);
230 result->radius = atof(coord[2]);
232 sprintf(buf2, "widget_in: read (%f, %f, %f)\n", result->center.x,
233 result->center.y, result->radius);
246 result = (char *) palloc(60);
247 sprintf(result, "(%g,%g,%g)",
248 widget->center.x, widget->center.y, widget->radius);
253 pt_in_widget(point, widget)
257 extern double point_dt();
259 return (point_dt(point, &widget->center) < widget->radius);
262 #define ABS(X) ((X) > 0 ? (X) : -(X))
273 width = ABS(box->high.x - box->low.x);
274 height = ABS(box->high.y - box->low.y);
275 return (width * height);
286 if (!(new_string = palloc(16)))
288 fprintf(stderr, "reverse_c16: palloc failed\n");
291 MemSet(new_string, 0, 16);
292 for (i = 0; i < 16 && string[i]; ++i)
294 if (i == 16 || !string[i])
298 new_string[len - i] = string[i];
302 #include "executor/spi.h" /* this is what you need to work with SPI */
303 #include "commands/trigger.h" /* -"- and triggers */
305 static TransactionId fd17b_xid = InvalidTransactionId;
306 static TransactionId fd17a_xid = InvalidTransactionId;
307 static int fd17b_level = 0;
308 static int fd17a_level = 0;
309 static bool fd17b_recursion = true;
310 static bool fd17a_recursion = true;
311 HeapTuple funny_dup17(void);
313 HeapTuple /* have to return HeapTuple to Executor */
328 tuple = CurrentTriggerData->tg_trigtuple;
329 rel = CurrentTriggerData->tg_relation;
330 tupdesc = rel->rd_att;
331 if (TRIGGER_FIRED_BEFORE(CurrentTriggerData->tg_event))
334 level = &fd17b_level;
335 recursion = &fd17b_recursion;
341 level = &fd17a_level;
342 recursion = &fd17a_recursion;
346 CurrentTriggerData = NULL;
348 if (!TransactionIdIsCurrentTransactionId(*xid))
350 *xid = GetCurrentTransactionId();
368 sprintf(sql, "insert into %s select * from %s where %s = '%s'::%s",
369 SPI_getrelname(rel), SPI_getrelname(rel),
370 SPI_fname(tupdesc, 1),
371 SPI_getvalue(tuple, tupdesc, 1),
372 SPI_gettype(tupdesc, 1));
374 if ((ret = SPI_exec(sql, 0)) < 0)
375 elog(ABORT, "funny_dup17 (fired %s) on level %3d: SPI_exec (insert ...) returned %d",
378 inserted = SPI_processed;
380 sprintf(sql, "select count (*) from %s where %s = '%s'::%s",
382 SPI_fname(tupdesc, 1),
383 SPI_getvalue(tuple, tupdesc, 1),
384 SPI_gettype(tupdesc, 1));
386 if ((ret = SPI_exec(sql, 0)) < 0)
387 elog(ABORT, "funny_dup17 (fired %s) on level %3d: SPI_exec (select ...) returned %d",
390 if (SPI_processed > 0)
395 SPI_tuptable->vals[0],
396 SPI_tuptable->tupdesc,
402 elog(NOTICE, "funny_dup17 (fired %s) on level %3d: %d/%d tuples inserted/selected",
403 when, *level, inserted, selected);
410 *xid = InvalidTransactionId;
415 HeapTuple ttdummy(void);
416 int32 set_ttdummy(int32 on);
418 extern int4 nextval(struct varlena * seqin);
420 #define TTDUMMY_INFINITY 999999
422 static void *splan = NULL;
423 static bool ttoff = false;
428 Trigger *trigger; /* to get trigger name */
429 char **args; /* arguments */
430 int attnum[2]; /* fnumbers of start/stop columns */
433 Datum *cvals; /* column values */
434 char *cnulls; /* column nulls */
435 char *relname; /* triggered relation name */
436 Relation rel; /* triggered relation */
438 HeapTuple newtuple = NULL;
440 TupleDesc tupdesc; /* tuple description */
441 int natts; /* # of attributes */
442 bool isnull; /* to know is some column NULL or not */
446 if (!CurrentTriggerData)
447 elog(ABORT, "ttdummy: triggers are not initialized");
448 if (TRIGGER_FIRED_FOR_STATEMENT(CurrentTriggerData->tg_event))
449 elog(ABORT, "ttdummy: can't process STATEMENT events");
450 if (TRIGGER_FIRED_AFTER(CurrentTriggerData->tg_event))
451 elog(ABORT, "ttdummy: must be fired before event");
452 if (TRIGGER_FIRED_BY_INSERT(CurrentTriggerData->tg_event))
453 elog (ABORT, "ttdummy: can't process INSERT event");
454 if (TRIGGER_FIRED_BY_UPDATE(CurrentTriggerData->tg_event))
455 newtuple = CurrentTriggerData->tg_newtuple;
457 trigtuple = CurrentTriggerData->tg_trigtuple;
459 rel = CurrentTriggerData->tg_relation;
460 relname = SPI_getrelname(rel);
462 /* check if TT is OFF for this relation */
463 if (ttoff) /* OFF - nothing to do */
466 return ((newtuple != NULL) ? newtuple : trigtuple);
469 trigger = CurrentTriggerData->tg_trigger;
471 if (trigger->tgnargs != 2)
472 elog(ABORT, "ttdummy (%s): invalid (!= 2) number of arguments %d",
473 relname, trigger->tgnargs);
475 args = trigger->tgargs;
476 tupdesc = rel->rd_att;
477 natts = tupdesc->natts;
479 CurrentTriggerData = NULL;
481 for (i = 0; i < 2; i++ )
483 attnum[i] = SPI_fnumber (tupdesc, args[i]);
485 elog(ABORT, "ttdummy (%s): there is no attribute %s", relname, args[i]);
486 if (SPI_gettypeid (tupdesc, attnum[i]) != INT4OID)
487 elog(ABORT, "ttdummy (%s): attributes %s and %s must be of abstime type",
488 relname, args[0], args[1]);
491 oldon = SPI_getbinval (trigtuple, tupdesc, attnum[0], &isnull);
493 elog(ABORT, "ttdummy (%s): %s must be NOT NULL", relname, args[0]);
495 oldoff = SPI_getbinval (trigtuple, tupdesc, attnum[1], &isnull);
497 elog(ABORT, "ttdummy (%s): %s must be NOT NULL", relname, args[1]);
499 if (newtuple != NULL) /* UPDATE */
501 newon = SPI_getbinval (newtuple, tupdesc, attnum[0], &isnull);
503 elog(ABORT, "ttdummy (%s): %s must be NOT NULL", relname, args[0]);
504 newoff = SPI_getbinval (newtuple, tupdesc, attnum[1], &isnull);
506 elog(ABORT, "ttdummy (%s): %s must be NOT NULL", relname, args[1]);
508 if ( oldon != newon || oldoff != newoff )
509 elog (ABORT, "ttdummy (%s): you can't change %s and/or %s columns (use set_ttdummy)",
510 relname, args[0], args[1]);
512 if ( newoff != TTDUMMY_INFINITY )
514 pfree (relname); /* allocated in upper executor context */
518 else if (oldoff != TTDUMMY_INFINITY) /* DELETE */
525 struct varlena *seqname = textin ("ttdummy_seq");
527 newoff = nextval (seqname);
531 /* Connect to SPI manager */
532 if ((ret = SPI_connect()) < 0)
533 elog(ABORT, "ttdummy (%s): SPI_connect returned %d", relname, ret);
535 /* Fetch tuple values and nulls */
536 cvals = (Datum *) palloc (natts * sizeof (Datum));
537 cnulls = (char *) palloc (natts * sizeof (char));
538 for (i = 0; i < natts; i++)
540 cvals[i] = SPI_getbinval ((newtuple != NULL) ? newtuple : trigtuple,
541 tupdesc, i + 1, &isnull);
542 cnulls[i] = (isnull) ? 'n' : ' ';
545 /* change date column(s) */
546 if (newtuple) /* UPDATE */
548 cvals[attnum[0] - 1] = newoff; /* start_date eq current date */
549 cnulls[attnum[0] - 1] = ' ';
550 cvals[attnum[1] - 1] = TTDUMMY_INFINITY; /* stop_date eq INFINITY */
551 cnulls[attnum[1] - 1] = ' ';
555 cvals[attnum[1] - 1] = newoff; /* stop_date eq current date */
556 cnulls[attnum[1] - 1] = ' ';
559 /* if there is no plan ... */
566 /* allocate ctypes for preparation */
567 ctypes = (Oid *) palloc(natts * sizeof(Oid));
571 * INSERT INTO _relation_ VALUES ($1, ...)
573 sprintf(sql, "INSERT INTO %s VALUES (", relname);
574 for (i = 1; i <= natts; i++)
576 sprintf(sql + strlen(sql), "$%d%s",
577 i, (i < natts) ? ", " : ")");
578 ctypes[i - 1] = SPI_gettypeid(tupdesc, i);
581 /* Prepare plan for query */
582 pplan = SPI_prepare(sql, natts, ctypes);
584 elog(ABORT, "ttdummy (%s): SPI_prepare returned %d", relname, SPI_result);
586 pplan = SPI_saveplan(pplan);
588 elog(ABORT, "ttdummy (%s): SPI_saveplan returned %d", relname, SPI_result);
593 ret = SPI_execp(splan, cvals, cnulls, 0);
596 elog(ABORT, "ttdummy (%s): SPI_execp returned %d", relname, ret);
598 /* Tuple to return to upper Executor ... */
599 if (newtuple) /* UPDATE */
603 tmptuple = SPI_copytuple (trigtuple);
604 rettuple = SPI_modifytuple (rel, tmptuple, 1, &(attnum[1]), &newoff, NULL);
605 SPI_pfree (tmptuple);
608 rettuple = trigtuple;
610 SPI_finish(); /* don't forget say Bye to SPI mgr */
618 set_ttdummy(int32 on)
621 if (ttoff) /* OFF currently */