Replace an assert with a small hack.
[cubemap] / server.cpp
1 #include <assert.h>
2 #include <errno.h>
3 #include <netinet/in.h>
4 #include <pthread.h>
5 #include <stdint.h>
6 #include <stdio.h>
7 #include <stdlib.h>
8 #include <string.h>
9 #include <sys/epoll.h>
10 #include <sys/sendfile.h>
11 #include <sys/socket.h>
12 #include <sys/types.h>
13 #include <unistd.h>
14 #include <algorithm>
15 #include <map>
16 #include <string>
17 #include <utility>
18 #include <vector>
19
20 #include "accesslog.h"
21 #include "log.h"
22 #include "metacube2.h"
23 #include "mutexlock.h"
24 #include "parse.h"
25 #include "server.h"
26 #include "state.pb.h"
27 #include "stream.h"
28 #include "util.h"
29
30 #ifndef SO_MAX_PACING_RATE
31 #define SO_MAX_PACING_RATE 47
32 #endif
33
34 using namespace std;
35
36 extern AccessLogThread *access_log;
37
38 namespace {
39
40 inline bool is_equal(timespec a, timespec b)
41 {
42         return a.tv_sec == b.tv_sec &&
43                a.tv_nsec == b.tv_nsec;
44 }
45
46 inline bool is_earlier(timespec a, timespec b)
47 {
48         if (a.tv_sec != b.tv_sec)
49                 return a.tv_sec < b.tv_sec;
50         return a.tv_nsec < b.tv_nsec;
51 }
52
53 }  // namespace
54
55 Server::Server()
56 {
57         pthread_mutex_init(&mutex, NULL);
58         pthread_mutex_init(&queued_clients_mutex, NULL);
59
60         epoll_fd = epoll_create(1024);  // Size argument is ignored.
61         if (epoll_fd == -1) {
62                 log_perror("epoll_fd");
63                 exit(1);
64         }
65 }
66
67 Server::~Server()
68 {
69         for (size_t i = 0; i < streams.size(); ++i) {   
70                 delete streams[i];
71         }
72
73         safe_close(epoll_fd);
74 }
75
76 vector<ClientStats> Server::get_client_stats() const
77 {
78         vector<ClientStats> ret;
79
80         MutexLock lock(&mutex);
81         for (map<int, Client>::const_iterator client_it = clients.begin();
82              client_it != clients.end();
83              ++client_it) {
84                 ret.push_back(client_it->second.get_stats());
85         }
86         return ret;
87 }
88
89 void Server::do_work()
90 {
91         while (!should_stop()) {
92                 // Wait until there's activity on at least one of the fds,
93                 // or 20 ms (about one frame at 50 fps) has elapsed.
94                 //
95                 // We could in theory wait forever and rely on wakeup()
96                 // from add_client_deferred() and add_data_deferred(),
97                 // but wakeup is a pretty expensive operation, and the
98                 // two threads might end up fighting over a lock, so it's
99                 // seemingly (much) more efficient to just have a timeout here.
100                 int nfds = epoll_pwait(epoll_fd, events, EPOLL_MAX_EVENTS, EPOLL_TIMEOUT_MS, &sigset_without_usr1_block);
101                 if (nfds == -1 && errno != EINTR) {
102                         log_perror("epoll_wait");
103                         exit(1);
104                 }
105
106                 MutexLock lock(&mutex);  // We release the mutex between iterations.
107         
108                 process_queued_data();
109
110                 // Process each client where we have socket activity.
111                 for (int i = 0; i < nfds; ++i) {
112                         Client *client = reinterpret_cast<Client *>(events[i].data.u64);
113
114                         if (events[i].events & (EPOLLERR | EPOLLRDHUP | EPOLLHUP)) {
115                                 close_client(client);
116                                 continue;
117                         }
118
119                         process_client(client);
120                 }
121
122                 // Process each client where its stream has new data,
123                 // even if there was no socket activity.
124                 for (size_t i = 0; i < streams.size(); ++i) {   
125                         vector<Client *> to_process;
126                         swap(streams[i]->to_process, to_process);
127                         for (size_t i = 0; i < to_process.size(); ++i) {
128                                 process_client(to_process[i]);
129                         }
130                 }
131
132                 // Finally, go through each client to see if it's timed out
133                 // in the READING_REQUEST state. (Seemingly there are clients
134                 // that can hold sockets up for days at a time without sending
135                 // anything at all.)
136                 timespec timeout_time;
137                 if (clock_gettime(CLOCK_MONOTONIC_COARSE, &timeout_time) == -1) {
138                         log_perror("clock_gettime(CLOCK_MONOTONIC_COARSE)");
139                         continue;
140                 }
141                 timeout_time.tv_sec -= REQUEST_READ_TIMEOUT_SEC;
142                 while (!clients_ordered_by_connect_time.empty()) {
143                         pair<timespec, int> &connect_time_and_fd = clients_ordered_by_connect_time.front();
144
145                         // See if we have reached the end of clients to process.
146                         if (is_earlier(timeout_time, connect_time_and_fd.first)) {
147                                 break;
148                         }
149
150                         // If this client doesn't exist anymore, just ignore it
151                         // (it was deleted earlier).
152                         std::map<int, Client>::iterator client_it = clients.find(connect_time_and_fd.second);
153                         if (client_it == clients.end()) {
154                                 clients_ordered_by_connect_time.pop();
155                                 continue;
156                         }
157                         Client *client = &client_it->second;
158                         if (!is_equal(client->connect_time, connect_time_and_fd.first)) {
159                                 // Another client has taken this fd in the meantime.
160                                 clients_ordered_by_connect_time.pop();
161                                 continue;
162                         }
163
164                         if (client->state != Client::READING_REQUEST) {
165                                 // Only READING_REQUEST can time out.
166                                 clients_ordered_by_connect_time.pop();
167                                 continue;
168                         }
169
170                         // OK, it timed out.
171                         close_client(client);
172                         clients_ordered_by_connect_time.pop();
173                 }
174         }
175 }
176
177 CubemapStateProto Server::serialize()
178 {
179         // We don't serialize anything queued, so empty the queues.
180         process_queued_data();
181
182         // Set all clients in a consistent state before serializing
183         // (ie., they have no remaining lost data). Otherwise, increasing
184         // the backlog could take clients into a newly valid area of the backlog,
185         // sending a stream of zeros instead of skipping the data as it should.
186         //
187         // TODO: Do this when clients are added back from serialized state instead;
188         // it would probably be less wasteful.
189         for (map<int, Client>::iterator client_it = clients.begin();
190              client_it != clients.end();
191              ++client_it) {
192                 skip_lost_data(&client_it->second);
193         }
194
195         CubemapStateProto serialized;
196         for (map<int, Client>::const_iterator client_it = clients.begin();
197              client_it != clients.end();
198              ++client_it) {
199                 serialized.add_clients()->MergeFrom(client_it->second.serialize());
200         }
201         for (size_t i = 0; i < streams.size(); ++i) {   
202                 serialized.add_streams()->MergeFrom(streams[i]->serialize());
203         }
204         return serialized;
205 }
206
207 void Server::add_client_deferred(int sock)
208 {
209         MutexLock lock(&queued_clients_mutex);
210         queued_add_clients.push_back(sock);
211 }
212
213 void Server::add_client(int sock)
214 {
215         pair<map<int, Client>::iterator, bool> ret =
216                 clients.insert(make_pair(sock, Client(sock)));
217         assert(ret.second == true);  // Should not already exist.
218         Client *client_ptr = &ret.first->second;
219
220         // Connection timestamps must be nondecreasing. I can't find any guarantee
221         // that even the monotonic clock can't go backwards by a small amount
222         // (think switching between CPUs with non-synchronized TSCs), so if
223         // this actually should happen, we hack around it by fudging
224         // connect_time.
225         if (!clients_ordered_by_connect_time.empty() &&
226             is_earlier(client_ptr->connect_time, clients_ordered_by_connect_time.back().first)) {
227                 client_ptr->connect_time = clients_ordered_by_connect_time.back().first;
228         }
229         clients_ordered_by_connect_time.push(make_pair(client_ptr->connect_time, sock));
230
231         // Start listening on data from this socket.
232         epoll_event ev;
233         ev.events = EPOLLIN | EPOLLET | EPOLLRDHUP;
234         ev.data.u64 = reinterpret_cast<uint64_t>(client_ptr);
235         if (epoll_ctl(epoll_fd, EPOLL_CTL_ADD, sock, &ev) == -1) {
236                 log_perror("epoll_ctl(EPOLL_CTL_ADD)");
237                 exit(1);
238         }
239
240         process_client(client_ptr);
241 }
242
243 void Server::add_client_from_serialized(const ClientProto &client)
244 {
245         MutexLock lock(&mutex);
246         Stream *stream;
247         int stream_index = lookup_stream_by_url(client.url());
248         if (stream_index == -1) {
249                 assert(client.state() != Client::SENDING_DATA);
250                 stream = NULL;
251         } else {
252                 stream = streams[stream_index];
253         }
254         pair<map<int, Client>::iterator, bool> ret =
255                 clients.insert(make_pair(client.sock(), Client(client, stream)));
256         assert(ret.second == true);  // Should not already exist.
257         Client *client_ptr = &ret.first->second;
258
259         // Connection timestamps must be nondecreasing.
260         assert(clients_ordered_by_connect_time.empty() ||
261                !is_earlier(client_ptr->connect_time, clients_ordered_by_connect_time.back().first));
262         clients_ordered_by_connect_time.push(make_pair(client_ptr->connect_time, client.sock()));
263
264         // Start listening on data from this socket.
265         epoll_event ev;
266         if (client.state() == Client::READING_REQUEST) {
267                 ev.events = EPOLLIN | EPOLLET | EPOLLRDHUP;
268         } else {
269                 // If we don't have more data for this client, we'll be putting it into
270                 // the sleeping array again soon.
271                 ev.events = EPOLLOUT | EPOLLET | EPOLLRDHUP;
272         }
273         ev.data.u64 = reinterpret_cast<uint64_t>(client_ptr);
274         if (epoll_ctl(epoll_fd, EPOLL_CTL_ADD, client.sock(), &ev) == -1) {
275                 log_perror("epoll_ctl(EPOLL_CTL_ADD)");
276                 exit(1);
277         }
278
279         if (client_ptr->state == Client::WAITING_FOR_KEYFRAME ||
280             client_ptr->state == Client::PREBUFFERING ||
281             (client_ptr->state == Client::SENDING_DATA &&
282              client_ptr->stream_pos == client_ptr->stream->bytes_received)) {
283                 client_ptr->stream->put_client_to_sleep(client_ptr);
284         } else {
285                 process_client(client_ptr);
286         }
287 }
288
289 int Server::lookup_stream_by_url(const std::string &url) const
290 {
291         map<string, int>::const_iterator url_it = url_map.find(url);
292         if (url_it == url_map.end()) {
293                 return -1;
294         }
295         return url_it->second;
296 }
297
298 int Server::add_stream(const string &url, size_t backlog_size, size_t prebuffering_bytes, Stream::Encoding encoding)
299 {
300         MutexLock lock(&mutex);
301         url_map.insert(make_pair(url, streams.size()));
302         streams.push_back(new Stream(url, backlog_size, prebuffering_bytes, encoding));
303         return streams.size() - 1;
304 }
305
306 int Server::add_stream_from_serialized(const StreamProto &stream, int data_fd)
307 {
308         MutexLock lock(&mutex);
309         url_map.insert(make_pair(stream.url(), streams.size()));
310         streams.push_back(new Stream(stream, data_fd));
311         return streams.size() - 1;
312 }
313         
314 void Server::set_backlog_size(int stream_index, size_t new_size)
315 {
316         MutexLock lock(&mutex);
317         assert(stream_index >= 0 && stream_index < ssize_t(streams.size()));
318         streams[stream_index]->set_backlog_size(new_size);
319 }
320         
321 void Server::set_encoding(int stream_index, Stream::Encoding encoding)
322 {
323         MutexLock lock(&mutex);
324         assert(stream_index >= 0 && stream_index < ssize_t(streams.size()));
325         streams[stream_index]->encoding = encoding;
326 }
327         
328 void Server::set_header(int stream_index, const string &http_header, const string &stream_header)
329 {
330         MutexLock lock(&mutex);
331         assert(stream_index >= 0 && stream_index < ssize_t(streams.size()));
332         streams[stream_index]->http_header = http_header;
333         streams[stream_index]->stream_header = stream_header;
334 }
335         
336 void Server::set_pacing_rate(int stream_index, uint32_t pacing_rate)
337 {
338         MutexLock lock(&mutex);
339         assert(clients.empty());
340         assert(stream_index >= 0 && stream_index < ssize_t(streams.size()));
341         streams[stream_index]->pacing_rate = pacing_rate;
342 }
343
344 void Server::add_data_deferred(int stream_index, const char *data, size_t bytes, StreamStartSuitability suitable_for_stream_start)
345 {
346         assert(stream_index >= 0 && stream_index < ssize_t(streams.size()));
347         streams[stream_index]->add_data_deferred(data, bytes, suitable_for_stream_start);
348 }
349
350 // See the .h file for postconditions after this function.      
351 void Server::process_client(Client *client)
352 {
353         switch (client->state) {
354         case Client::READING_REQUEST: {
355 read_request_again:
356                 // Try to read more of the request.
357                 char buf[1024];
358                 int ret;
359                 do {
360                         ret = read(client->sock, buf, sizeof(buf));
361                 } while (ret == -1 && errno == EINTR);
362
363                 if (ret == -1 && errno == EAGAIN) {
364                         // No more data right now. Nothing to do.
365                         // This is postcondition #2.
366                         return;
367                 }
368                 if (ret == -1) {
369                         log_perror("read");
370                         close_client(client);
371                         return;
372                 }
373                 if (ret == 0) {
374                         // OK, the socket is closed.
375                         close_client(client);
376                         return;
377                 }
378
379                 RequestParseStatus status = wait_for_double_newline(&client->request, buf, ret);
380         
381                 switch (status) {
382                 case RP_OUT_OF_SPACE:
383                         log(WARNING, "[%s] Client sent overlong request!", client->remote_addr.c_str());
384                         close_client(client);
385                         return;
386                 case RP_NOT_FINISHED_YET:
387                         // OK, we don't have the entire header yet. Fine; we'll get it later.
388                         // See if there's more data for us.
389                         goto read_request_again;
390                 case RP_EXTRA_DATA:
391                         log(WARNING, "[%s] Junk data after request!", client->remote_addr.c_str());
392                         close_client(client);
393                         return;
394                 case RP_FINISHED:
395                         break;
396                 }
397
398                 assert(status == RP_FINISHED);
399
400                 int error_code = parse_request(client);
401                 if (error_code == 200) {
402                         construct_header(client);
403                 } else {
404                         construct_error(client, error_code);
405                 }
406
407                 // We've changed states, so fall through.
408                 assert(client->state == Client::SENDING_ERROR ||
409                        client->state == Client::SENDING_HEADER);
410         }
411         case Client::SENDING_ERROR:
412         case Client::SENDING_HEADER: {
413 sending_header_or_error_again:
414                 int ret;
415                 do {
416                         ret = write(client->sock,
417                                     client->header_or_error.data() + client->header_or_error_bytes_sent,
418                                     client->header_or_error.size() - client->header_or_error_bytes_sent);
419                 } while (ret == -1 && errno == EINTR);
420
421                 if (ret == -1 && errno == EAGAIN) {
422                         // We're out of socket space, so now we're at the “low edge” of epoll's
423                         // edge triggering. epoll will tell us when there is more room, so for now,
424                         // just return.
425                         // This is postcondition #4.
426                         return;
427                 }
428
429                 if (ret == -1) {
430                         // Error! Postcondition #1.
431                         log_perror("write");
432                         close_client(client);
433                         return;
434                 }
435                 
436                 client->header_or_error_bytes_sent += ret;
437                 assert(client->header_or_error_bytes_sent <= client->header_or_error.size());
438
439                 if (client->header_or_error_bytes_sent < client->header_or_error.size()) {
440                         // We haven't sent all yet. Fine; go another round.
441                         goto sending_header_or_error_again;
442                 }
443
444                 // We're done sending the header or error! Clear it to release some memory.
445                 client->header_or_error.clear();
446
447                 if (client->state == Client::SENDING_ERROR) {
448                         // We're done sending the error, so now close.  
449                         // This is postcondition #1.
450                         close_client(client);
451                         return;
452                 }
453
454                 // Start sending from the first keyframe we get. In other
455                 // words, we won't send any of the backlog, but we'll start
456                 // sending immediately as we get the next keyframe block.
457                 // This is postcondition #3.
458                 if (client->stream_pos == size_t(-2)) {
459                         client->stream_pos = std::min<size_t>(
460                             client->stream->bytes_received - client->stream->backlog_size,
461                             0);
462                         client->state = Client::SENDING_DATA;
463                 } else {
464                         // client->stream_pos should be -1, but it might not be,
465                         // if we have clients from an older version.
466                         client->stream_pos = client->stream->bytes_received;
467                         client->state = Client::WAITING_FOR_KEYFRAME;
468                 }
469                 client->stream->put_client_to_sleep(client);
470                 return;
471         }
472         case Client::WAITING_FOR_KEYFRAME: {
473                 Stream *stream = client->stream;
474                 if (ssize_t(client->stream_pos) > stream->last_suitable_starting_point) {
475                         // We haven't received a keyframe since this stream started waiting,
476                         // so keep on waiting for one.
477                         // This is postcondition #3.
478                         stream->put_client_to_sleep(client);
479                         return;
480                 }
481                 client->stream_pos = stream->last_suitable_starting_point;
482                 client->state = Client::PREBUFFERING;
483                 // Fall through.
484         }
485         case Client::PREBUFFERING: {
486                 Stream *stream = client->stream;
487                 size_t bytes_to_send = stream->bytes_received - client->stream_pos;
488                 assert(bytes_to_send <= stream->backlog_size);
489                 if (bytes_to_send < stream->prebuffering_bytes) {
490                         // We don't have enough bytes buffered to start this client yet.
491                         stream->put_client_to_sleep(client);
492                         return;
493                 }
494                 client->state = Client::SENDING_DATA;
495                 // Fall through.
496         }
497         case Client::SENDING_DATA: {
498                 skip_lost_data(client);
499                 Stream *stream = client->stream;
500
501 sending_data_again:
502                 size_t bytes_to_send = stream->bytes_received - client->stream_pos;
503                 assert(bytes_to_send <= stream->backlog_size);
504                 if (bytes_to_send == 0) {
505                         return;
506                 }
507
508                 // See if we need to split across the circular buffer.
509                 bool more_data = false;
510                 if ((client->stream_pos % stream->backlog_size) + bytes_to_send > stream->backlog_size) {
511                         bytes_to_send = stream->backlog_size - (client->stream_pos % stream->backlog_size);
512                         more_data = true;
513                 }
514
515                 ssize_t ret;
516                 do {
517                         off_t offset = client->stream_pos % stream->backlog_size;
518                         ret = sendfile(client->sock, stream->data_fd, &offset, bytes_to_send);
519                 } while (ret == -1 && errno == EINTR);
520
521                 if (ret == -1 && errno == EAGAIN) {
522                         // We're out of socket space, so return; epoll will wake us up
523                         // when there is more room.
524                         // This is postcondition #4.
525                         return;
526                 }
527                 if (ret == -1) {
528                         // Error, close; postcondition #1.
529                         log_perror("sendfile");
530                         close_client(client);
531                         return;
532                 }
533                 client->stream_pos += ret;
534                 client->bytes_sent += ret;
535
536                 if (client->stream_pos == stream->bytes_received) {
537                         // We don't have any more data for this client, so put it to sleep.
538                         // This is postcondition #3.
539                         stream->put_client_to_sleep(client);
540                 } else if (more_data && size_t(ret) == bytes_to_send) {
541                         goto sending_data_again;
542                 }
543                 break;
544         }
545         default:
546                 assert(false);
547         }
548 }
549
550 // See if there's some data we've lost. Ideally, we should drop to a block boundary,
551 // but resync will be the mux's problem.
552 void Server::skip_lost_data(Client *client)
553 {
554         Stream *stream = client->stream;
555         if (stream == NULL) {
556                 return;
557         }
558         size_t bytes_to_send = stream->bytes_received - client->stream_pos;
559         if (bytes_to_send > stream->backlog_size) {
560                 size_t bytes_lost = bytes_to_send - stream->backlog_size;
561                 client->stream_pos = stream->bytes_received - stream->backlog_size;
562                 client->bytes_lost += bytes_lost;
563                 ++client->num_loss_events;
564         }
565 }
566
567 int Server::parse_request(Client *client)
568 {
569         vector<string> lines = split_lines(client->request);
570         if (lines.empty()) {
571                 return 400;  // Bad request (empty).
572         }
573
574         vector<string> request_tokens = split_tokens(lines[0]);
575         if (request_tokens.size() < 2) {
576                 return 400;  // Bad request (empty).
577         }
578         if (request_tokens[0] != "GET") {
579                 return 400;  // Should maybe be 405 instead?
580         }
581
582         string url = request_tokens[1];
583         if (url.find("?backlog") == url.size() - 8) {
584                 client->stream_pos = -2;
585                 url = url.substr(0, url.size() - 8);
586         } else {
587                 client->stream_pos = -1;
588         }
589
590         map<string, int>::const_iterator url_map_it = url_map.find(url);
591         if (url_map_it == url_map.end()) {
592                 return 404;  // Not found.
593         }
594
595         Stream *stream = streams[url_map_it->second];
596         if (stream->http_header.empty()) {
597                 return 503;  // Service unavailable.
598         }
599
600         client->url = request_tokens[1];
601         client->stream = stream;
602         if (setsockopt(client->sock, SOL_SOCKET, SO_MAX_PACING_RATE, &client->stream->pacing_rate, sizeof(client->stream->pacing_rate)) == -1) {
603                 if (client->stream->pacing_rate != ~0U) {
604                         log_perror("setsockopt(SO_MAX_PACING_RATE)");
605                 }
606         }
607         client->request.clear();
608
609         return 200;  // OK!
610 }
611
612 void Server::construct_header(Client *client)
613 {
614         Stream *stream = client->stream;
615         if (stream->encoding == Stream::STREAM_ENCODING_RAW) {
616                 client->header_or_error = stream->http_header +
617                         "\r\n" +
618                         stream->stream_header;
619         } else if (stream->encoding == Stream::STREAM_ENCODING_METACUBE) {
620                 client->header_or_error = stream->http_header +
621                         "Content-encoding: metacube\r\n" +
622                         "\r\n";
623                 if (!stream->stream_header.empty()) {
624                         metacube2_block_header hdr;
625                         memcpy(hdr.sync, METACUBE2_SYNC, sizeof(hdr.sync));
626                         hdr.size = htonl(stream->stream_header.size());
627                         hdr.flags = htons(METACUBE_FLAGS_HEADER);
628                         hdr.csum = htons(metacube2_compute_crc(&hdr));
629                         client->header_or_error.append(
630                                 string(reinterpret_cast<char *>(&hdr), sizeof(hdr)));
631                 }
632                 client->header_or_error.append(stream->stream_header);
633         } else {
634                 assert(false);
635         }
636
637         // Switch states.
638         client->state = Client::SENDING_HEADER;
639
640         epoll_event ev;
641         ev.events = EPOLLOUT | EPOLLET | EPOLLRDHUP;
642         ev.data.u64 = reinterpret_cast<uint64_t>(client);
643
644         if (epoll_ctl(epoll_fd, EPOLL_CTL_MOD, client->sock, &ev) == -1) {
645                 log_perror("epoll_ctl(EPOLL_CTL_MOD)");
646                 exit(1);
647         }
648 }
649         
650 void Server::construct_error(Client *client, int error_code)
651 {
652         char error[256];
653         snprintf(error, 256, "HTTP/1.0 %d Error\r\nContent-type: text/plain\r\n\r\nSomething went wrong. Sorry.\r\n",
654                 error_code);
655         client->header_or_error = error;
656
657         // Switch states.
658         client->state = Client::SENDING_ERROR;
659
660         epoll_event ev;
661         ev.events = EPOLLOUT | EPOLLET | EPOLLRDHUP;
662         ev.data.u64 = reinterpret_cast<uint64_t>(client);
663
664         if (epoll_ctl(epoll_fd, EPOLL_CTL_MOD, client->sock, &ev) == -1) {
665                 log_perror("epoll_ctl(EPOLL_CTL_MOD)");
666                 exit(1);
667         }
668 }
669
670 template<class T>
671 void delete_from(vector<T> *v, T elem)
672 {
673         typename vector<T>::iterator new_end = remove(v->begin(), v->end(), elem);
674         v->erase(new_end, v->end());
675 }
676         
677 void Server::close_client(Client *client)
678 {
679         if (epoll_ctl(epoll_fd, EPOLL_CTL_DEL, client->sock, NULL) == -1) {
680                 log_perror("epoll_ctl(EPOLL_CTL_DEL)");
681                 exit(1);
682         }
683
684         // This client could be sleeping, so we'll need to fix that. (Argh, O(n).)
685         if (client->stream != NULL) {
686                 delete_from(&client->stream->sleeping_clients, client);
687                 delete_from(&client->stream->to_process, client);
688         }
689
690         // Log to access_log.
691         access_log->write(client->get_stats());
692
693         // Bye-bye!
694         safe_close(client->sock);
695
696         clients.erase(client->sock);
697 }
698         
699 void Server::process_queued_data()
700 {
701         {
702                 MutexLock lock(&queued_clients_mutex);
703
704                 for (size_t i = 0; i < queued_add_clients.size(); ++i) {
705                         add_client(queued_add_clients[i]);
706                 }
707                 queued_add_clients.clear();
708         }
709
710         for (size_t i = 0; i < streams.size(); ++i) {   
711                 streams[i]->process_queued_data();
712         }
713 }