mirror of
https://github.com/superseriousbusiness/gotosocial.git
synced 2024-11-26 21:56:39 +00:00
28f85db30a
Co-authored-by: dependabot[bot] <49699333+dependabot[bot]@users.noreply.github.com>
77 lines
2.1 KiB
Go
77 lines
2.1 KiB
Go
// Copyright 2020 The Libc Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
//go:build amd64 || arm64 || ppc64le || riscv64 || s390x || loong64
|
|
// +build amd64 arm64 ppc64le riscv64 s390x loong64
|
|
|
|
package libc // import "modernc.org/libc"
|
|
|
|
import (
|
|
"unsafe"
|
|
|
|
"modernc.org/libc/limits"
|
|
"modernc.org/libc/sys/types"
|
|
)
|
|
|
|
const (
|
|
heapSize = 2 << 30 // Adjust for your debugging session requirements and system RAM size.
|
|
)
|
|
|
|
type (
|
|
// RawMem represents the biggest byte array the runtime can handle
|
|
RawMem [1<<50 - 1]byte
|
|
|
|
// 48-5*8 = 8 bytes left to pad
|
|
stackHeaderPadding struct {
|
|
a uintptr
|
|
}
|
|
)
|
|
|
|
type bits []int
|
|
|
|
func newBits(n int) (r bits) { return make(bits, (n+63)>>6) }
|
|
func (b bits) has(n int) bool { return b != nil && b[n>>6]&(1<<uint(n&63)) != 0 }
|
|
func (b bits) set(n int) { b[n>>6] |= 1 << uint(n&63) }
|
|
|
|
func Xstrchrnul(tls *TLS, s uintptr, c int32) (r uintptr) {
|
|
var k types.Size_t
|
|
var w uintptr
|
|
_, _ = k, w
|
|
c = int32(uint8(uint8(c)))
|
|
if !(c != 0) {
|
|
return s + uintptr(Xstrlen(tls, s))
|
|
}
|
|
for {
|
|
if !(uint64(uint64(s))%Uint64FromInt64(8) != 0) {
|
|
break
|
|
}
|
|
if !(*(*int8)(unsafe.Pointer(s)) != 0) || int32(*(*uint8)(unsafe.Pointer(s))) == c {
|
|
return s
|
|
}
|
|
goto _1
|
|
_1:
|
|
s++
|
|
}
|
|
k = uint64(-Int32FromInt32(1)) / Uint64FromInt32(limits.UCHAR_MAX) * uint64(uint64(c))
|
|
w = s
|
|
for {
|
|
if !(!((*(*uint64)(unsafe.Pointer(w))-uint64(-Int32FromInt32(1))/Uint64FromInt32(limits.UCHAR_MAX)) & ^*(*uint64)(unsafe.Pointer(w)) & (uint64(-Int32FromInt32(1))/Uint64FromInt32(limits.UCHAR_MAX)*uint64(Int32FromInt32(limits.UCHAR_MAX)/Int32FromInt32(2)+Int32FromInt32(1))) != 0) && !((*(*uint64)(unsafe.Pointer(w))^k-uint64(-Int32FromInt32(1))/Uint64FromInt32(limits.UCHAR_MAX)) & ^(*(*uint64)(unsafe.Pointer(w))^k) & (uint64(-Int32FromInt32(1))/Uint64FromInt32(limits.UCHAR_MAX)*uint64(Int32FromInt32(limits.UCHAR_MAX)/Int32FromInt32(2)+Int32FromInt32(1))) != 0)) {
|
|
break
|
|
}
|
|
goto _2
|
|
_2:
|
|
w += 8
|
|
}
|
|
s = w
|
|
for {
|
|
if !(*(*int8)(unsafe.Pointer(s)) != 0 && int32(*(*uint8)(unsafe.Pointer(s))) != c) {
|
|
break
|
|
}
|
|
goto _3
|
|
_3:
|
|
s++
|
|
}
|
|
return s
|
|
}
|