4a2bb7fcb0
This change removes the gccgo-specific hashmap code and replaces it with the hashmap code from the Go 1.7 runtime. The Go 1.7 hashmap code is more efficient, does a better job on details like when to update a key, and provides some support against denial-of-service attacks. The compiler is changed to call the new hashmap functions instead of the old ones. The compiler now tracks which types are reflexive and which require updating when used as a map key, and records the information in map type descriptors. Map_index_expression is simplified. The special case for a map index on the right hand side of a tuple expression has been unnecessary for some time, and is removed. The support for specially marking a map index as an lvalue is removed, in favor of lowering an assignment to a map index into a function call. The long-obsolete support for a map index of a pointer to a map is removed. The __go_new_map_big function (known to the compiler as Runtime::MAKEMAPBIG) is no longer needed, as the new runtime.makemap function takes an int64 hint argument. The old map descriptor type and supporting expression is removed. The compiler was still supporting the long-obsolete syntax `m[k] = 0, false` to delete a value from a map. That is now removed, requiring a change to one of the gccgo-specific tests. The builtin len function applied to a map or channel p is now compiled as `p == nil ? 0 : *(*int)(p)`. The __go_chan_len function (known to the compiler as Runtime::CHAN_LEN) is removed. Support for a shared zero value for maps to large value types is introduced, along the lines of the gc compiler. The zero value is handled as a common variable. The hash function is changed to take a seed argument, changing the runtime hash functions and the compiler-generated hash functions. Unlike the gc compiler, both the hash and equal functions continue to take the type length. Types that can not be compared now store nil for the hash and equal functions, rather than pointing to functions that throw. Interface hash and comparison functions now check explicitly for nil. This matches the gc compiler and permits a simple implementation for ismapkey. The compiler is changed to permit marking struct and array types as incomparable, meaning that they have no hash or equal function. We use this for thunk types, removing the existing special code to avoid generating hash/equal functions for them. The C runtime code adds memclr, memequal, and memmove functions. The hashmap code uses go:linkname comments to make the functions visible, as otherwise the compiler would discard them. The hashmap code comments out the unused reference to the address of the first parameter in the race code, as otherwise the compiler thinks that the parameter escapes and copies it onto the heap. This is probably not needed when we enable escape analysis. Several runtime map tests that ere previously skipped for gccgo are now run. The Go runtime picks up type kind information and stubs. The type kind information causes the generated runtime header file to define some constants, including `empty`, and the C code is adjusted accordingly. A Go-callable version of runtime.throw, that takes a Go string, is added to be called from the hashmap code. Reviewed-on: https://go-review.googlesource.com/29447 * go.go-torture/execute/map-1.go: Replace old map deletion syntax with call to builtin delete function. From-SVN: r240334
248 lines
5.2 KiB
C
248 lines
5.2 KiB
C
// Copyright 2012 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.
|
|
|
|
#include "runtime.h"
|
|
#include "malloc.h"
|
|
#include "go-panic.h"
|
|
|
|
// Code related to defer, panic and recover.
|
|
|
|
uint32 runtime_panicking;
|
|
static Lock paniclk;
|
|
|
|
// Allocate a Defer, usually using per-P pool.
|
|
// Each defer must be released with freedefer.
|
|
Defer*
|
|
runtime_newdefer()
|
|
{
|
|
Defer *d;
|
|
P *p;
|
|
|
|
d = nil;
|
|
p = (P*)runtime_m()->p;
|
|
d = p->deferpool;
|
|
if(d)
|
|
p->deferpool = d->next;
|
|
if(d == nil) {
|
|
// deferpool is empty
|
|
d = runtime_malloc(sizeof(Defer));
|
|
}
|
|
return d;
|
|
}
|
|
|
|
// Free the given defer.
|
|
// The defer cannot be used after this call.
|
|
void
|
|
runtime_freedefer(Defer *d)
|
|
{
|
|
P *p;
|
|
|
|
if(d->special)
|
|
return;
|
|
p = (P*)runtime_m()->p;
|
|
d->next = p->deferpool;
|
|
p->deferpool = d;
|
|
// No need to wipe out pointers in argp/pc/fn/args,
|
|
// because we empty the pool before GC.
|
|
}
|
|
|
|
// Run all deferred functions for the current goroutine.
|
|
// This is noinline for go_can_recover.
|
|
static void __go_rundefer (void) __attribute__ ((noinline));
|
|
static void
|
|
__go_rundefer(void)
|
|
{
|
|
G *g;
|
|
Defer *d;
|
|
|
|
g = runtime_g();
|
|
while((d = g->_defer) != nil) {
|
|
void (*pfn)(void*);
|
|
|
|
g->_defer = d->next;
|
|
pfn = (void (*) (void *))d->pfn;
|
|
d->pfn = 0;
|
|
if (pfn != nil)
|
|
(*pfn)(d->arg);
|
|
runtime_freedefer(d);
|
|
}
|
|
}
|
|
|
|
void
|
|
runtime_startpanic(void)
|
|
{
|
|
M *m;
|
|
|
|
m = runtime_m();
|
|
if(runtime_mheap.cachealloc.size == 0) { // very early
|
|
runtime_printf("runtime: panic before malloc heap initialized\n");
|
|
m->mallocing = 1; // tell rest of panic not to try to malloc
|
|
} else if(m->mcache == nil) // can happen if called from signal handler or throw
|
|
m->mcache = runtime_allocmcache();
|
|
switch(m->dying) {
|
|
case 0:
|
|
m->dying = 1;
|
|
if(runtime_g() != nil)
|
|
runtime_g()->writebuf = nil;
|
|
runtime_xadd(&runtime_panicking, 1);
|
|
runtime_lock(&paniclk);
|
|
if(runtime_debug.schedtrace > 0 || runtime_debug.scheddetail > 0)
|
|
runtime_schedtrace(true);
|
|
runtime_freezetheworld();
|
|
return;
|
|
case 1:
|
|
// Something failed while panicing, probably the print of the
|
|
// argument to panic(). Just print a stack trace and exit.
|
|
m->dying = 2;
|
|
runtime_printf("panic during panic\n");
|
|
runtime_dopanic(0);
|
|
runtime_exit(3);
|
|
case 2:
|
|
// This is a genuine bug in the runtime, we couldn't even
|
|
// print the stack trace successfully.
|
|
m->dying = 3;
|
|
runtime_printf("stack trace unavailable\n");
|
|
runtime_exit(4);
|
|
default:
|
|
// Can't even print! Just exit.
|
|
runtime_exit(5);
|
|
}
|
|
}
|
|
|
|
void
|
|
runtime_dopanic(int32 unused __attribute__ ((unused)))
|
|
{
|
|
G *g;
|
|
static bool didothers;
|
|
bool crash;
|
|
int32 t;
|
|
|
|
g = runtime_g();
|
|
if(g->sig != 0)
|
|
runtime_printf("[signal %x code=%p addr=%p]\n",
|
|
g->sig, (void*)g->sigcode0, (void*)g->sigcode1);
|
|
|
|
if((t = runtime_gotraceback(&crash)) > 0){
|
|
if(g != runtime_m()->g0) {
|
|
runtime_printf("\n");
|
|
runtime_goroutineheader(g);
|
|
runtime_traceback();
|
|
runtime_printcreatedby(g);
|
|
} else if(t >= 2 || runtime_m()->throwing > 0) {
|
|
runtime_printf("\nruntime stack:\n");
|
|
runtime_traceback();
|
|
}
|
|
if(!didothers) {
|
|
didothers = true;
|
|
runtime_tracebackothers(g);
|
|
}
|
|
}
|
|
runtime_unlock(&paniclk);
|
|
if(runtime_xadd(&runtime_panicking, -1) != 0) {
|
|
// Some other m is panicking too.
|
|
// Let it print what it needs to print.
|
|
// Wait forever without chewing up cpu.
|
|
// It will exit when it's done.
|
|
static Lock deadlock;
|
|
runtime_lock(&deadlock);
|
|
runtime_lock(&deadlock);
|
|
}
|
|
|
|
if(crash)
|
|
runtime_crash();
|
|
|
|
runtime_exit(2);
|
|
}
|
|
|
|
bool
|
|
runtime_canpanic(G *gp)
|
|
{
|
|
M *m = runtime_m();
|
|
byte g;
|
|
|
|
USED(&g); // don't use global g, it points to gsignal
|
|
|
|
// Is it okay for gp to panic instead of crashing the program?
|
|
// Yes, as long as it is running Go code, not runtime code,
|
|
// and not stuck in a system call.
|
|
if(gp == nil || gp != m->curg)
|
|
return false;
|
|
if(m->locks-m->softfloat != 0 || m->mallocing != 0 || m->throwing != 0 || m->gcing != 0 || m->dying != 0)
|
|
return false;
|
|
if(gp->atomicstatus != _Grunning)
|
|
return false;
|
|
#ifdef GOOS_windows
|
|
if(m->libcallsp != 0)
|
|
return false;
|
|
#endif
|
|
return true;
|
|
}
|
|
|
|
void
|
|
runtime_throw(const char *s)
|
|
{
|
|
M *mp;
|
|
|
|
mp = runtime_m();
|
|
if(mp->throwing == 0)
|
|
mp->throwing = 1;
|
|
runtime_startpanic();
|
|
runtime_printf("fatal error: %s\n", s);
|
|
runtime_dopanic(0);
|
|
*(int32*)0 = 0; // not reached
|
|
runtime_exit(1); // even more not reached
|
|
}
|
|
|
|
void throw(String) __asm__ (GOSYM_PREFIX "runtime.throw");
|
|
void
|
|
throw(String s)
|
|
{
|
|
M *mp;
|
|
|
|
mp = runtime_m();
|
|
if(mp->throwing == 0)
|
|
mp->throwing = 1;
|
|
runtime_startpanic();
|
|
runtime_printf("fatal error: %S\n", s);
|
|
runtime_dopanic(0);
|
|
*(int32*)0 = 0; // not reached
|
|
runtime_exit(1); // even more not reached
|
|
}
|
|
|
|
void
|
|
runtime_panicstring(const char *s)
|
|
{
|
|
Eface err;
|
|
|
|
if(runtime_m()->mallocing) {
|
|
runtime_printf("panic: %s\n", s);
|
|
runtime_throw("panic during malloc");
|
|
}
|
|
if(runtime_m()->gcing) {
|
|
runtime_printf("panic: %s\n", s);
|
|
runtime_throw("panic during gc");
|
|
}
|
|
if(runtime_m()->locks) {
|
|
runtime_printf("panic: %s\n", s);
|
|
runtime_throw("panic holding locks");
|
|
}
|
|
runtime_newErrorCString(s, &err);
|
|
runtime_panic(err);
|
|
}
|
|
|
|
void runtime_Goexit (void) __asm__ (GOSYM_PREFIX "runtime.Goexit");
|
|
|
|
void
|
|
runtime_Goexit(void)
|
|
{
|
|
__go_rundefer();
|
|
runtime_goexit();
|
|
}
|
|
|
|
void
|
|
runtime_panicdivide(void)
|
|
{
|
|
runtime_panicstring("integer divide by zero");
|
|
}
|