blob: 4101c5e9ab023a0f5624e989065ca993be3b3eff (
plain)
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
|
// Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "net/tools/quic/test_tools/mock_epoll_server.h"
namespace net {
namespace tools {
namespace test {
FakeTimeEpollServer::FakeTimeEpollServer(): now_in_usec_(0) {
}
FakeTimeEpollServer::~FakeTimeEpollServer() {
}
int64 FakeTimeEpollServer::NowInUsec() const {
return now_in_usec_;
}
MockEpollServer::MockEpollServer() : until_in_usec_(-1) {
}
MockEpollServer::~MockEpollServer() {
}
int MockEpollServer::epoll_wait_impl(int epfd,
struct epoll_event* events,
int max_events,
int timeout_in_ms) {
int num_events = 0;
while (!event_queue_.empty() &&
num_events < max_events &&
event_queue_.begin()->first <= NowInUsec() &&
((until_in_usec_ == -1) ||
(event_queue_.begin()->first < until_in_usec_))
) {
int64 event_time_in_usec = event_queue_.begin()->first;
events[num_events] = event_queue_.begin()->second;
if (event_time_in_usec > NowInUsec()) {
set_now_in_usec(event_time_in_usec);
}
event_queue_.erase(event_queue_.begin());
++num_events;
}
if (num_events == 0) { // then we'd have waited 'till the timeout.
if (until_in_usec_ < 0) { // then we don't care what the final time is.
if (timeout_in_ms > 0) {
AdvanceBy(timeout_in_ms * 1000);
}
} else { // except we assume that we don't wait for the timeout
// period if until_in_usec_ is a positive number.
set_now_in_usec(until_in_usec_);
// And reset until_in_usec_ to signal no waiting (as
// the AdvanceByExactly* stuff is meant to be one-shot,
// as are all similar EpollServer functions)
until_in_usec_ = -1;
}
}
if (until_in_usec_ >= 0) {
CHECK(until_in_usec_ >= NowInUsec());
}
return num_events;
}
} // namespace test
} // namespace tools
} // namespace net
|
