Linux id-dci-web1980.main-hosting.eu 5.14.0-611.26.1.el9_7.x86_64 #1 SMP PREEMPT_DYNAMIC Thu Jan 29 05:24:47 EST 2026 x86_64
LiteSpeed
: 153.92.8.146 | : 216.73.216.208
Cant Read [ /etc/named.conf ]
8.3.30
u610877233
www.github.com/MadExploits
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
CPANEL RESET
CREATE WP USER
README
+ Create Folder
+ Create File
/
opt /
golang /
1.22.0 /
src /
sync /
[ HOME SHELL ]
Name
Size
Permission
Action
atomic
[ DIR ]
drwxr-xr-x
cond.go
3.96
KB
-rw-r--r--
cond_test.go
4.96
KB
-rw-r--r--
example_pool_test.go
1017
B
-rw-r--r--
example_test.go
1.13
KB
-rw-r--r--
export_test.go
1.2
KB
-rw-r--r--
map.go
14.98
KB
-rw-r--r--
map_bench_test.go
11.25
KB
-rw-r--r--
map_reference_test.go
5.41
KB
-rw-r--r--
map_test.go
6.74
KB
-rw-r--r--
mutex.go
8.27
KB
-rw-r--r--
mutex_test.go
5.94
KB
-rw-r--r--
once.go
2.4
KB
-rw-r--r--
once_test.go
1.1
KB
-rw-r--r--
oncefunc.go
2
KB
-rw-r--r--
oncefunc_test.go
6.94
KB
-rw-r--r--
pool.go
9
KB
-rw-r--r--
pool_test.go
8.1
KB
-rw-r--r--
poolqueue.go
8.73
KB
-rw-r--r--
runtime.go
2.33
KB
-rw-r--r--
runtime2.go
465
B
-rw-r--r--
runtime2_lockrank.go
546
B
-rw-r--r--
runtime_sema_test.go
1.34
KB
-rw-r--r--
rwmutex.go
7.02
KB
-rw-r--r--
rwmutex_test.go
4.89
KB
-rw-r--r--
waitgroup.go
3.87
KB
-rw-r--r--
waitgroup_test.go
3.01
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : export_test.go
// Copyright 2012 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package sync // Export for testing. var Runtime_Semacquire = runtime_Semacquire var Runtime_Semrelease = runtime_Semrelease var Runtime_procPin = runtime_procPin var Runtime_procUnpin = runtime_procUnpin // poolDequeue testing. type PoolDequeue interface { PushHead(val any) bool PopHead() (any, bool) PopTail() (any, bool) } func NewPoolDequeue(n int) PoolDequeue { d := &poolDequeue{ vals: make([]eface, n), } // For testing purposes, set the head and tail indexes close // to wrapping around. d.headTail.Store(d.pack(1<<dequeueBits-500, 1<<dequeueBits-500)) return d } func (d *poolDequeue) PushHead(val any) bool { return d.pushHead(val) } func (d *poolDequeue) PopHead() (any, bool) { return d.popHead() } func (d *poolDequeue) PopTail() (any, bool) { return d.popTail() } func NewPoolChain() PoolDequeue { return new(poolChain) } func (c *poolChain) PushHead(val any) bool { c.pushHead(val) return true } func (c *poolChain) PopHead() (any, bool) { return c.popHead() } func (c *poolChain) PopTail() (any, bool) { return c.popTail() }
Close