- Sort Score
- Result 10 results
- Languages All
Results 161 - 170 of 1,018 for Allocate (0.22 sec)
-
src/slices/slices.go
if len(s2) < len(s) { clear(s[len(s2):]) // zero/nil out the obsolete elements, for GC } return s2 } tot := len(s[:i]) + len(v) + len(s[j:]) if tot > cap(s) { // Too big to fit, allocate and copy over. s2 := append(s[:i], make(S, tot-i)...) // See Insert copy(s2[i:], v) copy(s2[i+len(v):], s[j:]) return s2 } r := s[:tot] if i+len(v) <= j {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 29 14:01:59 UTC 2024 - 13.6K bytes - Viewed (0) -
platforms/core-execution/hashing/src/main/java/org/gradle/internal/hash/Hashing.java
throw new AssertionError(e); } } } private static class MessageDigestHasher implements PrimitiveHasher { private final ByteBuffer buffer = ByteBuffer.allocate(8).order(ByteOrder.LITTLE_ENDIAN); private MessageDigest digest; public MessageDigestHasher(MessageDigest digest) { this.digest = digest; }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Apr 26 16:02:30 UTC 2024 - 12.3K bytes - Viewed (0) -
src/runtime/sigqueue.go
// license that can be found in the LICENSE file. // This file implements runtime support for signal handling. // // Most synchronization primitives are not available from // the signal handler (it cannot block, allocate memory, or use locks) // so the handler communicates with a processing goroutine // via struct sig, below. // // sigsend is called by the signal handler to queue a new signal.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 7.6K bytes - Viewed (0) -
src/runtime/map.go
// For hint < 0 overLoadFactor returns false since hint < bucketCnt. B := uint8(0) for overLoadFactor(hint, B) { B++ } h.B = B // allocate initial hash table // if B == 0, the buckets field is allocated lazily later (in mapassign) // If hint is large zeroing this memory could take a while. if h.B != 0 { var nextOverflow *bmap h.buckets, nextOverflow = makeBucketArray(t, h.B, nil)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 57.6K bytes - Viewed (0) -
src/runtime/os_linux.go
// Called on the parent thread (main thread in case of bootstrap), can allocate memory. func mpreinit(mp *m) { mp.gsignal = malg(32 * 1024) // Linux wants >= 2K mp.gsignal.m = mp } func gettid() uint32 // Called to initialize a new m (including the bootstrap m). // Called on the new thread, cannot allocate memory. func minit() { minitSignals()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 25.9K bytes - Viewed (0) -
src/runtime/malloc_test.go
// by atomically accessing the first 64-bit // value of a tiny-allocated object. // See issue 37262 for details. // GC twice, once to reach a stable heap state // and again to make sure we finish the sweep phase. runtime.GC() runtime.GC() // Disable preemption so we stay on one P's tiny allocator and // nothing else allocates from it. runtime.Acquirem()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Sep 05 23:35:29 UTC 2023 - 10.6K bytes - Viewed (0) -
src/mime/multipart/formdata.go
if _, err := file.Write(b.Bytes()); err != nil { return nil, err } if copyBuf == nil { copyBuf = make([]byte, 32*1024) // same buffer size as io.Copy uses } // os.File.ReadFrom will allocate its own copy buffer if we let io.Copy use it. type writerOnly struct{ io.Writer } remainingSize, err := io.CopyBuffer(writerOnly{file}, p, copyBuf) if err != nil { return nil, err }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 21 16:12:35 UTC 2024 - 7.7K bytes - Viewed (0) -
internal/lock/lock_windows.go
// path unmodified. // // See https://msdn.microsoft.com/en-us/library/windows/desktop/aa365247(v=vs.85).aspx#maxpath func fixLongPath(path string) string { // Do nothing (and don't allocate) if the path is "short". // Empirically (at least on the Windows Server 2013 builder), // the kernel is arbitrarily okay with < 248 bytes. That // matches what the docs above say:
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Wed Oct 18 18:08:15 UTC 2023 - 7.9K bytes - Viewed (0) -
src/runtime/export_test.go
// Initialize the metrics beforehand because this could // allocate and skew the stats. metricsLock() initMetrics() systemstack(func() { // Donate the racectx to g0. readMetricsLocked calls into the race detector // via map access. getg().racectx = getg().m.curg.racectx // Read the metrics once before in case it allocates and skews the metrics.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:50:53 UTC 2024 - 46.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/compile.go
{name: "schedule", fn: schedule, required: true}, // schedule values {name: "late nilcheck", fn: nilcheckelim2}, {name: "flagalloc", fn: flagalloc, required: true}, // allocate flags register {name: "regalloc", fn: regalloc, required: true}, // allocate int & float registers + stack slots {name: "loop rotate", fn: loopRotate}, {name: "trim", fn: trim}, // remove empty blocks } // Double-check phase ordering constraints.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 22 14:55:18 UTC 2024 - 18.6K bytes - Viewed (0)