struct blocker {
struct blocker *n, *p, *n2, *p2;
int fd, reg;
- int ev;
+ int ev, rev, id;
+ int thpos;
time_t to;
struct muth *th;
};
static int epfd = -1, fdln = 0;
static int exitstatus;
static struct blocker **fdlist;
+static typedbuf(struct blocker *) timeheap;
static int regfd(struct blocker *bl)
{
bl->reg = 0;
}
-int block(int fd, int ev, time_t to)
+static void thraise(struct blocker *bl, int n)
{
- struct blocker *bl;
- int rv;
+ int p;
- omalloc(bl);
- bl->fd = fd;
- bl->ev = ev;
- if(to > 0)
- bl->to = time(NULL) + to;
- bl->th = current;
- if((epfd >= 0) && regfd(bl)) {
- free(bl);
- return(-1);
+ while(n > 0) {
+ p = (n - 1) >> 1;
+ if(timeheap.b[p]->to <= bl->to)
+ break;
+ timeheap.b[n] = timeheap.b[p];
+ timeheap.b[n]->thpos = n;
+ n = p;
+ }
+ timeheap.b[n] = bl;
+ bl->thpos = n;
+}
+
+static void thlower(struct blocker *bl, int n)
+{
+ int c;
+
+ while(1) {
+ c = (n << 1) + 1;
+ if(c >= timeheap.d)
+ break;
+ if((c + 1 < timeheap.d) && (timeheap.b[c + 1]->to < timeheap.b[c]->to))
+ c = c + 1;
+ if(timeheap.b[c]->to > bl->to)
+ break;
+ timeheap.b[n] = timeheap.b[c];
+ timeheap.b[n]->thpos = n;
+ n = c;
}
+ timeheap.b[n] = bl;
+ bl->thpos = n;
+}
+
+static void addtimeout(struct blocker *bl, time_t to)
+{
+ sizebuf(timeheap, ++timeheap.d);
+ thraise(bl, timeheap.d - 1);
+}
+
+static void deltimeout(struct blocker *bl)
+{
+ int n;
+
+ if(bl->thpos == timeheap.d - 1) {
+ timeheap.d--;
+ return;
+ }
+ n = bl->thpos;
+ bl = timeheap.b[--timeheap.d];
+ if((n > 0) && (timeheap.b[(n - 1) >> 1]->to > bl->to))
+ thraise(bl, n);
+ else
+ thlower(bl, n);
+}
+
+static int addblock(struct blocker *bl)
+{
+ if((epfd >= 0) && regfd(bl))
+ return(-1);
bl->n = blockers;
if(blockers)
blockers->p = bl;
blockers = bl;
- rv = yield();
+ if(bl->to > 0)
+ addtimeout(bl, bl->to);
+ return(0);
+}
+
+static void remblock(struct blocker *bl)
+{
+ if(bl->to > 0)
+ deltimeout(bl);
if(bl->n)
bl->n->p = bl->p;
if(bl->p)
bl->p->n = bl->n;
- if(bl == blockers)
+ if(blockers == bl)
blockers = bl->n;
remfd(bl);
- free(bl);
+}
+
+struct selected mblock(time_t to, int n, struct selected *spec)
+{
+ int i, id;
+ struct blocker bls[n];
+
+ to = (to > 0)?(time(NULL) + to):0;
+ for(i = 0; i < n; i++) {
+ bls[i] = (struct blocker) {
+ .fd = spec[i].fd,
+ .ev = spec[i].ev,
+ .id = i,
+ .to = to,
+ .th = current,
+ };
+ if(addblock(&bls[i])) {
+ for(i--; i >= 0; i--)
+ remblock(&bls[i]);
+ return((struct selected){.fd = -1, .ev = -1});
+ }
+ }
+ id = yield();
+ for(i = 0; i < n; i++)
+ remblock(&bls[i]);
+ if(id < 0)
+ return((struct selected){.fd = -1, .ev = -1});
+ return((struct selected){.fd = bls[id].fd, .ev = bls[id].rev});
+}
+
+int block(int fd, int ev, time_t to)
+{
+ struct blocker bl;
+ int rv;
+
+ bl = (struct blocker) {
+ .fd = fd,
+ .ev = ev,
+ .id = -1,
+ .to = (to > 0)?(time(NULL) + to):0,
+ .th = current,
+ };
+ if(addblock(&bl))
+ return(-1);
+ rv = yield();
+ remblock(&bl);
return(rv);
}
struct blocker *bl, *nbl;
struct epoll_event evr[16];
int i, fd, nev, ev, toval;
- time_t now, timeout;
+ time_t now;
exitstatus = 0;
epfd = epoll_create(128);
resume(bl->th, -1);
}
while(blockers != NULL) {
- timeout = 0;
- for(bl = blockers; bl; bl = bl->n) {
- if((bl->to != 0) && ((timeout == 0) || (timeout > bl->to)))
- timeout = bl->to;
- }
now = time(NULL);
- if(timeout == 0)
+ if(timeheap.d == 0)
toval = -1;
- else if(timeout > now)
- toval = (timeout - now) * 1000;
+ else if(timeheap.b[0]->to > now)
+ toval = (timeheap.b[0]->to - now) * 1000;
else
toval = 1000;
if(exitstatus)
ev = -1;
for(bl = fdlist[fd]; bl; bl = nbl) {
nbl = bl->n2;
- if((ev < 0) || (ev & bl->ev))
- resume(bl->th, ev);
+ if((ev < 0) || (ev & bl->ev)) {
+ if(bl->id < 0) {
+ resume(bl->th, ev);
+ } else {
+ bl->rev = ev;
+ resume(bl->th, bl->id);
+ }
+ }
}
}
now = time(NULL);
- for(bl = blockers; bl; bl = nbl) {
- nbl = bl->n;
- if((bl->to != 0) && (bl->to <= now))
+ while((timeheap.d > 0) && ((bl = timeheap.b[0])->to <= now)) {
+ if(bl->id < 0) {
resume(bl->th, 0);
+ } else {
+ bl->rev = 0;
+ resume(bl->th, bl->id);
+ }
}
}
for(bl = blockers; bl; bl = bl->n)