2 * Copyright (c) 2002-2005 The Regents of The University of Michigan
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 * Authors: Nathan Binkert
31 #include <sys/ioctl.h>
32 #include <sys/types.h>
33 #if defined(__sun__) || defined(__SUNPRO_CC)
42 #include "base/misc.hh"
43 #include "base/pollevent.hh"
44 #include "base/types.hh"
45 #include "sim/async.hh"
46 #include "sim/core.hh"
47 #include "sim/eventq.hh"
48 #include "sim/serialize.hh"
54 /////////////////////////////////////////////////////
56 PollEvent::PollEvent(int _fd
, int _events
)
57 : queue(NULL
), enabled(true)
64 PollEvent::~PollEvent()
91 PollEvent::serialize(ostream
&os
)
93 SERIALIZE_SCALAR(pfd
.fd
);
94 SERIALIZE_SCALAR(pfd
.events
);
95 SERIALIZE_SCALAR(enabled
);
99 PollEvent::unserialize(Checkpoint
*cp
, const std::string
§ion
)
101 UNSERIALIZE_SCALAR(pfd
.fd
);
102 UNSERIALIZE_SCALAR(pfd
.events
);
103 UNSERIALIZE_SCALAR(enabled
);
106 /////////////////////////////////////////////////////
108 PollQueue::PollQueue()
109 : poll_fds(NULL
), max_size(0), num_fds(0)
112 PollQueue::~PollQueue()
114 for (int i
= 0; i
< num_fds
; i
++)
115 setupAsyncIO(poll_fds
[0].fd
, false);
123 eventvec_t::iterator i
= events
.begin();
124 eventvec_t::iterator end
= events
.end();
130 poll_fds
[num_fds
++] = (*i
)->pfd
;
136 PollQueue::remove(PollEvent
*event
)
138 eventvec_t::iterator i
= events
.begin();
139 eventvec_t::iterator end
= events
.end();
152 panic("Event does not exist. Cannot remove.");
156 PollQueue::schedule(PollEvent
*event
)
159 panic("Event already scheduled!");
162 events
.push_back(event
);
163 setupAsyncIO(event
->pfd
.fd
, true);
165 // if we ran out of space in the fd array, double the capacity
166 // if this is the first time that we've scheduled an event, create
167 // the array with an initial size of 16
168 if (++num_fds
> max_size
) {
176 poll_fds
= new pollfd
[max_size
];
185 int ret
= poll(poll_fds
, num_fds
, 0);
190 for (int i
= 0; i
< num_fds
; i
++) {
191 int revents
= poll_fds
[i
].revents
;
193 events
[i
]->process(revents
);
201 PollQueue::setupAsyncIO(int fd
, bool set
)
203 int flags
= fcntl(fd
, F_GETFL
);
205 panic("Could not set up async IO");
213 if (fcntl(fd
, F_SETOWN
, getpid()) == -1)
214 panic("Could not set up async IO");
217 if (fcntl(fd
, F_SETFL
, flags
) == -1)
218 panic("Could not set up async IO");
220 // The file descriptor might already have events pending. We won't
221 // see them if they occurred before we set the FASYNC
222 // flag. Simulate a SIGIO to ensure that the FD will be polled in
223 // next iteration of the simulation loop. We could just poll it,
224 // but this is much simpler.
228 /* Wake up some event queue to handle event */
229 getEventQueue(0)->wakeup();