- Sort Score
- Result 10 results
- Languages All
Results 1 - 4 of 4 for newElems (0.14 sec)
-
src/runtime/malloc.go
freeIndex := s.nextFreeIndex() if freeIndex == s.nelems { // The span is full. if s.allocCount != s.nelems { println("runtime: s.allocCount=", s.allocCount, "s.nelems=", s.nelems) throw("s.allocCount != s.nelems && freeIndex == s.nelems") } c.refill(spc) shouldhelpgc = true s = c.alloc[spc] freeIndex = s.nextFreeIndex() } if freeIndex >= s.nelems { throw("freeIndex is not valid") }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 59.6K bytes - Viewed (0) -
src/runtime/mheap.go
// undefined and should never be referenced. // // Object n starts at address n*elemsize + (start << pageShift). freeindex uint16 // TODO: Look up nelems from sizeclass and remove this field if it // helps performance. nelems uint16 // number of object in the span. // freeIndexForScan is like freeindex, except that freeindex is // used by the allocator whereas freeIndexForScan is used by the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:31:00 UTC 2024 - 78K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/registry/generic/registry/store.go
if err != nil { return nil, err } newItems, err := meta.ExtractList(listObj) if err != nil { return nil, err } items = append(items, newItems...) for i := 0; i < len(newItems); i++ { select { case toProcess <- newItems[i]: case <-workersExited:
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Jan 19 23:22:44 UTC 2024 - 60.8K bytes - Viewed (0) -
src/runtime/mbitmap.go
// faster if profiling warrants it. func (s *mspan) nextFreeIndex() uint16 { sfreeindex := s.freeindex snelems := s.nelems if sfreeindex == snelems { return sfreeindex } if sfreeindex > snelems { throw("s.freeindex > s.nelems") } aCache := s.allocCache bitIndex := sys.TrailingZeros64(aCache) for bitIndex == 64 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:18:55 UTC 2024 - 60K bytes - Viewed (0)