-
Notifications
You must be signed in to change notification settings - Fork 1.7k
/
process.cpp
3425 lines (2726 loc) · 91 KB
/
process.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#include <errno.h>
#include <ev.h>
#include <limits.h>
#include <libgen.h>
#include <netdb.h>
#include <pthread.h>
#include <signal.h>
#include <stdarg.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <arpa/inet.h>
#include <glog/logging.h>
#include <netinet/in.h>
#include <netinet/tcp.h>
#include <sys/ioctl.h>
#include <sys/mman.h>
#include <sys/select.h>
#include <sys/socket.h>
#include <sys/time.h>
#include <sys/types.h>
#include <sys/uio.h>
#include <algorithm>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <vector>
#include <tr1/functional>
#include <tr1/memory> // TODO(benh): Replace all shared_ptr with unique_ptr.
#include <boost/shared_array.hpp>
#include <process/clock.hpp>
#include <process/defer.hpp>
#include <process/delay.hpp>
#include <process/dispatch.hpp>
#include <process/executor.hpp>
#include <process/filter.hpp>
#include <process/future.hpp>
#include <process/gc.hpp>
#include <process/id.hpp>
#include <process/io.hpp>
#include <process/mime.hpp>
#include <process/process.hpp>
#include <process/profiler.hpp>
#include <process/socket.hpp>
#include <process/statistics.hpp>
#include <process/thread.hpp>
#include <process/timer.hpp>
#include <stout/duration.hpp>
#include <stout/foreach.hpp>
#include <stout/lambda.hpp>
#include <stout/net.hpp>
#include <stout/os.hpp>
#include <stout/strings.hpp>
#include "config.hpp"
#include "decoder.hpp"
#include "encoder.hpp"
#include "gate.hpp"
#include "synchronized.hpp"
using process::wait; // Necessary on some OS's to disambiguate.
using process::http::BadRequest;
using process::http::InternalServerError;
using process::http::NotFound;
using process::http::OK;
using process::http::Request;
using process::http::Response;
using process::http::ServiceUnavailable;
using std::deque;
using std::find;
using std::list;
using std::map;
using std::ostream;
using std::pair;
using std::queue;
using std::set;
using std::stack;
using std::string;
using std::stringstream;
using std::vector;
std::ostream& doublePrecision(std::ostream& os)
{
return os << std::fixed
<< std::setprecision(std::numeric_limits<double>::digits10);
}
// Represents a remote "node" (encapsulates IP address and port).
class Node
{
public:
Node(uint32_t _ip = 0, uint16_t _port = 0)
: ip(_ip), port(_port) {}
bool operator < (const Node& that) const
{
if (ip == that.ip) {
return port < that.port;
} else {
return ip < that.ip;
}
}
ostream& operator << (ostream& stream) const
{
stream << ip << ":" << port;
return stream;
}
uint32_t ip;
uint16_t port;
};
namespace process {
namespace ID {
string generate(const string& prefix)
{
static map<string, int> prefixes;
stringstream out;
out << __sync_add_and_fetch(&prefixes[prefix], 1);
return prefix + "(" + out.str() + ")";
}
} // namespace ID {
namespace http {
hashmap<uint16_t, string> statuses;
} // namespace http {
namespace mime {
map<string, string> types;
} // namespace mime {
// Provides reference counting semantics for a process pointer.
class ProcessReference
{
public:
ProcessReference() : process(NULL) {}
~ProcessReference()
{
cleanup();
}
ProcessReference(const ProcessReference& that)
{
copy(that);
}
ProcessReference& operator = (const ProcessReference& that)
{
if (this != &that) {
cleanup();
copy(that);
}
return *this;
}
ProcessBase* operator -> ()
{
return process;
}
operator ProcessBase* ()
{
return process;
}
operator bool () const
{
return process != NULL;
}
private:
friend class ProcessManager; // For ProcessManager::use.
ProcessReference(ProcessBase* _process)
: process(_process)
{
if (process != NULL) {
__sync_fetch_and_add(&(process->refs), 1);
}
}
void copy(const ProcessReference& that)
{
process = that.process;
if (process != NULL) {
// There should be at least one reference to the process, so
// we don't need to worry about checking if it's exiting or
// not, since we know we can always create another reference.
CHECK(process->refs > 0);
__sync_fetch_and_add(&(process->refs), 1);
}
}
void cleanup()
{
if (process != NULL) {
__sync_fetch_and_sub(&(process->refs), 1);
}
}
ProcessBase* process;
};
// Provides a process that manages sending HTTP responses so as to
// satisfy HTTP/1.1 pipelining. Each request should either enqueue a
// response, or ask the proxy to handle a future response. The process
// is responsible for making sure the responses are sent in the same
// order as the requests. Note that we use a 'Socket' in order to keep
// the underyling file descriptor from getting closed while there
// might still be outstanding responses even though the client might
// have closed the connection (see more discussion in
// SocketManger::close and SocketManager::proxy).
class HttpProxy : public Process<HttpProxy>
{
public:
HttpProxy(const Socket& _socket);
virtual ~HttpProxy();
// Enqueues the response to be sent once all previously enqueued
// responses have been processed (e.g., waited for and sent).
void enqueue(const Response& response, const Request& request);
// Enqueues a future to a response that will get waited on (up to
// some timeout) and then sent once all previously enqueued
// responses have been processed (e.g., waited for and sent).
void handle(Future<Response>* future, const Request& request);
private:
// Starts "waiting" on the next available future response.
void next();
// Invoked once a future response has been satisfied.
void waited(const Future<Response>& future);
// Demuxes and handles a response.
bool process(const Future<Response>& future, const Request& request);
// Handles stream (i.e., pipe) based responses.
void stream(const Future<short>& poll, const Request& request);
Socket socket; // Wrap the socket to keep it from getting closed.
// Describes a queue "item" that wraps the future to the response
// and the original request.
// The original request contains needed information such as what encodings
// are acceptable and whether to persist the connection.
struct Item
{
Item(const Request& _request, Future<Response>* _future)
: request(_request), future(_future) {}
~Item()
{
delete future;
}
const Request request; // Make a copy.
Future<Response>* future;
};
queue<Item*> items;
Option<int> pipe; // Current pipe, if streaming.
};
class SocketManager
{
public:
SocketManager();
~SocketManager();
Socket accepted(int s);
void link(ProcessBase* process, const UPID& to);
PID<HttpProxy> proxy(const Socket& socket);
void send(Encoder* encoder, bool persist);
void send(const Response& response,
const Request& request,
const Socket& socket);
void send(Message* message);
Encoder* next(int s);
void close(int s);
void exited(const Node& node);
void exited(ProcessBase* process);
private:
// Map from UPID (local/remote) to process.
map<UPID, set<ProcessBase*> > links;
// Collection of all actice sockets.
map<int, Socket> sockets;
// Collection of sockets that should be disposed when they are
// finished being used (e.g., when there is no more data to send on
// them).
set<int> dispose;
// Map from socket to node (ip, port).
map<int, Node> nodes;
// Maps from node (ip, port) to temporary sockets (i.e., they will
// get closed once there is no more data to send on them).
map<Node, int> temps;
// Maps from node (ip, port) to persistent sockets (i.e., they will
// remain open even if there is no more data to send on them). We
// distinguish these from the 'temps' collection so we can tell when
// a persistant socket has been lost (and thus generate
// ExitedEvents).
map<Node, int> persists;
// Map from socket to outgoing queue.
map<int, queue<Encoder*> > outgoing;
// HTTP proxies.
map<int, HttpProxy*> proxies;
// Protects instance variables.
synchronizable(this);
};
class ProcessManager
{
public:
ProcessManager(const string& delegate);
~ProcessManager();
ProcessReference use(const UPID& pid);
bool handle(
const Socket& socket,
Request* request);
bool deliver(
ProcessBase* receiver,
Event* event,
ProcessBase* sender = NULL);
bool deliver(
const UPID& to,
Event* event,
ProcessBase* sender = NULL);
UPID spawn(ProcessBase* process, bool manage);
void resume(ProcessBase* process);
void cleanup(ProcessBase* process);
void link(ProcessBase* process, const UPID& to);
void terminate(const UPID& pid, bool inject, ProcessBase* sender = NULL);
bool wait(const UPID& pid);
void enqueue(ProcessBase* process);
ProcessBase* dequeue();
void settle();
private:
// Delegate process name to receive root HTTP requests.
const string delegate;
// Map of all local spawned and running processes.
map<string, ProcessBase*> processes;
synchronizable(processes);
// Gates for waiting threads (protected by synchronizable(processes)).
map<ProcessBase*, Gate*> gates;
// Queue of runnable processes (implemented using list).
list<ProcessBase*> runq;
synchronizable(runq);
// Number of running processes, to support Clock::settle operation.
int running;
};
// Unique id that can be assigned to each process.
static uint32_t __id__ = 0;
// Local server socket.
static int __s__ = -1;
// Local IP address.
static uint32_t __ip__ = 0;
// Local port.
static uint16_t __port__ = 0;
// Active SocketManager (eventually will probably be thread-local).
static SocketManager* socket_manager = NULL;
// Active ProcessManager (eventually will probably be thread-local).
static ProcessManager* process_manager = NULL;
// Event loop.
static struct ev_loop* loop = NULL;
// Asynchronous watcher for interrupting loop.
static ev_async async_watcher;
// Watcher for timeouts.
static ev_timer timeouts_watcher;
// Server watcher for accepting connections.
static ev_io server_watcher;
// Queue of I/O watchers.
static queue<ev_io*>* watchers = new queue<ev_io*>();
static synchronizable(watchers) = SYNCHRONIZED_INITIALIZER;
// We store the timers in a map of lists indexed by the timeout of the
// timer so that we can have two timers that have the same timeout. We
// exploit that the map is SORTED!
static map<double, list<Timer> >* timeouts =
new map<double, list<Timer> >();
static synchronizable(timeouts) = SYNCHRONIZED_INITIALIZER_RECURSIVE;
// For supporting Clock::settle(), true if timers have been removed
// from 'timeouts' but may not have been executed yet. Protected by
// the timeouts lock. This is only used when the clock is paused.
static bool pending_timers = false;
// Flag to indicate whether or to update the timer on async interrupt.
static bool update_timer = false;
// Scheduling gate that threads wait at when there is nothing to run.
static Gate* gate = new Gate();
// Filter. Synchronized support for using the filterer needs to be
// recursive incase a filterer wants to do anything fancy (which is
// possible and likely given that filters will get used for testing).
static Filter* filterer = NULL;
static synchronizable(filterer) = SYNCHRONIZED_INITIALIZER_RECURSIVE;
// Global garbage collector.
PID<GarbageCollector> gc;
// Per thread process pointer.
ThreadLocal<ProcessBase>* _process_ = new ThreadLocal<ProcessBase>();
// Per thread executor pointer.
ThreadLocal<Executor>* _executor_ = new ThreadLocal<Executor>();
// We namespace the clock related variables to keep them well
// named. In the future we'll probably want to associate a clock with
// a specific ProcessManager/SocketManager instance pair, so this will
// likely change.
namespace clock {
map<ProcessBase*, double>* currents = new map<ProcessBase*, double>();
double initial = 0;
double current = 0;
bool paused = false;
} // namespace clock {
double Clock::now()
{
return now(__process__);
}
double Clock::now(ProcessBase* process)
{
synchronized (timeouts) {
if (Clock::paused()) {
if (process != NULL) {
if (clock::currents->count(process) != 0) {
return (*clock::currents)[process];
} else {
return (*clock::currents)[process] = clock::initial;
}
} else {
return clock::current;
}
}
}
return ev_time(); // TODO(benh): Versus ev_now()?
}
void Clock::pause()
{
process::initialize(); // To make sure the libev watchers are ready.
synchronized (timeouts) {
if (!clock::paused) {
clock::initial = clock::current = now();
clock::paused = true;
VLOG(2) << "Clock paused at " << doublePrecision << clock::initial;
}
}
// Note that after pausing the clock an existing libev timer might
// still fire (invoking handle_timeout), but since paused == true no
// "time" will actually have passed, so no timer will actually fire.
}
bool Clock::paused()
{
return clock::paused;
}
void Clock::resume()
{
process::initialize(); // To make sure the libev watchers are ready.
synchronized (timeouts) {
if (clock::paused) {
VLOG(2) << "Clock resumed at " << doublePrecision << clock::current;
clock::paused = false;
clock::currents->clear();
update_timer = true;
ev_async_send(loop, &async_watcher);
}
}
}
void Clock::advance(const Duration& duration)
{
synchronized (timeouts) {
if (clock::paused) {
clock::current += duration.secs();
VLOG(2) << "Clock advanced (" << duration << ") to "
<< doublePrecision << clock::current;
if (!update_timer) {
update_timer = true;
ev_async_send(loop, &async_watcher);
}
}
}
}
void Clock::advance(ProcessBase* process, const Duration& duration)
{
synchronized (timeouts) {
if (clock::paused) {
double current = now(process);
current += duration.secs();
(*clock::currents)[process] = current;
VLOG(2) << "Clock of " << process->self() << " advanced (" << duration
<< ") to " << doublePrecision << current;
}
}
}
void Clock::update(const Duration& duration)
{
synchronized (timeouts) {
if (clock::paused) {
if (clock::current < duration.secs()) {
clock::current = duration.secs();
VLOG(2) << "Clock updated to " << doublePrecision << clock::current;
if (!update_timer) {
update_timer = true;
ev_async_send(loop, &async_watcher);
}
}
}
}
}
void Clock::update(ProcessBase* process, const Duration& duration)
{
synchronized (timeouts) {
if (clock::paused) {
double current = now(process);
if (current < duration.secs()) {
VLOG(2) << "Clock of " << process->self() << " updated to " << duration;
(*clock::currents)[process] = duration.secs();
}
}
}
}
void Clock::order(ProcessBase* from, ProcessBase* to)
{
update(to, Seconds(now(from)));
}
void Clock::settle()
{
CHECK(clock::paused); // TODO(benh): Consider returning a bool instead.
process_manager->settle();
}
static Message* encode(const UPID& from,
const UPID& to,
const string& name,
const string& data = "")
{
Message* message = new Message();
message->from = from;
message->to = to;
message->name = name;
message->body = data;
return message;
}
static void transport(Message* message, ProcessBase* sender = NULL)
{
if (message->to.ip == __ip__ && message->to.port == __port__) {
// Local message.
process_manager->deliver(message->to, new MessageEvent(message), sender);
} else {
// Remote message.
socket_manager->send(message);
}
}
static bool libprocess(Request* request)
{
return request->method == "POST" &&
request->headers.count("User-Agent") > 0 &&
request->headers["User-Agent"].find("libprocess/") == 0;
}
static Message* parse(Request* request)
{
// TODO(benh): Do better error handling (to deal with a malformed
// libprocess message, malicious or otherwise).
const string& agent = request->headers["User-Agent"];
const string& identifier = "libprocess/";
size_t index = agent.find(identifier);
if (index != string::npos) {
// Okay, now determine 'from'.
const UPID from(agent.substr(index + identifier.size(), agent.size()));
// Now determine 'to'.
index = request->path.find('/', 1);
index = index != string::npos ? index - 1 : string::npos;
const UPID to(request->path.substr(1, index), __ip__, __port__);
// And now determine 'name'.
index = index != string::npos ? index + 2: request->path.size();
const string& name = request->path.substr(index);
VLOG(2) << "Parsed message name '" << name
<< "' for " << to << " from " << from;
Message* message = new Message();
message->name = name;
message->from = from;
message->to = to;
message->body = request->body;
return message;
}
return NULL;
}
void handle_async(struct ev_loop* loop, ev_async* _, int revents)
{
synchronized (watchers) {
// Start all the new I/O watchers.
while (!watchers->empty()) {
ev_io* watcher = watchers->front();
watchers->pop();
ev_io_start(loop, watcher);
}
}
synchronized (timeouts) {
if (update_timer) {
if (!timeouts->empty()) {
// Determine when the next timer should fire.
timeouts_watcher.repeat = timeouts->begin()->first - Clock::now();
if (timeouts_watcher.repeat <= 0) {
// Feed the event now!
timeouts_watcher.repeat = 0;
ev_timer_again(loop, &timeouts_watcher);
ev_feed_event(loop, &timeouts_watcher, EV_TIMEOUT);
} else {
// Don't fire the timer if the clock is paused since we
// don't want time to advance (instead a call to
// clock::advance() will handle the timer).
if (Clock::paused() && timeouts_watcher.repeat > 0) {
timeouts_watcher.repeat = 0;
}
ev_timer_again(loop, &timeouts_watcher);
}
}
update_timer = false;
}
}
}
void handle_timeouts(struct ev_loop* loop, ev_timer* _, int revents)
{
list<Timer> timedout;
synchronized (timeouts) {
double now = Clock::now();
VLOG(3) << "Handling timeouts up to " << doublePrecision << now;
double timeout;
foreachkey (timeout, *timeouts) {
if (timeout > now) {
break;
}
VLOG(3) << "Have timeout(s) at " << doublePrecision << timeout;
// Record that we have pending timers to execute so the
// Clock::settle() operation can wait until we're done.
pending_timers = true;
foreach (const Timer& timer, (*timeouts)[timeout]) {
timedout.push_back(timer);
}
}
// Now erase the range of timeouts that timed out.
timeouts->erase(timeouts->begin(), timeouts->upper_bound(now));
// Okay, so the timeout for the next timer should not have fired.
CHECK(timeouts->empty() || (timeouts->begin()->first > now));
// Update the timer as necessary.
if (!timeouts->empty()) {
// Determine when the next timer should fire.
timeouts_watcher.repeat = timeouts->begin()->first - Clock::now();
if (timeouts_watcher.repeat <= 0) {
// Feed the event now!
timeouts_watcher.repeat = 0;
ev_timer_again(loop, &timeouts_watcher);
ev_feed_event(loop, &timeouts_watcher, EV_TIMEOUT);
} else {
// Don't fire the timer if the clock is paused since we don't
// want time to advance (instead a call to Clock::advance()
// will handle the timer).
if (Clock::paused() && timeouts_watcher.repeat > 0) {
timeouts_watcher.repeat = 0;
}
ev_timer_again(loop, &timeouts_watcher);
}
}
update_timer = false; // Since we might have a queued update_timer.
}
// Update current time of process (if it's present/valid). It might
// be necessary to actually add some more synchronization around
// this so that, for example, pausing and resuming the clock doesn't
// cause some processes to get thier current times updated and
// others not. Since ProcessManager::use acquires the 'processes'
// lock we had to move this out of the synchronized (timeouts) above
// since there was a deadlock with acquring 'processes' then
// 'timeouts' (reverse order) in ProcessManager::cleanup. Note that
// current time may be greater than the timeout if a local message
// was received (and happens-before kicks in).
if (Clock::paused()) {
foreach (const Timer& timer, timedout) {
if (ProcessReference process = process_manager->use(timer.creator())) {
Clock::update(process, Seconds(timer.timeout().value()));
}
}
}
// Invoke the timers that timed out (TODO(benh): Do this
// asynchronously so that we don't tie up the event thread!).
foreach (const Timer& timer, timedout) {
timer();
}
// Mark ourselves as done executing the timers since it's now safe
// for a call to Clock::settle() to check if there will be any
// future timeouts reached.
synchronized (timeouts) {
pending_timers = false;
}
}
void recv_data(struct ev_loop* loop, ev_io* watcher, int revents)
{
DataDecoder* decoder = (DataDecoder*) watcher->data;
int s = watcher->fd;
while (true) {
const ssize_t size = 80 * 1024;
ssize_t length = 0;
char data[size];
length = recv(s, data, size, 0);
if (length < 0 && (errno == EINTR)) {
// Interrupted, try again now.
continue;
} else if (length < 0 && (errno == EAGAIN || errno == EWOULDBLOCK)) {
// Might block, try again later.
break;
} else if (length <= 0) {
// Socket error or closed.
if (length < 0) {
const char* error = strerror(errno);
VLOG(1) << "Socket error while receiving: " << error;
} else {
VLOG(1) << "Socket closed while receiving";
}
socket_manager->close(s);
delete decoder;
ev_io_stop(loop, watcher);
delete watcher;
break;
} else {
CHECK(length > 0);
// Decode as much of the data as possible into HTTP requests.
const deque<Request*>& requests = decoder->decode(data, length);
if (!requests.empty()) {
foreach (Request* request, requests) {
process_manager->handle(decoder->socket(), request);
}
} else if (requests.empty() && decoder->failed()) {
VLOG(1) << "Decoder error while receiving";
socket_manager->close(s);
delete decoder;
ev_io_stop(loop, watcher);
delete watcher;
break;
}
}
}
}
void send_data(struct ev_loop* loop, ev_io* watcher, int revents)
{
DataEncoder* encoder = (DataEncoder*) watcher->data;
int s = watcher->fd;
while (true) {
const void* data;
size_t size;
data = encoder->next(&size);
CHECK(size > 0);
ssize_t length = send(s, data, size, MSG_NOSIGNAL);
if (length < 0 && (errno == EINTR)) {
// Interrupted, try again now.
encoder->backup(size);
continue;
} else if (length < 0 && (errno == EAGAIN || errno == EWOULDBLOCK)) {
// Might block, try again later.
encoder->backup(size);
break;
} else if (length <= 0) {
// Socket error or closed.
if (length < 0) {
const char* error = strerror(errno);
VLOG(1) << "Socket error while sending: " << error;
} else {
VLOG(1) << "Socket closed while sending";
}
socket_manager->close(s);
delete encoder;
ev_io_stop(loop, watcher);
delete watcher;
break;
} else {
CHECK(length > 0);
// Update the encoder with the amount sent.
encoder->backup(size - length);
// See if there is any more of the message to send.
if (encoder->remaining() == 0) {
delete encoder;
// Stop this watcher for now.
ev_io_stop(loop, watcher);
// Check for more stuff to send on socket.
Encoder* next = socket_manager->next(s);
if (next != NULL) {
watcher->data = next;
ev_io_init(watcher, next->sender(), s, EV_WRITE);
ev_io_start(loop, watcher);
} else {
// Nothing more to send right now, clean up.
delete watcher;
}
break;
}
}
}
}
void send_file(struct ev_loop* loop, ev_io* watcher, int revents)
{
FileEncoder* encoder = (FileEncoder*) watcher->data;
int s = watcher->fd;
while (true) {
int fd;
off_t offset;
size_t size;
fd = encoder->next(&offset, &size);
CHECK(size > 0);
ssize_t length = sendfile(s, fd, offset, size);
if (length < 0 && (errno == EINTR)) {
// Interrupted, try again now.
encoder->backup(size);
continue;
} else if (length < 0 && (errno == EAGAIN || errno == EWOULDBLOCK)) {
// Might block, try again later.
encoder->backup(size);
break;
} else if (length <= 0) {
// Socket error or closed.
if (length < 0) {
const char* error = strerror(errno);
VLOG(1) << "Socket error while sending: " << error;
} else {
VLOG(1) << "Socket closed while sending";
}
socket_manager->close(s);
delete encoder;
ev_io_stop(loop, watcher);