forked from SWI-Prolog/swipl
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpl-dict.c
1819 lines (1447 loc) · 39.3 KB
/
pl-dict.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
/* Part of SWI-Prolog
Author: Jan Wielemaker
E-mail: [email protected]
WWW: http://www.swi-prolog.org
Copyright (c) 2013-2022, VU University Amsterdam
SWI-Prolog Solutions b.v.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
*/
#include "pl-incl.h"
#include "pl-comp.h"
#include "pl-dict.h"
#include "pl-rsort.h"
#include "pl-funct.h"
#include "pl-prims.h"
#include "pl-wam.h"
#include "pl-fli.h"
#include "pl-gc.h"
#include "pl-gvar.h"
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Dicts are associative arrays, where keys are either atoms or small
integers. Dicts should be considered an abstract data type. They are
currently represented as compound terms using the functor `dict`/Arity.
The term has the following layout on the global stack:
------------
| `dict`/A |
------------
| tag |
------------
| value1 |
------------
| key1 |
------------
| value2 |
------------
| key2 |
...
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
static int PL_get_dict_ex(term_t data, term_t tag, term_t dict, int flags);
#define DICT_GET_ALL 0xff
#define DICT_GET_PAIRS 0x01
#define DICT_GET_EQUALS 0x02
#define DICT_GET_COLON 0x04
#define DICT_GET_TERM 0x08
functor_t
dict_functor(int pairs)
{ if ( pairs < CACHED_DICT_FUNCTORS )
{ if ( GD->dict.dict_functors[pairs] )
return GD->dict.dict_functors[pairs];
GD->dict.dict_functors[pairs] = lookupFunctorDef(ATOM_dict, pairs*2+1);
return GD->dict.dict_functors[pairs];
} else
{ return lookupFunctorDef(ATOM_dict, pairs*2+1);
}
}
/*******************************
* LOW-LEVEL FUNCTIONS *
*******************************/
#define get_dict_ex(t, dp, ex) LDFUNC(get_dict_ex, t, dp, ex)
static int
get_dict_ex(DECL_LD term_t t, Word dp, int ex)
{ Word p = valTermRef(t);
deRef(p);
if ( isTerm(*p) )
{ Functor f = valueTerm(*p);
FunctorDef fd = valueFunctor(f->definition);
if ( fd->name == ATOM_dict &&
fd->arity%2 == 1 ) /* does *not* validate ordering */
{ *dp = *p;
return TRUE;
}
}
if ( !ex )
return FALSE;
PL_type_error("dict", t);
return FALSE;
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
get_create_dict_ex(DECL_LD +t, -dict) extracts a dict from t or raises a
type error. The term reference dict contains a plain dict term handle
and is never a reference.
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
#define get_create_dict_ex(t, dt) LDFUNC(get_create_dict_ex, t, dt)
static int
get_create_dict_ex(DECL_LD term_t t, term_t dt)
{ Word p = valTermRef(t);
deRef(p);
if ( isTerm(*p) )
{ Functor f = valueTerm(*p);
FunctorDef fd = valueFunctor(f->definition);
if ( fd->name == ATOM_dict &&
fd->arity%2 == 1 ) /* does *not* validate ordering */
{ *valTermRef(dt) = *p;
return TRUE;
}
}
if ( PL_get_dict_ex(t, 0, dt, DICT_GET_ALL) )
{ assert(isTerm(*valTermRef(dt)));
return TRUE;
}
return PL_type_error("dict", t);
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
dict_lookup_ptr() returns a pointer to the value for a given key
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
Word
dict_lookup_ptr(DECL_LD word dict, word name)
{ Functor data = valueTerm(dict);
int arity = arityFunctor(data->definition);
int l = 1, h = arity/2;
if ( arity == 1 )
return NULL; /* empty */
assert(arity%2 == 1);
for(;;)
{ int m = (l+h)/2;
Word p;
deRef2(&data->arguments[m*2], p);
if ( *p == name )
return p-1;
if ( l == h )
return NULL;
if ( *p < name )
l=m+1;
else if ( m == l )
h=m;
else
h=m-1;
}
}
/* True if the keys are proper keys and ordered. Return values:
TRUE: correctly ordered dict
FALSE: not ordered
-1: not a key
-2: duplicate key
*/
#define dict_ordered(data, count, dupl) LDFUNC(dict_ordered, data, count, dupl)
static int
dict_ordered(DECL_LD Word data, int count, Word dupl)
{ int ordered = TRUE;
Word n1, n2;
if ( count > 0 )
{ data++; /* skip to key */
deRef2(data, n1);
if ( !is_dict_key(*n1) )
return -1;
for(; count > 1; count--, data += 2, n1=n2)
{ deRef2(data+2, n2);
if ( !is_dict_key(*n2) )
return -1;
if ( *n1 < *n2 )
continue;
if ( *n1 > *n2 )
ordered = FALSE;
if ( *n1 == *n2 )
{ if ( dupl )
{ *dupl = *n1;
} else
{ term_t t = PL_new_term_ref();
*valTermRef(t) = linkValI(n1);
PL_error(NULL, 0, NULL, ERR_DUPLICATE_KEY, t);
}
return -2;
}
}
}
return ordered;
}
static int
compare_dict_entry(const void *a, const void *b, void *arg)
{ Word p = (Word)a+1;
Word q = (Word)b+1;
WITH_LD(arg)
{ deRef(p);
deRef(q);
}
return (*p<*q ? -1 : *p>*q ? 1 : 0);
}
int
dict_order(DECL_LD Word dict, Word dupl)
{ Functor data = (Functor)dict;
int arity = arityFunctor(data->definition);
assert(arity%2 == 1);
sort_r(data->arguments+1, arity/2, sizeof(word)*2,
compare_dict_entry, LD);
return dict_ordered(data->arguments+1, arity/2, dupl);
}
/* dict_order_term_refs() orders an array of indexes into a key/value array
of term references. Returns 0 if there are no duplicates and else the
index of the first duplicate.
*/
typedef struct order_term_refs
{ PL_local_data_t *ld;
term_t *av;
} order_term_refs;
#define compare_term_refs(ip1, ip2, ctx) LDFUNC(compare_term_refs, ip1, ip2, ctx)
static inline int compare_term_refs(DECL_LD const int *ip1, const int *ip2, order_term_refs *ctx);
static int
(compare_term_refs)(const void *a, const void *b, void *arg)
{ return compare_term_refs(PASS_AS_LD(((order_term_refs*)arg)->ld) a, b, arg);
}
static inline int
compare_term_refs(DECL_LD const int *ip1, const int *ip2, order_term_refs *ctx)
{ Word p = valTermRef(ctx->av[*ip1*2]);
Word q = valTermRef(ctx->av[*ip2*2]);
assert(!isRef(*p));
assert(!isRef(*q));
return (*p<*q ? -1 : *p>*q ? 1 : 0);
}
int
dict_order_term_refs(DECL_LD term_t *av, int *indexes, int count)
{ order_term_refs ctx;
ctx.ld = LD;
ctx.av = av;
sort_r(indexes, count, sizeof(int), compare_term_refs, &ctx);
if ( count > 1 )
{ word k = *valTermRef(av[indexes[0]*2]);
int i;
for(i=1; i<count; i++)
{ word k2 = *valTermRef(av[indexes[i]*2]);
if ( k == k2 )
return i;
k = k2;
}
}
return 0;
}
#define assign_in_dict(dp, val) LDFUNC(assign_in_dict, dp, val)
static int
assign_in_dict(DECL_LD Word dp, Word val)
{ deRef(val);
if ( !canBind(*val) )
{ *dp = *val;
} else if ( isAttVar(*val) )
{ *dp = makeRefG(val);
} else
{ if ( dp < val )
{ if ( unlikely(tTop+1 >= tMax) )
return TRAIL_OVERFLOW;
setVar(*dp);
Trail(val, makeRefG(dp));
} else
{ *dp = makeRefG(val);
}
}
return TRUE;
}
#define put_dict(dict, size, nv, new_dict) LDFUNC(put_dict, dict, size, nv, new_dict)
static int
put_dict(DECL_LD word dict, int size, Word nv, word *new_dict)
{ Functor data = valueTerm(dict);
int arity = arityFunctor(data->definition);
Word new, out, in, in_end, nv_end;
int modified = FALSE;
assert(arity%2 == 1);
if ( size == 0 )
{ *new_dict = dict;
return TRUE;
}
if ( gTop+1+arity+2*size > gMax )
return GLOBAL_OVERFLOW;
new = gTop;
out = new+2; /* functor, tag */
in = data->arguments+1;
in_end = in+arity-1;
nv_end = nv+size*2;
while(in < in_end && nv < nv_end)
{ Word i_name, n_name;
int rc;
deRef2(in+1, i_name);
deRef2(nv+1, n_name);
if ( *i_name == *n_name )
{ if ( (rc=assign_in_dict(out++, nv)) != TRUE )
return rc;
*out++ = *i_name;
if ( !modified && compareStandard(nv, in, TRUE) )
modified = TRUE;
in += 2;
nv += 2;
} else if ( *i_name < *n_name )
{ *out++ = linkValI(in);
*out++ = *i_name;
in += 2;
} else
{ if ( (rc=assign_in_dict(out++, nv)) != TRUE )
return rc;
*out++ = *n_name;
nv += 2;
modified = TRUE;
}
}
if ( nv == nv_end )
{ if ( !modified )
{ *new_dict = dict;
return TRUE;
}
while(in < in_end)
{ Word i_name;
deRef2(in+1, i_name);
*out++ = linkValI(in);
*out++ = *i_name;
in += 2;
}
} else
{ while(nv < nv_end)
{ Word n_name;
int rc;
deRef2(nv+1, n_name);
if ( (rc=assign_in_dict(out++, nv)) != TRUE )
return rc;
*out++ = *n_name;
nv += 2;
}
}
gTop = out;
new[1] = linkValI(&data->arguments[0]);
new[0] = dict_functor((out-(new+1))/2);
*new_dict = consPtr(new, TAG_COMPOUND|STG_GLOBAL);
return TRUE;
}
#define del_dict(dict, key, new_dict) LDFUNC(del_dict, dict, key, new_dict)
static int
del_dict(DECL_LD word dict, word key, word *new_dict)
{ Functor data = valueTerm(dict);
int arity = arityFunctor(data->definition);
Word new, out, in, in_end;
assert(arity%2 == 1);
if ( gTop+1+arity-2 > gMax )
return GLOBAL_OVERFLOW;
new = gTop;
out = new+2; /* functor, tag */
in = data->arguments+1;
in_end = in+arity-1;
while(in < in_end)
{ Word i_name;
deRef2(in+1, i_name);
if ( *i_name != key )
{ *out++ = linkValI(in);
*out++ = *i_name;
}
in += 2;
}
gTop = out;
new[1] = linkValI(&data->arguments[0]); /* tag */
new[0] = dict_functor((out-(new+1))/2); /* arity */
*new_dict = consPtr(new, TAG_COMPOUND|STG_GLOBAL);
return TRUE;
}
/* partial_unify_dict(dict1, dict2) unifies all common elements of two
dicts. It returns TRUE on success, FALSE on a failed unification
and *_OVERFLOW on some memory overflow
*/
#define partial_unify_dict(dict1, dict2) LDFUNC(partial_unify_dict, dict1, dict2)
static int
partial_unify_dict(DECL_LD word dict1, word dict2)
{ Functor d1 = valueTerm(dict1);
Functor d2 = valueTerm(dict2);
Word in1 = d1->arguments;
Word in2 = d2->arguments;
Word end1 = in1+arityFunctor(d1->definition);
Word end2 = in2+arityFunctor(d2->definition);
int rc;
/* unify the tages */
if ( (rc=unify_ptrs(in1, in2, ALLOW_RETCODE)) != TRUE )
return rc;
/* advance to first v+k entry */
in1++;
in2++;
while(in1 < end1 && in2 < end2)
{ Word n1, n2;
deRef2(in1+1, n1);
deRef2(in2+1, n2);
if ( *n1 == *n2 )
{ if ( (rc = unify_ptrs(in1, in2, ALLOW_RETCODE)) != TRUE )
return rc;
in1 += 2;
in2 += 2;
} else if ( *n1 < *n2 )
{ in1 += 2;
} else
{ in2 += 2;
}
}
return TRUE;
}
/* select_dict() demands del to be a sub-dict of from and assigns
all remaining values in new.
Note that unify_ptrs() can push data onto the global stack in
case it encounters attributed variables. Therefore we need a
two pass process.
*/
#define unify_left_dict(del, from) \
LDFUNC(unify_left_dict, del, from)
static int
unify_left_dict(DECL_LD word del, word from)
{ Functor dd = valueTerm(del);
Functor fd = valueTerm(from);
Word din = dd->arguments;
Word fin = fd->arguments;
Word dend = din+arityFunctor(dd->definition);
Word fend = fin+arityFunctor(fd->definition);
int rc;
/* unify the tags */
if ( (rc=unify_ptrs(din, fin, ALLOW_RETCODE)) != TRUE )
return rc;
/* advance to first v+k entry */
din++;
fin++;
while(din < dend && fin < fend)
{ Word d, f;
deRef2(din+1, d);
deRef2(fin+1, f);
if ( *d == *f ) /* same keys */
{ if ( (rc = unify_ptrs(din, fin, ALLOW_RETCODE)) != TRUE )
return rc;
din += 2;
fin += 2;
} else if ( *d < *f )
{ return FALSE;
} else
{ fin += 2;
}
}
return din == dend;
}
#define select_dict(del, from, new_dict) \
LDFUNC(select_dict, del, from, new_dict)
static int
select_dict(DECL_LD word del, word from, word *new_dict)
{ Functor dd = valueTerm(del);
Functor fd = valueTerm(from);
Word din = dd->arguments;
Word fin = fd->arguments;
Word dend = din+arityFunctor(dd->definition);
Word fend = fin+arityFunctor(fd->definition);
int buf[256];
bit_vector *keep = NULL;
int rc;
/* unify the tags */
if ( (rc=unify_ptrs(din, fin, ALLOW_RETCODE)) != TRUE )
return rc;
/* advance to first v+k entry */
din++;
fin++;
for(size_t i=0; din < dend && fin < fend; i++, fin += 2)
{ Word d, f;
deRef2(din+1, d);
deRef2(fin+1, f);
if ( *d == *f ) /* same keys */
{ if ( (rc = unify_ptrs(din, fin, ALLOW_RETCODE)) != TRUE )
return rc;
din += 2;
} else if ( *d < *f )
{ return FALSE;
} else
{ if ( !keep )
{ size_t entries = arityFunctor(fd->definition)/2;
size_t sz = sizeof_bitvector(entries);
if ( sz <= sizeof(buf) )
keep = (bit_vector*)buf;
else if ( !(keep = malloc(sz)) )
return MEMORY_OVERFLOW;
init_bitvector(keep, entries);
}
set_bit(keep, i);
}
}
if ( din == dend ) /* unification succeeded */
{ size_t nsize = (keep ? popcount_bitvector(keep) : 0) + (fend-fin)/2;
if ( gTop+nsize*2+2 <= gMax )
{ Word out = gTop;
*new_dict = consPtr(out, TAG_COMPOUND|STG_GLOBAL);
*out++ = dict_functor(nsize);
setVar(*out++);
Word fe = fin;
fin = fd->arguments+1;
for(size_t i=0; fin < fend; i++, fin += 2)
{ if ( fin >= fe || (keep && true_bit(keep, i)) )
{ Word f;
deRef2(fin+1, f);
*out++ = linkValI(fin);
*out++ = *f;
}
}
gTop = out;
rc = TRUE;
} else
{ rc = GLOBAL_OVERFLOW;
}
} else
{ rc = FALSE;
}
if ( keep && keep != (bit_vector*)buf )
free(keep);
return rc;
}
#define get_name_ex(t, np) LDFUNC(get_name_ex, t, np)
static int
get_name_ex(DECL_LD term_t t, Word np)
{ Word p = valTermRef(t);
deRef(p);
if ( is_dict_key(*p) )
{ *np = *p;
return TRUE;
}
PL_type_error("dict-key", t);
return FALSE;
}
#define get_name_value(p, name, value, m, flags) LDFUNC(get_name_value, p, name, value, m, flags)
static int
get_name_value(DECL_LD Word p, Word name, Word value, mark *m, int flags)
{ const char *type;
deRef(p);
if ( isTerm(*p) )
{ Functor f = valueTerm(*p);
if ( (f->definition == FUNCTOR_minus2 && (flags&DICT_GET_PAIRS)) ||
(f->definition == FUNCTOR_equals2 && (flags&DICT_GET_EQUALS)) ||
(f->definition == FUNCTOR_colon2 && (flags&DICT_GET_COLON)))
{ Word np, vp;
deRef2(&f->arguments[0], np);
if ( is_dict_key(*np) )
{ *name = *np;
deRef2(&f->arguments[1], vp);
*value = linkValI(vp);
return TRUE;
} else
{ Undo(*m);
PL_type_error("dict-key", pushWordAsTermRef(np));
popTermRef();
return FALSE;
}
} else if ( arityFunctor(f->definition) == 1 &&
(flags&DICT_GET_TERM) ) /* Name(Value) */
{ Word vp;
*name = nameFunctor(f->definition);
deRef2(&f->arguments[0], vp);
*value = linkValI(vp);
return TRUE;
}
}
if ( flags == DICT_GET_PAIRS )
type = "pair";
else
type = "key-value";
Undo(*m);
PL_type_error(type, pushWordAsTermRef(p));
popTermRef();
return FALSE; /* type error */
}
/*******************************
* FOREIGN SUPPORT *
*******************************/
int
PL_is_dict(term_t t)
{ GET_LD
Word p = valTermRef(t);
deRef(p);
if ( isTerm(*p) )
{ Functor f = valueTerm(*p);
FunctorDef fd = valueFunctor(f->definition);
word dupl;
if ( fd->name == ATOM_dict &&
fd->arity%2 == 1 &&
dict_ordered(f->arguments+1, fd->arity/2, &dupl) == TRUE )
return TRUE;
}
return FALSE;
}
static int
PL_get_dict_ex(term_t data, term_t tag, term_t dict, int flags)
{ GET_LD
word dupl;
if ( PL_is_dict(data) )
{ PL_put_term(dict, data);
return TRUE;
}
if ( PL_is_list(data) )
{ intptr_t len = lengthList(data, TRUE);
Word ap, dp, tail;
mark m;
int rc;
if ( len < 0 )
return FALSE; /* not a proper list */
if ( unlikely(tTop+1 >= tMax) )
{ if ( !makeMoreStackSpace(TRAIL_OVERFLOW, ALLOW_GC|ALLOW_SHIFT) )
return FALSE;
}
if ( (rc=ensureGlobalSpace(len*2+2, ALLOW_GC)) != TRUE )
return raiseStackOverflow(rc);
ap = gTop;
Mark(m);
dp = ap;
*ap++ = dict_functor(len);
if ( tag )
{ Word cp = valTermRef(tag);
deRef(cp);
if ( needsRef(*cp) )
{ if ( isVar(*cp) )
{ setVar(*ap);
Trail(cp, makeRefG(ap));
} else
{ assert(onStack(global, cp));
*ap = makeRefG(cp);
}
} else
{ *ap = *cp;
}
} else
{ setVar(*ap);
}
ap++;
tail = valTermRef(data);
deRef(tail);
while( isList(*tail) )
{ Word head = HeadList(tail);
if ( !get_name_value(head, ap+1, ap, &m, flags) )
return FALSE;
ap += 2;
tail = TailList(tail);
deRef(tail);
}
if ( (rc=dict_order(dp, &dupl)) == TRUE )
{ gTop = ap;
*valTermRef(dict) = consPtr(dp, TAG_COMPOUND|STG_GLOBAL);
DEBUG(CHK_SECURE, checkStacks(NULL));
return TRUE;
} else
{ term_t ex;
assert(rc == -2);
Undo(m);
return ( (ex = PL_new_term_ref()) &&
_PL_unify_atomic(ex, dupl) &&
PL_error(NULL, 0, NULL, ERR_DUPLICATE_KEY, ex) );
}
} /* TBD: {name:value, ...} */
return PL_type_error("dict-data", data);
}
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
PL_for_dict() runs func on each key-value pair in dict. Returns
immediately with the return value of func if func returns non-zero. If
the flag PL_FOR_DICT_SORTED is given, the key-value pairs are called in
the standard order of terms.
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
typedef struct cmp_dict_index_data
{ Word data;
int *indexes;
PL_local_data_t *ld;
} cmp_dict_index_data;
#define cmp_dict_index(ip1, ip2, ctx) LDFUNC(cmp_dict_index, ip1, ip2, ctx)
static inline int cmp_dict_index(DECL_LD const int *ip1, const int *ip2, cmp_dict_index_data *ctx);
static int
(cmp_dict_index)(const void *a1, const void *a2, void *arg)
{ return cmp_dict_index(PASS_AS_LD(((cmp_dict_index_data*)arg)->ld) a1, a2, arg);
}
static inline int
cmp_dict_index(DECL_LD const int *ip1, const int *ip2, cmp_dict_index_data *ctx)
{ Word p = &ctx->data[*ip1*2+1];
Word q = &ctx->data[*ip2*2+1];
int rc;
deRef(p);
deRef(q);
if ( *p == *q )
{ rc = CMP_EQUAL;
} else
{ if ( isAtom(*p) )
{ if ( isAtom(*q) )
rc = compareAtoms(*p, *q);
else
rc = CMP_GREATER;
} else
{ if ( isTaggedInt(*p) )
rc = valInt(*p) > valInt(*q) ? CMP_GREATER : CMP_LESS;
else
rc = CMP_LESS;
}
}
return rc;
}
typedef struct dict_helper
{ int (*function)(term_t key, term_t value, void *closure);
void *closure;
} dict_helper;
#define public_for_dict_helper(k,v,l,c) \
LDFUNC(public_for_dict_helper, k,v,l,c)
static int
public_for_dict_helper(DECL_LD term_t key, term_t value, int last, void *closure)
{ struct dict_helper *h = closure;
return (*h->function)(key, value, h->closure);
}
int
PL_for_dict(term_t dict,
int (*func)(term_t key, term_t value, void *closure),
void *closure,
int flags)
{ GET_LD
struct dict_helper h = {.function = func, .closure = closure};
return _PL_for_dict(dict, public_for_dict_helper, &h, flags);
}
int
pl_for_dict(DECL_LD term_t dict,
int LDFUNCP (*func)(DECL_LD term_t key, term_t value, int last, void *closure),
void *closure,
int flags)
{ term_t av = PL_new_term_refs(2);
int i, arity, pairs;
Word p = valTermRef(dict);
int index_buf[256];
int *indexes = NULL;
int rc = 0;
deRef(p);
arity = arityTerm(*p);
pairs = arity/2;
if ( (flags&PL_FOR_DICT_SORTED) )
{ cmp_dict_index_data ctx;
if ( pairs < 256 )
indexes = index_buf;
else if ( !(indexes = malloc(pairs*sizeof(int))) )
return PL_no_memory();
for(i=0; i<pairs; i++)
indexes[i] = i;
ctx.ld = LD;
ctx.data = argTermP(*p,1);
ctx.indexes = indexes;
sort_r(indexes, pairs, sizeof(int), cmp_dict_index, &ctx);
}
for(i=0; i < pairs; )
{ Word p = valTermRef(dict);
int in;
if ( indexes )
{ in = indexes[i]*2+1;
} else
{ in = i*2+1;
}
deRef(p);
Functor f = valueTerm(*p);
*valTermRef(av+0) = linkValI(&f->arguments[in+1]);
*valTermRef(av+1) = linkValI(&f->arguments[in]);
if ( (rc=LDFUNCP(*func)(av+0, av+1, ++i == pairs, closure)) != 0 )
break;
}
if ( indexes && indexes != index_buf )
free(indexes);
return rc;
}
/*******************************
* RELOAD SUPPORT *
*******************************/
/* resortDictsInClause() resorts the contents of dicts in a clause
This predicate is called from pl-qlf.c after reloading a clause from a
.qlf file or state if pl-qlf.c detected a dict inside the clause. It
identifies the code ranges that constitute the k-v pairs in the dict and
re-orders them according to the new atom-handle ordering.
There is a complicating factor with B_FIRSTVAR/B_VAR,
B_ARGFIRSTVAR/B_ARGVAR and H_FIRSTVAR/H_VAR, that may get swapped after
reordering. This is corrected by fix_firstvars(). The current
implementation is quadratic in the number of variables in the dict.
*/
typedef struct kv_code
{ word key;
size_t start;
size_t len;
} kv_code;
#define KV_PREALOCATED 32
#define C_PREALLOCATED 256
static int
cmp_kv_pos(const void *p1, const void *p2)
{ const kv_code *k1 = p1;
const kv_code *k2 = p2;
return k1->key < k2->key ? -1 : k1->key == k2->key ? 0 : 1;
}
static void
fix_firstvars(Code start, Code end)
{ Code PC;
for( PC=start; PC < end; PC = stepPC(PC) )
{ code op = fetchop(PC);
code first;
code var;
switch(op)