-
Notifications
You must be signed in to change notification settings - Fork 73
/
query-datatypes.c
1309 lines (1170 loc) · 35.3 KB
/
query-datatypes.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
/*
* 4store - a clustered RDF storage and query engine
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
*
* Copyright (C) 2006 Steve Harris for Garlik
*/
#include <stdlib.h>
#include <glib.h>
#include <string.h>
#include "query-datatypes.h"
#include "query-intl.h"
#include "filter.h"
#include "debug.h"
#include "../common/error.h"
#include "../common/sort.h"
#define DEBUG_CUTOFF 20
/* struct to hold information useful for sorting binding tables */
struct sort_context {
fs_binding *b;
};
/* lookup sorted table values given a column number and logcial (sorted) row
* number, sorted order is represented in the 0th column (_ord) to make sorting
* more efficient */
static fs_rid table_value(fs_binding *b, int col, int log)
{
if (b[col].vals->length < log) {
/* out of range */
return FS_RID_NULL;
}
/* if the _ord column exists */
if (b[0].vals->length > 0) {
return b[col].vals->data[b[0].vals->data[log]];
} else {
return b[col].vals->data[log];
}
}
fs_binding *fs_binding_new()
{
fs_binding *b = calloc(FS_BINDING_MAX_VARS+1, sizeof(fs_binding));
for (int i=0; i<FS_BINDING_MAX_VARS; i++) {
b[i].appears = -1;
b[i].depends = -1;
}
return b;
}
void fs_binding_free(fs_binding *b)
{
if (!b) return;
for (int i=0; b[i].name; i++) {
g_free(b[i].name);
b[i].name = NULL;
fs_rid_vector_free(b[i].vals);
b[i].vals = NULL;
}
memset(b, 0, sizeof(fs_binding));
free(b);
}
int fs_binding_set_expression(fs_binding *b, rasqal_variable *var, rasqal_expression *ex)
{
fs_binding *vb = fs_binding_get(b, var);
if (vb) {
vb->expression = ex;
return 0;
}
fs_error(LOG_ERR, "cannot find varaible %s", var->name);
return 1;
}
int fs_binding_any_bound(fs_binding *b)
{
for (int i=0; b[i].name; i++) {
if (b[i].bound) {
return 1;
}
}
return 0;
}
int fs_binding_length(fs_binding *b)
{
int length = 0;
for (int i=0; 1; i++) {
if (!b[i].name) break;
if (b[i].vals && b[i].vals->length > length) {
length = b[i].vals->length;
}
}
return length;
}
int fs_binding_width(fs_binding *b)
{
int width;
for (width=0; b[width].name; width++) ;
return width;
}
fs_binding *fs_binding_create(fs_binding *b, const char *name, fs_rid val, int projected)
{
int i;
for (i=0; i < FS_BINDING_MAX_VARS && b[i].name; i++);
if (i == FS_BINDING_MAX_VARS) {
fs_error(LOG_ERR, "variable limit of %d exceeded", FS_BINDING_MAX_VARS);
return NULL;
}
b[i].name = g_strdup(name);
if (val != FS_RID_NULL) {
if (b[i].vals) {
fs_error(LOG_WARNING, "loosing pointer to rid_vector");
}
b[i].vals = fs_rid_vector_new_from_args(1, val);
b[i].bound = 1;
} else {
if (b[i].vals) {
fs_error(LOG_WARNING, "loosing pointer to rid_vector");
}
b[i].vals = fs_rid_vector_new(0);
}
b[i].proj = projected;
b[i].need_val = projected;
return b+i;
}
fs_binding *fs_binding_add(fs_binding *b, rasqal_variable *var, fs_rid val, int projected)
{
#ifdef DEBUG_BINDING
if (strcmp(DEBUG_BINDING, name)) printf("@@ add("DEBUG_BINDING", %016llx, %d)\n", val, projected);
#endif
fs_binding *bv = fs_binding_get(b, var);
if (bv) {
fs_rid_vector_append(bv->vals, val);
bv->bound = 1;
bv->proj |= projected;
bv->need_val |= projected;
return bv;
}
long i;
for (i=0; i < FS_BINDING_MAX_VARS && b[i].name; i++);
if (i == FS_BINDING_MAX_VARS) {
fs_error(LOG_ERR, "variable limit (%d) exceeded",
FS_BINDING_MAX_VARS);
return NULL;
}
b[i].name = g_strdup((char *)var->name);
if (val != FS_RID_NULL) {
if (b[i].vals) {
fs_error(LOG_WARNING, "loosing pointer to rid_vector");
}
b[i].vals = fs_rid_vector_new_from_args(1, val);
b[i].bound = 1;
} else {
if (b[i].vals) {
fs_error(LOG_WARNING, "loosing pointer to rid_vector");
}
b[i].vals = fs_rid_vector_new(0);
}
b[i].proj = projected;
b[i].need_val = projected;
var->user_data = (void *)i;
return b+i;
}
fs_binding *fs_binding_copy(fs_binding *b)
{
if (!b) {
return NULL;
}
#ifdef DEBUG_BINDING
printf("@@ copy()\n");
#endif
fs_binding *b2 = fs_binding_new();
memcpy(b2, b, sizeof(fs_binding) * FS_BINDING_MAX_VARS);
for (int i=0; 1; i++) {
if (!b[i].name) {
break;
}
b[i].name = g_strdup(b2[i].name);
b[i].vals = fs_rid_vector_copy(b2[i].vals);
}
return b2;
}
fs_binding *fs_binding_copy_and_clear(fs_binding *b)
{
#ifdef DEBUG_BINDING
printf("@@ copy_and_clear()\n");
#endif
fs_binding *b2 = fs_binding_new();
memcpy(b2, b, sizeof(fs_binding) * FS_BINDING_MAX_VARS);
for (int i=0; 1; i++) {
if (!b[i].name) {
break;
}
b[i].name = g_strdup(b2[i].name);
b[i].vals = fs_rid_vector_new(b2[i].vals->size);
b[i].vals->length = 0;
/* at this point we can clear the bound flag as
shortcuts on variables bound to the empty
list are now handled by a wrapper round
fsp_bind_*() and look to the parent code
just like we had sent them to the backend */
b[i].bound = 0;
}
return b2;
}
void fs_binding_clear(fs_binding *b)
{
#ifdef DEBUG_BINDING
printf("@@ clear()\n");
#endif
for (int i=0; 1; i++) {
if (!b[i].name) {
break;
}
b[i].name = NULL;
b[i].vals->length = 0;
b[i].bound = 0;
}
}
void fs_binding_add_vector(fs_binding *b, rasqal_variable *var, fs_rid_vector *vals)
{
#ifdef DEBUG_BINDING
if (!strcmp(DEBUG_BINDING, name)) printf("@@ add_vector("DEBUG_BINDING", %p)\n", vals);
#endif
fs_binding *bv = fs_binding_get(b, var);
if (bv) {
fs_rid_vector_append_vector(bv->vals, vals);
bv->bound = 1;
return;
}
int i;
for (i=0; i < FS_BINDING_MAX_VARS && b[i].name; i++);
if (i == FS_BINDING_MAX_VARS) {
fs_error(LOG_ERR, "variable limit (%d) exceeded",
FS_BINDING_MAX_VARS);
return;
}
/* name wasn't found, add it */
b[i].name = g_strdup((char *)var->name);
b[i].vals = fs_rid_vector_copy(vals);
b[i].bound = 1;
}
fs_binding *fs_binding_get(fs_binding *b, rasqal_variable *var)
{
#ifdef DEBUG_BINDING
if (!strcmp(DEBUG_BINDING, name)) printf("@@ get_var("DEBUG_BINDING")\n");
#endif
if (var->user_data) {
long col = (long)var->user_data;
return b+col;
}
const char *vname = (char *)var->name;
fs_binding *vb = NULL;
long i;
for (i=0; b[i].name; i++) {
if (!strcmp(b[i].name, vname)) {
vb = b+i;
var->user_data = (void *)i;
break;
}
}
return vb;
}
fs_rid fs_binding_get_val(fs_binding *b, rasqal_variable *var, int idx, int *bound)
{
#ifdef DEBUG_BINDING
if (!strcmp(DEBUG_BINDING, name)) printf("@@ get_val("DEBUG_BINDING", %d)\n", idx);
#endif
fs_binding *bv = fs_binding_get(b, var);
if (!bv) {
if (bound) *bound = 0;
return FS_RID_NULL;
}
if (!bv->need_val) return FS_RID_GONE;
if (bound) *bound = bv->bound;
if (!bv->bound) {
return FS_RID_NULL;
}
if (idx >= 0 && idx < bv->vals->length) {
return bv->vals->data[idx];
}
fs_error(LOG_ERR, "val request out of range for variable '%s'", var->name);
return FS_RID_NULL;
}
fs_rid_vector *fs_binding_get_vals(fs_binding *b, const char *name, int *bound)
{
#ifdef DEBUG_BINDING
if (!strcmp(DEBUG_BINDING, name)) printf("@@ get_vals("DEBUG_BINDING")\n");
#endif
int i;
for (i=0; 1; i++) {
if (!b[i].name) break;
if (!strcmp(b[i].name, name)) {
if (bound) *bound = b[i].bound;
return b[i].vals;
}
}
/*
fs_error(LOG_ERR, "binding lookup on unknown variable '%s'", name);
*/
return NULL;
}
void fs_binding_clear_used_all(fs_binding *b)
{
#ifdef DEBUG_BINDING
printf("@@ clear_used_all()\n");
#endif
for (int i=0; 1; i++) {
if (!b[i].name) break;
b[i].used = 0;
}
}
void fs_binding_set_used(fs_binding *b, rasqal_variable *var)
{
#ifdef DEBUG_BINDING
if (!strcmp(DEBUG_BINDING, name)) printf("@@ set_used("DEBUG_BINDING")\n");
#endif
fs_binding *vb = fs_binding_get(b, var);
if (vb) {
vb->used = 1;
} else {
fs_error(LOG_ERR, "tried to set 'used' on unknown varaible %s", var->name);
}
}
void fs_binding_copy_row_unused(fs_binding *from, int row, int count, fs_binding *to)
{
for (int i=0; 1; i++) {
if (!from[i].name) break;
if (from[i].used) {
continue;
}
fs_rid val;
if (row < from[i].vals->length) {
val = from[i].vals->data[row];
} else {
val = FS_RID_NULL;
}
for (int j=0; j<count; j++) {
fs_rid_vector_append(to[i].vals, val);
}
}
}
void fs_binding_print(fs_binding *b, FILE *out)
{
int length = fs_binding_length(b);
fprintf(out, " ");
if (b[0].vals->length) {
fprintf(out, " ");
}
for (int c=1; b[c].name; c++) {
if (b[c].bound) {
fprintf(out, " %16.16s", b[c].name);
} else {
fprintf(out, " %12.12s", b[c].name);
}
}
fprintf(out, "\n");
fprintf(out, " row");
if (b[0].vals->length) {
fprintf(out, " order");
}
for (int c=1; b[c].name; c++) {
if (b[c].bound) {
fprintf(out, " %c%c%c%c A%02d D%02d",
b[c].proj ? 'p' : '-', b[c].used ? 'u' : '-',
b[c].need_val ? 'n' : '-', b[c].bound ? 'b' : '-',
b[c].appears, b[c].depends);
} else {
fprintf(out, " %c%c%c A%02d D%02d",
b[c].proj ? 'p' : '-', b[c].used ? 'u' : '-',
b[c].need_val ? 'n' : '-',
b[c].appears, b[c].depends);
}
}
fprintf(out, "\n");
for (long int lr=0; lr<length; lr++) {
long int r = lr;
if (b[0].vals->length) {
r = b[0].vals->data[lr];
}
fprintf(out, "%4ld", lr);
if (b[0].vals->length) {
fprintf(out, " %5ld", r);
}
for (int c=1; b[c].name; c++) {
if (b[c].bound) {
if (r < b[c].vals->length && b[c].vals->data[r] == FS_RID_NULL) {
fprintf(out, " %16s", "null");
} else {
fprintf(out, " %016llx", r < b[c].vals->length ? b[c].vals->data[r] : -1);
}
} else {
fprintf(out, "%13s", "null");
}
}
fprintf(out, "\n");
#if !defined(DEBUG_MERGE) || DEBUG_MERGE < 3
if (length > 25 && lr > DEBUG_CUTOFF && (length - lr) > 2) {
fprintf(out, " ...\n");
lr = length - 3;
}
#endif
}
}
/* q should be set when joining */
static int binding_row_compare(fs_query *q, fs_binding *b1, fs_binding *b2, int p1, int p2, int length1, int length2)
{
if (p1 >= length1 && p2 >= length2) {
return 0;
}
if (p1 >= length1) {
#ifdef DEBUG_COMPARE
printf("CMP from past end\n");
#endif
return 1;
} else if (p2 >= length2) {
#ifdef DEBUG_COMPARE
printf("CMP to past end\n");
#endif
return -1;
}
for (int i=1; b1[i].name; i++) {
if (!b1[i].sort) continue;
const fs_rid b1v = table_value(b1, i, p1);
const fs_rid b2v = table_value(b2, i, p2);
if (b1v == FS_RID_NULL) {
if (b2v == FS_RID_NULL) {
/* both bindings are null, assume equality */
continue;
}
/* b1v is null, b2v is not, assume null < b2v */
return -2;
}
if (b2v == FS_RID_NULL) {
/* b2v is null, b1v is not, assume b1v > null */
return 2;
}
if (b1v > b2v) {
#ifdef DEBUG_COMPARE
printf("CMP %llx > %llx\n", b1v, b2v);
#endif
return 1;
}
if (b1v < b2v) {
#ifdef DEBUG_COMPARE
printf("CMP %llx < %llx\n", b1v, b2v);
#endif
return -1;
}
}
return 0;
}
static int qsort_r_cmp(const void *a, const void *b, void *ctxt)
{
struct sort_context *c = ctxt;
const long rowa = *(fs_rid *)a;
const long rowb = *(fs_rid *)b;
for (int i=1; c->b[i].name; i++) {
if (!c->b[i].sort) continue;
const fs_rid vala = rowa >= c->b[i].vals->length ?
FS_RID_NULL : c->b[i].vals->data[rowa];
const fs_rid valb = rowb >= c->b[i].vals->length ?
FS_RID_NULL : c->b[i].vals->data[rowb];
if (vala > valb) {
return 1;
}
if (vala < valb) {
return -1;
}
}
return 0;
}
/* inplace quicksort on an array of rid_vectors */
void fs_binding_sort(fs_binding *b)
{
int scount = 0;
int length = fs_binding_length(b);
for (int i=0; b[i].name; i++) {
if (b[i].sort) scount++;
if (b[i].vals->length < length) {
for (int j=b[i].vals->length; j<length; j++) {
fs_rid_vector_append(b[i].vals, FS_RID_NULL);
}
}
}
if (!scount) {
fs_error(LOG_WARNING, "fs_binding_sort() called with no sort "
"columns set, ignoring");
return;
}
/* fill out the _ord column with integers in [0,n] */
b[0].vals->length = 0;
for (int row=0; row<length; row++) {
fs_rid_vector_append(b[0].vals, row);
}
if (length > 1) {
#ifdef DEBUG_MERGE
double then = fs_time();
#endif
/* ctxt could include other stuff for optimisations */
struct sort_context ctxt = { b };
fs_qsort_r(b[0].vals->data, length, sizeof(fs_rid), qsort_r_cmp, &ctxt);
#ifdef DEBUG_MERGE
double now = fs_time();
printf("sort took %f seconds\n", now - then);
#endif
}
}
void fs_binding_uniq(fs_binding *bi)
{
if (fs_binding_length(bi) < 2) {
/* we don't need to do anything, code below assumes >= 1 row */
return;
}
fs_binding *b = fs_binding_copy_and_clear(bi);
bi[0].vals->length = 0;
#ifdef DEBUG_MERGE
double then = fs_time();
#endif
int length = fs_binding_length(b);
int outrow = 1;
for (int column = 1; b[column].name; column++) {
fs_rid_vector_append(bi[column].vals, table_value(b, column, 0));
bi[column].bound = b[column].bound;
b[column].sort = b[column].bound;
}
for (int row = 1; row < length; row++) {
if (binding_row_compare(NULL, b, b, row, row-1, length, length) == 0) {
continue;
}
for (int column = 1; b[column].name; column++) {
fs_rid_vector_append(bi[column].vals, table_value(b, column, row));
}
outrow++;
}
#ifdef DEBUG_MERGE
double now = fs_time();
printf("uniq took %fs (%d->%d rows)\n", now-then, length, outrow);
fs_binding_print(bi, stdout);
#endif
fs_binding_free(b);
}
/* truncate a binding to length entries long */
void fs_binding_truncate(fs_binding *b, int length)
{
for (int i=0; b[i].name; i++) {
fs_rid_vector_truncate(b[i].vals, length);
}
}
/* UNION b onto a, returns a with b appended */
void fs_binding_union(fs_query *q, fs_binding *a, fs_binding *b)
{
const int alen = fs_binding_length(a);
const int blen = fs_binding_length(b);
a[0].vals->length = 0;
for (int c=1; a[c].name && b[c].name; c++) {
if (!a[c].bound && b[c].bound) {
a[c].bound = 1;
while (a[c].vals->length < alen) {
fs_rid_vector_append(a[c].vals, FS_RID_NULL);
}
} else if (a[c].bound && !b[c].bound) {
b[c].bound = 1;
while (b[c].vals->length < blen) {
fs_rid_vector_append(b[c].vals, FS_RID_NULL);
}
}
fs_rid_vector_append_vector(a[c].vals, b[c].vals);
}
}
/* return to = from [X] to, this is used to perform joins inside blocks, it
* saves allocations by doing most operations inplace, unlike fs_binding_join */
void fs_binding_merge(fs_query *q, int block, fs_binding *from, fs_binding *to)
{
fs_binding *inter_f = NULL; /* the intersecting column */
fs_binding *inter_t = NULL; /* the intersecting column */
for (int i=0; from[i].name; i++) {
from[i].sort = 0;
to[i].sort = 0;
}
int used = 0;
for (int i=1; from[i].name; i++) {
if (!from[i].bound || !to[i].bound) continue;
if (from[i].used) used++;
if (from[i].bound && to[i].bound) {
inter_f = from+i;
inter_t = to+i;
from[i].sort = 1;
to[i].sort = 1;
#ifdef DEBUG_MERGE
printf("@@ join on %s\n", to[i].name);
#endif
}
}
/* from and to bound variables do not intersect, we can just dump results,
under some circustances we need to do a combinatorial explosion */
if (!inter_f && (fs_binding_length(from) == 0)) {
const int length_f = fs_binding_length(from);
const int length_t = fs_binding_length(to);
for (int i=1; from[i].name; i++) {
if (to[i].bound && !from[i].bound) {
if (from[i].vals) {
fs_rid_vector_free(from[i].vals);
}
from[i].vals = fs_rid_vector_new(length_f);
for (int d=0; d<length_f; d++) {
from[i].vals->data[d] = FS_RID_NULL;
}
from[i].bound = 1;
}
if (!from[i].bound) continue;
if (!to[i].bound) {
if (to[i].vals) {
fs_rid_vector_free(to[i].vals);
}
to[i].vals = fs_rid_vector_new(length_t);
for (int d=0; d<length_t; d++) {
to[i].vals->data[d] = FS_RID_NULL;
}
}
fs_rid_vector_append_vector(to[i].vals, from[i].vals);
to[i].bound = 1;
}
#ifdef DEBUG_MERGE
printf("append all, result:\n");
fs_binding_print(to, stdout);
#endif
return;
}
/* If were running in restricted mode, truncate the binding tables */
if (q->flags & FS_QUERY_RESTRICTED) {
fs_binding_truncate(from, q->soft_limit);
fs_binding_truncate(to, q->soft_limit);
}
int length_t = fs_binding_length(to);
int length_f = fs_binding_length(from);
/* ms8: this list keeps track of the vars to replace */
GList *rep_list = NULL;
for (int i=1; to[i].name; i++) {
if (to+i == inter_t || to[i].used || to[i].bound) {
/* do nothing */
#if DEBUG_MERGE > 1
printf("@@ preserve %s\n", to[i].name);
#endif
} else if (from[i].bound && !to[i].bound) {
#if DEBUG_MERGE > 1
printf("@@ replace %s\n", from[i].name);
#endif
to[i].bound = 1;
if (to[i].vals) {
if (to[i].vals->length != length_t) {
fs_rid_vector_free(to[i].vals);
to[i].vals = fs_rid_vector_new(length_t);
}
} else {
to[i].vals = fs_rid_vector_new(length_t);
}
for (int d=0; d<length_t; d++) {
to[i].vals->data[d] = FS_RID_NULL;
}
rep_list = g_list_append(rep_list, GINT_TO_POINTER(i));
}
}
/* sort the two sets of bindings so they can be merged linearly */
if (inter_f) {
fs_binding_sort(from);
fs_binding_sort(to);
} else {
/* make sure the tables are not marked sorted */
from[0].vals->length = 0;
to[0].vals->length = 0;
}
#ifdef DEBUG_MERGE
printf("old: %d bindings\n", fs_binding_length(from));
fs_binding_print(from, stdout);
printf("new: %d bindings\n", fs_binding_length(to));
fs_binding_print(to, stdout);
#endif
int fpos = 0;
int tpos = 0;
while (fpos < length_f || tpos < length_t) {
if (q->flags & FS_QUERY_RESTRICTED &&
fs_binding_length(to) >= q->soft_limit) {
char *msg = g_strdup("some results have been dropped to prevent overunning time allocation");
q->warnings = g_slist_prepend(q->warnings, msg);
break;
}
int cmp;
cmp = binding_row_compare(q, from, to, fpos, tpos, length_f, length_t);
if (cmp == 0) {
/* both rows match */
int fp, tp = tpos;
for (fp = fpos; binding_row_compare(q, from, to, fp, tpos, length_f, length_t) == 0; fp++) {
#if DEBUG_MERGE > 1
if (fp == DEBUG_CUTOFF) {
printf("...\n");
}
#endif
for (tp = tpos; 1; tp++) {
if (binding_row_compare(q, from, to, fp, tp, length_f, length_t) == 0) {
#if DEBUG_MERGE > 1
if (fp < DEBUG_CUTOFF) {
printf("STEP %d, %d ", fp-fpos, tp-tpos);
}
#endif
if (fp == fpos) {
#if DEBUG_MERGE > 1
if (fp < DEBUG_CUTOFF) {
if (inter_f) {
printf("REPL %llx\n", inter_f->vals->data[fp]);
} else {
printf("REPL ???\n");
}
}
#endif
for (int c=1; to[c].name; c++) {
if (!from[c].bound && !to[c].bound) continue;
if (from[c].bound && table_value(from, c, fp) == FS_RID_NULL) {
continue;
}
if (from[c].bound && fp < from[c].vals->length) {
long wrow = to[0].vals->length ? to[0].vals->data[tp] : tp;
to[c].vals->data[wrow] = table_value(from, c, fp);
if (to[c].vals->length <= tp) {
to[c].vals->length = tp+1;
}
}
}
} else {
#if DEBUG_MERGE > 1
if (fp < DEBUG_CUTOFF) {
printf("ADD\n");
}
#endif
for (int c=1; to[c].name; c++) {
if (!from[c].bound && !to[c].bound) continue;
if (from[c].bound && fp < from[c].vals->length) {
fs_rid_vector_append(to[c].vals, table_value(from, c, fp));
} else {
fs_rid_vector_append(to[c].vals, table_value(to, c, tp));
}
}
}
} else {
break;
}
}
}
tpos = tp;
fpos = fp;
} else if (cmp <= -1) {
fpos++;
} else if (cmp >= 1) {
tpos++;
} else {
fs_error(LOG_CRIT, "unknown compare state %d in binding", cmp);
}
}
/* clear the _ord columns */
from[0].vals->length = 0;
to[0].vals->length = 0;
/* ms8: INIT code to clean up rows that where not replaced */
if (rep_list) {
unsigned char *to_del = fs_new_bit_array(length_t);
int to_del_count = 0;
while(rep_list) {
int col_r = GPOINTER_TO_INT(rep_list->data);
rep_list = g_list_next(rep_list);
for (int d=0; d<length_t; d++) {
if (to[col_r].vals->data[d] == FS_RID_NULL) {
fs_bit_array_set(to_del, d, 0);
to_del_count++;
}
}
}
g_list_free(rep_list);
if (to_del_count) {
int vars = 0;
for (int i=1; to[i].name; i++)
vars++;
fs_rid_vector **clean = calloc(vars, sizeof(fs_rid_vector *));
for (int i=0;i<vars;i++)
clean[i] = fs_rid_vector_new(0);
for (int d = 0;d<length_t;d++) {
if (fs_bit_array_get(to_del,d)) {
for (int i=0;i<vars;i++) {
fs_rid_vector_append(clean[i],to[i+1].vals->data[d]);
}
}
}
for (int i=1;i<=vars;i++) {
free(to[i].vals->data);
to[i].vals->data = clean[i-1]->data;
to[i].vals->length = clean[i-1]->length;
to[i].vals->size = clean[i-1]->size;
free(clean[i-1]);
}
free(clean);
}
fs_bit_array_destroy(to_del);
}
/* ms8: END code to clean up rows that where not replaced */
#ifdef DEBUG_MERGE
printf("result: %d bindings\n", fs_binding_length(to));
fs_binding_print(to, stdout);
#endif
}
/* return a [X] b, or a =X] b, depending on value of join */
fs_binding *fs_binding_join(fs_query *q, fs_binding *a, fs_binding *b, fs_join_type join)
{
if (a == NULL) {
return fs_binding_copy(b);
}
if (b == NULL) {
return fs_binding_copy(a);
}
fs_binding *c = fs_binding_copy(a);
int inter = 0; /* do the tables intersect */
for (int i=0; a[i].name; i++) {
a[i].sort = 0;
b[i].sort = 0;
c[i].sort = 0;
c[i].vals->length = 0;
}
int bound_a = 0;
int bound_b = 0;
for (int i=1; a[i].name; i++) {
if (a[i].bound) bound_a++;
if (b[i].bound) bound_b++;
if (a[i].bound || b[i].bound) {
c[i].bound = 1;
}
if (a[i].bound && b[i].bound) {
inter = 1;
a[i].sort = 1;
b[i].sort = 1;
#ifdef DEBUG_MERGE
printf("joining on %s\n", a[i].name);
#endif
}
}
/* a and b bound variables do not intersect, we can just dump results */
if (!inter) {
int length_a = fs_binding_length(a);
int length_b = fs_binding_length(b);
for (int i=1; a[i].name; i++) {
if (!a[i].bound) {
for (int j=0; j<length_a; j++) {
fs_rid_vector_append(c[i].vals, FS_RID_NULL);
}
} else {
fs_rid_vector_append_vector(c[i].vals, a[i].vals);
}
if (!b[i].bound) {
for (int j=0; j<length_b; j++) {
fs_rid_vector_append(c[i].vals, FS_RID_NULL);
}
} else {
fs_rid_vector_append_vector(c[i].vals, b[i].vals);
}
}
#ifdef DEBUG_MERGE
printf("append all, result:\n");
fs_binding_print(c, stdout);
#endif
return c;
}
int length_a = fs_binding_length(a);
int length_b = fs_binding_length(b);
/* sort the two sets of bindings so they can be merged linearly */
fs_binding_sort(a);
fs_binding_sort(b);
#ifdef DEBUG_MERGE
printf("a: %d bindings\n", fs_binding_length(a));
fs_binding_print(a, stdout);
printf("b: %d bindings\n", fs_binding_length(b));
fs_binding_print(b, stdout);
#endif
/* If were running in restricted mode, truncate the binding tables */
if (q->flags & FS_QUERY_RESTRICTED) {
int restricted = 0;