- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 2,556 for free1 (0.04 sec)
-
src/runtime/mpallocbits.go
func (b *pallocBits) allocAll() { (*pageBits)(b).setAll() } // free1 frees a single page in the pallocBits at i. func (b *pallocBits) free1(i uint) { (*pageBits)(b).clear(i) } // free frees the range [i, i+n) of pages in the pallocBits. func (b *pallocBits) free(i, n uint) { (*pageBits)(b).clearRange(i, n) } // freeAll frees all the bits of b. func (b *pallocBits) freeAll() { (*pageBits)(b).clearAll()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat May 18 15:13:43 UTC 2024 - 12.5K bytes - Viewed (0) -
src/runtime/mpagecache.go
for i := uint(0); i < 64; i++ { if c.cache&(1<<i) != 0 { p.chunkOf(ci).free1(pi + i) // Update density statistics. p.scav.index.free(ci, pi+i, 1) } if c.scav&(1<<i) != 0 { p.chunkOf(ci).scavenged.setRange(pi+i, 1) } } // Since this is a lot like a free, we need to make sure // we update the searchAddr just like free does. if b := (offAddr{c.base}); b.lessThan(p.searchAddr) { p.searchAddr = b
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 19 14:30:00 UTC 2023 - 5.6K bytes - Viewed (0) -
src/runtime/mpagealloc_test.go
} tests := map[string]struct { before map[ChunkIdx][]BitRange after map[ChunkIdx][]BitRange npages uintptr frees []uintptr }{ "Free1": { npages: 1, before: map[ChunkIdx][]BitRange{ BaseChunkIdx: {{0, PallocChunkPages}}, }, frees: []uintptr{ PageBase(BaseChunkIdx, 0), PageBase(BaseChunkIdx, 1), PageBase(BaseChunkIdx, 2), PageBase(BaseChunkIdx, 3),
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Dec 06 19:16:48 UTC 2021 - 32.6K bytes - Viewed (0) -
src/runtime/mpagealloc.go
p.chunkOf(sc).free(si, pallocChunkPages-si) p.scav.index.free(sc, si, pallocChunkPages-si) for c := sc + 1; c < ec; c++ { p.chunkOf(c).freeAll() p.scav.index.free(c, 0, pallocChunkPages) } p.chunkOf(ec).free(0, ei+1) p.scav.index.free(ec, 0, ei+1) } } p.update(base, npages, true, false) } const ( pallocSumBytes = unsafe.Sizeof(pallocSum(0))
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 39.2K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/internal/typeparams/free.go
import ( "go/types" "golang.org/x/tools/internal/aliases" ) // Free is a memoization of the set of free type parameters within a // type. It makes a sequence of calls to [Free.Has] for overlapping // types more efficient. The zero value is ready for use. // // NOTE: Adapted from go/types/infer.go. If it is later exported, factor. type Free struct { seen map[types.Type]bool }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 02:20:05 UTC 2024 - 2.7K bytes - Viewed (0) -
cmd/xl-storage-free-version_test.go
fatalErr(err) // At this point the version stack must look as below, // v3 --> free version 00000000-0000-0000-0000-0000000000f2 (from removal of null version) // v2 --> free version 00000000-0000-0000-0000-0000000000f1 (from overwriting of null version ) // v1 --> non-free version 00000000-0000-0000-0000-000000000001 // Check number of free-versions freeVersions, err := xl.listFreeVersions(newtierfi.Volume, newtierfi.Name)
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Sat Mar 02 05:11:03 UTC 2024 - 7.8K bytes - Viewed (0) -
cmd/xl-storage-free-version.go
// Copyright (c) 2015-2021 MinIO, Inc. // // This file is part of MinIO Object Storage stack // // This program is free software: you can redistribute it and/or modify // it under the terms of the GNU Affero General Public License as published by // the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // // This program is distributed in the hope that it will be useful
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Sat Mar 02 05:11:03 UTC 2024 - 3.4K bytes - Viewed (0) -
src/runtime/mstats.go
Lookups uint64 // Mallocs is the cumulative count of heap objects allocated. // The number of live objects is Mallocs - Frees. Mallocs uint64 // Frees is the cumulative count of heap objects freed. Frees uint64 // Heap memory statistics. // // Interpreting the heap statistics requires some knowledge of // how Go organizes memory. Go divides the virtual address
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 08 21:03:13 UTC 2024 - 34.2K bytes - Viewed (0) -
src/runtime/mgcsweep.go
// objects, because a fresh span that had been allocated into, // wasn't totally filled, but then swept, still has all of its // free slots zeroed. s.needzero = 1 stats := memstats.heapStats.acquire() atomic.Xadd64(&stats.smallFreeCount[spc.sizeclass()], int64(nfreed)) memstats.heapStats.release() // Count the frees in the inconsistent, internal stats.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:52:18 UTC 2024 - 32.9K bytes - Viewed (0) -
src/cmd/cgo/internal/testsanitizers/testdata/arena_fail.go
import "arena" func main() { a := arena.NewArena() x := arena.New[[200]byte](a) x[0] = 9 a.Free() // Use after free. // // ASAN should detect this deterministically as Free // should poison the arena memory. // // MSAN should detect that this access is to freed // memory. This may crash with an "accessed freed arena // memory" error before MSAN gets a chance, but if MSAN
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 12 11:59:56 UTC 2023 - 700 bytes - Viewed (0)