22 Star 36 Fork 15

蔡东赟 / beanstalkd-win

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
克隆/下载
conn.c 4.23 KB
一键复制 编辑 原始数据 按行查看 历史
zhangjiazhu 提交于 2015-07-27 18:34 . iocp 模型的 beanstalkd ~~~
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#include <limits.h>
#include <unistd.h>
#include "dat.h"
#define SAFETY_MARGIN (1000000000) /* 1 second */
static int cur_conn_ct = 0, cur_worker_ct = 0, cur_producer_ct = 0;
static uint tot_conn_ct = 0;
int verbose = 0;
static void
on_watch(ms a, tube t, size_t i)
{
tube_iref(t);
t->watching_ct++;
}
static void
on_ignore(ms a, tube t, size_t i)
{
t->watching_ct--;
tube_dref(t);
}
Conn *
make_conn(int fd, char start_state, tube use, tube watch)
{
job j;
Conn *c;
c = new(Conn);
if (!c) return (twarn("OOM"), NULL);
ms_init(&c->watch, (ms_event_fn) on_watch, (ms_event_fn) on_ignore);
if (!ms_append(&c->watch, watch)) {
free(c);
return twarn("OOM"), NULL;
}
TUBE_ASSIGN(c->use, use);
use->using_ct++;
c->sock.fd = fd;
#if defined WIN32_IOCP_MODE
c->sock.type = SOCK_TYPE_CONNECT;
#endif
c->state = start_state;
c->pending_timeout = -1;
c->tickpos = -1;
j = &c->reserved_jobs;
j->prev = j->next = j;
/* stats */
cur_conn_ct++;
tot_conn_ct++;
return c;
}
void
connsetproducer(Conn *c)
{
if (c->type & CONN_TYPE_PRODUCER) return;
c->type |= CONN_TYPE_PRODUCER;
cur_producer_ct++; /* stats */
}
void
connsetworker(Conn *c)
{
if (c->type & CONN_TYPE_WORKER) return;
c->type |= CONN_TYPE_WORKER;
cur_worker_ct++; /* stats */
}
int
count_cur_conns()
{
return cur_conn_ct;
}
uint
count_tot_conns()
{
return tot_conn_ct;
}
int
count_cur_producers()
{
return cur_producer_ct;
}
int
count_cur_workers()
{
return cur_worker_ct;
}
static int
has_reserved_job(Conn *c)
{
return job_list_any_p(&c->reserved_jobs);
}
static int64
conntickat(Conn *c)
{
int margin = 0, should_timeout = 0;
int64 t = INT64_MAX;
if (conn_waiting(c)) {
margin = SAFETY_MARGIN;
}
if (has_reserved_job(c)) {
t = connsoonestjob(c)->r.deadline_at - nanoseconds() - margin;
should_timeout = 1;
}
if (c->pending_timeout >= 0) {
t = min(t, ((int64)c->pending_timeout) * 1000000000);
should_timeout = 1;
}
if (should_timeout) {
return nanoseconds() + t;
}
return 0;
}
void
connwant(Conn *c, int rw)
{
c->rw = rw;
connsched(c);
}
void
connsched(Conn *c)
{
if (c->tickpos > -1) {
heapremove(&c->srv->conns, c->tickpos);
}
c->tickat = conntickat(c);
if (c->tickat) {
heapinsert(&c->srv->conns, c);
}
}
/* return the reserved job with the earliest deadline,
* or NULL if there's no reserved job */
job
connsoonestjob(Conn *c)
{
job j = NULL;
job soonest = c->soonest_job;
if (soonest == NULL) {
for (j = c->reserved_jobs.next; j != &c->reserved_jobs; j = j->next) {
if (j->r.deadline_at <= (soonest ? soonest : j)->r.deadline_at) soonest = j;
}
}
c->soonest_job = soonest;
return soonest;
}
/* return true if c has a reserved job with less than one second until its
* deadline */
int
conndeadlinesoon(Conn *c)
{
int64 t = nanoseconds();
job j = connsoonestjob(c);
return j && t >= j->r.deadline_at - SAFETY_MARGIN;
}
int
conn_ready(Conn *c)
{
size_t i;
for (i = 0; i < c->watch.used; i++) {
if (((tube) c->watch.items[i])->ready.len) return 1;
}
return 0;
}
int
connless(Conn *a, Conn *b)
{
return a->tickat < b->tickat;
}
void
connrec(Conn *c, int i)
{
c->tickpos = i;
}
void
connclose(Conn *c)
{
sockwant(&c->sock, 0);
net_close(c->sock.fd);
if (verbose) {
printf("close %d\n", c->sock.fd);
}
job_free(c->in_job);
/* was this a peek or stats command? */
if (c->out_job && !c->out_job->r.id) job_free(c->out_job);
c->in_job = c->out_job = NULL;
c->in_job_read = 0;
if (c->type & CONN_TYPE_PRODUCER) cur_producer_ct--; /* stats */
if (c->type & CONN_TYPE_WORKER) cur_worker_ct--; /* stats */
cur_conn_ct--; /* stats */
remove_waiting_conn(c);
if (has_reserved_job(c)) enqueue_reserved_jobs(c);
ms_clear(&c->watch);
c->use->using_ct--;
TUBE_ASSIGN(c->use, NULL);
if (c->tickpos > -1) {
heapremove(&c->srv->conns, c->tickpos);
}
free(c);
}
C
1
https://gitee.com/lomox/beanstalkd-win.git
git@gitee.com:lomox/beanstalkd-win.git
lomox
beanstalkd-win
beanstalkd-win
master

搜索帮助