@@ -87,10 +87,6 @@ func hashmapMake(keySize, valueSize uintptr, sizeHint uintptr, alg uint8) *hashm
87
87
}
88
88
}
89
89
90
- func hashmapMakeUnsafePointer (keySize , valueSize uintptr , sizeHint uintptr , alg uint8 ) unsafe.Pointer {
91
- return (unsafe .Pointer )(hashmapMake (keySize , valueSize , sizeHint , alg ))
92
- }
93
-
94
90
// Remove all entries from the map, without actually deallocating the space for
95
91
// it. This is used for the clear builtin, and can be used to reuse a map (to
96
92
// avoid extra heap allocations).
@@ -178,10 +174,6 @@ func hashmapLen(m *hashmap) int {
178
174
return int (m .count )
179
175
}
180
176
181
- func hashmapLenUnsafePointer (m unsafe.Pointer ) int {
182
- return hashmapLen ((* hashmap )(m ))
183
- }
184
-
185
177
//go:inline
186
178
func hashmapBucketSize (m * hashmap ) uintptr {
187
179
return unsafe .Sizeof (hashmapBucket {}) + uintptr (m .keySize )* 8 + uintptr (m .valueSize )* 8
@@ -268,10 +260,6 @@ func hashmapSet(m *hashmap, key unsafe.Pointer, value unsafe.Pointer, hash uint3
268
260
* emptySlotTophash = tophash
269
261
}
270
262
271
- func hashmapSetUnsafePointer (m unsafe.Pointer , key unsafe.Pointer , value unsafe.Pointer , hash uint32 ) {
272
- hashmapSet ((* hashmap )(m ), key , value , hash )
273
- }
274
-
275
263
// hashmapInsertIntoNewBucket creates a new bucket, inserts the given key and
276
264
// value into the bucket, and returns a pointer to this bucket.
277
265
func hashmapInsertIntoNewBucket (m * hashmap , key , value unsafe.Pointer , tophash uint8 ) * hashmapBucket {
@@ -352,10 +340,6 @@ func hashmapGet(m *hashmap, key, value unsafe.Pointer, valueSize uintptr, hash u
352
340
return false
353
341
}
354
342
355
- func hashmapGetUnsafePointer (m unsafe.Pointer , key , value unsafe.Pointer , valueSize uintptr , hash uint32 ) bool {
356
- return hashmapGet ((* hashmap )(m ), key , value , valueSize , hash )
357
- }
358
-
359
343
// Delete a given key from the map. No-op when the key does not exist in the
360
344
// map.
361
345
//
@@ -456,10 +440,6 @@ func hashmapNext(m *hashmap, it *hashmapIterator, key, value unsafe.Pointer) boo
456
440
}
457
441
}
458
442
459
- func hashmapNextUnsafePointer (m unsafe.Pointer , it unsafe.Pointer , key , value unsafe.Pointer ) bool {
460
- return hashmapNext ((* hashmap )(m ), (* hashmapIterator )(it ), key , value )
461
- }
462
-
463
443
// Hashmap with plain binary data keys (not containing strings etc.).
464
444
func hashmapBinarySet (m * hashmap , key , value unsafe.Pointer ) {
465
445
if m == nil {
@@ -469,10 +449,6 @@ func hashmapBinarySet(m *hashmap, key, value unsafe.Pointer) {
469
449
hashmapSet (m , key , value , hash )
470
450
}
471
451
472
- func hashmapBinarySetUnsafePointer (m unsafe.Pointer , key , value unsafe.Pointer ) {
473
- hashmapBinarySet ((* hashmap )(m ), key , value )
474
- }
475
-
476
452
func hashmapBinaryGet (m * hashmap , key , value unsafe.Pointer , valueSize uintptr ) bool {
477
453
if m == nil {
478
454
memzero (value , uintptr (valueSize ))
@@ -482,10 +458,6 @@ func hashmapBinaryGet(m *hashmap, key, value unsafe.Pointer, valueSize uintptr)
482
458
return hashmapGet (m , key , value , valueSize , hash )
483
459
}
484
460
485
- func hashmapBinaryGetUnsafePointer (m unsafe.Pointer , key , value unsafe.Pointer , valueSize uintptr ) bool {
486
- return hashmapBinaryGet ((* hashmap )(m ), key , value , valueSize )
487
- }
488
-
489
461
func hashmapBinaryDelete (m * hashmap , key unsafe.Pointer ) {
490
462
if m == nil {
491
463
return
@@ -494,10 +466,6 @@ func hashmapBinaryDelete(m *hashmap, key unsafe.Pointer) {
494
466
hashmapDelete (m , key , hash )
495
467
}
496
468
497
- func hashmapBinaryDeleteUnsafePointer (m unsafe.Pointer , key unsafe.Pointer ) {
498
- hashmapBinaryDelete ((* hashmap )(m ), key )
499
- }
500
-
501
469
// Hashmap with string keys (a common case).
502
470
503
471
func hashmapStringEqual (x , y unsafe.Pointer , n uintptr ) bool {
@@ -522,10 +490,6 @@ func hashmapStringSet(m *hashmap, key string, value unsafe.Pointer) {
522
490
hashmapSet (m , unsafe .Pointer (& key ), value , hash )
523
491
}
524
492
525
- func hashmapStringSetUnsafePointer (m unsafe.Pointer , key string , value unsafe.Pointer ) {
526
- hashmapStringSet ((* hashmap )(m ), key , value )
527
- }
528
-
529
493
func hashmapStringGet (m * hashmap , key string , value unsafe.Pointer , valueSize uintptr ) bool {
530
494
if m == nil {
531
495
memzero (value , uintptr (valueSize ))
@@ -535,10 +499,6 @@ func hashmapStringGet(m *hashmap, key string, value unsafe.Pointer, valueSize ui
535
499
return hashmapGet (m , unsafe .Pointer (& key ), value , valueSize , hash )
536
500
}
537
501
538
- func hashmapStringGetUnsafePointer (m unsafe.Pointer , key string , value unsafe.Pointer , valueSize uintptr ) bool {
539
- return hashmapStringGet ((* hashmap )(m ), key , value , valueSize )
540
- }
541
-
542
502
func hashmapStringDelete (m * hashmap , key string ) {
543
503
if m == nil {
544
504
return
@@ -547,10 +507,6 @@ func hashmapStringDelete(m *hashmap, key string) {
547
507
hashmapDelete (m , unsafe .Pointer (& key ), hash )
548
508
}
549
509
550
- func hashmapStringDeleteUnsafePointer (m unsafe.Pointer , key string ) {
551
- hashmapStringDelete ((* hashmap )(m ), key )
552
- }
553
-
554
510
// Hashmap with interface keys (for everything else).
555
511
556
512
// This is a method that is intentionally unexported in the reflect package. It
@@ -654,10 +610,6 @@ func hashmapInterfaceSet(m *hashmap, key interface{}, value unsafe.Pointer) {
654
610
hashmapSet (m , unsafe .Pointer (& key ), value , hash )
655
611
}
656
612
657
- func hashmapInterfaceSetUnsafePointer (m unsafe.Pointer , key interface {}, value unsafe.Pointer ) {
658
- hashmapInterfaceSet ((* hashmap )(m ), key , value )
659
- }
660
-
661
613
func hashmapInterfaceGet (m * hashmap , key interface {}, value unsafe.Pointer , valueSize uintptr ) bool {
662
614
if m == nil {
663
615
memzero (value , uintptr (valueSize ))
@@ -667,18 +619,10 @@ func hashmapInterfaceGet(m *hashmap, key interface{}, value unsafe.Pointer, valu
667
619
return hashmapGet (m , unsafe .Pointer (& key ), value , valueSize , hash )
668
620
}
669
621
670
- func hashmapInterfaceGetUnsafePointer (m unsafe.Pointer , key interface {}, value unsafe.Pointer , valueSize uintptr ) bool {
671
- return hashmapInterfaceGet ((* hashmap )(m ), key , value , valueSize )
672
- }
673
-
674
622
func hashmapInterfaceDelete (m * hashmap , key interface {}) {
675
623
if m == nil {
676
624
return
677
625
}
678
626
hash := hashmapInterfaceHash (key , m .seed )
679
627
hashmapDelete (m , unsafe .Pointer (& key ), hash )
680
628
}
681
-
682
- func hashmapInterfaceDeleteUnsafePointer (m unsafe.Pointer , key interface {}) {
683
- hashmapInterfaceDelete ((* hashmap )(m ), key )
684
- }
0 commit comments