OXIESEC PANEL
- Current Dir:
/
/
opt
/
golang
/
1.19.4
/
src
/
sync
Server IP: 2a02:4780:11:1084:0:327f:3464:10
Upload:
Create Dir:
Name
Size
Modified
Perms
📁
..
-
12/01/2022 06:13:58 PM
rwxr-xr-x
📁
atomic
-
12/01/2022 06:13:56 PM
rwxr-xr-x
📄
cond.go
3.49 KB
12/01/2022 06:13:00 PM
rw-r--r--
📄
cond_test.go
5.07 KB
12/01/2022 06:13:00 PM
rw-r--r--
📄
example_pool_test.go
1017 bytes
12/01/2022 06:13:00 PM
rw-r--r--
📄
example_test.go
1.13 KB
12/01/2022 06:13:00 PM
rw-r--r--
📄
export_test.go
1.2 KB
12/01/2022 06:13:00 PM
rw-r--r--
📄
map.go
11.86 KB
12/01/2022 06:13:00 PM
rw-r--r--
📄
map_bench_test.go
6.29 KB
12/01/2022 06:13:00 PM
rw-r--r--
📄
map_reference_test.go
3.53 KB
12/01/2022 06:13:00 PM
rw-r--r--
📄
map_test.go
5.69 KB
12/01/2022 06:13:00 PM
rw-r--r--
📄
mutex.go
8.27 KB
12/01/2022 06:13:00 PM
rw-r--r--
📄
mutex_test.go
5.94 KB
12/01/2022 06:13:00 PM
rw-r--r--
📄
once.go
2.43 KB
12/01/2022 06:13:00 PM
rw-r--r--
📄
once_test.go
1.1 KB
12/01/2022 06:13:00 PM
rw-r--r--
📄
pool.go
8.77 KB
12/01/2022 06:13:00 PM
rw-r--r--
📄
pool_test.go
7.72 KB
12/01/2022 06:13:00 PM
rw-r--r--
📄
poolqueue.go
8.8 KB
12/01/2022 06:13:00 PM
rw-r--r--
📄
runtime.go
1.97 KB
12/01/2022 06:13:00 PM
rw-r--r--
📄
runtime2.go
465 bytes
12/01/2022 06:13:00 PM
rw-r--r--
📄
runtime2_lockrank.go
546 bytes
12/01/2022 06:13:00 PM
rw-r--r--
📄
runtime_sema_test.go
1.34 KB
12/01/2022 06:13:00 PM
rw-r--r--
📄
rwmutex.go
6.61 KB
12/01/2022 06:13:00 PM
rw-r--r--
📄
rwmutex_test.go
4.89 KB
12/01/2022 06:13:00 PM
rw-r--r--
📄
waitgroup.go
4.83 KB
12/01/2022 06:13:00 PM
rw-r--r--
📄
waitgroup_test.go
3.01 KB
12/01/2022 06:13:00 PM
rw-r--r--
Editing: export_test.go
Close
// 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 = 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() }