2009-05-08 16:55:45 -06:00
|
|
|
// Copyright 2009 The Go Authors. All rights reserved.
|
|
|
|
// Use of this source code is governed by a BSD-style
|
|
|
|
// license that can be found in the LICENSE file.
|
|
|
|
|
|
|
|
/*
|
|
|
|
The runtime package contains operations that interact with Go's runtime system,
|
2009-11-17 12:44:15 -07:00
|
|
|
such as functions to control goroutines. It also includes the low-level type information
|
|
|
|
used by the reflect package; see reflect's documentation for the programmable
|
|
|
|
interface to the run-time type system.
|
2009-11-05 16:37:55 -07:00
|
|
|
*/
|
2009-05-08 16:55:45 -06:00
|
|
|
package runtime
|
|
|
|
|
|
|
|
// Gosched yields the processor, allowing other goroutines to run. It does not
|
|
|
|
// suspend the current goroutine, so execution resumes automatically.
|
2009-10-07 12:55:06 -06:00
|
|
|
func Gosched()
|
2009-05-08 16:55:45 -06:00
|
|
|
|
|
|
|
// Goexit terminates the goroutine that calls it. No other goroutine is affected.
|
2009-10-07 12:55:06 -06:00
|
|
|
func Goexit()
|
2009-05-08 16:55:45 -06:00
|
|
|
|
|
|
|
// Breakpoint() executes a breakpoint trap.
|
2009-10-07 12:55:06 -06:00
|
|
|
func Breakpoint()
|
2009-05-08 16:55:45 -06:00
|
|
|
|
|
|
|
// Caller reports file and line number information about function invocations on
|
2010-03-23 21:48:23 -06:00
|
|
|
// the calling goroutine's stack. The argument skip is the number of stack frames to
|
2010-02-16 17:11:11 -07:00
|
|
|
// ascend, with 0 identifying the the caller of Caller. The return values report the
|
2009-05-08 16:55:45 -06:00
|
|
|
// program counter, file name, and line number within the file of the corresponding
|
|
|
|
// call. The boolean ok is false if it was not possible to recover the information.
|
2010-03-23 21:48:23 -06:00
|
|
|
func Caller(skip int) (pc uintptr, file string, line int, ok bool)
|
|
|
|
|
|
|
|
// Callers fills the slice pc with the program counters of function invocations
|
|
|
|
// on the calling goroutine's stack. The argument skip is the number of stack frames
|
|
|
|
// to skip before recording in pc, with 0 starting at the caller of Caller.
|
|
|
|
// It returns the number of entries written to pc.
|
|
|
|
func Callers(skip int, pc []int) int
|
2009-07-13 18:28:39 -06:00
|
|
|
|
2010-03-24 10:40:09 -06:00
|
|
|
// FuncForPC returns a *Func describing the function that contains the
|
|
|
|
// given program counter address, or else nil.
|
|
|
|
func FuncForPC(pc uintptr) *Func
|
|
|
|
|
|
|
|
// NOTE(rsc): Func must match struct Func in runtime.h
|
|
|
|
|
|
|
|
// Func records information about a function in the program,
|
|
|
|
// in particular the mapping from program counters to source
|
|
|
|
// line numbers within that function.
|
|
|
|
type Func struct {
|
|
|
|
name string
|
|
|
|
typ string
|
|
|
|
src string
|
|
|
|
pcln []byte
|
|
|
|
entry uintptr
|
|
|
|
pc0 uintptr
|
|
|
|
ln0 int32
|
|
|
|
frame int32
|
|
|
|
args int32
|
|
|
|
locals int32
|
|
|
|
}
|
|
|
|
|
|
|
|
// Name returns the name of the function.
|
|
|
|
func (f *Func) Name() string { return f.name }
|
|
|
|
|
|
|
|
// Entry returns the entry address of the function.
|
|
|
|
func (f *Func) Entry() uintptr { return f.entry }
|
|
|
|
|
|
|
|
// FileLine returns the file name and line number of the
|
|
|
|
// source code corresponding to the program counter pc.
|
|
|
|
// The result will not be accurate if pc is not a program
|
|
|
|
// counter within f.
|
|
|
|
func (f *Func) FileLine(pc uintptr) (file string, line int) {
|
|
|
|
// NOTE(rsc): If you edit this function, also edit
|
|
|
|
// symtab.c:/^funcline.
|
|
|
|
const PcQuant = 1
|
|
|
|
|
|
|
|
p := f.pcln
|
|
|
|
pc1 := f.pc0
|
|
|
|
line = int(f.ln0)
|
|
|
|
file = f.src
|
|
|
|
for i := 0; i < len(p) && pc1 <= pc; i++ {
|
|
|
|
switch {
|
|
|
|
case p[i] == 0:
|
|
|
|
line += int(p[i+1]<<24) | int(p[i+2]<<16) | int(p[i+3]<<8) | int(p[i+4])
|
|
|
|
i += 4
|
|
|
|
case p[i] <= 64:
|
|
|
|
line += int(p[i])
|
|
|
|
case p[i] <= 128:
|
|
|
|
line += int(p[i] - 64)
|
|
|
|
default:
|
|
|
|
line += PcQuant * int(p[i]-129)
|
|
|
|
}
|
|
|
|
pc += PcQuant
|
|
|
|
}
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
2009-07-13 18:28:39 -06:00
|
|
|
// mid returns the current os thread (m) id.
|
|
|
|
func mid() uint32
|
|
|
|
|
|
|
|
// LockOSThread wires the calling goroutine to its current operating system thread.
|
|
|
|
// Until the calling goroutine exits or calls UnlockOSThread, it will always
|
|
|
|
// execute in that thread, and no other goroutine can.
|
|
|
|
// LockOSThread cannot be used during init functions.
|
|
|
|
func LockOSThread()
|
|
|
|
|
|
|
|
// UnlockOSThread unwires the calling goroutine from its fixed operating system thread.
|
|
|
|
// If the calling goroutine has not called LockOSThread, UnlockOSThread is a no-op.
|
|
|
|
func UnlockOSThread()
|
|
|
|
|
2009-08-06 14:07:05 -06:00
|
|
|
// GOMAXPROCS sets the maximum number of CPUs that can be executing
|
|
|
|
// simultaneously. This call will go away when the scheduler improves.
|
|
|
|
func GOMAXPROCS(n int)
|
2009-08-25 16:37:22 -06:00
|
|
|
|
|
|
|
// Cgocalls returns the number of cgo calls made by the current process.
|
|
|
|
func Cgocalls() int64
|
2009-10-15 18:46:53 -06:00
|
|
|
|
|
|
|
// Semacquire waits until *s > 0 and then atomically decrements it.
|
|
|
|
// It is intended as a simple sleep primitive for use by the synchronization
|
|
|
|
// library and should not be used directly.
|
|
|
|
func Semacquire(s *uint32)
|
|
|
|
|
|
|
|
// Semrelease atomically increments *s and notifies a waiting goroutine
|
|
|
|
// if one is blocked in Semacquire.
|
|
|
|
// It is intended as a simple wakeup primitive for use by the synchronization
|
|
|
|
// library and should not be used directly.
|
|
|
|
func Semrelease(s *uint32)
|
2009-12-15 19:21:29 -07:00
|
|
|
|
|
|
|
// Sigrecv returns a bitmask of signals that have arrived since the last call to Sigrecv.
|
|
|
|
// It blocks until at least one signal arrives.
|
|
|
|
func Sigrecv() uint32
|
|
|
|
|
|
|
|
// Signame returns a string describing the signal, or "" if the signal is unknown.
|
|
|
|
func Signame(sig int32) string
|
2009-12-16 21:20:50 -07:00
|
|
|
|
|
|
|
// Siginit enables receipt of signals via Sigrecv. It should typically
|
|
|
|
// be called during initialization.
|
|
|
|
func Siginit()
|
2010-02-03 17:31:34 -07:00
|
|
|
|
2010-02-07 02:20:44 -07:00
|
|
|
type MemStatsType struct {
|
2010-02-03 17:31:34 -07:00
|
|
|
Alloc uint64
|
2010-02-08 15:32:22 -07:00
|
|
|
TotalAlloc uint64
|
2010-02-03 17:31:34 -07:00
|
|
|
Sys uint64
|
|
|
|
Stacks uint64
|
|
|
|
InusePages uint64
|
|
|
|
NextGC uint64
|
2010-03-08 15:15:44 -07:00
|
|
|
HeapAlloc uint64
|
2010-02-03 17:31:34 -07:00
|
|
|
Lookups uint64
|
|
|
|
Mallocs uint64
|
2010-02-08 15:32:22 -07:00
|
|
|
PauseNs uint64
|
|
|
|
NumGC uint32
|
2010-02-03 17:31:34 -07:00
|
|
|
EnableGC bool
|
2010-02-08 15:32:22 -07:00
|
|
|
DebugGC bool
|
|
|
|
BySize [67]struct {
|
|
|
|
Size uint32
|
|
|
|
Mallocs uint64
|
|
|
|
Frees uint64
|
|
|
|
}
|
2010-02-03 17:31:34 -07:00
|
|
|
}
|
|
|
|
|
2010-02-07 02:20:44 -07:00
|
|
|
// MemStats holds statistics about the memory system.
|
|
|
|
// The statistics are only approximate, as they are not interlocked on update.
|
|
|
|
var MemStats MemStatsType
|
|
|
|
|
2010-02-03 17:31:34 -07:00
|
|
|
// Alloc allocates a block of the given size.
|
|
|
|
// FOR TESTING AND DEBUGGING ONLY.
|
|
|
|
func Alloc(uintptr) *byte
|
|
|
|
|
|
|
|
// Free frees the block starting at the given pointer.
|
|
|
|
// FOR TESTING AND DEBUGGING ONLY.
|
|
|
|
func Free(*byte)
|
|
|
|
|
|
|
|
// Lookup returns the base and size of the block containing the given pointer.
|
|
|
|
// FOR TESTING AND DEBUGGING ONLY.
|
|
|
|
func Lookup(*byte) (*byte, uintptr)
|
|
|
|
|
|
|
|
// GC runs a garbage collection.
|
|
|
|
func GC()
|
|
|
|
|
|
|
|
// SetFinalizer sets the finalizer associated with x to f.
|
|
|
|
// When the garbage collector finds an unreachable block
|
|
|
|
// with an associated finalizer, it clears the association and creates
|
|
|
|
// a new goroutine running f(x). Creating the new goroutine makes
|
|
|
|
// x reachable again, but now without an associated finalizer.
|
|
|
|
// Assuming that SetFinalizer is not called again, the next time
|
|
|
|
// the garbage collector sees that x is unreachable, it will free x.
|
|
|
|
//
|
|
|
|
// SetFinalizer(x, nil) clears any finalizer associated with f.
|
|
|
|
//
|
|
|
|
// The argument x must be a pointer to an object allocated by
|
|
|
|
// calling new or by taking the address of a composite literal.
|
|
|
|
// The argument f must be a function that takes a single argument
|
|
|
|
// of x's type and returns no arguments. If either of these is not
|
|
|
|
// true, SetFinalizer aborts the program.
|
|
|
|
//
|
|
|
|
// Finalizers are run in dependency order: if A points at B, both have
|
|
|
|
// finalizers, and they are otherwise unreachable, only the finalizer
|
|
|
|
// for A runs; once A is freed, the finalizer for B can run.
|
|
|
|
// If a cyclic structure includes a block with a finalizer, that
|
|
|
|
// cycle is not guaranteed to be garbage collected and the finalizer
|
|
|
|
// is not guaranteed to run, because there is no ordering that
|
|
|
|
// respects the dependencies.
|
|
|
|
//
|
|
|
|
// The finalizer for x is scheduled to run at some arbitrary time after
|
|
|
|
// x becomes unreachable.
|
|
|
|
// There is no guarantee that finalizers will run before a program exits,
|
|
|
|
// so typically they are useful only for releasing non-memory resources
|
|
|
|
// associated with an object during a long-running program.
|
|
|
|
// For example, an os.File object could use a finalizer to close the
|
|
|
|
// associated operating system file descriptor when a program discards
|
|
|
|
// an os.File without calling Close, but it would be a mistake
|
|
|
|
// to depend on a finalizer to flush an in-memory I/O buffer such as a
|
|
|
|
// bufio.Writer, because the buffer would not be flushed at program exit.
|
|
|
|
//
|
|
|
|
// TODO(rsc): make os.File use SetFinalizer
|
|
|
|
// TODO(rsc): allow f to have (ignored) return values
|
|
|
|
//
|
|
|
|
func SetFinalizer(x, f interface{})
|
2010-03-17 00:10:33 -06:00
|
|
|
|
|
|
|
func getgoroot() string
|
|
|
|
|
|
|
|
// GOROOT returns the root of the Go tree.
|
|
|
|
// It uses the GOROOT environment variable, if set,
|
|
|
|
// or else the root used during the Go build.
|
|
|
|
func GOROOT() string {
|
|
|
|
s := getgoroot()
|
|
|
|
if s != "" {
|
|
|
|
return s
|
|
|
|
}
|
|
|
|
return defaultGoroot
|
|
|
|
}
|
|
|
|
|
|
|
|
// Version returns the Go tree's version string.
|
|
|
|
// It is either a sequence number or, when possible,
|
|
|
|
// a release tag like "release.2010-03-04".
|
|
|
|
// A trailing + indicates that the tree had local modifications
|
|
|
|
// at the time of the build.
|
|
|
|
func Version() string { return defaultVersion }
|
2010-03-23 21:48:23 -06:00
|
|
|
|
2010-03-24 10:40:09 -06:00
|
|
|
// MemProfileRate controls the fraction of memory allocations
|
|
|
|
// that are recorded and reported in the memory profile.
|
|
|
|
// The profiler aims to sample an average of
|
|
|
|
// one allocation per MemProfileRate bytes allocated.
|
|
|
|
//
|
|
|
|
// To include every allocated block in the profile, set MemProfileRate to 1.
|
|
|
|
// To turn off profiling entirely, set MemProfileRate to 0.
|
|
|
|
//
|
|
|
|
// The tools that process the memory profiles assume that the
|
|
|
|
// profile rate is constant across the lifetime of the program
|
|
|
|
// and equal to the current value. Programs that change the
|
|
|
|
// memory profiling rate should do so just once, as early as
|
|
|
|
// possible in the execution of the program (for example,
|
|
|
|
// at the beginning of main).
|
|
|
|
var MemProfileRate int = 512 * 1024
|
|
|
|
|
|
|
|
// A MemProfileRecord describes the live objects allocated
|
|
|
|
// by a particular call sequence (stack trace).
|
|
|
|
type MemProfileRecord struct {
|
|
|
|
AllocBytes, FreeBytes int64 // number of bytes allocated, freed
|
|
|
|
AllocObjects, FreeObjects int64 // number of objects allocated, freed
|
|
|
|
Stack0 [32]uintptr // stack trace for this record; ends at first 0 entry
|
|
|
|
}
|
2010-03-23 21:48:23 -06:00
|
|
|
|
2010-03-24 10:40:09 -06:00
|
|
|
// InUseBytes returns the number of bytes in use (AllocBytes - FreeBytes).
|
|
|
|
func (r *MemProfileRecord) InUseBytes() int64 { return r.AllocBytes - r.FreeBytes }
|
2010-03-23 21:48:23 -06:00
|
|
|
|
2010-03-24 10:40:09 -06:00
|
|
|
// InUseObjects returns the number of objects in use (AllocObjects - FreeObjects).
|
|
|
|
func (r *MemProfileRecord) InUseObjects() int64 {
|
|
|
|
return r.AllocObjects - r.FreeObjects
|
|
|
|
}
|
|
|
|
|
|
|
|
// Stack returns the stack trace associated with the record,
|
|
|
|
// a prefix of r.Stack0.
|
|
|
|
func (r *MemProfileRecord) Stack() []uintptr {
|
|
|
|
for i, v := range r.Stack0 {
|
|
|
|
if v == 0 {
|
|
|
|
return r.Stack0[0:i]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return r.Stack0[0:]
|
|
|
|
}
|
|
|
|
|
|
|
|
// MemProfile returns n, the number of records in the current memory profile.
|
|
|
|
// If len(p) >= n, MemProfile copies the profile into p and returns n, true.
|
|
|
|
// If len(p) < n, MemProfile does not change p and returns n, false.
|
|
|
|
//
|
|
|
|
// If inuseZero is true, the profile includes allocation records
|
|
|
|
// where r.AllocBytes > 0 but r.AllocBytes == r.FreeBytes.
|
|
|
|
// These are sites where memory was allocated, but it has all
|
|
|
|
// been released back to the runtime.
|
|
|
|
func MemProfile(p []MemProfileRecord, inuseZero bool) (n int, ok bool)
|