- Sort Score
- Result 10 results
- Languages All
Results 131 - 140 of 815 for fslock (0.11 sec)
-
src/cmd/compile/internal/ssagen/phi.go
stk = append(stk, stackEntry{b: c}) } } } // domBlock contains extra per-block information to record the dominator tree. type domBlock struct { firstChild *ssa.Block // first child of block in dominator tree sibling *ssa.Block // next child of parent in dominator tree } // A block heap is used as a priority queue to implement the PiggyBank
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 15.2K bytes - Viewed (0) -
pkg/kubelet/util/node_startup_latency_tracker.go
bootTime: bootTime, kubeletStartTime: time.Now(), clock: clock.RealClock{}, } } func (n *basicNodeStartupLatencyTracker) RecordAttemptRegisterNode() { n.lock.Lock() defer n.lock.Unlock() if !n.firstRegistrationAttemptTime.IsZero() { return } n.firstRegistrationAttemptTime = n.clock.Now() } func (n *basicNodeStartupLatencyTracker) RecordRegisteredNewNode() {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Sep 11 05:54:25 UTC 2023 - 2.8K bytes - Viewed (0) -
subprojects/core/src/testFixtures/groovy/org/gradle/util/ports/AbstractAvailablePortAllocator.groovy
public int assignPort() { try { lock.lock() return reservePort() } finally { lock.unlock() } } @Override public void releasePort(int port) { if (port == null || port < MIN_PRIVATE_PORT || port > MAX_PRIVATE_PORT) { return } try { lock.lock() for (int i = 0; i < reservations.size(); i++) {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Apr 05 16:58:31 UTC 2022 - 3.1K bytes - Viewed (0) -
pkg/ledger/smt.go
func (s *smt) Update(keys, values [][]byte) ([]byte, error) { s.lock.Lock() defer s.lock.Unlock() s.atomicUpdate = true ch := make(chan result, 1) s.update(s.Root(), keys, values, nil, 0, s.trieHeight, false, true, ch) result := <-ch if result.err != nil { return nil, result.err } s.rootMu.Lock() defer s.rootMu.Unlock() if len(result.update) != 0 { s.root = result.update[:hashLength]
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue Aug 08 16:43:05 UTC 2023 - 14K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/lca.go
type lcaRange struct { // Additional information about each block (indexed by block ID). blocks []lcaRangeBlock // Data structure for range minimum queries. // rangeMin[k][i] contains the ID of the minimum depth block // in the Euler tour from positions i to i+1<<k-1, inclusive. rangeMin [][]ID } type lcaRangeBlock struct { b *Block
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 30 21:52:15 UTC 2023 - 3.8K bytes - Viewed (0) -
security/pkg/nodeagent/sds/sdsservice.go
w.Lock() defer w.Unlock() w.watch = nil } func (w *Watch) GetWatchedResource(string) *xds.WatchedResource { w.Lock() defer w.Unlock() return w.watch } func (w *Watch) NewWatchedResource(typeURL string, names []string) { w.Lock() defer w.Unlock() w.watch = &xds.WatchedResource{TypeUrl: typeURL, ResourceNames: names} }
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Sat May 25 00:20:04 UTC 2024 - 10.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/phiopt.go
// // In this case we can also replace x with a copy of c. // // The optimization idea: // 1. block b has a phi value x, x = OpPhi (ConstBool [true]) (ConstBool [false]), // and len(b.Preds) is equal to 2. // 2. find the common dominator(b0) of the predecessors(pb0, pb1) of block b, and the // dominator(b0) is a If block. // Special case: one of the predecessors(pb0 or pb1) is the dominator(b0).
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 8.1K bytes - Viewed (0) -
src/vendor/golang.org/x/net/idna/tables15.0.0.go
0x21bc: 0x0040, 0x21bd: 0x0040, 0x21be: 0x0040, 0x21bf: 0x0040, } // idnaIndex: 39 blocks, 2496 entries, 4992 bytes // Block 0 is the zero block. var idnaIndex = [2496]uint16{ // Block 0x0, offset 0x0 // Block 0x1, offset 0x40 // Block 0x2, offset 0x80 // Block 0x3, offset 0xc0 0xc2: 0x01, 0xc3: 0x85, 0xc4: 0x02, 0xc5: 0x03, 0xc6: 0x04, 0xc7: 0x05,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 297.4K bytes - Viewed (0) -
hack/tools/go.mod
github.com/go-toolsmith/typep v1.1.0 // indirect github.com/go-viper/mapstructure/v2 v2.0.0-alpha.1 // indirect github.com/go-xmlfmt/xmlfmt v1.1.2 // indirect github.com/gobwas/glob v0.2.3 // indirect github.com/gofrs/flock v0.8.1 // indirect github.com/golang/protobuf v1.5.3 // indirect github.com/golangci/check v0.0.0-20180506172741-cfe4005ccda2 // indirect github.com/golangci/dupl v0.0.0-20180902072040-3e9179ac440a // indirect
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Mar 07 08:12:16 UTC 2024 - 10.1K bytes - Viewed (0) -
src/crypto/x509/example_test.go
yecLk/4L1W0l6jQQZnWErXZYe0PNFcmwGXy1Rep83kfBRNKRy5tvocalLlwXLdUk AIU+2GKjyT3iMuzZxxFxPFMCAwEAAQ== -----END PUBLIC KEY-----` block, _ := pem.Decode([]byte(pubPEM)) if block == nil { panic("failed to parse PEM block containing the public key") } pub, err := x509.ParsePKIXPublicKey(block.Bytes) if err != nil { panic("failed to parse DER encoded public key: " + err.Error()) } switch pub := pub.(type) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jul 29 16:52:01 UTC 2019 - 5.3K bytes - Viewed (0)