2 * $Header: /cvsroot/pgsql/src/test/regress/regress.c,v 1.28 1998/09/01 03:29:11 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_name(char *string);
31 ** Distance from a point to a path
34 regress_dist_ptpath(pt, path)
46 result = palloc(sizeof(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 = palloc(sizeof(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);
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(NAMEDATALEN)))
288 fprintf(stderr, "reverse_name: palloc failed\n");
291 MemSet(new_string, 0, NAMEDATALEN);
292 for (i = 0; i < NAMEDATALEN && string[i]; ++i)
294 if (i == NAMEDATALEN || !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(ERROR, "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(ERROR, "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 */
435 Datum *cvals; /* column values */
436 char *cnulls; /* column nulls */
437 char *relname; /* triggered relation name */
438 Relation rel; /* triggered relation */
440 HeapTuple newtuple = NULL;
442 TupleDesc tupdesc; /* tuple description */
443 int natts; /* # of attributes */
444 bool isnull; /* to know is some column NULL or not */
448 if (!CurrentTriggerData)
449 elog(ERROR, "ttdummy: triggers are not initialized");
450 if (TRIGGER_FIRED_FOR_STATEMENT(CurrentTriggerData->tg_event))
451 elog(ERROR, "ttdummy: can't process STATEMENT events");
452 if (TRIGGER_FIRED_AFTER(CurrentTriggerData->tg_event))
453 elog(ERROR, "ttdummy: must be fired before event");
454 if (TRIGGER_FIRED_BY_INSERT(CurrentTriggerData->tg_event))
455 elog(ERROR, "ttdummy: can't process INSERT event");
456 if (TRIGGER_FIRED_BY_UPDATE(CurrentTriggerData->tg_event))
457 newtuple = CurrentTriggerData->tg_newtuple;
459 trigtuple = CurrentTriggerData->tg_trigtuple;
461 rel = CurrentTriggerData->tg_relation;
462 relname = SPI_getrelname(rel);
464 /* check if TT is OFF for this relation */
465 if (ttoff) /* OFF - nothing to do */
468 return (newtuple != NULL) ? newtuple : trigtuple;
471 trigger = CurrentTriggerData->tg_trigger;
473 if (trigger->tgnargs != 2)
474 elog(ERROR, "ttdummy (%s): invalid (!= 2) number of arguments %d",
475 relname, trigger->tgnargs);
477 args = trigger->tgargs;
478 tupdesc = rel->rd_att;
479 natts = tupdesc->natts;
481 CurrentTriggerData = NULL;
483 for (i = 0; i < 2; i++)
485 attnum[i] = SPI_fnumber(tupdesc, args[i]);
487 elog(ERROR, "ttdummy (%s): there is no attribute %s", relname, args[i]);
488 if (SPI_gettypeid(tupdesc, attnum[i]) != INT4OID)
489 elog(ERROR, "ttdummy (%s): attributes %s and %s must be of abstime type",
490 relname, args[0], args[1]);
493 oldon = SPI_getbinval(trigtuple, tupdesc, attnum[0], &isnull);
495 elog(ERROR, "ttdummy (%s): %s must be NOT NULL", relname, args[0]);
497 oldoff = SPI_getbinval(trigtuple, tupdesc, attnum[1], &isnull);
499 elog(ERROR, "ttdummy (%s): %s must be NOT NULL", relname, args[1]);
501 if (newtuple != NULL) /* UPDATE */
503 newon = SPI_getbinval(newtuple, tupdesc, attnum[0], &isnull);
505 elog(ERROR, "ttdummy (%s): %s must be NOT NULL", relname, args[0]);
506 newoff = SPI_getbinval(newtuple, tupdesc, attnum[1], &isnull);
508 elog(ERROR, "ttdummy (%s): %s must be NOT NULL", relname, args[1]);
510 if (oldon != newon || oldoff != newoff)
511 elog(ERROR, "ttdummy (%s): you can't change %s and/or %s columns (use set_ttdummy)",
512 relname, args[0], args[1]);
514 if (newoff != TTDUMMY_INFINITY)
516 pfree(relname); /* allocated in upper executor context */
520 else if (oldoff != TTDUMMY_INFINITY) /* DELETE */
527 struct varlena *seqname = textin("ttdummy_seq");
529 newoff = nextval(seqname);
533 /* Connect to SPI manager */
534 if ((ret = SPI_connect()) < 0)
535 elog(ERROR, "ttdummy (%s): SPI_connect returned %d", relname, ret);
537 /* Fetch tuple values and nulls */
538 cvals = (Datum *) palloc(natts * sizeof(Datum));
539 cnulls = (char *) palloc(natts * sizeof(char));
540 for (i = 0; i < natts; i++)
542 cvals[i] = SPI_getbinval((newtuple != NULL) ? newtuple : trigtuple,
543 tupdesc, i + 1, &isnull);
544 cnulls[i] = (isnull) ? 'n' : ' ';
547 /* change date column(s) */
548 if (newtuple) /* UPDATE */
550 cvals[attnum[0] - 1] = newoff; /* start_date eq current date */
551 cnulls[attnum[0] - 1] = ' ';
552 cvals[attnum[1] - 1] = TTDUMMY_INFINITY; /* stop_date eq INFINITY */
553 cnulls[attnum[1] - 1] = ' ';
558 cvals[attnum[1] - 1] = newoff; /* stop_date eq current date */
559 cnulls[attnum[1] - 1] = ' ';
562 /* if there is no plan ... */
569 /* allocate ctypes for preparation */
570 ctypes = (Oid *) palloc(natts * sizeof(Oid));
573 * Construct query: INSERT INTO _relation_ VALUES ($1, ...)
575 sprintf(sql, "INSERT INTO %s VALUES (", relname);
576 for (i = 1; i <= natts; i++)
578 sprintf(sql + strlen(sql), "$%d%s",
579 i, (i < natts) ? ", " : ")");
580 ctypes[i - 1] = SPI_gettypeid(tupdesc, i);
583 /* Prepare plan for query */
584 pplan = SPI_prepare(sql, natts, ctypes);
586 elog(ERROR, "ttdummy (%s): SPI_prepare returned %d", relname, SPI_result);
588 pplan = SPI_saveplan(pplan);
590 elog(ERROR, "ttdummy (%s): SPI_saveplan returned %d", relname, SPI_result);
595 ret = SPI_execp(splan, cvals, cnulls, 0);
598 elog(ERROR, "ttdummy (%s): SPI_execp returned %d", relname, ret);
600 /* Tuple to return to upper Executor ... */
601 if (newtuple) /* UPDATE */
605 tmptuple = SPI_copytuple(trigtuple);
606 rettuple = SPI_modifytuple(rel, tmptuple, 1, &(attnum[1]), &newoff, NULL);
611 rettuple = trigtuple;
613 SPI_finish(); /* don't forget say Bye to SPI mgr */
621 set_ttdummy(int32 on)
624 if (ttoff) /* OFF currently */