1 /*-------------------------------------------------------------------------
4 * Internal 64-bit integer operations
6 * Portions Copyright (c) 1996-2006, PostgreSQL Global Development Group
7 * Portions Copyright (c) 1994, Regents of the University of California
10 * $PostgreSQL: pgsql/src/backend/utils/adt/int8.c,v 1.62 2006/10/04 00:29:59 momjian Exp $
12 *-------------------------------------------------------------------------
21 #include "libpq/pqformat.h"
22 #include "nodes/nodes.h"
23 #include "utils/int8.h"
28 #define SAMESIGN(a,b) (((a) < 0) == ((b) < 0))
35 } generate_series_fctx;
38 /***********************************************************************
40 ** Routines for 64-bit integers.
42 ***********************************************************************/
44 /*----------------------------------------------------------
45 * Formatting and conversion routines.
46 *---------------------------------------------------------*/
49 * scanint8 --- try to parse a string into an int8.
51 * If errorOK is false, ereport a useful error message if the string is bad.
52 * If errorOK is true, just return "false" for bad input.
55 scanint8(const char *str, bool errorOK, int64 *result)
57 const char *ptr = str;
62 * Do our own scan, rather than relying on sscanf which might be broken
66 /* skip leading spaces */
67 while (*ptr && isspace((unsigned char) *ptr))
76 * Do an explicit check for INT64_MIN. Ugly though this is, it's
77 * cleaner than trying to get the loop below to handle it portably.
79 #ifndef INT64_IS_BUSTED
80 if (strncmp(ptr, "9223372036854775808", 19) == 0)
82 tmp = -INT64CONST(0x7fffffffffffffff) - 1;
93 /* require at least one digit */
94 if (!isdigit((unsigned char) *ptr))
100 (errcode(ERRCODE_INVALID_TEXT_REPRESENTATION),
101 errmsg("invalid input syntax for integer: \"%s\"",
106 while (*ptr && isdigit((unsigned char) *ptr))
108 int64 newtmp = tmp * 10 + (*ptr++ - '0');
110 if ((newtmp / 10) != tmp) /* overflow? */
116 (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
117 errmsg("value \"%s\" is out of range for type bigint",
125 /* allow trailing whitespace, but not other trailing chars */
126 while (*ptr != '\0' && isspace((unsigned char) *ptr))
135 (errcode(ERRCODE_INVALID_TEXT_REPRESENTATION),
136 errmsg("invalid input syntax for integer: \"%s\"",
140 *result = (sign < 0) ? -tmp : tmp;
148 int8in(PG_FUNCTION_ARGS)
150 char *str = PG_GETARG_CSTRING(0);
153 (void) scanint8(str, false, &result);
154 PG_RETURN_INT64(result);
161 int8out(PG_FUNCTION_ARGS)
163 int64 val = PG_GETARG_INT64(0);
166 char buf[MAXINT8LEN + 1];
168 if ((len = snprintf(buf, MAXINT8LEN, INT64_FORMAT, val)) < 0)
169 elog(ERROR, "could not format int8");
171 result = pstrdup(buf);
172 PG_RETURN_CSTRING(result);
176 * int8recv - converts external binary format to int8
179 int8recv(PG_FUNCTION_ARGS)
181 StringInfo buf = (StringInfo) PG_GETARG_POINTER(0);
183 PG_RETURN_INT64(pq_getmsgint64(buf));
187 * int8send - converts int8 to binary format
190 int8send(PG_FUNCTION_ARGS)
192 int64 arg1 = PG_GETARG_INT64(0);
195 pq_begintypsend(&buf);
196 pq_sendint64(&buf, arg1);
197 PG_RETURN_BYTEA_P(pq_endtypsend(&buf));
201 /*----------------------------------------------------------
202 * Relational operators for int8s, including cross-data-type comparisons.
203 *---------------------------------------------------------*/
206 * Is val1 relop val2?
209 int8eq(PG_FUNCTION_ARGS)
211 int64 val1 = PG_GETARG_INT64(0);
212 int64 val2 = PG_GETARG_INT64(1);
214 PG_RETURN_BOOL(val1 == val2);
218 int8ne(PG_FUNCTION_ARGS)
220 int64 val1 = PG_GETARG_INT64(0);
221 int64 val2 = PG_GETARG_INT64(1);
223 PG_RETURN_BOOL(val1 != val2);
227 int8lt(PG_FUNCTION_ARGS)
229 int64 val1 = PG_GETARG_INT64(0);
230 int64 val2 = PG_GETARG_INT64(1);
232 PG_RETURN_BOOL(val1 < val2);
236 int8gt(PG_FUNCTION_ARGS)
238 int64 val1 = PG_GETARG_INT64(0);
239 int64 val2 = PG_GETARG_INT64(1);
241 PG_RETURN_BOOL(val1 > val2);
245 int8le(PG_FUNCTION_ARGS)
247 int64 val1 = PG_GETARG_INT64(0);
248 int64 val2 = PG_GETARG_INT64(1);
250 PG_RETURN_BOOL(val1 <= val2);
254 int8ge(PG_FUNCTION_ARGS)
256 int64 val1 = PG_GETARG_INT64(0);
257 int64 val2 = PG_GETARG_INT64(1);
259 PG_RETURN_BOOL(val1 >= val2);
263 * Is 64-bit val1 relop 32-bit val2?
266 int84eq(PG_FUNCTION_ARGS)
268 int64 val1 = PG_GETARG_INT64(0);
269 int32 val2 = PG_GETARG_INT32(1);
271 PG_RETURN_BOOL(val1 == val2);
275 int84ne(PG_FUNCTION_ARGS)
277 int64 val1 = PG_GETARG_INT64(0);
278 int32 val2 = PG_GETARG_INT32(1);
280 PG_RETURN_BOOL(val1 != val2);
284 int84lt(PG_FUNCTION_ARGS)
286 int64 val1 = PG_GETARG_INT64(0);
287 int32 val2 = PG_GETARG_INT32(1);
289 PG_RETURN_BOOL(val1 < val2);
293 int84gt(PG_FUNCTION_ARGS)
295 int64 val1 = PG_GETARG_INT64(0);
296 int32 val2 = PG_GETARG_INT32(1);
298 PG_RETURN_BOOL(val1 > val2);
302 int84le(PG_FUNCTION_ARGS)
304 int64 val1 = PG_GETARG_INT64(0);
305 int32 val2 = PG_GETARG_INT32(1);
307 PG_RETURN_BOOL(val1 <= val2);
311 int84ge(PG_FUNCTION_ARGS)
313 int64 val1 = PG_GETARG_INT64(0);
314 int32 val2 = PG_GETARG_INT32(1);
316 PG_RETURN_BOOL(val1 >= val2);
320 * Is 32-bit val1 relop 64-bit val2?
323 int48eq(PG_FUNCTION_ARGS)
325 int32 val1 = PG_GETARG_INT32(0);
326 int64 val2 = PG_GETARG_INT64(1);
328 PG_RETURN_BOOL(val1 == val2);
332 int48ne(PG_FUNCTION_ARGS)
334 int32 val1 = PG_GETARG_INT32(0);
335 int64 val2 = PG_GETARG_INT64(1);
337 PG_RETURN_BOOL(val1 != val2);
341 int48lt(PG_FUNCTION_ARGS)
343 int32 val1 = PG_GETARG_INT32(0);
344 int64 val2 = PG_GETARG_INT64(1);
346 PG_RETURN_BOOL(val1 < val2);
350 int48gt(PG_FUNCTION_ARGS)
352 int32 val1 = PG_GETARG_INT32(0);
353 int64 val2 = PG_GETARG_INT64(1);
355 PG_RETURN_BOOL(val1 > val2);
359 int48le(PG_FUNCTION_ARGS)
361 int32 val1 = PG_GETARG_INT32(0);
362 int64 val2 = PG_GETARG_INT64(1);
364 PG_RETURN_BOOL(val1 <= val2);
368 int48ge(PG_FUNCTION_ARGS)
370 int32 val1 = PG_GETARG_INT32(0);
371 int64 val2 = PG_GETARG_INT64(1);
373 PG_RETURN_BOOL(val1 >= val2);
377 * Is 64-bit val1 relop 16-bit val2?
380 int82eq(PG_FUNCTION_ARGS)
382 int64 val1 = PG_GETARG_INT64(0);
383 int16 val2 = PG_GETARG_INT16(1);
385 PG_RETURN_BOOL(val1 == val2);
389 int82ne(PG_FUNCTION_ARGS)
391 int64 val1 = PG_GETARG_INT64(0);
392 int16 val2 = PG_GETARG_INT16(1);
394 PG_RETURN_BOOL(val1 != val2);
398 int82lt(PG_FUNCTION_ARGS)
400 int64 val1 = PG_GETARG_INT64(0);
401 int16 val2 = PG_GETARG_INT16(1);
403 PG_RETURN_BOOL(val1 < val2);
407 int82gt(PG_FUNCTION_ARGS)
409 int64 val1 = PG_GETARG_INT64(0);
410 int16 val2 = PG_GETARG_INT16(1);
412 PG_RETURN_BOOL(val1 > val2);
416 int82le(PG_FUNCTION_ARGS)
418 int64 val1 = PG_GETARG_INT64(0);
419 int16 val2 = PG_GETARG_INT16(1);
421 PG_RETURN_BOOL(val1 <= val2);
425 int82ge(PG_FUNCTION_ARGS)
427 int64 val1 = PG_GETARG_INT64(0);
428 int16 val2 = PG_GETARG_INT16(1);
430 PG_RETURN_BOOL(val1 >= val2);
434 * Is 16-bit val1 relop 64-bit val2?
437 int28eq(PG_FUNCTION_ARGS)
439 int16 val1 = PG_GETARG_INT16(0);
440 int64 val2 = PG_GETARG_INT64(1);
442 PG_RETURN_BOOL(val1 == val2);
446 int28ne(PG_FUNCTION_ARGS)
448 int16 val1 = PG_GETARG_INT16(0);
449 int64 val2 = PG_GETARG_INT64(1);
451 PG_RETURN_BOOL(val1 != val2);
455 int28lt(PG_FUNCTION_ARGS)
457 int16 val1 = PG_GETARG_INT16(0);
458 int64 val2 = PG_GETARG_INT64(1);
460 PG_RETURN_BOOL(val1 < val2);
464 int28gt(PG_FUNCTION_ARGS)
466 int16 val1 = PG_GETARG_INT16(0);
467 int64 val2 = PG_GETARG_INT64(1);
469 PG_RETURN_BOOL(val1 > val2);
473 int28le(PG_FUNCTION_ARGS)
475 int16 val1 = PG_GETARG_INT16(0);
476 int64 val2 = PG_GETARG_INT64(1);
478 PG_RETURN_BOOL(val1 <= val2);
482 int28ge(PG_FUNCTION_ARGS)
484 int16 val1 = PG_GETARG_INT16(0);
485 int64 val2 = PG_GETARG_INT64(1);
487 PG_RETURN_BOOL(val1 >= val2);
491 /*----------------------------------------------------------
492 * Arithmetic operators on 64-bit integers.
493 *---------------------------------------------------------*/
496 int8um(PG_FUNCTION_ARGS)
498 int64 arg = PG_GETARG_INT64(0);
502 /* overflow check (needed for INT64_MIN) */
503 if (arg != 0 && SAMESIGN(result, arg))
505 (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
506 errmsg("bigint out of range")));
507 PG_RETURN_INT64(result);
511 int8up(PG_FUNCTION_ARGS)
513 int64 arg = PG_GETARG_INT64(0);
515 PG_RETURN_INT64(arg);
519 int8pl(PG_FUNCTION_ARGS)
521 int64 arg1 = PG_GETARG_INT64(0);
522 int64 arg2 = PG_GETARG_INT64(1);
525 result = arg1 + arg2;
528 * Overflow check. If the inputs are of different signs then their sum
529 * cannot overflow. If the inputs are of the same sign, their sum had
530 * better be that sign too.
532 if (SAMESIGN(arg1, arg2) && !SAMESIGN(result, arg1))
534 (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
535 errmsg("bigint out of range")));
536 PG_RETURN_INT64(result);
540 int8mi(PG_FUNCTION_ARGS)
542 int64 arg1 = PG_GETARG_INT64(0);
543 int64 arg2 = PG_GETARG_INT64(1);
546 result = arg1 - arg2;
549 * Overflow check. If the inputs are of the same sign then their
550 * difference cannot overflow. If they are of different signs then the
551 * result should be of the same sign as the first input.
553 if (!SAMESIGN(arg1, arg2) && !SAMESIGN(result, arg1))
555 (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
556 errmsg("bigint out of range")));
557 PG_RETURN_INT64(result);
561 int8mul(PG_FUNCTION_ARGS)
563 int64 arg1 = PG_GETARG_INT64(0);
564 int64 arg2 = PG_GETARG_INT64(1);
567 result = arg1 * arg2;
570 * Overflow check. We basically check to see if result / arg2 gives arg1
571 * again. There are two cases where this fails: arg2 = 0 (which cannot
572 * overflow) and arg1 = INT64_MIN, arg2 = -1 (where the division itself
573 * will overflow and thus incorrectly match).
575 * Since the division is likely much more expensive than the actual
576 * multiplication, we'd like to skip it where possible. The best bang for
577 * the buck seems to be to check whether both inputs are in the int32
578 * range; if so, no overflow is possible.
580 if (!(arg1 == (int64) ((int32) arg1) &&
581 arg2 == (int64) ((int32) arg2)) &&
583 (result / arg2 != arg1 || (arg2 == -1 && arg1 < 0 && result < 0)))
585 (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
586 errmsg("bigint out of range")));
587 PG_RETURN_INT64(result);
591 int8div(PG_FUNCTION_ARGS)
593 int64 arg1 = PG_GETARG_INT64(0);
594 int64 arg2 = PG_GETARG_INT64(1);
599 (errcode(ERRCODE_DIVISION_BY_ZERO),
600 errmsg("division by zero")));
602 result = arg1 / arg2;
605 * Overflow check. The only possible overflow case is for arg1 =
606 * INT64_MIN, arg2 = -1, where the correct result is -INT64_MIN, which
607 * can't be represented on a two's-complement machine.
609 if (arg2 == -1 && arg1 < 0 && result < 0)
611 (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
612 errmsg("bigint out of range")));
613 PG_RETURN_INT64(result);
620 int8abs(PG_FUNCTION_ARGS)
622 int64 arg1 = PG_GETARG_INT64(0);
625 result = (arg1 < 0) ? -arg1 : arg1;
626 /* overflow check (needed for INT64_MIN) */
629 (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
630 errmsg("bigint out of range")));
631 PG_RETURN_INT64(result);
638 int8mod(PG_FUNCTION_ARGS)
640 int64 arg1 = PG_GETARG_INT64(0);
641 int64 arg2 = PG_GETARG_INT64(1);
645 (errcode(ERRCODE_DIVISION_BY_ZERO),
646 errmsg("division by zero")));
647 /* No overflow is possible */
649 PG_RETURN_INT64(arg1 % arg2);
654 int8inc(PG_FUNCTION_ARGS)
656 if (fcinfo->context && IsA(fcinfo->context, AggState))
659 * Special case to avoid palloc overhead for COUNT(): when called from
660 * nodeAgg, we know that the argument is modifiable local storage, so
661 * just update it in-place.
663 * Note: this assumes int8 is a pass-by-ref type; if we ever support
664 * pass-by-val int8, this should be ifdef'd out when int8 is
667 int64 *arg = (int64 *) PG_GETARG_POINTER(0);
672 if (result < 0 && *arg > 0)
674 (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
675 errmsg("bigint out of range")));
678 PG_RETURN_POINTER(arg);
682 /* Not called by nodeAgg, so just do it the dumb way */
683 int64 arg = PG_GETARG_INT64(0);
688 if (result < 0 && arg > 0)
690 (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
691 errmsg("bigint out of range")));
693 PG_RETURN_INT64(result);
698 * These functions are exactly like int8inc but are used for aggregates that
699 * count only non-null values. Since the functions are declared strict,
700 * the null checks happen before we ever get here, and all we need do is
701 * increment the state value. We could actually make these pg_proc entries
702 * point right at int8inc, but then the opr_sanity regression test would
703 * complain about mismatched entries for a built-in function.
707 int8inc_any(PG_FUNCTION_ARGS)
709 return int8inc(fcinfo);
713 int8inc_float8_float8(PG_FUNCTION_ARGS)
715 return int8inc(fcinfo);
720 int8larger(PG_FUNCTION_ARGS)
722 int64 arg1 = PG_GETARG_INT64(0);
723 int64 arg2 = PG_GETARG_INT64(1);
726 result = ((arg1 > arg2) ? arg1 : arg2);
728 PG_RETURN_INT64(result);
732 int8smaller(PG_FUNCTION_ARGS)
734 int64 arg1 = PG_GETARG_INT64(0);
735 int64 arg2 = PG_GETARG_INT64(1);
738 result = ((arg1 < arg2) ? arg1 : arg2);
740 PG_RETURN_INT64(result);
744 int84pl(PG_FUNCTION_ARGS)
746 int64 arg1 = PG_GETARG_INT64(0);
747 int32 arg2 = PG_GETARG_INT32(1);
750 result = arg1 + arg2;
753 * Overflow check. If the inputs are of different signs then their sum
754 * cannot overflow. If the inputs are of the same sign, their sum had
755 * better be that sign too.
757 if (SAMESIGN(arg1, arg2) && !SAMESIGN(result, arg1))
759 (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
760 errmsg("bigint out of range")));
761 PG_RETURN_INT64(result);
765 int84mi(PG_FUNCTION_ARGS)
767 int64 arg1 = PG_GETARG_INT64(0);
768 int32 arg2 = PG_GETARG_INT32(1);
771 result = arg1 - arg2;
774 * Overflow check. If the inputs are of the same sign then their
775 * difference cannot overflow. If they are of different signs then the
776 * result should be of the same sign as the first input.
778 if (!SAMESIGN(arg1, arg2) && !SAMESIGN(result, arg1))
780 (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
781 errmsg("bigint out of range")));
782 PG_RETURN_INT64(result);
786 int84mul(PG_FUNCTION_ARGS)
788 int64 arg1 = PG_GETARG_INT64(0);
789 int32 arg2 = PG_GETARG_INT32(1);
792 result = arg1 * arg2;
795 * Overflow check. We basically check to see if result / arg1 gives arg2
796 * again. There is one case where this fails: arg1 = 0 (which cannot
799 * Since the division is likely much more expensive than the actual
800 * multiplication, we'd like to skip it where possible. The best bang for
801 * the buck seems to be to check whether both inputs are in the int32
802 * range; if so, no overflow is possible.
804 if (arg1 != (int64) ((int32) arg1) &&
805 result / arg1 != arg2)
807 (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
808 errmsg("bigint out of range")));
809 PG_RETURN_INT64(result);
813 int84div(PG_FUNCTION_ARGS)
815 int64 arg1 = PG_GETARG_INT64(0);
816 int32 arg2 = PG_GETARG_INT32(1);
821 (errcode(ERRCODE_DIVISION_BY_ZERO),
822 errmsg("division by zero")));
824 result = arg1 / arg2;
827 * Overflow check. The only possible overflow case is for arg1 =
828 * INT64_MIN, arg2 = -1, where the correct result is -INT64_MIN, which
829 * can't be represented on a two's-complement machine.
831 if (arg2 == -1 && arg1 < 0 && result < 0)
833 (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
834 errmsg("bigint out of range")));
835 PG_RETURN_INT64(result);
839 int48pl(PG_FUNCTION_ARGS)
841 int32 arg1 = PG_GETARG_INT32(0);
842 int64 arg2 = PG_GETARG_INT64(1);
845 result = arg1 + arg2;
848 * Overflow check. If the inputs are of different signs then their sum
849 * cannot overflow. If the inputs are of the same sign, their sum had
850 * better be that sign too.
852 if (SAMESIGN(arg1, arg2) && !SAMESIGN(result, arg1))
854 (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
855 errmsg("bigint out of range")));
856 PG_RETURN_INT64(result);
860 int48mi(PG_FUNCTION_ARGS)
862 int32 arg1 = PG_GETARG_INT32(0);
863 int64 arg2 = PG_GETARG_INT64(1);
866 result = arg1 - arg2;
869 * Overflow check. If the inputs are of the same sign then their
870 * difference cannot overflow. If they are of different signs then the
871 * result should be of the same sign as the first input.
873 if (!SAMESIGN(arg1, arg2) && !SAMESIGN(result, arg1))
875 (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
876 errmsg("bigint out of range")));
877 PG_RETURN_INT64(result);
881 int48mul(PG_FUNCTION_ARGS)
883 int32 arg1 = PG_GETARG_INT32(0);
884 int64 arg2 = PG_GETARG_INT64(1);
887 result = arg1 * arg2;
890 * Overflow check. We basically check to see if result / arg2 gives arg1
891 * again. There is one case where this fails: arg2 = 0 (which cannot
894 * Since the division is likely much more expensive than the actual
895 * multiplication, we'd like to skip it where possible. The best bang for
896 * the buck seems to be to check whether both inputs are in the int32
897 * range; if so, no overflow is possible.
899 if (arg2 != (int64) ((int32) arg2) &&
900 result / arg2 != arg1)
902 (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
903 errmsg("bigint out of range")));
904 PG_RETURN_INT64(result);
908 int48div(PG_FUNCTION_ARGS)
910 int32 arg1 = PG_GETARG_INT32(0);
911 int64 arg2 = PG_GETARG_INT64(1);
915 (errcode(ERRCODE_DIVISION_BY_ZERO),
916 errmsg("division by zero")));
917 /* No overflow is possible */
918 PG_RETURN_INT64((int64) arg1 / arg2);
921 /* Binary arithmetics
923 * int8and - returns arg1 & arg2
924 * int8or - returns arg1 | arg2
925 * int8xor - returns arg1 # arg2
926 * int8not - returns ~arg1
927 * int8shl - returns arg1 << arg2
928 * int8shr - returns arg1 >> arg2
932 int8and(PG_FUNCTION_ARGS)
934 int64 arg1 = PG_GETARG_INT64(0);
935 int64 arg2 = PG_GETARG_INT64(1);
937 PG_RETURN_INT64(arg1 & arg2);
941 int8or(PG_FUNCTION_ARGS)
943 int64 arg1 = PG_GETARG_INT64(0);
944 int64 arg2 = PG_GETARG_INT64(1);
946 PG_RETURN_INT64(arg1 | arg2);
950 int8xor(PG_FUNCTION_ARGS)
952 int64 arg1 = PG_GETARG_INT64(0);
953 int64 arg2 = PG_GETARG_INT64(1);
955 PG_RETURN_INT64(arg1 ^ arg2);
959 int8not(PG_FUNCTION_ARGS)
961 int64 arg1 = PG_GETARG_INT64(0);
963 PG_RETURN_INT64(~arg1);
967 int8shl(PG_FUNCTION_ARGS)
969 int64 arg1 = PG_GETARG_INT64(0);
970 int32 arg2 = PG_GETARG_INT32(1);
972 PG_RETURN_INT64(arg1 << arg2);
976 int8shr(PG_FUNCTION_ARGS)
978 int64 arg1 = PG_GETARG_INT64(0);
979 int32 arg2 = PG_GETARG_INT32(1);
981 PG_RETURN_INT64(arg1 >> arg2);
984 /*----------------------------------------------------------
985 * Conversion operators.
986 *---------------------------------------------------------*/
989 int48(PG_FUNCTION_ARGS)
991 int32 arg = PG_GETARG_INT32(0);
993 PG_RETURN_INT64((int64) arg);
997 int84(PG_FUNCTION_ARGS)
999 int64 arg = PG_GETARG_INT64(0);
1002 result = (int32) arg;
1004 /* Test for overflow by reverse-conversion. */
1005 if ((int64) result != arg)
1007 (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
1008 errmsg("integer out of range")));
1010 PG_RETURN_INT32(result);
1014 int28(PG_FUNCTION_ARGS)
1016 int16 arg = PG_GETARG_INT16(0);
1018 PG_RETURN_INT64((int64) arg);
1022 int82(PG_FUNCTION_ARGS)
1024 int64 arg = PG_GETARG_INT64(0);
1027 result = (int16) arg;
1029 /* Test for overflow by reverse-conversion. */
1030 if ((int64) result != arg)
1032 (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
1033 errmsg("smallint out of range")));
1035 PG_RETURN_INT16(result);
1039 i8tod(PG_FUNCTION_ARGS)
1041 int64 arg = PG_GETARG_INT64(0);
1046 PG_RETURN_FLOAT8(result);
1050 * Convert float8 to 8-byte integer.
1053 dtoi8(PG_FUNCTION_ARGS)
1055 float8 arg = PG_GETARG_FLOAT8(0);
1058 /* Round arg to nearest integer (but it's still in float form) */
1062 * Does it fit in an int64? Avoid assuming that we have handy constants
1063 * defined for the range boundaries, instead test for overflow by
1064 * reverse-conversion.
1066 result = (int64) arg;
1068 if ((float8) result != arg)
1070 (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
1071 errmsg("bigint out of range")));
1073 PG_RETURN_INT64(result);
1077 i8tof(PG_FUNCTION_ARGS)
1079 int64 arg = PG_GETARG_INT64(0);
1084 PG_RETURN_FLOAT4(result);
1088 * Convert float4 to 8-byte integer.
1091 ftoi8(PG_FUNCTION_ARGS)
1093 float4 arg = PG_GETARG_FLOAT4(0);
1097 /* Round arg to nearest integer (but it's still in float form) */
1101 * Does it fit in an int64? Avoid assuming that we have handy constants
1102 * defined for the range boundaries, instead test for overflow by
1103 * reverse-conversion.
1105 result = (int64) darg;
1107 if ((float8) result != darg)
1109 (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
1110 errmsg("bigint out of range")));
1112 PG_RETURN_INT64(result);
1116 i8tooid(PG_FUNCTION_ARGS)
1118 int64 arg = PG_GETARG_INT64(0);
1123 /* Test for overflow by reverse-conversion. */
1124 if ((int64) result != arg)
1126 (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
1127 errmsg("OID out of range")));
1129 PG_RETURN_OID(result);
1133 oidtoi8(PG_FUNCTION_ARGS)
1135 Oid arg = PG_GETARG_OID(0);
1137 PG_RETURN_INT64((int64) arg);
1141 text_int8(PG_FUNCTION_ARGS)
1143 text *str = PG_GETARG_TEXT_P(0);
1148 len = (VARSIZE(str) - VARHDRSZ);
1149 s = palloc(len + 1);
1150 memcpy(s, VARDATA(str), len);
1153 result = DirectFunctionCall1(int8in, CStringGetDatum(s));
1161 int8_text(PG_FUNCTION_ARGS)
1163 /* arg is int64, but easier to leave it as Datum */
1164 Datum arg = PG_GETARG_DATUM(0);
1169 s = DatumGetCString(DirectFunctionCall1(int8out, arg));
1172 result = (text *) palloc(VARHDRSZ + len);
1174 VARATT_SIZEP(result) = len + VARHDRSZ;
1175 memcpy(VARDATA(result), s, len);
1179 PG_RETURN_TEXT_P(result);
1183 * non-persistent numeric series generator
1186 generate_series_int8(PG_FUNCTION_ARGS)
1188 return generate_series_step_int8(fcinfo);
1192 generate_series_step_int8(PG_FUNCTION_ARGS)
1194 FuncCallContext *funcctx;
1195 generate_series_fctx *fctx;
1197 MemoryContext oldcontext;
1199 /* stuff done only on the first call of the function */
1200 if (SRF_IS_FIRSTCALL())
1202 int64 start = PG_GETARG_INT64(0);
1203 int64 finish = PG_GETARG_INT64(1);
1206 /* see if we were given an explicit step size */
1207 if (PG_NARGS() == 3)
1208 step = PG_GETARG_INT64(2);
1211 (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
1212 errmsg("step size may not equal zero")));
1214 /* create a function context for cross-call persistence */
1215 funcctx = SRF_FIRSTCALL_INIT();
1218 * switch to memory context appropriate for multiple function calls
1220 oldcontext = MemoryContextSwitchTo(funcctx->multi_call_memory_ctx);
1222 /* allocate memory for user context */
1223 fctx = (generate_series_fctx *) palloc(sizeof(generate_series_fctx));
1226 * Use fctx to keep state from call to call. Seed current with the
1227 * original start value
1229 fctx->current = start;
1230 fctx->finish = finish;
1233 funcctx->user_fctx = fctx;
1234 MemoryContextSwitchTo(oldcontext);
1237 /* stuff done on every call of the function */
1238 funcctx = SRF_PERCALL_SETUP();
1241 * get the saved state and use current as the result for this iteration
1243 fctx = funcctx->user_fctx;
1244 result = fctx->current;
1246 if ((fctx->step > 0 && fctx->current <= fctx->finish) ||
1247 (fctx->step < 0 && fctx->current >= fctx->finish))
1249 /* increment current in preparation for next iteration */
1250 fctx->current += fctx->step;
1252 /* do when there is more left to send */
1253 SRF_RETURN_NEXT(funcctx, Int64GetDatum(result));
1256 /* do when there is no more left */
1257 SRF_RETURN_DONE(funcctx);