src/scheduler.c

   1 /* -*- Mode: C; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
   2
   3 /*  Monkey HTTP Daemon
   4  *  ------------------
   5  *  Copyright (C) 2001-2010, Eduardo Silva P. <edsiper@gmail.com>
   6  *
   7  *  This program is free software; you can redistribute it and/or modify
   8  *  it under the terms of the GNU General Public License as published by
   9  *  the Free Software Foundation; either version 2 of the License, or
  10  *  (at your option) any later version.
  11  *
  12  *  This program is distributed in the hope that it will be useful,
  13  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
  14  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15  *  GNU Library General Public License for more details.
  16  *
  17  *  You should have received a copy of the GNU General Public License
  18  *  along with this program; if not, write to the Free Software
  19  *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
  20  */
  21
  22 #include <stdio.h>
  23 #include <stdlib.h>
  24 #include <errno.h>
  25 #include <pthread.h>
  26 #include <sys/epoll.h>
  27 #include <unistd.h>
  28 #include <sys/syscall.h>
  29 #include <string.h>
  30
  31 #include "monkey.h"
  32 #include "connection.h"
  33 #include "scheduler.h"
  34 #include "memory.h"
  35 #include "epoll.h"
  36 #include "request.h"
  37 #include "cache.h"
  38 #include "config.h"
  39 #include "clock.h"
  40 #include "signals.h"
  41 #include "plugin.h"
  42 #include "utils.h"
  43
  44 /* Register thread information */
  45 int mk_sched_register_thread(pthread_t tid, int efd)
  46 {
  47     int i;
  48     struct sched_list_node *sr, *aux;
  49
  50     sr = mk_mem_malloc_z(sizeof(struct sched_list_node));
  51     sr->tid = tid;
  52     sr->pid = -1;
  53     sr->epoll_fd = efd;
  54     sr->queue = mk_mem_malloc_z(sizeof(struct sched_connection) *
  55                                 config->worker_capacity);
  56     sr->request_handler = NULL;
  57     sr->next = NULL;
  58
  59     for (i = 0; i < config->worker_capacity; i++) {
  60         sr->queue[i].status = MK_SCHEDULER_CONN_AVAILABLE;
  61     }
  62
  63     if (!sched_list) {
  64         sr->idx = 1;
  65         sched_list = sr;
  66         return 0;
  67     }
  68
  69     aux = sched_list;
  70     while (aux->next) {
  71         aux = aux->next;
  72     }
  73     sr->idx = aux->idx + 1;
  74     aux->next = sr;
  75
  76     return 0;
  77 }
  78
  79 /*
  80  * Create thread which will be listening
  81  * for incomings file descriptors
  82  */
  83 int mk_sched_launch_thread(int max_events)
  84 {
  85     int efd;
  86     pthread_t tid;
  87     pthread_attr_t attr;
  88     sched_thread_conf *thconf;
  89     pthread_mutex_t mutex_wait_register;
  90
  91     /* Creating epoll file descriptor */
  92     efd = mk_epoll_create(max_events);
  93     if (efd < 1) {
  94         return -1;
  95     }
  96
  97     /* Thread stuff */
  98     pthread_mutex_init(&mutex_wait_register, (pthread_mutexattr_t *) NULL);
  99     pthread_mutex_lock(&mutex_wait_register);
 100
 101     thconf = mk_mem_malloc(sizeof(sched_thread_conf));
 102     thconf->epoll_fd = efd;
 103     thconf->max_events = max_events;
 104
 105     pthread_attr_init(&attr);
 106     pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_DETACHED);
 107     if (pthread_create(&tid, &attr, mk_sched_launch_epoll_loop,
 108                        (void *) thconf) != 0) {
 109         perror("pthread_create");
 110         return -1;
 111     }
 112
 113     /* Register working thread */
 114     mk_sched_register_thread(tid, efd);
 115     pthread_mutex_unlock(&mutex_wait_register);
 116
 117     return 0;
 118 }
 119
 120 /* created thread, all this calls are in the thread context */
 121 void *mk_sched_launch_epoll_loop(void *thread_conf)
 122 {
 123     sched_thread_conf *thconf;
 124     struct sched_list_node *thinfo;
 125     mk_epoll_handlers *handler;
 126
 127     /* Avoid SIGPIPE signals */
 128     mk_signal_thread_sigpipe_safe();
 129
 130     thconf = thread_conf;
 131
 132     /* Init specific thread cache */
 133     mk_cache_thread_init();
 134     mk_plugin_worker_startup();
 135
 136     /* Epoll event handlers */
 137     handler = mk_epoll_set_handlers((void *) mk_conn_read,
 138                                     (void *) mk_conn_write,
 139                                     (void *) mk_conn_error,
 140                                     (void *) mk_conn_close,
 141                                     (void *) mk_conn_timeout);
 142
 143     /* Nasty way to export task id */
 144     usleep(1000);
 145     thinfo = mk_sched_get_thread_conf();
 146     while (!thinfo) {
 147         thinfo = mk_sched_get_thread_conf();
 148     }
 149
 150     /* Glibc doesn't export to user space the gettid() syscall */
 151     thinfo->pid = syscall(__NR_gettid);
 152
 153     mk_sched_set_thread_poll(thconf->epoll_fd);
 154     mk_epoll_init(thconf->epoll_fd, handler, thconf->max_events);
 155
 156     return 0;
 157 }
 158
 159 struct request_idx *mk_sched_get_request_index()
 160 {
 161     return pthread_getspecific(request_index);
 162 }
 163
 164 void mk_sched_set_request_index(struct request_idx *ri)
 165 {
 166     pthread_setspecific(request_index, (void *) ri);
 167 }
 168
 169 void mk_sched_set_thread_poll(int epoll)
 170 {
 171     pthread_setspecific(epoll_fd, (void *) epoll);
 172 }
 173
 174 int mk_sched_get_thread_poll()
 175 {
 176     return (int) pthread_getspecific(epoll_fd);
 177 }
 178
 179 struct sched_list_node *mk_sched_get_thread_conf()
 180 {
 181     struct sched_list_node *node;
 182     pthread_t current;
 183
 184     current = pthread_self();
 185     node = sched_list;
 186     while (node) {
 187         if (pthread_equal(node->tid, current) != 0) {
 188             return node;
 189         }
 190         node = node->next;
 191     }
 192
 193     return NULL;
 194 }
 195
 196 int mk_sched_add_client(struct sched_list_node *sched, int remote_fd)
 197 {
 198     unsigned int i, ret;
 199
 200     /* Look for an available slot */
 201     for (i = 0; i < config->worker_capacity; i++) {
 202         if (sched->queue[i].status == MK_SCHEDULER_CONN_AVAILABLE) {
 203             /* Set IP */
 204             sched->queue[i].ipv4.data = mk_mem_malloc_z(16);
 205             mk_socket_get_ip(remote_fd, sched->queue[i].ipv4.data);
 206             mk_pointer_set( &sched->queue[i].ipv4, sched->queue[i].ipv4.data );
 207
 208             /* Before to continue, we need to run plugin stage 20 */
 209             ret = mk_plugin_stage_run(MK_PLUGIN_STAGE_20,
 210                                       remote_fd,
 211                                       &sched->queue[i], NULL, NULL);
 212
 213             /* Close connection, otherwise continue */
 214             if (ret == MK_PLUGIN_RET_CLOSE_CONX) {
 215                 mk_conn_close(remote_fd);
 216                 return MK_PLUGIN_RET_CLOSE_CONX;
 217             }
 218
 219             /* Socket and status */
 220             sched->queue[i].socket = remote_fd;
 221             sched->queue[i].status = MK_SCHEDULER_CONN_PENDING;
 222             sched->queue[i].arrive_time = log_current_utime;
 223
 224             mk_epoll_add_client(sched->epoll_fd, remote_fd, MK_EPOLL_READ,
 225                                 MK_EPOLL_BEHAVIOR_TRIGGERED);
 226             return 0;
 227         }
 228     }
 229
 230     return -1;
 231 }
 232
 233 int mk_sched_remove_client(struct sched_list_node *sched, int remote_fd)
 234 {
 235     struct sched_connection *sc;
 236
 237     sc = mk_sched_get_connection(sched, remote_fd);
 238     if (sc) {
 239         close(remote_fd);
 240         sc->status = MK_SCHEDULER_CONN_AVAILABLE;
 241         return 0;
 242     }
 243     return -1;
 244 }
 245
 246 struct sched_connection *mk_sched_get_connection(struct sched_list_node
 247                                                  *sched, int remote_fd)
 248 {
 249     int i;
 250
 251     if (!sched) {
 252         sched = mk_sched_get_thread_conf();
 253         if (!sched) {
 254             close(remote_fd);
 255             return NULL;
 256         }
 257     }
 258
 259     for (i = 0; i < config->worker_capacity; i++) {
 260         if (sched->queue[i].socket == remote_fd) {
 261             return &sched->queue[i];
 262         }
 263     }
 264
 265     return NULL;
 266 }
 267
 268 int mk_sched_check_timeouts(struct sched_list_node *sched)
 269 {
 270     int i;
 271     struct request_idx *req_idx;
 272     struct client_request *req_cl;
 273
 274     /* PENDING CONN TIMEOUT */
 275     for (i = 0; i < config->worker_capacity; i++) {
 276         if (sched->queue[i].status == MK_SCHEDULER_CONN_PENDING) {
 277             if (sched->queue[i].arrive_time + config->timeout <=
 278                 log_current_utime) {
 279 #ifdef TRACE
 280                 MK_TRACE("Scheduler, closing fd %i due TIMEOUT",
 281                          sched->queue[i].socket);
 282 #endif
 283                 mk_sched_remove_client(sched, sched->queue[i].socket);
 284             }
 285         }
 286     }
 287
 288     /* PROCESSING CONN TIMEOUT */
 289     req_idx = mk_sched_get_request_index();
 290     req_cl = req_idx->first;
 291
 292     while (req_cl) {
 293         if (req_cl->status == MK_REQUEST_STATUS_INCOMPLETE) {
 294             if ((req_cl->init_time + config->timeout) >= log_current_utime) {
 295 #ifdef TRACE
 296                 MK_TRACE("Scheduler, closing fd %i due to timeout (incomplete)",
 297                          req_cl->socket);
 298 #endif
 299                 close(req_cl->socket);
 300             }
 301         }
 302         req_cl = req_cl->next;
 303     }
 304
 305     return 0;
 306 }
 307
 308 int mk_sched_update_conn_status(struct sched_list_node *sched,
 309                                 int remote_fd, int status)
 310 {
 311     int i;
 312
 313     if (!sched) {
 314         return -1;
 315     }
 316
 317     for (i = 0; i < config->workers; i++) {
 318         if (sched->queue[i].socket == remote_fd) {
 319             sched->queue[i].status = status;
 320             return 0;
 321         }
 322     }
 323     return 0;
 324 }