forked from dimitri/prefix
-
Notifications
You must be signed in to change notification settings - Fork 0
/
prefix.c
1879 lines (1612 loc) · 48 KB
/
prefix.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/**
* Prefix opclass allows to efficiently index a prefix table with
* GiST.
*
* More common use case is telephony prefix searching for cost or
* routing.
*
* Many thanks to AndrewSN, who provided great amount of help in the
* writing of this opclass, on the PostgreSQL internals, GiST inner
* working and prefix search analyses.
*/
#include <stdio.h>
#include "postgres.h"
#include "access/gist.h"
#include "access/skey.h"
#include "utils/elog.h"
#include "utils/palloc.h"
#include "utils/builtins.h"
#include "libpq/pqformat.h"
#if PG_VERSION_NUM >= 160000
#include "varatt.h"
#endif
#include <math.h>
/**
* We use those DEBUG defines in the code, uncomment them to get very
* verbose output.
*
#define DEBUG
#define DEBUG_UNION
#define DEBUG_INTER
#define DEBUG_PENALTY
#define DEBUG_PICKSPLIT
#define DEBUG_CONSISTENT
#define DEBUG_PRESORT_GP
#define DEBUG_PRESORT_MAX
#define DEBUG_PRESORT_UNIONS
#define DEBUG_PRESORT_RESULT
#define DEBUG_PR_IN
#define DEBUG_PR_NORMALIZE
#define DEBUG_MAKE_VARLENA
*/
PG_MODULE_MAGIC;
/**
* prefix_range datatype, varlena structure
*/
typedef struct {
char first;
char last;
char prefix[1]; /* this is a varlena structure, data follows */
} prefix_range;
enum pr_delimiters_t {
PR_OPEN = '[',
PR_CLOSE = ']',
PR_SEP = '-'
} pr_delimiters;
/**
* prefix_range input/output functions and operators
*/
Datum prefix_range_init(PG_FUNCTION_ARGS);
Datum prefix_range_in(PG_FUNCTION_ARGS);
Datum prefix_range_out(PG_FUNCTION_ARGS);
Datum prefix_range_recv(PG_FUNCTION_ARGS);
Datum prefix_range_send(PG_FUNCTION_ARGS);
Datum prefix_range_cast_to_text(PG_FUNCTION_ARGS);
Datum prefix_range_cast_from_text(PG_FUNCTION_ARGS);
Datum prefix_range_length(PG_FUNCTION_ARGS);
Datum prefix_range_eq(PG_FUNCTION_ARGS);
Datum prefix_range_neq(PG_FUNCTION_ARGS);
Datum prefix_range_lt(PG_FUNCTION_ARGS);
Datum prefix_range_le(PG_FUNCTION_ARGS);
Datum prefix_range_gt(PG_FUNCTION_ARGS);
Datum prefix_range_ge(PG_FUNCTION_ARGS);
Datum prefix_range_cmp(PG_FUNCTION_ARGS);
Datum prefix_range_overlaps(PG_FUNCTION_ARGS);
Datum prefix_range_contains(PG_FUNCTION_ARGS);
Datum prefix_range_contains_strict(PG_FUNCTION_ARGS);
Datum prefix_range_contained_by(PG_FUNCTION_ARGS);
Datum prefix_range_contained_by_strict(PG_FUNCTION_ARGS);
Datum prefix_range_union(PG_FUNCTION_ARGS);
Datum prefix_range_inter(PG_FUNCTION_ARGS);
#define DatumGetPrefixRange(X) ((prefix_range *) VARDATA_ANY(X) )
#define PrefixRangeGetDatum(X) PointerGetDatum(make_varlena(X))
#define PG_GETARG_PREFIX_RANGE_P(n) DatumGetPrefixRange(PG_DETOAST_DATUM(PG_GETARG_DATUM(n)))
#define PG_RETURN_PREFIX_RANGE_P(x) return PrefixRangeGetDatum(x)
/**
* Used by prefix_contains_internal and pr_contains_prefix.
*
* plen is the length of string p, qlen the length of string q, the
* caller are dealing with either text * or char * and its their
* responsabolity to use either strlen() or VARSIZE_ANY_EXHDR()
*/
static inline
bool __prefix_contains(char *p, char *q, int plen, int qlen) {
if(qlen < plen )
return false;
return memcmp(p, q, plen) == 0;
}
static inline
char *__greater_prefix(char *a, char *b, int alen, int blen)
{
int i = 0;
char *result = NULL;
for(i=0; i<alen && i<blen && a[i] == b[i]; i++);
/* i is the last common char position in a, or 0 */
if( i == 0 ) {
/**
* return ""
*/
result = (char *)palloc(sizeof(char));
}
else {
result = (char *)palloc((i+1) * sizeof(char));
memcpy(result, a, i);
}
result[i] = 0;
return result;
}
/**
* Helper function which builds a prefix_range from a prefix, a first
* and a last component, making a copy of the prefix string.
*/
static inline
prefix_range *build_pr(const char *prefix, char first, char last) {
int s = strlen(prefix) + 1;
prefix_range *pr = palloc(sizeof(prefix_range) + s);
memcpy(pr->prefix, prefix, s);
pr->first = first;
pr->last = last;
#ifdef DEBUG_PR_IN
elog(NOTICE,
"build_pr: pr->prefix = '%s', pr->first = %d, pr->last = %d",
pr->prefix, pr->first, pr->last);
#endif
return pr;
}
/**
* Normalize a prefix_range. Two cases are handled:
*
* abc[x-x] is rewritten abcx
* abc[x-y] is rewritten abc[y-x] when y < x
*/
static inline
prefix_range *pr_normalize(prefix_range *a) {
char tmpswap;
char *prefix;
prefix_range *pr = build_pr(a->prefix, a->first, a->last);
if( pr->first == pr->last ) {
int s = strlen(pr->prefix)+2;
prefix = (char *)palloc(s);
memcpy(prefix, pr->prefix, s-2);
prefix[s-2] = pr->first;
prefix[s-1] = 0;
#ifdef DEBUG_PR_NORMALIZE
elog(NOTICE, "prefix_range %s %s %s", a->prefix, pr->prefix, prefix);
#endif
pfree(pr);
pr = build_pr(prefix, 0, 0);
}
else if( pr->first > pr->last ) {
tmpswap = pr->first;
pr->first = pr->last;
pr->last = tmpswap;
}
return pr;
}
/*
* Init a prefix value from the prefix_range(text, text, text)
* function
*/
static inline
prefix_range *make_prefix_range(char *str, char first, char last) {
int len;
prefix_range *pr = NULL;
if( str != NULL )
pr = build_pr(str, first, last);
else
pr = build_pr("", first, last);
len = strlen(pr->prefix);
memcpy(pr->prefix, str, len);
pr->prefix[len] = 0;
return pr_normalize(pr);
}
/**
* First, the input reader. A prefix range will have to respect the
* following regular expression: .*([[].-.[]])?
*
* examples : 123[4-6], [1-3], 234, 01[] --- last one not covered by
* regexp.
*/
static inline
prefix_range *pr_from_str(char *str) {
prefix_range *pr = NULL;
char *prefix = (char *)palloc(strlen(str)+1);
char current = 0, previous = 0;
bool opened = false;
bool closed = false;
bool sawsep = false;
char *ptr, *prefix_ptr = prefix;
bzero(prefix, strlen(str)+1);
for(ptr=str; *ptr != 0; ptr++) {
previous = current;
current = *ptr;
if( !opened && current != PR_OPEN )
*prefix_ptr++ = current;
#ifdef DEBUG_PR_IN
elog(NOTICE, "prefix_range previous='%c' current='%c' prefix='%s'",
(previous?previous:' '), current, prefix);
#endif
switch( current ) {
case PR_OPEN:
if( opened ) {
#ifdef DEBUG_PR_IN
elog(ERROR,
"prefix_range %s contains several %c", str, PR_OPEN);
#endif
return NULL;
}
opened = true;
pr = build_pr(prefix, 0, 0);
break;
case PR_SEP:
if( opened ) {
if( closed ) {
#ifdef DEBUG_PR_IN
elog(ERROR,
"prefix_range %s contains trailing character", str);
#endif
return NULL;
}
sawsep = true;
if( previous == PR_OPEN ) {
#ifdef DEBUG_PR_IN
elog(ERROR,
"prefix_range %s has separator following range opening, without data", str);
#endif
return NULL;
}
pr->first = previous;
}
break;
case PR_CLOSE:
if( !opened ) {
#ifdef DEBUG_PR_IN
elog(ERROR,
"prefix_range %s closes a range which is not opened ", str);
#endif
return NULL;
}
if( closed ) {
#ifdef DEBUG_PR_IN
elog(ERROR,
"prefix_range %s contains several %c", str, PR_CLOSE);
#endif
return NULL;
}
closed = true;
if( sawsep ) {
if( previous == PR_SEP ) {
#ifdef DEBUG_PR_IN
elog(ERROR,
"prefix_range %s has a closed range without last bound", str);
#endif
return NULL;
}
pr->last = previous;
}
else {
if( previous != PR_OPEN ) {
#ifdef DEBUG_PR_IN
elog(ERROR,
"prefix_range %s has a closing range without separator", str);
#endif
return NULL;
}
}
break;
default:
if( closed ) {
#ifdef DEBUG_PR_IN
elog(ERROR,
"prefix_range %s contains trailing characters", str);
#endif
return NULL;
}
break;
}
}
if( ! opened ) {
pr = build_pr(prefix, 0, 0);
}
if( opened && !closed ) {
#ifdef DEBUG_PR_IN
elog(ERROR, "prefix_range %s opens a range but does not close it", str);
#endif
return NULL;
}
pr = pr_normalize(pr);
#ifdef DEBUG_PR_IN
if( pr != NULL ) {
if( pr->first && pr->last )
elog(NOTICE,
"prefix_range %s: prefix = '%s', first = '%c', last = '%c'",
str, pr->prefix, pr->first, pr->last);
else
elog(NOTICE,
"prefix_range %s: prefix = '%s', no first nor last",
str, pr->prefix);
}
#endif
return pr;
}
static inline
struct varlena *make_varlena(prefix_range *pr) {
struct varlena *vdat;
int size;
if (pr != NULL) {
size = sizeof(prefix_range) + ((strlen(pr->prefix)+1)*sizeof(char)) + VARHDRSZ;
vdat = palloc(size);
SET_VARSIZE(vdat, size);
memcpy(VARDATA(vdat), pr, (size - VARHDRSZ));
#ifdef DEBUG_MAKE_VARLENA
elog(NOTICE, "make varlena: size=%d varsize=%d compressed=%c external=%c %s[%c-%c] %s[%c-%c]",
size,
VARSIZE_ANY_EXHDR(vdat),
(VARATT_IS_COMPRESSED(vdat) ? 't' : 'f'),
(VARATT_IS_EXTERNAL(vdat) ? 't' : 'f'),
pr->prefix,
(pr->first != 0 ? pr->first : ' '),
(pr->last != 0 ? pr->last : ' '),
((prefix_range *)VARDATA(vdat))->prefix,
(((prefix_range *)VARDATA(vdat))->first ? ((prefix_range *)VARDATA(vdat))->first : ' '),
(((prefix_range *)VARDATA(vdat))->last ? ((prefix_range *)VARDATA(vdat))->last : ' '));
#endif
return vdat;
}
return NULL;
}
/*
* Allow users to use length(prefix) rather than length(prefix::text), and
* while at it, provides an implementation which won't count the displaying
* artifacts that are the [] and -.
*/
static inline
int pr_length(prefix_range *pr) {
int len = strlen(pr->prefix);
if( pr->first != 0 || pr->last != 0 )
len += 1;
return len;
}
static inline
bool pr_eq(prefix_range *a, prefix_range *b) {
int sa = strlen(a->prefix);
int sb = strlen(b->prefix);
return sa == sb
&& memcmp(a->prefix, b->prefix, sa) == 0
&& a->first == b->first
&& a->last == b->last;
}
/*
* We invent a prefix_range ordering for convenience, but that's
* dangerous. Use the BTree opclass at your own risk.
*
* On the other hand, when your routing table does contain pretty static
* data and you test it carefully or know it will fit into the ordering
* simplification, you're good to go.
*
* Baring bug, the constraint is to have non-overlapping data.
*/
/*static inline
bool pr_lt(prefix_range *a, prefix_range *b, bool eqval) {
*/
static inline
int pr_cmp(prefix_range *a, prefix_range *b) {
int cmp = 0;
int alen = strlen(a->prefix);
int blen = strlen(b->prefix);
int mlen = alen; /* minimum length */
char *p = a->prefix;
char *q = b->prefix;
/*
* First case, common prefix length
*/
if( alen == blen ) {
cmp = memcmp(p, q, alen);
/* Uncommon prefix, easy to compare */
if( cmp != 0 )
return cmp;
/* Common prefix, check for (sub)ranges */
else
return (a->first == b->first) ? (a->last - b->last) : (a->first - b->first);
}
/* For memcmp() safety, we need the minimum length */
if( mlen > blen )
mlen = blen;
/*
* Don't forget we may have [x-y] prefix style, that's empty prefix, only range.
*/
if( alen == 0 && a->first != 0 ) {
/* return (eqval ? (a->first <= q[0]) : (a->first < q[0])); */
return a->first - q[0];
}
else if( blen == 0 && b->first != 0 ) {
/* return (eqval ? (p[0] <= b->first) : (p[0] < b->first)); */
return p[0] - b->first;
}
/*
* General case
*
* When memcmp() on the shorter of p and q returns 0, that means they
* share a common prefix: avoid to say that '93' < '9377' and '9377' <
* '93'.
*/
cmp = memcmp(p, q, mlen);
if( cmp == 0 )
/*
* we are comparing e.g. '1' and '12' (the shorter contains the
* smaller), so let's pretend '12' < '1' as it contains less elements.
*/
return (alen == mlen) ? 1 : -1;
return cmp;
}
static inline
bool pr_lt(prefix_range *a, prefix_range *b, bool eqval) {
int cmp = pr_cmp(a, b);
return eqval ? cmp <= 0 : cmp < 0;
}
static inline
bool pr_gt(prefix_range *a, prefix_range *b, bool eqval) {
int cmp = pr_cmp(a, b);
return eqval ? cmp >= 0 : cmp > 0;
}
static inline
bool pr_contains(prefix_range *left, prefix_range *right, bool eqval) {
int sl;
int sr;
bool left_prefixes_right;
if( pr_eq(left, right) )
return eqval;
sl = strlen(left->prefix);
sr = strlen(right->prefix);
if( sr < sl )
return false;
left_prefixes_right = memcmp(left->prefix, right->prefix, sl) == 0;
if( left_prefixes_right ) {
if( sl == sr )
return left->first == 0 ||
(left->first <= right->first && left->last >= right->last);
return left->first == 0 ||
(left->first <= right->prefix[sl] && right->prefix[sl] <= left->last);
}
return false;
}
/**
* does a given prefix_range includes a given prefix?
*/
static inline
bool pr_contains_prefix(prefix_range *pr, text *query, bool eqval) {
int plen = strlen(pr->prefix);
int qlen = VARSIZE_ANY_EXHDR(query);
char *p = pr->prefix;
char *q = (char *)VARDATA_ANY(query);
if( __prefix_contains(p, q, plen, qlen) ) {
if( pr->first == 0 || qlen == plen ) {
return eqval;
}
/**
* __prefix_contains() is true means qlen >= plen, and previous
* test ensures qlen != plen, we hence assume qlen > plen.
*/
Assert(qlen > plen);
return pr-> first <= q[plen] && q[plen] <= pr->last;
}
return false;
}
static
prefix_range *pr_union(prefix_range *a, prefix_range *b) {
prefix_range *res = NULL;
int alen = strlen(a->prefix);
int blen = strlen(b->prefix);
char *gp = NULL;
int gplen;
char min, max;
if( 0 == alen && 0 == blen ) {
res = build_pr("",
a->first <= b->first ? a->first : b->first,
a->last >= b->last ? a->last : b->last);
return pr_normalize(res);
}
gp = __greater_prefix(a->prefix, b->prefix, alen, blen);
gplen = strlen(gp);
if( gplen == 0 ) {
res = build_pr("", 0, 0);
if( alen > 0 && blen > 0 ) {
res->first = a->prefix[0];
res->last = b->prefix[0];
}
else if( alen == 0 ) {
res->first = a->first <= b->prefix[0] ? a->first : b->prefix[0];
res->last = a->last >= b->prefix[0] ? a->last : b->prefix[0];
}
else if( blen == 0 ) {
res->first = b->first <= a->prefix[0] ? b->first : a->prefix[0];
res->last = b->last >= a->prefix[0] ? b->last : a->prefix[0];
}
}
else {
res = build_pr(gp, 0, 0);
if( gplen == alen && alen == blen ) {
res->first = a->first <= b->first ? a->first : b->first;
res->last = a->last >= b->last ? a->last : b->last;
}
else if( gplen == alen ) {
Assert(alen < blen);
res->first = a->first <= b->prefix[alen] ? a->first : b->prefix[alen];
res->last = a->last >= b->prefix[alen] ? a->last : b->prefix[alen];
}
else if( gplen == blen ) {
Assert(blen < alen);
res->first = b->first <= a->prefix[blen] ? b->first : a->prefix[blen];
res->last = b->last >= a->prefix[blen] ? b->last : a->prefix[blen];
}
else {
Assert(gplen < alen && gplen < blen);
min = a->prefix[gplen];
max = b->prefix[gplen];
if( min > max ) {
min = b->prefix[gplen];
max = a->prefix[gplen];
}
res->first = min;
res->last = max;
#ifdef DEBUG_UNION
elog(NOTICE, "union a: %s %d %d", a->prefix, a->first, a->last);
elog(NOTICE, "union b: %s %d %d", b->prefix, b->first, b->last);
elog(NOTICE, "union r: %s %d %d", res->prefix, res->first, res->last);
#endif
}
}
return pr_normalize(res);
}
static inline
prefix_range *pr_inter(prefix_range *a, prefix_range *b) {
prefix_range *res = NULL;
int alen = strlen(a->prefix);
int blen = strlen(b->prefix);
char *gp = NULL;
int gplen;
if( 0 == alen && 0 == blen ) {
res = build_pr("",
a->first > b->first ? a->first : b->first,
a->last < b->last ? a->last : b->last);
return pr_normalize(res);
}
gp = __greater_prefix(a->prefix, b->prefix, alen, blen);
gplen = strlen(gp);
if( gplen != alen && gplen != blen ) {
return build_pr("", 0, 0);
}
if( gplen == alen && 0 == alen ) {
if( a->first <= b->prefix[0] && b->prefix[0] <= a->last ) {
res = build_pr(b->prefix, b->first, b->last);
}
else
res = build_pr("", 0, 0);
}
else if( gplen == blen && 0 == blen ) {
if( b->first <= a->prefix[0] && a->prefix[0] <= b->last ) {
res = build_pr(a->prefix, a->first, a->last);
}
else
res = build_pr("", 0, 0);
}
else if( gplen == alen && alen == blen ) {
char first, last;
if( a->first == 0 )
first = b->first;
else
first = a->first > b->first ? a->first : b->first;
if( a->last == 0 )
last = b->last;
else
last = a->last > b->last ? b->last : a->last;
res = build_pr(gp, first, last);
#ifdef DEBUG_INTER
elog(NOTICE, "inter a: %s %d %d", a->prefix, a->first, a->last);
elog(NOTICE, "inter b: %s %d %d", b->prefix, b->first, b->last);
elog(NOTICE, "inter r: %s %d %d", res->prefix, res->first, res->last);
#endif
}
else if( gplen == alen ) {
Assert(gplen < blen);
res = build_pr(b->prefix, b->first, b->last);
}
else if( gplen == blen ) {
Assert(gplen < alen);
res = build_pr(a->prefix, a->first, a->last);
}
return pr_normalize(res);
}
/**
* true if ranges have at least one common element
*/
static inline
bool pr_overlaps(prefix_range *a, prefix_range *b) {
prefix_range *inter = pr_inter(a, b);
return strlen(inter->prefix) > 0 || (inter->first != 0 && inter->last != 0);
}
PG_FUNCTION_INFO_V1(prefix_range_init);
Datum
prefix_range_init(PG_FUNCTION_ARGS)
{
text *txt = PG_GETARG_TEXT_P(0);
char *str =
DatumGetCString(DirectFunctionCall1(textout, PointerGetDatum(txt)));
text *t_first = PG_GETARG_TEXT_P(1);
char *c_first =
DatumGetCString(DirectFunctionCall1(textout, PointerGetDatum(t_first)));
text *t_last = PG_GETARG_TEXT_P(2);
char *c_last =
DatumGetCString(DirectFunctionCall1(textout, PointerGetDatum(t_last)));
int flen = t_first == NULL ? 0 : strlen(c_first);
int llen = t_last == NULL ? 0 : strlen(c_last);
char first, last;
if( flen > 1 || llen > 1 )
ereport(ERROR,
(errcode(ERRCODE_INVALID_PARAMETER_VALUE),
errmsg("prefix_range first and last must be at most 1 char long.")
));
first = flen == 0 ? 0 : c_first[0];
last = llen == 0 ? 0 : c_last[0];
PG_RETURN_PREFIX_RANGE_P(make_prefix_range(str, first, last));
}
PG_FUNCTION_INFO_V1(prefix_range_in);
Datum
prefix_range_in(PG_FUNCTION_ARGS)
{
char *str = PG_GETARG_CSTRING(0);
prefix_range *pr = pr_from_str(str);
if (pr != NULL) {
PG_RETURN_PREFIX_RANGE_P(pr);
}
ereport(ERROR,
(errcode(ERRCODE_INVALID_PARAMETER_VALUE),
errmsg("invalid prefix_range value: \"%s\"", str)));
PG_RETURN_NULL();
}
PG_FUNCTION_INFO_V1(prefix_range_out);
Datum
prefix_range_out(PG_FUNCTION_ARGS)
{
prefix_range *pr = PG_GETARG_PREFIX_RANGE_P(0);
char *out = NULL;
if( pr->first ) {
out = (char *)palloc((strlen(pr->prefix)+6) * sizeof(char));
sprintf(out, "%s[%c-%c]", pr->prefix, pr->first, pr->last);
}
else {
out = (char *)palloc((strlen(pr->prefix)+1) * sizeof(char));
sprintf(out, "%s", pr->prefix);
}
PG_RETURN_CSTRING(out);
}
PG_FUNCTION_INFO_V1(prefix_range_recv);
Datum
prefix_range_recv(PG_FUNCTION_ARGS)
{
StringInfo buf = (StringInfo) PG_GETARG_POINTER(0);
const char *first = pq_getmsgbytes(buf, 1);
const char *last = pq_getmsgbytes(buf, 1);
const char *prefix = pq_getmsgstring(buf);
prefix_range *pr = build_pr(prefix, *first, *last);
pq_getmsgend(buf);
PG_RETURN_PREFIX_RANGE_P(pr);
}
PG_FUNCTION_INFO_V1(prefix_range_send);
Datum
prefix_range_send(PG_FUNCTION_ARGS)
{
prefix_range *pr = PG_GETARG_PREFIX_RANGE_P(0);
StringInfoData buf;
pq_begintypsend(&buf);
pq_sendbyte(&buf, pr->first);
pq_sendbyte(&buf, pr->last);
pq_sendstring(&buf, pr->prefix);
PG_RETURN_BYTEA_P(pq_endtypsend(&buf));
}
PG_FUNCTION_INFO_V1(prefix_range_cast_from_text);
Datum
prefix_range_cast_from_text(PG_FUNCTION_ARGS)
{
text *txt = PG_GETARG_TEXT_P(0);
Datum cstring = DirectFunctionCall1(textout, PointerGetDatum(txt));
return DirectFunctionCall1(prefix_range_in, cstring);
}
PG_FUNCTION_INFO_V1(prefix_range_cast_to_text);
Datum
prefix_range_cast_to_text(PG_FUNCTION_ARGS)
{
prefix_range *pr = PG_GETARG_PREFIX_RANGE_P(0);
Datum cstring;
text *out;
if (pr != NULL) {
cstring = DirectFunctionCall1(prefix_range_out, PrefixRangeGetDatum(pr));
out = (text *)DirectFunctionCall1(textin, cstring);
PG_RETURN_TEXT_P(out);
}
PG_RETURN_NULL();
}
PG_FUNCTION_INFO_V1(prefix_range_length);
Datum
prefix_range_length(PG_FUNCTION_ARGS)
{
PG_RETURN_INT32( pr_length(PG_GETARG_PREFIX_RANGE_P(0)) );
}
PG_FUNCTION_INFO_V1(prefix_range_eq);
Datum
prefix_range_eq(PG_FUNCTION_ARGS)
{
PG_RETURN_BOOL( pr_eq(PG_GETARG_PREFIX_RANGE_P(0),
PG_GETARG_PREFIX_RANGE_P(1)) );
}
PG_FUNCTION_INFO_V1(prefix_range_neq);
Datum
prefix_range_neq(PG_FUNCTION_ARGS)
{
PG_RETURN_BOOL( ! pr_eq(PG_GETARG_PREFIX_RANGE_P(0),
PG_GETARG_PREFIX_RANGE_P(1)) );
}
PG_FUNCTION_INFO_V1(prefix_range_lt);
Datum
prefix_range_lt(PG_FUNCTION_ARGS)
{
PG_RETURN_BOOL( pr_lt(PG_GETARG_PREFIX_RANGE_P(0),
PG_GETARG_PREFIX_RANGE_P(1),
false) );
}
PG_FUNCTION_INFO_V1(prefix_range_le);
Datum
prefix_range_le(PG_FUNCTION_ARGS)
{
PG_RETURN_BOOL( pr_lt(PG_GETARG_PREFIX_RANGE_P(0),
PG_GETARG_PREFIX_RANGE_P(1),
true) );
}
PG_FUNCTION_INFO_V1(prefix_range_gt);
Datum
prefix_range_gt(PG_FUNCTION_ARGS)
{
PG_RETURN_BOOL( pr_gt(PG_GETARG_PREFIX_RANGE_P(0),
PG_GETARG_PREFIX_RANGE_P(1),
false) );
}
PG_FUNCTION_INFO_V1(prefix_range_ge);
Datum
prefix_range_ge(PG_FUNCTION_ARGS)
{
PG_RETURN_BOOL( pr_gt(PG_GETARG_PREFIX_RANGE_P(0),
PG_GETARG_PREFIX_RANGE_P(1),
true) );
}
PG_FUNCTION_INFO_V1(prefix_range_cmp);
Datum
prefix_range_cmp(PG_FUNCTION_ARGS)
{
prefix_range *a = PG_GETARG_PREFIX_RANGE_P(0);
prefix_range *b = PG_GETARG_PREFIX_RANGE_P(1);
PG_RETURN_INT32(pr_cmp(a, b));
}
PG_FUNCTION_INFO_V1(prefix_range_overlaps);
Datum
prefix_range_overlaps(PG_FUNCTION_ARGS)
{
PG_RETURN_BOOL( pr_overlaps(PG_GETARG_PREFIX_RANGE_P(0),
PG_GETARG_PREFIX_RANGE_P(1)) );
}
PG_FUNCTION_INFO_V1(prefix_range_contains);
Datum
prefix_range_contains(PG_FUNCTION_ARGS)
{
PG_RETURN_BOOL( pr_contains(PG_GETARG_PREFIX_RANGE_P(0),
PG_GETARG_PREFIX_RANGE_P(1),
true ));
}
PG_FUNCTION_INFO_V1(prefix_range_contains_strict);
Datum
prefix_range_contains_strict(PG_FUNCTION_ARGS)
{
PG_RETURN_BOOL( pr_contains(PG_GETARG_PREFIX_RANGE_P(0),
PG_GETARG_PREFIX_RANGE_P(1),
false ));
}
PG_FUNCTION_INFO_V1(prefix_range_contained_by);
Datum
prefix_range_contained_by(PG_FUNCTION_ARGS)
{
PG_RETURN_BOOL( pr_contains(PG_GETARG_PREFIX_RANGE_P(1),
PG_GETARG_PREFIX_RANGE_P(0),
true ));
}
PG_FUNCTION_INFO_V1(prefix_range_contained_by_strict);
Datum
prefix_range_contained_by_strict(PG_FUNCTION_ARGS)
{
PG_RETURN_BOOL( pr_contains(PG_GETARG_PREFIX_RANGE_P(1),
PG_GETARG_PREFIX_RANGE_P(0),
false ));
}
PG_FUNCTION_INFO_V1(prefix_range_union);
Datum
prefix_range_union(PG_FUNCTION_ARGS)
{
PG_RETURN_PREFIX_RANGE_P( pr_union(PG_GETARG_PREFIX_RANGE_P(0),
PG_GETARG_PREFIX_RANGE_P(1)) );
}
PG_FUNCTION_INFO_V1(prefix_range_inter);
Datum
prefix_range_inter(PG_FUNCTION_ARGS)
{
PG_RETURN_PREFIX_RANGE_P( pr_inter(PG_GETARG_PREFIX_RANGE_P(0),
PG_GETARG_PREFIX_RANGE_P(1)) );
}
/**
* GiST support methods
*
* pr_penalty allows SQL level penalty code testing.
*/
Datum gpr_consistent(PG_FUNCTION_ARGS);
Datum gpr_compress(PG_FUNCTION_ARGS);
Datum gpr_decompress(PG_FUNCTION_ARGS);
Datum gpr_penalty(PG_FUNCTION_ARGS);
Datum gpr_picksplit(PG_FUNCTION_ARGS);
Datum gpr_picksplit_presort(PG_FUNCTION_ARGS);
Datum gpr_picksplit_jordan(PG_FUNCTION_ARGS);
Datum gpr_union(PG_FUNCTION_ARGS);
Datum gpr_same(PG_FUNCTION_ARGS);
Datum pr_penalty(PG_FUNCTION_ARGS);
/*
* Internal implementation of consistent
*
OPERATOR 1 @>,
OPERATOR 2 <@,
OPERATOR 3 =,
OPERATOR 4 &&,
*/
static inline
bool pr_consistent(StrategyNumber strategy,
prefix_range *key, prefix_range *query, bool is_leaf) {
switch (strategy) {
case 1:
return pr_contains(key, query, true);
case 2:
if ( is_leaf ) {
return pr_contains(query, key, true);
} else {
return pr_overlaps(query, key);