-
Notifications
You must be signed in to change notification settings - Fork 13
/
Copy pathHASHMAP.RPGLE
719 lines (566 loc) · 22.2 KB
/
HASHMAP.RPGLE
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
//***********************************************************************
// MIT License
//
// Copyright (c) 2017 Edoardo Luppi
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
//
// @author Edoardo Luppi
// @description RPG implementation of an HashMap
//***********************************************************************
ctl-opt nomain option(*srcstmt) bnddir('QC2LE':'UTILS');
dcl-c HASHMAP_SIZE %size(hashMapTpl);
dcl-c BUCKET_SIZE %size(bucketTpl);
dcl-c ENTRY_SIZE %size(entryTpl);
dcl-c LOAD_FACTOR 0.72;
/include qcopysrc,memcpy
/include qcopysrc,memcmp
/include qcopysrc,utils
dcl-ds hashMapTpl qualified template;
bucketsPtr pointer;
size uns(10);
allocatedSize uns(10);
loadFactor packed(3:2);
threshold uns(10);
end-ds;
dcl-ds bucketTpl qualified template align;
entryPtr pointer;
end-ds;
dcl-ds entryTpl qualified template align;
nextEntryPtr pointer;
keyPtr pointer;
keySize uns(10);
valuePtr pointer;
valueSize uns(10);
hashCode zoned(63);
*n char(9);
end-ds;
//***********************************************************************
// hashMapNew
//***********************************************************************
dcl-proc hashMapNew export;
dcl-pi *n pointer;
initialSize uns(10) const;
loadFactor packed(3:2) const options(*nopass);
end-pi;
dcl-ds hashMap likeds(hashMapTpl) based(hashMapPtr);
dcl-ds bucket likeds(bucketTpl) based(bucketPtr);
dcl-ds entry likeds(entryTpl) based(entryPtr);
dcl-s hashMapPtr pointer inz(*null);
dcl-s bucketPtr pointer inz(*null);
dcl-s entryPtr pointer inz(*null);
dcl-s loadFactor_ packed(3:2) inz;
dcl-s i uns(10) inz;
if (%parms > 1);
loadFactor_ = loadFactor;
else;
loadFactor_ = LOAD_FACTOR;
endif;
allocSpace(hashMapPtr:HASHMAP_SIZE);
hashMap.size = 0;
hashMap.allocatedSize = getNearestExpOf2(initialSize);
hashMap.loadFactor = loadFactor_;
hashMap.threshold = loadFactor_ * hashMap.allocatedSize;
allocSpace(hashMap.bucketsPtr:BUCKET_SIZE * hashMap.allocatedSize);
return hashMapPtr;
end-proc;
//***********************************************************************
// hashMapDispose
//***********************************************************************
dcl-proc hashMapDispose export;
dcl-pi *n;
hashMapPtr pointer;
end-pi;
dcl-ds hashMap likeds(hashMapTpl) based(hashMapPtr);
if (hashMapPtr <> *null);
hashMapClear(hashMapPtr);
deallocSpace(hashMapPtr);
endif;
end-proc;
//***********************************************************************
// hashMapClear
//***********************************************************************
dcl-proc hashMapClear export;
dcl-pi *n;
hashMapPtr pointer const;
end-pi;
dcl-ds hashMap likeds(hashMapTpl) based(hashMapPtr);
dcl-ds bucket likeds(bucketTpl) based(bucketPtr);
dcl-ds entry likeds(entryTpl) based(entryPtr);
dcl-s bucketPtr pointer inz(*null);
dcl-s entryPtr pointer inz(*null);
dcl-s tempPtr pointer inz(*null);
dcl-s i uns(10) inz;
for i = 1 to hashMap.allocatedSize;
bucketPtr = getBucket(hashMap.bucketsPtr:i);
entryPtr = bucket.entryPtr;
dow (entryPtr <> *null);
tempPtr = entry.nextEntryPtr;
disposeEntry(entryPtr);
entryPtr = tempPtr;
enddo;
bucket.entryPtr = *null;
endfor;
hashMap.size = 0;
end-proc;
//***********************************************************************
// hashMapSize
//***********************************************************************
dcl-proc hashMapSize export;
dcl-pi *n uns(10);
hashMapPtr pointer const;
end-pi;
dcl-ds hashMap likeds(hashMapTpl) based(hashMapPtr);
return hashMap.size;
end-proc;
//***********************************************************************
// hashMapPut
//***********************************************************************
dcl-proc hashMapPut export;
dcl-pi *n;
hashMapPtr pointer const;
keyPtr pointer const;
keySize uns(10) const;
valuePtr pointer const;
valueSize uns(10) const;
end-pi;
dcl-ds hashMap likeds(hashMapTpl) based(hashMapPtr);
hashMap.size += 1;
ensureCapacity(hashMapPtr:hashMap.size);
addEntry(
hashMap.bucketsPtr:
hashMap.allocatedSize:
getHashCode(keyPtr:keySize):
keyPtr:
keySize:
valuePtr:
valueSize
);
end-proc;
//***********************************************************************
// hashMapPutSS
//***********************************************************************
dcl-proc hashMapPutSS export;
dcl-pi *n;
hashMapPtr pointer const;
stringKey varchar(32767) value;
stringValue varchar(32767) value;
end-pi;
hashMapPut(
hashMapPtr:
%addr(stringKey:*data):%len(stringKey):
%addr(stringValue:*data):%len(stringValue)
);
end-proc;
//***********************************************************************
// hashMapPutNN
//***********************************************************************
dcl-proc hashMapPutNN export;
dcl-pi *n;
hashMapPtr pointer const;
numericKey packed(22:7) value;
numericValue packed(22:7) value;
end-pi;
hashMapPut(
hashMapPtr:
%addr(numericKey):%size(numericKey):
%addr(numericValue):%size(numericValue)
);
end-proc;
//***********************************************************************
// hashMapGet
//***********************************************************************
dcl-proc hashMapGet export;
dcl-pi *n pointer;
hashMapPtr pointer const;
keyPtr pointer const;
keySize uns(10) const;
end-pi;
dcl-ds entry likeds(entryTpl) based(entryPtr);
dcl-s entryPtr pointer inz(*null);
entryPtr = hashMapGetEntry(hashMapPtr:keyPtr:keySize);
if (entryPtr = *null);
return *null;
endif;
return entry.valuePtr;
end-proc;
//***********************************************************************
// hashMapGetSS
//***********************************************************************
dcl-proc hashMapGetSS export;
dcl-pi *n varchar(32767);
hashMapPtr pointer const;
key varchar(32767) value;
end-pi;
dcl-ds entry likeds(entryTpl) based(entryPtr);
dcl-s entryPtr pointer inz(*null);
entryPtr = hashMapGetEntry(hashMapPtr:%addr(key:*data):%len(key));
return %str(entry.valuePtr:entry.valueSize);
end-proc;
//***********************************************************************
// hashMapGetNN
//***********************************************************************
dcl-proc hashMapGetNN export;
dcl-pi *n packed(22:7);
hashMapPtr pointer const;
key packed(22:7) value;
end-pi;
dcl-ds entry likeds(entryTpl) based(entryPtr);
dcl-s entryPtr pointer inz(*null);
dcl-s packedValue packed(22:7) based(entry.valuePtr);
entryPtr = hashMapGetEntry(hashMapPtr:%addr(key):%size(key));
if (entryPtr = *null);
return *loval;
endif;
return packedValue;
end-proc;
//***********************************************************************
// hashMapContainsKey
//***********************************************************************
dcl-proc hashMapContainsKey export;
dcl-pi *n ind;
hashMapPtr pointer const;
keyPtr pointer const;
keySize uns(10) const;
end-pi;
return hashMapGet(hashMapPtr:keyPtr:keySize) <> *null;
end-proc;
//***********************************************************************
// hashMapContainsValue
//***********************************************************************
dcl-proc hashMapContainsValue export;
dcl-pi *n ind;
hashMapPtr pointer const;
valuePtr pointer const;
valueSize uns(10) const;
end-pi;
dcl-ds hashMap likeds(hashMapTpl) based(hashMapPtr);
dcl-ds bucket likeds(bucketTpl) based(bucketPtr);
dcl-ds entry likeds(entryTpl) based(entryPtr);
dcl-s bucketPtr pointer inz(*null);
dcl-s entryPtr pointer inz(*null);
dcl-s i uns(10) inz;
for i = 1 to hashMap.allocatedSize;
bucketPtr = getBucket(hashMap.bucketsPtr:i);
entryPtr = bucket.entryPtr;
dow (entryPtr <> *null);
if (memcmp(entry.valuePtr:valuePtr:valueSize) = 0);
return *on;
endif;
entryPtr = entry.nextEntryPtr;
enddo;
endfor;
return *off;
end-proc;
//***********************************************************************
// hashMapRemove
//***********************************************************************
dcl-proc hashMapRemove export;
dcl-pi *n;
hashMapPtr pointer const;
keyPtr pointer const;
keySize uns(10) const;
end-pi;
dcl-ds hashMap likeds(hashMapTpl) based(hashMapPtr);
dcl-ds bucket likeds(bucketTpl) based(bucketPtr);
dcl-ds entry likeds(entryTpl) based(entryPtr);
dcl-s bucketPtr pointer inz(*null);
dcl-s entryPtr pointer inz(*null);
dcl-s hashCode zoned(63) inz;
dcl-s bucketIndex uns(10) inz;
hashCode = getHashCode(keyPtr:keySize);
bucketIndex = getBucketIndex(hashCode:hashMap.allocatedSize);
bucketPtr = getBucket(hashMap.bucketsPtr:bucketIndex);
entryPtr = bucket.entryPtr;
dow (entryPtr <> *null);
if (entry.hashCode = hashCode);
if (entryPtr = bucket.entryPtr);
bucket.entryPtr = *null;
endif;
deallocSpace(entryPtr);
hashMap.size -= 1;
return;
endif;
entryPtr = entry.nextEntryPtr;
enddo;
end-proc;
//***********************************************************************
// hashMapGetEntry
//***********************************************************************
dcl-proc hashMapGetEntry;
dcl-pi *n pointer;
hashMapPtr pointer const;
keyPtr pointer const;
keySize uns(10) const;
end-pi;
dcl-ds hashMap likeds(hashMapTpl) based(hashMapPtr);
dcl-ds bucket likeds(bucketTpl) based(bucketPtr);
dcl-ds entry likeds(entryTpl) based(entryPtr);
dcl-s hashCode zoned(63) inz;
dcl-s bucketIndex uns(10) inz;
dcl-s bucketPtr pointer inz(*null);
dcl-s entryPtr pointer inz(*null);
hashCode = getHashCode(keyPtr:keySize);
bucketIndex = getBucketIndex(hashCode:hashMap.allocatedSize);
bucketPtr = getBucket(hashMap.bucketsPtr:bucketIndex);
entryPtr = bucket.entryPtr;
dow (entryPtr <> *null);
if (entry.hashCode = hashCode);
return entryPtr;
endif;
entryPtr = entry.nextEntryPtr;
enddo;
return *null;
end-proc;
//***********************************************************************
// getHashCode
//***********************************************************************
dcl-proc getHashCode;
dcl-pi *n zoned(63);
objectPtr pointer const;
objectSize uns(10) const;
end-pi;
dcl-pr Qc3CalculateHash extproc('Qc3CalculateHash');
inData pointer value;
inDataSize int(10) const;
inDataFormat char(8) const;
algorithmDescription pointer value;
algorithmFormat char(8) const;
CryptographicServiceProvider char(1) const;
CryptographicDeviceName char(10) const options(*omit);
hash pointer value;
apiError pointer value;
end-pr;
dcl-pr cvthc extproc('cvthc');
target pointer value;
source pointer value;
sourceSize int(10) value;
end-pr;
dcl-pr cvtch extproc('cvtch');
target pointer value;
source pointer value;
sourceSize int(10) value;
end-pr;
dcl-ds algd0500 qualified inz;
hashingAlgorithm int(10) inz(HASH_SHA1);
end-ds;
dcl-ds apiError qualified inz;
bytesProvided int(10);
bytesAvailable int(10);
exceptionId char(7);
reserved char(1);
end-ds;
dcl-c HASH_MD5 1;
dcl-c HASH_SHA1 2;
dcl-c HASH_SHA256 3;
dcl-c HASH_SHA384 4;
dcl-c HASH_SHA512 5;
dcl-c HEX_LENGTH %len(hex);
dcl-c HEX_NUM_SIZE %size(hexNumber);
dcl-s hash char(64) inz;
dcl-s hex char(40) inz;
dcl-s hexChar char(2) inz;
dcl-s hexNumber int(3) inz;
dcl-s integerValue zoned(63) inz;
dcl-s incrementalValue zoned(63) inz;
dcl-s i uns(3) inz;
if (objectPtr = *null);
return 1;
endif;
Qc3CalculateHash(
objectPtr:
objectSize:
'DATA0100':
%addr(algd0500):
'ALGD0500':
'0':
*omit:
%addr(hash):
%addr(apiError)
);
cvthc(%addr(hex):%addr(hash):%len(hash) * 2);
integerValue = 0;
incrementalValue = 0;
for i = HEX_LENGTH downto 1;
hexChar = '0' + %subst(hex:HEX_LENGTH - i + 1:1);
cvtch(%addr(hexNumber):%addr(hexChar):HEX_NUM_SIZE * 2);
integerValue = (hexNumber * (16 ** (i - 1)));
incrementalValue += integerValue;
endfor;
return incrementalValue;
end-proc;
//***********************************************************************
// getBucketIndex
//***********************************************************************
dcl-proc getBucketIndex;
dcl-pi *n uns(10);
hashCode zoned(63) const;
allocatedSize uns(10) const;
end-pi;
dcl-s index uns(10) inz;
index = %rem(hashCode:allocatedSize);
if (index = 0);
index = 1;
endif;
return index;
end-proc;
//***********************************************************************
// getBucket
//***********************************************************************
dcl-proc getBucket;
dcl-pi *n pointer;
bucketsPtr pointer const;
index uns(10) const;
end-pi;
return bucketsPtr + (BUCKET_SIZE * (index - 1));
end-proc;
//***********************************************************************
// getNearestExpOf2
//***********************************************************************
dcl-proc getNearestExpOf2;
dcl-pi *n uns(10);
number uns(10) const;
end-pi;
dcl-s newNumber uns(10) inz(1);
dow (newNumber < number);
newNumber *= 2;
enddo;
return newNumber;
end-proc;
//***********************************************************************
// disposeEntry
//***********************************************************************
dcl-proc disposeEntry;
dcl-pi *n;
entryPtr pointer;
end-pi;
dcl-ds entry likeds(entryTpl) based(entryPtr);
deallocSpace(entry.keyPtr);
deallocSpace(entry.valuePtr);
deallocSpace(entryPtr);
end-proc;
//***********************************************************************
// ensureCapacity
//***********************************************************************
dcl-proc ensureCapacity;
dcl-pi *n;
hashMapPtr pointer const;
size uns(10) const;
end-pi;
dcl-ds hashMap likeds(hashMapTpl) based(hashMapPtr);
if (size > hashMap.threshold);
hashMap.allocatedSize *= 2;
allocSpace(hashMap.bucketsPtr:BUCKET_SIZE * hashMap.allocatedSize);
hashMap.threshold = hashMap.allocatedSize * hashMap.loadFactor;
rebuild(hashMapPtr);
endif;
end-proc;
//***********************************************************************
// addEntry
//***********************************************************************
dcl-proc addEntry;
dcl-pi *n;
bucketsPtr pointer const;
bucketsSize uns(10) const;
hashCode zoned(63) const;
keyPtr pointer const;
keySize uns(10) const;
valuePtr pointer const;
valueSize uns(10) const;
end-pi;
dcl-ds bucket likeds(bucketTpl) based(bucketPtr);
dcl-ds entry likeds(entryTpl) based(entryPtr);
dcl-s bucketPtr pointer inz(*null);
dcl-s entryPtr pointer inz(*null);
dcl-s oldEntryPtr pointer inz(*null);
dcl-s bucketIndex uns(10) inz;
bucketIndex = getBucketIndex(hashCode:bucketsSize);
bucketPtr = getBucket(bucketsPtr:bucketIndex);
entryPtr = bucket.entryPtr;
if (entryPtr = *null);
allocSpace(entryPtr:ENTRY_SIZE);
bucket.entryPtr = entryPtr;
else;
// Bucket gia' in uso.
// Ciclo la lista di elementi gia' presenti, per cercare una eventuale corrispondenza.
dow (entryPtr <> *null);
if (entry.hashCode = hashCode);
// Elemento gia' presente in questo bucket. Sovrascrivo il valore.
allocSpace(entry.valuePtr:valueSize);
memcpy(entry.valuePtr:valuePtr:valueSize);
entry.valueSize = valueSize;
return;
endif;
if (entry.nextEntryPtr = *null);
leave;
endif;
entryPtr = entry.nextEntryPtr;
enddo;
// Elemento non presente nel bucket. Lo aggiungo in testa.
// Copio il vecchio elemento iniziale, per poi referenziarlo come elemento successivo.
allocSpace(oldEntryPtr:ENTRY_SIZE);
memcpy(oldEntryPtr:entryPtr:ENTRY_SIZE);
entry.keyPtr = *null;
entry.valuePtr = *null;
endif;
allocSpace(entry.keyPtr:keySize);
allocSpace(entry.valuePtr:valueSize);
memcpy(entry.keyPtr:keyPtr:keySize);
memcpy(entry.valuePtr:valuePtr:valueSize);
entry.nextEntryPtr = oldEntryPtr;
entry.keySize = keySize;
entry.valueSize = valueSize;
entry.hashCode = hashCode;
end-proc;
//***********************************************************************
// rebuild
//***********************************************************************
dcl-proc rebuild;
dcl-pi *n;
hashMapPtr pointer const;
end-pi;
dcl-ds hashMap likeds(hashMapTpl) based(hashMapPtr);
dcl-ds bucket likeds(bucketTpl) based(bucketPtr);
dcl-ds entry likeds(entryTpl) based(entryPtr);
dcl-s newBucketsPtr pointer inz(*null);
dcl-s bucketPtr pointer inz(*null);
dcl-s entryPtr pointer inz(*null);
dcl-s i uns(10) inz;
// Alloco un nuovo spazio dove sistemare gli elementi.
allocSpace(newBucketsPtr:BUCKET_SIZE * hashMap.allocatedSize);
for i = 1 to %int(hashMap.allocatedSize / 2);
bucketPtr = getBucket(hashMap.bucketsPtr:i);
entryPtr = bucket.entryPtr;
dow (entryPtr <> *null);
addEntry(
newBucketsPtr:
hashMap.allocatedSize:
entry.hashCode:
entry.keyPtr:
entry.keySize:
entry.valuePtr:
entry.valueSize
);
entryPtr = entry.nextEntryPtr;
enddo;
endfor;
hashMapClear(hashMapPtr);
deallocSpace(hashMap.bucketsPtr);
hashMap.bucketsPtr = newBucketsPtr;
end-proc;