- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 349 for nelem (0.08 sec)
-
src/cmd/vendor/golang.org/x/sys/unix/mkerrors.sh
printf("var errorList = [...]struct {\n"); printf("\tnum syscall.Errno\n"); printf("\tname string\n"); printf("\tdesc string\n"); printf("} {\n"); qsort(errors, nelem(errors), sizeof errors[0], tuplecmp); for(i=0; i<nelem(errors); i++) { e = errors[i].num; if(i > 0 && errors[i-1].num == e) continue; strncpy(buf, strerror(e), sizeof(buf) - 1); buf[sizeof(buf) - 1] = '\0';
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 20.2K bytes - Viewed (0) -
src/runtime/cgo/libcgo.h
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. #include <stdint.h> #include <stdlib.h> #include <stdio.h> #undef nil #define nil ((void*)0) #define nelem(x) (sizeof(x)/sizeof((x)[0])) typedef uint32_t uint32; typedef uint64_t uint64; typedef uintptr_t uintptr; /* * The beginning of the per-goroutine structure, * as defined in ../pkg/runtime/runtime.h.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Feb 13 20:50:04 UTC 2024 - 3.5K bytes - Viewed (0) -
src/runtime/mheap.go
// then object n is free; // otherwise, object n is allocated. Bits starting at nelem are // 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
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:31:00 UTC 2024 - 78K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/ssa.go
s.Fatalf("expected pointer type: %v", n.Type()) } elem, rtypeExpr := n.Type().Elem(), n.ElemRType if count != nil { if !elem.IsArray() { s.Fatalf("expected array type: %v", elem) } elem, rtypeExpr = elem.Elem(), n.ElemElemRType } size := elem.Size() // Casting from larger type to smaller one is ok, so for smallest type, do nothing. if elem.Alignment() == 1 && (size == 0 || size == 1 || count == nil) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 284.9K bytes - Viewed (0) -
src/embed/embed.go
// q/s/u // q/v // w // // is actually sorted as: // // p # dir=. elem=p // q/ # dir=. elem=q // w/ # dir=. elem=w // q/r # dir=q elem=r // q/s/ # dir=q elem=s // q/v # dir=q elem=v // q/s/t # dir=q/s elem=t // q/s/u # dir=q/s elem=u // // This order brings directory contents together in contiguous sections
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 19:42:51 UTC 2024 - 13.5K bytes - Viewed (0) -
src/testing/fstest/mapfs.go
for fname, f := range fsys { if strings.HasPrefix(fname, prefix) { felem := fname[len(prefix):] i := strings.Index(felem, "/") if i < 0 { list = append(list, mapFileInfo{felem, f}) } else { need[fname[len(prefix):len(prefix)+i]] = true } } } // If the directory name is not in the map, // and there are no children of the name in the map, // then the directory is treated as not existing.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 7.1K bytes - Viewed (0) -
src/runtime/mgcsweep.go
// more detail. print("runtime: nelems=", s.nelems, " nalloc=", nalloc, " previous allocCount=", s.allocCount, " nfreed=", nfreed, "\n") throw("sweep increased allocation count") } s.allocCount = nalloc s.freeindex = 0 // reset allocation index to start of span. s.freeIndexForScan = 0 if traceEnabled() { getg().m.p.ptr().trace.reclaimed += uintptr(nfreed) * s.elemsize }
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/runtime/debug/mod.go
newline = "\n" tab = "\t" ) readModuleLine := func(elem []string) (Module, error) { if len(elem) != 2 && len(elem) != 3 { return Module{}, fmt.Errorf("expected 2 or 3 columns; got %d", len(elem)) } version := elem[1] sum := "" if len(elem) == 3 { sum = elem[2] } return Module{ Path: elem[0], Version: version, Sum: sum, }, nil }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 25 15:06:51 UTC 2023 - 7.6K bytes - Viewed (0) -
schema/utils.go
Registered: Wed Jun 12 16:27:09 UTC 2024 - Last Modified: Sat Aug 19 13:35:14 UTC 2023 - 5.5K bytes - Viewed (0) -
src/runtime/mbitmap.go
} return tp } // Move up elem and addr. // Offsets within an element are always at a ptrBits*goarch.PtrSize boundary. if n >= tp.typ.Size_ { // elem needs to be moved to the element containing // tp.addr + n. oldelem := tp.elem tp.elem += (tp.addr - tp.elem + n) / tp.typ.Size_ * tp.typ.Size_ tp.addr = tp.elem + alignDown(n-(tp.elem-oldelem), ptrBits*goarch.PtrSize) } else {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:18:55 UTC 2024 - 60K bytes - Viewed (0)