本文整理汇总了C++中boost::scoped_ptr::getFd方法的典型用法代码示例。如果您正苦于以下问题：C++ scoped_ptr::getFd方法的具体用法？C++ scoped_ptr::getFd怎么用？C++ scoped_ptr::getFd使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类boost::scoped_ptr的用法示例。
在下文中一共展示了scoped_ptr::getFd方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: serve
/** accepts and keeps track of connections. reads data
from connected peers and notifies through virtual methods
if packets can be deserialized
\param tls use GnuTLS for encryption
\param port listen for incoming connections at this port
\param maxPeers maximum number of connected peers */
void serve(bool tls, int port, int maxPeers) {
if (tls)
sock.reset(new TLSSocket());
else
sock.reset(new Socket());
sock->setNonBlocking();
sock->bind(port);
sock->listen(maxPeers);
Select select;
/* Wait for a peer, send data and term */
while (!closed)
{
select.reset();
if (peers.size() < maxPeers)
select.input(sock->getFd());
for (typename Peers::iterator i = peers.begin(); i != peers.end(); i++) {
select.input((*i)->getFd());
}
if (select.select(100) == -1)
continue;
if (select.canRead(sock->getFd())
&& peers.size() < maxPeers) {
try {
Socket* csock = sock->accept();
if (tls) {
boost::threadpool::schedule(pool,
boost::bind(&Server::handshake, this, csock));
} else {
peers.push_back(boost::shared_ptr<PeerT>(new PeerT()));
csock->setNonBlocking();
peers.back()->setup(csock);
onJoin(*peers.back());
}
} catch (SocketExcept& e) {
std::cerr << e.what() << std::endl;
}
}
if (tls) {
Socket* sock = NULL;
socketsReady.try_pop_front(sock);
if (sock) {
sock->setNonBlocking();
peers.push_back(boost::shared_ptr<PeerT>(new PeerT()));
peers.back()->setup(sock);
onJoin(*peers.back());
}
}
for (size_t i = 0; i < peers.size(); i++) {
boost::shared_ptr<PeerT>& p = peers[i];
if (select.canRead(p->getFd()))
p->onInput();
while (p->hasPacket()) {
onPacket(*p);
}
}
// collect dead peers
size_t count = peers.size();
for (size_t i = 0; i < count; ) {
if (!peers[i]->isActive()) {
onLeave(*peers[i]);
peers[i] = peers[peers.size() - 1];
count--;
} else
i++;
}
if (count < peers.size()) {
peers.resize(count);
}
}
}