summaryrefslogtreecommitdiff
path: root/vendor/github.com/cornelk/hashmap/util.go
diff options
context:
space:
mode:
authorLibravatar kim <89579420+NyaaaWhatsUpDoc@users.noreply.github.com>2024-05-22 09:46:24 +0000
committerLibravatar GitHub <noreply@github.com>2024-05-22 11:46:24 +0200
commit3d3e99ae52ff8895b840cbced2e55b5f849fd4be (patch)
treec646d5eb99368028a2fbdafbe2c4400059d8eed5 /vendor/github.com/cornelk/hashmap/util.go
parent--- (#2923) (diff)
downloadgotosocial-3d3e99ae52ff8895b840cbced2e55b5f849fd4be.tar.xz
[performance] update storage backend and make use of seek syscall when available (#2924)
* update to use go-storage/ instead of go-store/v2/storage/ * pull in latest version from codeberg * remove test output :innocent: * add code comments * set the exclusive bit when creating new files in disk config * bump to actual release version * bump to v0.1.1 (tis a simple no-logic change) * update readme * only use a temporary read seeker when decoding video if required (should only be S3 now) * use fastcopy library to use memory pooled buffers when calling TempFileSeeker() * update to use seek call in serveFileRange()
Diffstat (limited to 'vendor/github.com/cornelk/hashmap/util.go')
-rw-r--r--vendor/github.com/cornelk/hashmap/util.go32
1 files changed, 0 insertions, 32 deletions
diff --git a/vendor/github.com/cornelk/hashmap/util.go b/vendor/github.com/cornelk/hashmap/util.go
deleted file mode 100644
index 4ef40e224..000000000
--- a/vendor/github.com/cornelk/hashmap/util.go
+++ /dev/null
@@ -1,32 +0,0 @@
-package hashmap
-
-import (
- "strconv"
-)
-
-const (
- // intSizeBytes is the size in byte of an int or uint value.
- intSizeBytes = strconv.IntSize >> 3
-)
-
-// roundUpPower2 rounds a number to the next power of 2.
-func roundUpPower2(i uintptr) uintptr {
- i--
- i |= i >> 1
- i |= i >> 2
- i |= i >> 4
- i |= i >> 8
- i |= i >> 16
- i |= i >> 32
- i++
- return i
-}
-
-// log2 computes the binary logarithm of x, rounded up to the next integer.
-func log2(i uintptr) uintptr {
- var n, p uintptr
- for p = 1; p < i; p += p {
- n++
- }
- return n
-}