Line data Source code
1 : /*
2 : * contrib/btree_gist/btree_int8.c
3 : */
4 : #include "postgres.h"
5 :
6 : #include "btree_gist.h"
7 : #include "btree_utils_num.h"
8 : #include "common/int.h"
9 : #include "utils/sortsupport.h"
10 :
11 : typedef struct int64key
12 : {
13 : int64 lower;
14 : int64 upper;
15 : } int64KEY;
16 :
17 : /* GiST support functions */
18 4 : PG_FUNCTION_INFO_V1(gbt_int8_compress);
19 4 : PG_FUNCTION_INFO_V1(gbt_int8_fetch);
20 4 : PG_FUNCTION_INFO_V1(gbt_int8_union);
21 4 : PG_FUNCTION_INFO_V1(gbt_int8_picksplit);
22 4 : PG_FUNCTION_INFO_V1(gbt_int8_consistent);
23 4 : PG_FUNCTION_INFO_V1(gbt_int8_distance);
24 4 : PG_FUNCTION_INFO_V1(gbt_int8_penalty);
25 4 : PG_FUNCTION_INFO_V1(gbt_int8_same);
26 4 : PG_FUNCTION_INFO_V1(gbt_int8_sortsupport);
27 :
28 :
29 : static bool
30 3276 : gbt_int8gt(const void *a, const void *b, FmgrInfo *flinfo)
31 : {
32 3276 : return (*((const int64 *) a) > *((const int64 *) b));
33 : }
34 : static bool
35 1112 : gbt_int8ge(const void *a, const void *b, FmgrInfo *flinfo)
36 : {
37 1112 : return (*((const int64 *) a) >= *((const int64 *) b));
38 : }
39 : static bool
40 548 : gbt_int8eq(const void *a, const void *b, FmgrInfo *flinfo)
41 : {
42 548 : return (*((const int64 *) a) == *((const int64 *) b));
43 : }
44 : static bool
45 1116 : gbt_int8le(const void *a, const void *b, FmgrInfo *flinfo)
46 : {
47 1116 : return (*((const int64 *) a) <= *((const int64 *) b));
48 : }
49 : static bool
50 2730 : gbt_int8lt(const void *a, const void *b, FmgrInfo *flinfo)
51 : {
52 2730 : return (*((const int64 *) a) < *((const int64 *) b));
53 : }
54 :
55 : static int
56 1092 : gbt_int8key_cmp(const void *a, const void *b, FmgrInfo *flinfo)
57 : {
58 1092 : int64KEY *ia = (int64KEY *) (((const Nsrt *) a)->t);
59 1092 : int64KEY *ib = (int64KEY *) (((const Nsrt *) b)->t);
60 :
61 1092 : if (ia->lower == ib->lower)
62 : {
63 0 : if (ia->upper == ib->upper)
64 0 : return 0;
65 :
66 0 : return (ia->upper > ib->upper) ? 1 : -1;
67 : }
68 :
69 1092 : return (ia->lower > ib->lower) ? 1 : -1;
70 : }
71 :
72 : static float8
73 550 : gbt_int8_dist(const void *a, const void *b, FmgrInfo *flinfo)
74 : {
75 550 : return GET_FLOAT_DISTANCE(int64, a, b);
76 : }
77 :
78 :
79 : static const gbtree_ninfo tinfo =
80 : {
81 : gbt_t_int8,
82 : sizeof(int64),
83 : 16, /* sizeof(gbtreekey16) */
84 : gbt_int8gt,
85 : gbt_int8ge,
86 : gbt_int8eq,
87 : gbt_int8le,
88 : gbt_int8lt,
89 : gbt_int8key_cmp,
90 : gbt_int8_dist
91 : };
92 :
93 :
94 4 : PG_FUNCTION_INFO_V1(int8_dist);
95 : Datum
96 1100 : int8_dist(PG_FUNCTION_ARGS)
97 : {
98 1100 : int64 a = PG_GETARG_INT64(0);
99 1100 : int64 b = PG_GETARG_INT64(1);
100 : int64 r;
101 : int64 ra;
102 :
103 1100 : if (pg_sub_s64_overflow(a, b, &r) ||
104 1100 : r == PG_INT64_MIN)
105 0 : ereport(ERROR,
106 : (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
107 : errmsg("bigint out of range")));
108 :
109 1100 : ra = i64abs(r);
110 :
111 1100 : PG_RETURN_INT64(ra);
112 : }
113 :
114 :
115 : /**************************************************
116 : * GiST support functions
117 : **************************************************/
118 :
119 : Datum
120 1098 : gbt_int8_compress(PG_FUNCTION_ARGS)
121 : {
122 1098 : GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
123 :
124 1098 : PG_RETURN_POINTER(gbt_num_compress(entry, &tinfo));
125 : }
126 :
127 : Datum
128 548 : gbt_int8_fetch(PG_FUNCTION_ARGS)
129 : {
130 548 : GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
131 :
132 548 : PG_RETURN_POINTER(gbt_num_fetch(entry, &tinfo));
133 : }
134 :
135 : Datum
136 3852 : gbt_int8_consistent(PG_FUNCTION_ARGS)
137 : {
138 3852 : GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
139 3852 : int64 query = PG_GETARG_INT64(1);
140 3852 : StrategyNumber strategy = (StrategyNumber) PG_GETARG_UINT16(2);
141 :
142 : /* Oid subtype = PG_GETARG_OID(3); */
143 3852 : bool *recheck = (bool *) PG_GETARG_POINTER(4);
144 3852 : int64KEY *kkk = (int64KEY *) DatumGetPointer(entry->key);
145 : GBT_NUMKEY_R key;
146 :
147 : /* All cases served by this function are exact */
148 3852 : *recheck = false;
149 :
150 3852 : key.lower = (GBT_NUMKEY *) &kkk->lower;
151 3852 : key.upper = (GBT_NUMKEY *) &kkk->upper;
152 :
153 3852 : PG_RETURN_BOOL(gbt_num_consistent(&key, &query, &strategy,
154 : GIST_LEAF(entry), &tinfo, fcinfo->flinfo));
155 : }
156 :
157 : Datum
158 552 : gbt_int8_distance(PG_FUNCTION_ARGS)
159 : {
160 552 : GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
161 552 : int64 query = PG_GETARG_INT64(1);
162 :
163 : /* Oid subtype = PG_GETARG_OID(3); */
164 552 : int64KEY *kkk = (int64KEY *) DatumGetPointer(entry->key);
165 : GBT_NUMKEY_R key;
166 :
167 552 : key.lower = (GBT_NUMKEY *) &kkk->lower;
168 552 : key.upper = (GBT_NUMKEY *) &kkk->upper;
169 :
170 552 : PG_RETURN_FLOAT8(gbt_num_distance(&key, &query, GIST_LEAF(entry),
171 : &tinfo, fcinfo->flinfo));
172 : }
173 :
174 : Datum
175 2 : gbt_int8_union(PG_FUNCTION_ARGS)
176 : {
177 2 : GistEntryVector *entryvec = (GistEntryVector *) PG_GETARG_POINTER(0);
178 2 : void *out = palloc(sizeof(int64KEY));
179 :
180 2 : *(int *) PG_GETARG_POINTER(1) = sizeof(int64KEY);
181 2 : PG_RETURN_POINTER(gbt_num_union(out, entryvec, &tinfo, fcinfo->flinfo));
182 : }
183 :
184 : Datum
185 0 : gbt_int8_penalty(PG_FUNCTION_ARGS)
186 : {
187 0 : int64KEY *origentry = (int64KEY *) DatumGetPointer(((GISTENTRY *) PG_GETARG_POINTER(0))->key);
188 0 : int64KEY *newentry = (int64KEY *) DatumGetPointer(((GISTENTRY *) PG_GETARG_POINTER(1))->key);
189 0 : float *result = (float *) PG_GETARG_POINTER(2);
190 :
191 0 : penalty_num(result, origentry->lower, origentry->upper, newentry->lower, newentry->upper);
192 :
193 0 : PG_RETURN_POINTER(result);
194 : }
195 :
196 : Datum
197 2 : gbt_int8_picksplit(PG_FUNCTION_ARGS)
198 : {
199 2 : PG_RETURN_POINTER(gbt_num_picksplit((GistEntryVector *) PG_GETARG_POINTER(0),
200 : (GIST_SPLITVEC *) PG_GETARG_POINTER(1),
201 : &tinfo, fcinfo->flinfo));
202 : }
203 :
204 : Datum
205 0 : gbt_int8_same(PG_FUNCTION_ARGS)
206 : {
207 0 : int64KEY *b1 = (int64KEY *) PG_GETARG_POINTER(0);
208 0 : int64KEY *b2 = (int64KEY *) PG_GETARG_POINTER(1);
209 0 : bool *result = (bool *) PG_GETARG_POINTER(2);
210 :
211 0 : *result = gbt_num_same((void *) b1, (void *) b2, &tinfo, fcinfo->flinfo);
212 0 : PG_RETURN_POINTER(result);
213 : }
214 :
215 : static int
216 10218 : gbt_int8_ssup_cmp(Datum x, Datum y, SortSupport ssup)
217 : {
218 10218 : int64KEY *arg1 = (int64KEY *) DatumGetPointer(x);
219 10218 : int64KEY *arg2 = (int64KEY *) DatumGetPointer(y);
220 :
221 : /* for leaf items we expect lower == upper, so only compare lower */
222 10218 : if (arg1->lower < arg2->lower)
223 5134 : return -1;
224 5084 : else if (arg1->lower > arg2->lower)
225 5084 : return 1;
226 : else
227 0 : return 0;
228 :
229 : }
230 :
231 : Datum
232 2 : gbt_int8_sortsupport(PG_FUNCTION_ARGS)
233 : {
234 2 : SortSupport ssup = (SortSupport) PG_GETARG_POINTER(0);
235 :
236 2 : ssup->comparator = gbt_int8_ssup_cmp;
237 2 : PG_RETURN_VOID();
238 : }
|