-
Notifications
You must be signed in to change notification settings - Fork 35
/
hashtable.c
1227 lines (1035 loc) · 26.5 KB
/
hashtable.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
/// @file
#include "hashtable.h"
#include "allocate.h"
#include "imprison.h"
#include "retrieve.h"
#include "xtract.h"
/* CUT_END(): extract [b_w] low bits from [a_w]
*/
#define CUT_END(a_w, b_w) ((a_w) & ((1 << (b_w)) - 1))
/* BIT_SET(): [1] if bit [b_w] is set in [a_w]
*/
#define BIT_SET(a_w, b_w) ((a_w) & (1 << (b_w)))
static c3_o
_ch_trim_slot(u3h_root* har_u, u3h_slot *sot_w, c3_w lef_w, c3_w rem_w);
c3_w
_ch_skip_slot(c3_w mug_w, c3_w lef_w);
/* u3h_new_cache(): create hashtable with bounded size.
*/
u3p(u3h_root)
u3h_new_cache(c3_w max_w)
{
u3h_root* har_u = u3a_walloc(c3_wiseof(u3h_root));
u3p(u3h_root) har_p = u3of(u3h_root, har_u);
c3_w i_w;
har_u->max_w = max_w;
har_u->use_w = 0;
har_u->arm_u.mug_w = 0;
har_u->arm_u.inx_w = 0;
for ( i_w = 0; i_w < 64; i_w++ ) {
har_u->sot_w[i_w] = 0;
}
return har_p;
}
/* u3h_new(): create hashtable.
*/
u3p(u3h_root)
u3h_new(void)
{
return u3h_new_cache(0);
}
/* _ch_popcount(): number of bits set in word. A standard intrinsic.
*/
static c3_w
_ch_popcount(c3_w num_w)
{
return __builtin_popcount(num_w);
}
/* _ch_buck_new(): create new bucket.
*/
static u3h_buck*
_ch_buck_new(c3_w len_w)
{
u3h_buck* hab_u = u3a_walloc(c3_wiseof(u3h_buck) +
(len_w * c3_wiseof(u3h_slot)));
hab_u->len_w = len_w;
return hab_u;
}
/* _ch_node_new(): create new node.
*/
static u3h_node*
_ch_node_new(c3_w len_w)
{
u3h_node* han_u = u3a_walloc(c3_wiseof(u3h_node) +
(len_w * c3_wiseof(u3h_slot)));
han_u->map_w = 0;
return han_u;
}
static void _ch_slot_put(u3h_slot*, u3_noun, c3_w, c3_w, c3_w*);
/* _ch_node_add(): add to node.
*/
static u3h_node*
_ch_node_add(u3h_node* han_u, c3_w lef_w, c3_w rem_w, u3_noun kev, c3_w *use_w)
{
c3_w bit_w, inx_w, map_w, i_w;
lef_w -= 5;
bit_w = (rem_w >> lef_w);
rem_w = CUT_END(rem_w, lef_w);
map_w = han_u->map_w;
inx_w = _ch_popcount(CUT_END(map_w, bit_w));
if ( BIT_SET(map_w, bit_w) ) {
_ch_slot_put(&(han_u->sot_w[inx_w]), kev, lef_w, rem_w, use_w);
return han_u;
}
else {
// nothing was at this slot.
// Optimize: use u3a_wealloc.
//
c3_w len_w = _ch_popcount(map_w);
u3h_node* nah_u = _ch_node_new(1 + len_w);
nah_u->map_w = han_u->map_w | (1 << bit_w);
for ( i_w = 0; i_w < inx_w; i_w++ ) {
nah_u->sot_w[i_w] = han_u->sot_w[i_w];
}
nah_u->sot_w[inx_w] = u3h_noun_be_warm(u3h_noun_to_slot(kev));
for ( i_w = inx_w; i_w < len_w; i_w++ ) {
nah_u->sot_w[i_w + 1] = han_u->sot_w[i_w];
}
u3a_wfree(han_u);
*use_w += 1;
return nah_u;
}
}
/* ch_buck_add(): add to bucket.
*/
static u3h_buck*
_ch_buck_add(u3h_buck* hab_u, u3_noun kev, c3_w *use_w)
{
c3_w i_w;
// if our key is equal to any of the existing keys in the bucket,
// then replace that key-value pair with kev.
//
for ( i_w = 0; i_w < hab_u->len_w; i_w++ ) {
u3_noun kov = u3h_slot_to_noun(hab_u->sot_w[i_w]);
if ( c3y == u3r_sing(u3h(kev), u3h(kov)) ) {
hab_u->sot_w[i_w] = u3h_noun_to_slot(kev);
u3z(kov);
return hab_u;
}
}
// create mutant bucket with added key-value pair.
// Optimize: use u3a_wealloc().
{
u3h_buck* bah_u = _ch_buck_new(1 + hab_u->len_w);
bah_u->sot_w[0] = u3h_noun_be_warm(u3h_noun_to_slot(kev));
for ( i_w = 0; i_w < hab_u->len_w; i_w++ ) {
bah_u->sot_w[i_w + 1] = hab_u->sot_w[i_w];
}
u3a_wfree(hab_u);
*use_w += 1;
return bah_u;
}
}
/* _ch_some_add(): add to node or bucket.
*/
static void*
_ch_some_add(void* han_v, c3_w lef_w, c3_w rem_w, u3_noun kev, c3_w *use_w)
{
if ( 0 == lef_w ) {
return _ch_buck_add((u3h_buck*)han_v, kev, use_w);
}
else return _ch_node_add((u3h_node*)han_v, lef_w, rem_w, kev, use_w);
}
/* _ch_two(): create a new node with two leaves underneath
*/
u3h_slot
_ch_two(u3h_slot had_w, u3h_slot add_w, c3_w lef_w, c3_w ham_w, c3_w mad_w)
{
void* ret;
if ( 0 == lef_w ) {
u3h_buck* hab_u = _ch_buck_new(2);
ret = hab_u;
hab_u->sot_w[0] = had_w;
hab_u->sot_w[1] = add_w;
}
else {
c3_w hop_w, tad_w;
lef_w -= 5;
hop_w = ham_w >> lef_w;
tad_w = mad_w >> lef_w;
if ( hop_w == tad_w ) {
// fragments collide: store in a child node.
u3h_node* han_u = _ch_node_new(1);
ret = han_u;
han_u->map_w = 1 << hop_w;
ham_w = CUT_END(ham_w, lef_w);
mad_w = CUT_END(mad_w, lef_w);
han_u->sot_w[0] = _ch_two(had_w, add_w, lef_w, ham_w, mad_w);
}
else {
u3h_node* han_u = _ch_node_new(2);
ret = han_u;
han_u->map_w = (1 << hop_w) | (1 << tad_w);
// smaller mug fragments go in earlier slots
if ( hop_w < tad_w ) {
han_u->sot_w[0] = had_w;
han_u->sot_w[1] = add_w;
}
else {
han_u->sot_w[0] = add_w;
han_u->sot_w[1] = had_w;
}
}
}
return u3h_node_to_slot(ret);
}
/* _ch_slot_put(): store a key-value pair in a non-null slot
*/
static void
_ch_slot_put(u3h_slot* sot_w, u3_noun kev, c3_w lef_w, c3_w rem_w, c3_w* use_w)
{
if ( c3n == u3h_slot_is_noun(*sot_w) ) {
void* hav_v = _ch_some_add(u3h_slot_to_node(*sot_w),
lef_w,
rem_w,
kev,
use_w);
u3_assert( c3y == u3h_slot_is_node(*sot_w) );
*sot_w = u3h_node_to_slot(hav_v);
}
else {
u3_noun kov = u3h_slot_to_noun(*sot_w);
u3h_slot add_w = u3h_noun_be_warm(u3h_noun_to_slot(kev));
if ( c3y == u3r_sing(u3h(kev), u3h(kov)) ) {
// replace old value
u3z(kov);
*sot_w = add_w;
}
else {
c3_w ham_w = CUT_END(u3r_mug(u3h(kov)), lef_w);
*sot_w = _ch_two(*sot_w, add_w, lef_w, ham_w, rem_w);
*use_w += 1;
}
}
}
/* u3h_put(): insert in hashtable.
**
** `key` is RETAINED; `val` is transferred.
*/
void
u3h_put(u3p(u3h_root) har_p, u3_noun key, u3_noun val)
{
u3h_root* har_u = u3to(u3h_root, har_p);
u3_noun kev = u3nc(u3k(key), val);
c3_w mug_w = u3r_mug(key);
c3_w inx_w = (mug_w >> 25); // 6 bits
c3_w rem_w = CUT_END(mug_w, 25);
u3h_slot* sot_w = &(har_u->sot_w[inx_w]);
if ( c3y == u3h_slot_is_null(*sot_w) ) {
*sot_w = u3h_noun_be_warm(u3h_noun_to_slot(kev));
har_u->use_w += 1;
}
else {
_ch_slot_put(sot_w, kev, 25, rem_w, &(har_u->use_w));
}
if ( har_u->max_w > 0 ) {
u3h_trim_to(har_p, har_u->max_w);
}
}
/* _ch_uni_with(): key/value callback, put into [*wit]
*/
static void
_ch_uni_with(u3_noun kev, void* wit)
{
u3p(u3h_root) har_p = *(u3p(u3h_root)*)wit;
u3_noun key, val;
u3x_cell(kev, &key, &val);
u3h_put(har_p, key, u3k(val));
}
/* u3h_uni(): unify hashtables, copying [rah_p] into [har_p]
*/
void
u3h_uni(u3p(u3h_root) har_p, u3p(u3h_root) rah_p)
{
u3h_walk_with(rah_p, _ch_uni_with, &har_p);
}
/* _ch_trim_node(): trim one entry from a node slot or its children
*/
static c3_o
_ch_trim_node(u3h_root* har_u, u3h_slot* sot_w, c3_w lef_w, c3_w rem_w)
{
c3_w bit_w, map_w, inx_w;
u3h_slot* tos_w;
u3h_node* han_u = (u3h_node*) u3h_slot_to_node(*sot_w);
lef_w -= 5;
bit_w = (rem_w >> lef_w);
map_w = han_u->map_w;
if ( !BIT_SET(map_w, bit_w) ) {
har_u->arm_u.mug_w = _ch_skip_slot(har_u->arm_u.mug_w, lef_w);
return c3n;
}
rem_w = CUT_END(rem_w, lef_w);
inx_w = _ch_popcount(CUT_END(map_w, bit_w));
tos_w = &(han_u->sot_w[inx_w]);
if ( c3n == _ch_trim_slot(har_u, tos_w, lef_w, rem_w) ) {
// nothing trimmed
return c3n;
}
else if ( 0 != *tos_w ) {
// something trimmed, but slot still has value
return c3y;
}
else {
// shrink!
c3_w i_w, ken_w, len_w = _ch_popcount(map_w);
u3h_slot kes_w;
if ( 2 == len_w && ((ken_w = (0 == inx_w) ? 1 : 0),
(kes_w = han_u->sot_w[ken_w]),
(c3y == u3h_slot_is_noun(kes_w))) ) {
// only one side left, and the other is a noun. debucketize.
*sot_w = kes_w;
u3a_wfree(han_u);
}
else {
// shrink node in place; don't reallocate, we could be low on memory
//
han_u->map_w &= ~(1 << bit_w);
--len_w;
for ( i_w = inx_w; i_w < len_w; i_w++ ) {
han_u->sot_w[i_w] = han_u->sot_w[i_w + 1];
}
}
return c3y;
}
}
/* _ch_trim_kev(): trim a single entry slot
*/
static c3_o
_ch_trim_kev(u3h_slot *sot_w)
{
if ( _(u3h_slot_is_warm(*sot_w)) ) {
*sot_w = u3h_noun_be_cold(*sot_w);
return c3n;
}
else {
u3_noun kev = u3h_slot_to_noun(*sot_w);
*sot_w = 0;
u3z(kev);
return c3y;
}
}
/* _ch_trim_node(): trim one entry from a bucket slot
*/
static c3_o
_ch_trim_buck(u3h_root* har_u, u3h_slot* sot_w)
{
c3_w i_w, len_w;
u3h_buck* hab_u = u3h_slot_to_node(*sot_w);
for ( len_w = hab_u->len_w;
har_u->arm_u.inx_w < len_w;
har_u->arm_u.inx_w += 1 )
{
if ( c3y == _ch_trim_kev(&(hab_u->sot_w[har_u->arm_u.inx_w])) ) {
if ( 2 == len_w ) {
// 2 things in bucket: debucketize to key-value pair, the next
// run will point at this pair (same mug_w, no longer in bucket)
*sot_w = hab_u->sot_w[ (0 == har_u->arm_u.inx_w) ? 1 : 0 ];
u3a_wfree(hab_u);
har_u->arm_u.inx_w = 0;
}
else {
// shrink bucket in place; don't reallocate, we could be low on memory
hab_u->len_w = --len_w;
for ( i_w = har_u->arm_u.inx_w; i_w < len_w; ++i_w ) {
hab_u->sot_w[i_w] = hab_u->sot_w[i_w + 1];
}
// leave the arm pointing at the next index in the bucket
++(har_u->arm_u.inx_w);
}
return c3y;
}
}
har_u->arm_u.mug_w = (har_u->arm_u.mug_w + 1) & 0x7FFFFFFF; // modulo 2^31
har_u->arm_u.inx_w = 0;
return c3n;
}
/* _ch_trim_some(): trim one entry from a bucket or node slot
*/
static c3_o
_ch_trim_some(u3h_root* har_u, u3h_slot* sot_w, c3_w lef_w, c3_w rem_w)
{
if ( 0 == lef_w ) {
return _ch_trim_buck(har_u, sot_w);
}
else {
return _ch_trim_node(har_u, sot_w, lef_w, rem_w);
}
}
/* _ch_skip_slot(): increment arm over hash prefix.
*/
c3_w
_ch_skip_slot(c3_w mug_w, c3_w lef_w)
{
c3_w hig_w = mug_w >> lef_w;
c3_w new_w = CUT_END(hig_w + 1, (31 - lef_w)); // modulo 2^(31 - lef_w)
return new_w << lef_w;
}
/* _ch_trim_slot(): trim one entry from a non-bucket slot
*/
static c3_o
_ch_trim_slot(u3h_root* har_u, u3h_slot *sot_w, c3_w lef_w, c3_w rem_w)
{
if ( c3y == u3h_slot_is_noun(*sot_w) ) {
har_u->arm_u.mug_w = _ch_skip_slot(har_u->arm_u.mug_w, lef_w);
return _ch_trim_kev(sot_w);
}
else {
return _ch_trim_some(har_u, sot_w, lef_w, rem_w);
}
}
/* _ch_trim_root(): trim one entry from a hashtable
*/
static c3_o
_ch_trim_root(u3h_root* har_u)
{
c3_w mug_w = har_u->arm_u.mug_w;
c3_w inx_w = mug_w >> 25; // 6 bits
u3h_slot* sot_w = &(har_u->sot_w[inx_w]);
if ( c3y == u3h_slot_is_null(*sot_w) ) {
har_u->arm_u.mug_w = _ch_skip_slot(har_u->arm_u.mug_w, 25);
return c3n;
}
return _ch_trim_slot(har_u, sot_w, 25, CUT_END(mug_w, 25));
}
/* u3h_trim_to(): trim to n key-value pairs
*/
void
u3h_trim_to(u3p(u3h_root) har_p, c3_w n_w)
{
u3h_root* har_u = u3to(u3h_root, har_p);
while ( har_u->use_w > n_w ) {
if ( c3y == _ch_trim_root(har_u) ) {
har_u->use_w -= 1;
}
}
}
/* _ch_buck_hum(): read in bucket.
*/
static c3_o
_ch_buck_hum(u3h_buck* hab_u, c3_w mug_w)
{
c3_w i_w;
for ( i_w = 0; i_w < hab_u->len_w; i_w++ ) {
if ( mug_w == u3r_mug(u3h(u3h_slot_to_noun(hab_u->sot_w[i_w]))) ) {
return c3y;
}
}
return c3n;
}
/* _ch_node_hum(): read in node.
*/
static c3_o
_ch_node_hum(u3h_node* han_u, c3_w lef_w, c3_w rem_w, c3_w mug_w)
{
c3_w bit_w, map_w;
lef_w -= 5;
bit_w = (rem_w >> lef_w);
rem_w = CUT_END(rem_w, lef_w);
map_w = han_u->map_w;
if ( !BIT_SET(map_w, bit_w) ) {
return c3n;
}
else {
c3_w inx_w = _ch_popcount(CUT_END(map_w, bit_w));
c3_w sot_w = han_u->sot_w[inx_w];
if ( _(u3h_slot_is_noun(sot_w)) ) {
u3_noun kev = u3h_slot_to_noun(sot_w);
if ( mug_w == u3r_mug(u3h(kev)) ) {
return c3y;
}
else {
return c3n;
}
}
else {
void* hav_v = u3h_slot_to_node(sot_w);
if ( 0 == lef_w ) {
return _ch_buck_hum(hav_v, mug_w);
}
else return _ch_node_hum(hav_v, lef_w, rem_w, mug_w);
}
}
}
/* u3h_hum(): check presence in hashtable.
**
** `key` is RETAINED.
*/
c3_o
u3h_hum(u3p(u3h_root) har_p, c3_w mug_w)
{
u3h_root* har_u = u3to(u3h_root, har_p);
c3_w inx_w = (mug_w >> 25);
c3_w rem_w = CUT_END(mug_w, 25);
c3_w sot_w = har_u->sot_w[inx_w];
if ( _(u3h_slot_is_null(sot_w)) ) {
return c3n;
}
else if ( _(u3h_slot_is_noun(sot_w)) ) {
u3_noun kev = u3h_slot_to_noun(sot_w);
if ( mug_w == u3r_mug(u3h(kev)) ) {
return c3y;
}
else {
return c3n;
}
}
else {
u3h_node* han_u = u3h_slot_to_node(sot_w);
return _ch_node_hum(han_u, 25, rem_w, mug_w);
}
}
/* _ch_buck_git(): read in bucket.
*/
static u3_weak
_ch_buck_git(u3h_buck* hab_u, u3_noun key)
{
c3_w i_w;
for ( i_w = 0; i_w < hab_u->len_w; i_w++ ) {
u3_noun kev = u3h_slot_to_noun(hab_u->sot_w[i_w]);
if ( _(u3r_sing(key, u3h(kev))) ) {
return u3t(kev);
}
}
return u3_none;
}
/* _ch_node_git(): read in node.
*/
static u3_weak
_ch_node_git(u3h_node* han_u, c3_w lef_w, c3_w rem_w, u3_noun key)
{
c3_w bit_w, map_w;
lef_w -= 5;
bit_w = (rem_w >> lef_w);
rem_w = CUT_END(rem_w, lef_w);
map_w = han_u->map_w;
if ( !BIT_SET(map_w, bit_w) ) {
return u3_none;
}
else {
c3_w inx_w = _ch_popcount(CUT_END(map_w, bit_w));
c3_w sot_w = han_u->sot_w[inx_w];
if ( _(u3h_slot_is_noun(sot_w)) ) {
u3_noun kev = u3h_slot_to_noun(sot_w);
if ( _(u3r_sing(key, u3h(kev))) ) {
return u3t(kev);
}
else {
return u3_none;
}
}
else {
void* hav_v = u3h_slot_to_node(sot_w);
if ( 0 == lef_w ) {
return _ch_buck_git(hav_v, key);
}
else return _ch_node_git(hav_v, lef_w, rem_w, key);
}
}
}
/* u3h_git(): read from hashtable.
**
** `key` is RETAINED; result is RETAINED.
*/
u3_weak
u3h_git(u3p(u3h_root) har_p, u3_noun key)
{
u3h_root* har_u = u3to(u3h_root, har_p);
c3_w mug_w = u3r_mug(key);
c3_w inx_w = (mug_w >> 25);
c3_w rem_w = CUT_END(mug_w, 25);
c3_w sot_w = har_u->sot_w[inx_w];
if ( _(u3h_slot_is_null(sot_w)) ) {
return u3_none;
}
else if ( _(u3h_slot_is_noun(sot_w)) ) {
u3_noun kev = u3h_slot_to_noun(sot_w);
if ( _(u3r_sing(key, u3h(kev))) ) {
har_u->sot_w[inx_w] = u3h_noun_be_warm(sot_w);
return u3t(kev);
}
else {
return u3_none;
}
}
else {
u3h_node* han_u = u3h_slot_to_node(sot_w);
return _ch_node_git(han_u, 25, rem_w, key);
}
}
/* u3h_get(): read from hashtable, incrementing refcount.
**
** `key` is RETAINED; result is PRODUCED.
*/
u3_weak
u3h_get(u3p(u3h_root) har_p, u3_noun key)
{
u3_noun pro = u3h_git(har_p, key);
if ( u3_none != pro ) {
u3k(pro);
}
return pro;
}
/* _ch_free_buck(): free bucket
*/
static void
_ch_free_buck(u3h_buck* hab_u)
{
c3_w i_w;
for ( i_w = 0; i_w < hab_u->len_w; i_w++ ) {
u3z(u3h_slot_to_noun(hab_u->sot_w[i_w]));
}
u3a_wfree(hab_u);
}
/* _ch_free_node(): free node.
*/
static void
_ch_free_node(u3h_node* han_u, c3_w lef_w)
{
c3_w len_w = _ch_popcount(han_u->map_w);
c3_w i_w;
lef_w -= 5;
for ( i_w = 0; i_w < len_w; i_w++ ) {
c3_w sot_w = han_u->sot_w[i_w];
if ( _(u3h_slot_is_noun(sot_w)) ) {
u3z(u3h_slot_to_noun(sot_w));
}
else {
void* hav_v = u3h_slot_to_node(sot_w);
if ( 0 == lef_w ) {
_ch_free_buck(hav_v);
} else {
_ch_free_node(hav_v, lef_w);
}
}
}
u3a_wfree(han_u);
}
/* u3h_free(): free hashtable.
*/
void
u3h_free(u3p(u3h_root) har_p)
{
u3h_root* har_u = u3to(u3h_root, har_p);
c3_w i_w;
for ( i_w = 0; i_w < 64; i_w++ ) {
c3_w sot_w = har_u->sot_w[i_w];
if ( _(u3h_slot_is_noun(sot_w)) ) {
u3z(u3h_slot_to_noun(sot_w));
}
else if ( _(u3h_slot_is_node(sot_w)) ) {
u3h_node* han_u = u3h_slot_to_node(sot_w);
_ch_free_node(han_u, 25);
}
}
u3a_wfree(har_u);
}
/* _ch_walk_buck(): walk bucket for gc.
*/
static void
_ch_walk_buck(u3h_buck* hab_u, void (*fun_f)(u3_noun, void*), void* wit)
{
c3_w i_w;
for ( i_w = 0; i_w < hab_u->len_w; i_w++ ) {
fun_f(u3h_slot_to_noun(hab_u->sot_w[i_w]), wit);
}
}
/* _ch_walk_node(): walk node for gc.
*/
static void
_ch_walk_node(u3h_node* han_u, c3_w lef_w, void (*fun_f)(u3_noun, void*), void* wit)
{
c3_w len_w = _ch_popcount(han_u->map_w);
c3_w i_w;
lef_w -= 5;
for ( i_w = 0; i_w < len_w; i_w++ ) {
c3_w sot_w = han_u->sot_w[i_w];
if ( _(u3h_slot_is_noun(sot_w)) ) {
u3_noun kev = u3h_slot_to_noun(sot_w);
fun_f(kev, wit);
}
else {
void* hav_v = u3h_slot_to_node(sot_w);
if ( 0 == lef_w ) {
_ch_walk_buck(hav_v, fun_f, wit);
} else {
_ch_walk_node(hav_v, lef_w, fun_f, wit);
}
}
}
}
/* u3h_walk_with(): traverse hashtable with key, value fn and data
* argument; RETAINS.
*/
void
u3h_walk_with(u3p(u3h_root) har_p,
void (*fun_f)(u3_noun, void*),
void* wit)
{
u3h_root* har_u = u3to(u3h_root, har_p);
c3_w i_w;
for ( i_w = 0; i_w < 64; i_w++ ) {
c3_w sot_w = har_u->sot_w[i_w];
if ( _(u3h_slot_is_noun(sot_w)) ) {
u3_noun kev = u3h_slot_to_noun(sot_w);
fun_f(kev, wit);
}
else if ( _(u3h_slot_is_node(sot_w)) ) {
u3h_node* han_u = u3h_slot_to_node(sot_w);
_ch_walk_node(han_u, 25, fun_f, wit);
}
}
}
/* _ch_walk_plain(): use plain u3_noun fun_f for each node
*/
static void
_ch_walk_plain(u3_noun kev, void* wit)
{
void (*fun_f)(u3_noun) = wit;
fun_f(kev);
}
/* u3h_walk(): u3h_walk_with, but with no data argument
*/
void
u3h_walk(u3p(u3h_root) har_p, void (*fun_f)(u3_noun))
{
u3h_walk_with(har_p, _ch_walk_plain, fun_f);
}
/* _ch_take_noun(): take key and call [fun_f] on val.
*/
static u3h_slot
_ch_take_noun(u3h_slot sot_w, u3_funk fun_f)
{
u3_noun kov = u3h_slot_to_noun(sot_w);
u3_noun kev = u3nc(u3a_take(u3h(kov)),
fun_f(u3t(kov)));
return u3h_noun_to_slot(kev);
}
/* _ch_take_buck(): take bucket and contents
*/
static u3h_slot
_ch_take_buck(u3h_slot sot_w, u3_funk fun_f)
{
u3h_buck* hab_u = u3h_slot_to_node(sot_w);
u3h_buck* bah_u = _ch_buck_new(hab_u->len_w);
c3_w i_w;
for ( i_w = 0; i_w < hab_u->len_w; i_w++ ) {
bah_u->sot_w[i_w] = _ch_take_noun(hab_u->sot_w[i_w], fun_f);
}
return u3h_node_to_slot(bah_u);
}
/* _ch_take_node(): take node and contents
*/
static u3h_slot
_ch_take_node(u3h_slot sot_w, c3_w lef_w, u3_funk fun_f)
{
u3h_node* han_u = u3h_slot_to_node(sot_w);
c3_w len_w = _ch_popcount(han_u->map_w);
u3h_node* nah_u = _ch_node_new(len_w);
c3_w i_w;
nah_u->map_w = han_u->map_w;
lef_w -= 5;
for ( i_w = 0; i_w < len_w; i_w++ ) {
c3_w tos_w = han_u->sot_w[i_w];
nah_u->sot_w[i_w] = ( c3y == u3h_slot_is_noun(tos_w) )
? _ch_take_noun(tos_w, fun_f)
: ( 0 == lef_w )
? _ch_take_buck(tos_w, fun_f)
: _ch_take_node(tos_w, lef_w, fun_f);
}
return u3h_node_to_slot(nah_u);
}
/* u3h_take_with(): gain hashtable, copying junior keys
** and calling [fun_f] on values
*/
u3p(u3h_root)
u3h_take_with(u3p(u3h_root) har_p, u3_funk fun_f)
{
u3h_root* har_u = u3to(u3h_root, har_p);
u3p(u3h_root) rah_p = u3h_new_cache(har_u->max_w);
u3h_root* rah_u = u3to(u3h_root, rah_p);
c3_w i_w;
rah_u->use_w = har_u->use_w;
rah_u->arm_u = har_u->arm_u;
for ( i_w = 0; i_w < 64; i_w++ ) {
c3_w sot_w = har_u->sot_w[i_w];
rah_u->sot_w[i_w] = ( c3y == u3h_slot_is_noun(sot_w) )
? _ch_take_noun(sot_w, fun_f)
: _ch_take_node(sot_w, 25, fun_f);
}
return rah_p;
}
/* u3h_take(): gain hashtable, copying junior nouns
*/
u3p(u3h_root)
u3h_take(u3p(u3h_root) har_p)
{
return u3h_take_with(har_p, u3a_take);
}
/* _ch_mark_buck(): mark bucket for gc.
*/
c3_w
_ch_mark_buck(u3h_buck* hab_u)
{
c3_w tot_w = 0;
c3_w i_w;
for ( i_w = 0; i_w < hab_u->len_w; i_w++ ) {
tot_w += u3a_mark_noun(u3h_slot_to_noun(hab_u->sot_w[i_w]));
}
tot_w += u3a_mark_ptr(hab_u);
return tot_w;
}
/* _ch_mark_node(): mark node for gc.
*/
c3_w
_ch_mark_node(u3h_node* han_u, c3_w lef_w)
{
c3_w tot_w = 0;
c3_w len_w = _ch_popcount(han_u->map_w);
c3_w i_w;
lef_w -= 5;
for ( i_w = 0; i_w < len_w; i_w++ ) {
c3_w sot_w = han_u->sot_w[i_w];
if ( _(u3h_slot_is_noun(sot_w)) ) {
u3_noun kev = u3h_slot_to_noun(sot_w);
tot_w += u3a_mark_noun(kev);
}
else {
void* hav_v = u3h_slot_to_node(sot_w);
if ( 0 == lef_w ) {
tot_w += _ch_mark_buck(hav_v);
} else {
tot_w += _ch_mark_node(hav_v, lef_w);
}
}
}
tot_w += u3a_mark_ptr(han_u);
return tot_w;
}
/* u3h_mark(): mark hashtable for gc.
*/
c3_w
u3h_mark(u3p(u3h_root) har_p)
{
c3_w tot_w = 0;
u3h_root* har_u = u3to(u3h_root, har_p);
c3_w i_w;
for ( i_w = 0; i_w < 64; i_w++ ) {
c3_w sot_w = har_u->sot_w[i_w];
if ( _(u3h_slot_is_noun(sot_w)) ) {
u3_noun kev = u3h_slot_to_noun(sot_w);
tot_w += u3a_mark_noun(kev);
}
else if ( _(u3h_slot_is_node(sot_w)) ) {
u3h_node* han_u = u3h_slot_to_node(sot_w);
tot_w += _ch_mark_node(han_u, 25);
}
}
tot_w += u3a_mark_ptr(har_u);
return tot_w;
}
/* _ch_rewrite_buck(): rewrite buck for compaction.
*/
void
_ch_rewrite_buck(u3h_buck* hab_u)
{
if ( c3n == u3a_rewrite_ptr(hab_u) ) return;
c3_w i_w;
for ( i_w = 0; i_w < hab_u->len_w; i_w++ ) {
u3_noun som = u3h_slot_to_noun(hab_u->sot_w[i_w]);
hab_u->sot_w[i_w] = u3h_noun_to_slot(u3a_rewritten_noun(som));
u3a_rewrite_noun(som);
}
}
/* _ch_rewrite_node(): rewrite node for compaction.
*/
void
_ch_rewrite_node(u3h_node* han_u, c3_w lef_w)
{