finalize chan, to free OS X semaphore inside Lock.
os: finalize File, to close fd.
Fixes #503.
R=ken2
CC=golang-dev
https://golang.org/cl/204065
package os
import (
+ "runtime"
"syscall"
)
if fd < 0 {
return nil
}
- return &File{fd, name, nil, 0}
+ f := &File{fd, name, nil, 0}
+ runtime.SetFinalizer(f, (*File).Close)
+ return f
}
// Stdin, Stdout, and Stderr are open Files pointing to the standard input,
// Close closes the File, rendering it unusable for I/O.
// It returns an Error, if any.
func (file *File) Close() Error {
- if file == nil {
+ if file == nil || file.fd < 0 {
return EINVAL
}
var err Error
static uint32 gcd(uint32, uint32);
static uint32 fastrand1(void);
static uint32 fastrand2(void);
+static void destroychan(Hchan*);
Hchan*
makechan(Type *elem, uint32 hint)
}
c = mal(sizeof(*c));
+ addfinalizer(c, destroychan, 0);
c->elemsize = elem->size;
c->elemalg = &algarray[elem->alg];
return c;
}
+static void
+destroychan(Hchan *c)
+{
+ destroylock(&c->Lock);
+}
+
+
// makechan(elemsize uint32, elemalg uint32, hint uint32) (hchan *chan any);
void
·makechan(Type *elem, uint32 hint, Hchan *ret)
// be >0, so it will increment the semaphore to wake up
// one of the others. This is the same algorithm used
// in Plan 9's user-level locks.
-//
-// Note that semaphores are never destroyed (the kernel
-// will clean up when the process exits). We assume for now
-// that Locks are only used for long-lived structures like M and G.
void
lock(Lock *l)
}
}
+void
+destroylock(Lock *l)
+{
+ if(l->sema != 0) {
+ mach_semdestroy(l->sema);
+ l->sema = 0;
+ }
+}
// User-level semaphore implementation:
// try to do the operations in user space on u,
umtx_unlock(l);
}
+void
+destroylock(Lock *l)
+{
+}
+
// Event notifications.
void
noteclear(Note *n)
futexunlock(l);
}
+void
+destroylock(Lock *l)
+{
+}
+
// One-time notifications.
//
byte *base;
uintptr size;
FuncType *ft;
+ int32 i, nret;
+ Type *t;
if(obj.type == nil) {
printf("runtime.SetFinalizer: first argument is nil interface\n");
printf("runtime.SetFinalizer: pointer not at beginning of allocated block\n");
goto throw;
}
+ nret = 0;
if(finalizer.type != nil) {
if(finalizer.type->kind != KindFunc) {
badfunc:
goto throw;
}
ft = (FuncType*)finalizer.type;
- if(ft->dotdotdot || ft->out.len != 0 || ft->in.len != 1 || *(Type**)ft->in.array != obj.type)
+ if(ft->dotdotdot || ft->in.len != 1 || *(Type**)ft->in.array != obj.type)
goto badfunc;
- if(getfinalizer(obj.data, 0)) {
+
+ // compute size needed for return parameters
+ for(i=0; i<ft->out.len; i++) {
+ t = ((Type**)ft->out.array)[i];
+ nret = (nret + t->align - 1) & ~(t->align - 1);
+ nret += t->size;
+ }
+ nret = (nret + sizeof(void*)-1) & ~(sizeof(void*)-1);
+
+ if(getfinalizer(obj.data, 0, nil)) {
printf("runtime.SetFinalizer: finalizer already set");
goto throw;
}
}
- addfinalizer(obj.data, finalizer.data);
+ addfinalizer(obj.data, finalizer.data, nret);
}
void SysUnused(void*, uintptr);
void SysFree(void*, uintptr);
-void addfinalizer(void*, void*);
-void* getfinalizer(void*, bool);
+void* getfinalizer(void*, bool, int32*);
enum
{
struct Fintab
{
void **key;
- void **val;
+ struct {
+ void *fn;
+ int32 nret;
+ } *val;
int32 nkey; // number of non-nil entries in key
int32 ndead; // number of dead (-1) entries in key
int32 max; // size of key, val allocations
};
static void
-addfintab(Fintab *t, void *k, void *v)
+addfintab(Fintab *t, void *k, void *fn, int32 nret)
{
int32 i, j;
ret:
t->key[i] = k;
- t->val[i] = v;
+ t->val[i].fn = fn;
+ t->val[i].nret = nret;
}
static void*
-lookfintab(Fintab *t, void *k, bool del)
+lookfintab(Fintab *t, void *k, bool del, int32 *nret)
{
int32 i, j;
void *v;
if(t->key[i] == nil)
return nil;
if(t->key[i] == k) {
- v = t->val[i];
+ v = t->val[i].fn;
+ if(nret)
+ *nret = t->val[i].nret;
if(del) {
t->key[i] = (void*)-1;
- t->val[i] = nil;
+ t->val[i].fn = nil;
+ t->val[i].nret = 0;
t->ndead++;
}
return v;
// add finalizer; caller is responsible for making sure not already in table
void
-addfinalizer(void *p, void *f)
+addfinalizer(void *p, void (*f)(void*), int32 nret)
{
Fintab newtab;
int32 i;
k = fintab.key[i];
if(k != nil && k != (void*)-1)
- addfintab(&newtab, k, fintab.val[i]);
+ addfintab(&newtab, k, fintab.val[i].fn, fintab.val[i].nret);
}
free(fintab.key);
free(fintab.val);
fintab = newtab;
}
- addfintab(&fintab, p, f);
+ addfintab(&fintab, p, f, nret);
}
void*
-getfinalizer(void *p, bool del)
+getfinalizer(void *p, bool del, int32 *nret)
{
- return lookfintab(&fintab, p, del);
+ return lookfintab(&fintab, p, del, nret);
}
extern byte etext[];
extern byte end[];
-static void *finq[128]; // finalizer queue - two elements per entry
-static void **pfinq = finq;
-static void **efinq = finq+nelem(finq);
+typedef struct Finq Finq;
+struct Finq
+{
+ void (*fn)(void*);
+ void *p;
+ int32 nret;
+};
+
+static Finq finq[128]; // finalizer queue - two elements per entry
+static Finq *pfinq = finq;
+static Finq *efinq = finq+nelem(finq);
static void sweepblock(byte*, int64, uint32*, int32);
break;
case RefNone:
case RefNone|RefNoPointers:
- if(pass == 0 && getfinalizer(p, 0)) {
+ if(pass == 0 && getfinalizer(p, 0, nil)) {
// Tentatively mark as finalizable.
// Make sure anything it points at will not be collected.
if(Debug > 0)
if(pfinq < efinq) {
if(Debug > 0)
printf("finalize %p+%D\n", p, n);
- *pfinq++ = getfinalizer(p, 1);
- *pfinq++ = p;
+ pfinq->p = p;
+ pfinq->nret = 0;
+ pfinq->fn = getfinalizer(p, 1, &pfinq->nret);
+ if(pfinq->fn == nil)
+ throw("getfinalizer inconsistency");
+ pfinq++;
}
// Reset for next mark+sweep.
*gcrefp = RefNone | (gcref&RefNoPointers);
{
int64 t0, t1;
byte *p;
- void **fp;
+ Finq *fp;
// The gc is turned off (via enablegc) until
// the bootstrap has completed.
// kick off goroutines to run queued finalizers
m->locks++; // disable gc during the mallocs in newproc
- for(fp=finq; fp<pfinq; fp+=2) {
- ·newproc(sizeof(void*), fp[0], fp[1]);
- fp[0] = nil;
- fp[1] = nil;
+ for(fp=finq; fp<pfinq; fp++) {
+ newproc1((byte*)fp->fn, (byte*)&fp->p, sizeof(fp->p), fp->nret);
+ fp->fn = nil;
+ fp->p = nil;
}
pfinq = finq;
m->locks--;
#pragma textflag 7
void
·newproc(int32 siz, byte* fn, byte* arg0)
+{
+ newproc1(fn, (byte*)&arg0, siz, 0);
+}
+
+void
+newproc1(byte *fn, byte *argp, int32 narg, int32 nret)
{
byte *stk, *sp;
G *newg;
+ int32 siz;
-//printf("newproc siz=%d fn=%p", siz, fn);
-
+//printf("newproc1 %p %p narg=%d nret=%d\n", fn, argp, narg, nret);
+ siz = narg + nret;
siz = (siz+7) & ~7;
if(siz > 1024)
throw("runtime.newproc: too many args");
newg->stackbase = sp;
sp -= siz;
- mcpy(sp, (byte*)&arg0, siz);
+ mcpy(sp, argp, narg);
newg->sched.sp = sp;
newg->sched.pc = (byte*)goexit;
uint32 noequal(uint32, void*, void*);
void* malloc(uintptr size);
void free(void *v);
+void addfinalizer(void*, void(*fn)(void*), int32);
void exit(int32);
void breakpoint(void);
void gosched(void);
void runcgo(void (*fn)(void*), void*);
void ·entersyscall(void);
void ·exitsyscall(void);
-void ·newproc(int32, byte*, byte*);
+void newproc1(byte*, byte*, int32, int32);
void siginit(void);
bool sigsend(int32 sig);
void gettime(int64*, int32*);
*/
void lock(Lock*);
void unlock(Lock*);
+void destroylock(Lock*);
/*
* sleep and wakeup on one-time events.