2 * $Header: /cvsroot/pgsql/src/test/regress/regress.c,v 1.36 2000/04/12 17:17:21 momjian Exp $
5 #include <float.h> /* faked on sunos */
9 #include "utils/geo_decls.h" /* includes <math.h> */
10 #include "executor/executor.h" /* For GetAttributeByName */
19 extern double *regress_dist_ptpath(Point *pt, PATH *path);
20 extern double *regress_path_dist(PATH *p1, PATH *p2);
21 extern PATH *poly2path(POLYGON *poly);
22 extern Point *interpt_pp(PATH *p1, PATH *p2);
23 extern void regress_lseg_construct(LSEG *lseg, Point *pt1, Point *pt2);
24 extern char overpaid(TUPLE tuple);
25 extern int boxarea(BOX *box);
26 extern char *reverse_name(char *string);
29 ** Distance from a point to a path
32 regress_dist_ptpath(pt, path)
44 result = palloc(sizeof(double));
45 *result = Abs((double) DBL_MAX); /* +infinity */
48 result = point_distance(pt, &path->p[0]);
53 * the distance from a point to a path is the smallest
54 * distance from the point to any of its constituent segments.
56 Assert(path->npts > 1);
57 result = palloc(sizeof(double));
58 for (i = 0; i < path->npts - 1; ++i)
60 regress_lseg_construct(&lseg, &path->p[i], &path->p[i + 1]);
61 tmp = dist_ps(pt, &lseg);
62 if (i == 0 || *tmp < *result)
72 /* this essentially does a cartesian product of the lsegs in the
73 two paths, and finds the min distance between any two lsegs */
75 regress_path_dist(p1, p2)
86 regress_lseg_construct(&seg1, &p1->p[0], &p1->p[1]);
87 regress_lseg_construct(&seg2, &p2->p[0], &p2->p[1]);
88 min = lseg_distance(&seg1, &seg2);
90 for (i = 0; i < p1->npts - 1; i++)
91 for (j = 0; j < p2->npts - 1; j++)
93 regress_lseg_construct(&seg1, &p1->p[i], &p1->p[i + 1]);
94 regress_lseg_construct(&seg2, &p2->p[j], &p2->p[j + 1]);
96 if (*min < *(tmp = lseg_distance(&seg1, &seg2)))
109 char *output = (char *) palloc(2 * (P_MAXDIG + 1) * poly->npts + 64);
110 char buf[2 * (P_MAXDIG) + 20];
112 sprintf(output, "(1, %*d", P_MAXDIG, poly->npts);
114 for (i = 0; i < poly->npts; i++)
116 sprintf(buf, ",%*g,%*g", P_MAXDIG, poly->p[i].x, P_MAXDIG, poly->p[i].y);
120 sprintf(buf, "%c", RDELIM);
122 return path_in(output);
125 /* return the point where two paths intersect. Assumes that they do. */
142 bool found; /* We've found the intersection */
144 found = false; /* Haven't found it yet */
146 for (i = 0; i < p1->npts - 1 && !found; i++)
147 for (j = 0; j < p2->npts - 1 && !found; j++)
149 regress_lseg_construct(&seg1, &p1->p[i], &p1->p[i + 1]);
150 regress_lseg_construct(&seg2, &p2->p[j], &p2->p[j + 1]);
151 if (lseg_intersect(&seg1, &seg2))
156 ln = line_construct_pp(&seg2.p[0], &seg2.p[1]);
157 retval = interpt_sl(&seg1, ln);
159 retval = lseg_interpt(&seg1, &seg2);
165 /* like lseg_construct, but assume space already allocated */
167 regress_lseg_construct(lseg, pt1, pt2)
172 lseg->p[0].x = pt1->x;
173 lseg->p[0].y = pt1->y;
174 lseg->p[1].x = pt2->x;
175 lseg->p[1].y = pt2->y;
176 lseg->m = point_sl(pt1, pt2);
187 salary = (long) GetAttributeByName(tuple, "salary", &isnull);
192 * This used to be "circle", but I added circle to builtins,
193 * so needed to make sure the names do not collide. - tgl 97/04/21
202 WIDGET *widget_in(char *str);
203 char *widget_out(WIDGET * widget);
204 int pt_in_widget(Point *point, WIDGET * widget);
220 for (i = 0, p = str; *p && i < NARGS && *p != RDELIM; p++)
221 if (*p == ',' || (*p == LDELIM && !i))
225 result = (WIDGET *) palloc(sizeof(WIDGET));
226 result->center.x = atof(coord[0]);
227 result->center.y = atof(coord[1]);
228 result->radius = atof(coord[2]);
230 sprintf(buf2, "widget_in: read (%f, %f, %f)\n", result->center.x,
231 result->center.y, result->radius);
244 result = (char *) palloc(60);
245 sprintf(result, "(%g,%g,%g)",
246 widget->center.x, widget->center.y, widget->radius);
251 pt_in_widget(point, widget)
255 extern double point_dt();
257 return point_dt(point, &widget->center) < widget->radius;
260 #define ABS(X) ((X) > 0 ? (X) : -(X))
271 width = ABS(box->high.x - box->low.x);
272 height = ABS(box->high.y - box->low.y);
273 return width * height;
284 if (!(new_string = palloc(NAMEDATALEN)))
286 fprintf(stderr, "reverse_name: palloc failed\n");
289 MemSet(new_string, 0, NAMEDATALEN);
290 for (i = 0; i < NAMEDATALEN && string[i]; ++i)
292 if (i == NAMEDATALEN || !string[i])
296 new_string[len - i] = string[i];
300 #include "executor/spi.h" /* this is what you need to work with SPI */
301 #include "commands/trigger.h" /* -"- and triggers */
303 static TransactionId fd17b_xid = InvalidTransactionId;
304 static TransactionId fd17a_xid = InvalidTransactionId;
305 static int fd17b_level = 0;
306 static int fd17a_level = 0;
307 static bool fd17b_recursion = true;
308 static bool fd17a_recursion = true;
309 HeapTuple funny_dup17(void);
311 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 fieldval = SPI_getvalue(tuple, tupdesc, 1);
369 fieldtype = SPI_gettype(tupdesc, 1);
371 query = (char *) palloc(100 + NAMEDATALEN * 3 +
372 strlen(fieldval) + strlen(fieldtype));
374 sprintf(query, "insert into %s select * from %s where %s = '%s'::%s",
375 SPI_getrelname(rel), SPI_getrelname(rel),
376 SPI_fname(tupdesc, 1),
377 fieldval, fieldtype);
379 if ((ret = SPI_exec(query, 0)) < 0)
380 elog(ERROR, "funny_dup17 (fired %s) on level %3d: SPI_exec (insert ...) returned %d",
383 inserted = SPI_processed;
385 sprintf(query, "select count (*) from %s where %s = '%s'::%s",
387 SPI_fname(tupdesc, 1),
388 fieldval, fieldtype);
390 if ((ret = SPI_exec(query, 0)) < 0)
391 elog(ERROR, "funny_dup17 (fired %s) on level %3d: SPI_exec (select ...) returned %d",
394 if (SPI_processed > 0)
398 SPI_tuptable->vals[0],
399 SPI_tuptable->tupdesc,
405 elog(NOTICE, "funny_dup17 (fired %s) on level %3d: %d/%d tuples inserted/selected",
406 when, *level, inserted, selected);
413 *xid = InvalidTransactionId;
418 HeapTuple ttdummy(void);
419 int32 set_ttdummy(int32 on);
421 extern int4 nextval(struct varlena * seqin);
423 #define TTDUMMY_INFINITY 999999
425 static void *splan = NULL;
426 static bool ttoff = false;
431 Trigger *trigger; /* to get trigger name */
432 char **args; /* arguments */
433 int attnum[2]; /* fnumbers of start/stop columns */
438 Datum *cvals; /* column values */
439 char *cnulls; /* column nulls */
440 char *relname; /* triggered relation name */
441 Relation rel; /* triggered relation */
443 HeapTuple newtuple = NULL;
445 TupleDesc tupdesc; /* tuple description */
446 int natts; /* # of attributes */
447 bool isnull; /* to know is some column NULL or not */
451 if (!CurrentTriggerData)
452 elog(ERROR, "ttdummy: triggers are not initialized");
453 if (TRIGGER_FIRED_FOR_STATEMENT(CurrentTriggerData->tg_event))
454 elog(ERROR, "ttdummy: can't process STATEMENT events");
455 if (TRIGGER_FIRED_AFTER(CurrentTriggerData->tg_event))
456 elog(ERROR, "ttdummy: must be fired before event");
457 if (TRIGGER_FIRED_BY_INSERT(CurrentTriggerData->tg_event))
458 elog(ERROR, "ttdummy: can't process INSERT event");
459 if (TRIGGER_FIRED_BY_UPDATE(CurrentTriggerData->tg_event))
460 newtuple = CurrentTriggerData->tg_newtuple;
462 trigtuple = CurrentTriggerData->tg_trigtuple;
464 rel = CurrentTriggerData->tg_relation;
465 relname = SPI_getrelname(rel);
467 /* check if TT is OFF for this relation */
468 if (ttoff) /* OFF - nothing to do */
471 return (newtuple != NULL) ? newtuple : trigtuple;
474 trigger = CurrentTriggerData->tg_trigger;
476 if (trigger->tgnargs != 2)
477 elog(ERROR, "ttdummy (%s): invalid (!= 2) number of arguments %d",
478 relname, trigger->tgnargs);
480 args = trigger->tgargs;
481 tupdesc = rel->rd_att;
482 natts = tupdesc->natts;
484 CurrentTriggerData = NULL;
486 for (i = 0; i < 2; i++)
488 attnum[i] = SPI_fnumber(tupdesc, args[i]);
490 elog(ERROR, "ttdummy (%s): there is no attribute %s", relname, args[i]);
491 if (SPI_gettypeid(tupdesc, attnum[i]) != INT4OID)
492 elog(ERROR, "ttdummy (%s): attributes %s and %s must be of abstime type",
493 relname, args[0], args[1]);
496 oldon = SPI_getbinval(trigtuple, tupdesc, attnum[0], &isnull);
498 elog(ERROR, "ttdummy (%s): %s must be NOT NULL", relname, args[0]);
500 oldoff = SPI_getbinval(trigtuple, tupdesc, attnum[1], &isnull);
502 elog(ERROR, "ttdummy (%s): %s must be NOT NULL", relname, args[1]);
504 if (newtuple != NULL) /* UPDATE */
506 newon = SPI_getbinval(newtuple, tupdesc, attnum[0], &isnull);
508 elog(ERROR, "ttdummy (%s): %s must be NOT NULL", relname, args[0]);
509 newoff = SPI_getbinval(newtuple, tupdesc, attnum[1], &isnull);
511 elog(ERROR, "ttdummy (%s): %s must be NOT NULL", relname, args[1]);
513 if (oldon != newon || oldoff != newoff)
514 elog(ERROR, "ttdummy (%s): you can't change %s and/or %s columns (use set_ttdummy)",
515 relname, args[0], args[1]);
517 if (newoff != TTDUMMY_INFINITY)
519 pfree(relname); /* allocated in upper executor context */
523 else if (oldoff != TTDUMMY_INFINITY) /* DELETE */
530 struct varlena *seqname = textin("ttdummy_seq");
532 newoff = nextval(seqname);
536 /* Connect to SPI manager */
537 if ((ret = SPI_connect()) < 0)
538 elog(ERROR, "ttdummy (%s): SPI_connect returned %d", relname, ret);
540 /* Fetch tuple values and nulls */
541 cvals = (Datum *) palloc(natts * sizeof(Datum));
542 cnulls = (char *) palloc(natts * sizeof(char));
543 for (i = 0; i < natts; i++)
545 cvals[i] = SPI_getbinval((newtuple != NULL) ? newtuple : trigtuple,
546 tupdesc, i + 1, &isnull);
547 cnulls[i] = (isnull) ? 'n' : ' ';
550 /* change date column(s) */
551 if (newtuple) /* UPDATE */
553 cvals[attnum[0] - 1] = newoff; /* start_date eq current date */
554 cnulls[attnum[0] - 1] = ' ';
555 cvals[attnum[1] - 1] = TTDUMMY_INFINITY; /* stop_date eq INFINITY */
556 cnulls[attnum[1] - 1] = ' ';
561 cvals[attnum[1] - 1] = newoff; /* stop_date eq current date */
562 cnulls[attnum[1] - 1] = ' ';
565 /* if there is no plan ... */
572 /* allocate space in preparation */
573 ctypes = (Oid *) palloc(natts * sizeof(Oid));
574 query = (char *) palloc(100 + 16 * natts);
577 * Construct query: INSERT INTO _relation_ VALUES ($1, ...)
579 sprintf(query, "INSERT INTO %s VALUES (", relname);
580 for (i = 1; i <= natts; i++)
582 sprintf(query + strlen(query), "$%d%s",
583 i, (i < natts) ? ", " : ")");
584 ctypes[i - 1] = SPI_gettypeid(tupdesc, i);
587 /* Prepare plan for query */
588 pplan = SPI_prepare(query, natts, ctypes);
590 elog(ERROR, "ttdummy (%s): SPI_prepare returned %d", relname, SPI_result);
592 pplan = SPI_saveplan(pplan);
594 elog(ERROR, "ttdummy (%s): SPI_saveplan returned %d", relname, SPI_result);
599 ret = SPI_execp(splan, cvals, cnulls, 0);
602 elog(ERROR, "ttdummy (%s): SPI_execp returned %d", relname, ret);
604 /* Tuple to return to upper Executor ... */
605 if (newtuple) /* UPDATE */
609 tmptuple = SPI_copytuple(trigtuple);
610 rettuple = SPI_modifytuple(rel, tmptuple, 1, &(attnum[1]), &newoff, NULL);
611 SPI_freetuple(tmptuple);
615 rettuple = trigtuple;
617 SPI_finish(); /* don't forget say Bye to SPI mgr */
625 set_ttdummy(int32 on)
628 if (ttoff) /* OFF currently */