⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 poll_kqueue.cc

📁 LibTorrent is a BitTorrent library written in C++ for *nix, with a focus on high performance and goo
💻 CC
字号:
// libTorrent - BitTorrent library// Copyright (C) 2005-2006, Jari Sundell//// This program is free software; you can redistribute it and/or modify// it under the terms of the GNU General Public License as published by// the Free Software Foundation; either version 2 of the License, or// (at your option) any later version.// // This program is distributed in the hope that it will be useful,// but WITHOUT ANY WARRANTY; without even the implied warranty of// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the// GNU General Public License for more details.// // You should have received a copy of the GNU General Public License// along with this program; if not, write to the Free Software// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA//// In addition, as a special exception, the copyright holders give// permission to link the code of portions of this program with the// OpenSSL library under certain conditions as described in each// individual source file, and distribute linked combinations// including the two.//// You must obey the GNU General Public License in all respects for// all of the code used other than OpenSSL.  If you modify file(s)// with this exception, you may extend this exception to your version// of the file(s), but you are not obligated to do so.  If you do not// wish to do so, delete this exception statement from your version.// If you delete this exception statement from all source files in the// program, then also delete it here.//// Contact:  Jari Sundell <jaris@ifi.uio.no>////           Skomakerveien 33//           3185 Skoppum, NORWAY#include "config.h"#include <cerrno>#include <algorithm>#include <unistd.h>#include <rak/error_number.h>#include <rak/functional.h>#include <torrent/exceptions.h>#include <torrent/event.h>#include "poll_kqueue.h"#ifdef USE_KQUEUE#include <sys/types.h>#include <sys/event.h>#include <sys/time.h>#endifnamespace torrent {#ifdef USE_KQUEUEinline uint32_tPollKQueue::event_mask(Event* e) {  return m_table[e->file_descriptor()];}inline voidPollKQueue::set_event_mask(Event* e, uint32_t m) {  m_table[e->file_descriptor()] = m;}voidPollKQueue::modify(Event* event, unsigned short op, short mask) {  // Just so I can test it on my mac, comment this out.//   if (event->file_descriptor() == 0)//     return;  // Flush the changed filters to the kernel if the buffer if full.  if (m_changedEvents == m_maxEvents) {    if (kevent(m_fd, m_changes, m_changedEvents, NULL, 0, NULL) == -1)      throw internal_error("PollKQueue::modify() error: " + std::string(rak::error_number::current().c_str()));          m_changedEvents = 0;  }  struct kevent* itr = m_changes + (m_changedEvents++);  EV_SET(itr, event->file_descriptor(), mask, op, 0, 0, event);}PollKQueue*PollKQueue::create(int maxOpenSockets) {  int fd = kqueue();  if (fd == -1)    return NULL;  return new PollKQueue(fd, 1024, maxOpenSockets);}PollKQueue::PollKQueue(int fd, int maxEvents, int maxOpenSockets) :  m_fd(fd),  m_maxEvents(maxEvents),  m_waitingEvents(0),  m_changedEvents(0) {  m_events = new struct kevent[m_maxEvents];  m_changes = new struct kevent[maxOpenSockets];  m_table.resize(maxOpenSockets);}PollKQueue::~PollKQueue() {  m_table.clear();  delete [] m_events;  delete [] m_changes;  ::close(m_fd);}intPollKQueue::poll(int msec) {  timespec timeout = { msec / 1000, (msec % 1000) * 1000000 };  int nfds = kevent(m_fd, m_changes, m_changedEvents, m_events, m_maxEvents, &timeout);  // Clear the changed events even on fail as we might have received a  // signal or similar, and the changed events have already been  // consumed.  //  // There's a chance a bad changed event could make kevent return -1,  // but it won't as long as there is room enough in m_events.  m_changedEvents = 0;  if (nfds == -1)    return -1;  m_waitingEvents = nfds;  return nfds;}voidPollKQueue::perform() {  for (struct kevent *itr = m_events, *last = m_events + m_waitingEvents; itr != last; ++itr) {    if (itr->flags == EV_ERROR)      throw internal_error("PollKQueue::perform() error: " + std::string(rak::error_number(itr->data).c_str()));    // Also check current mask.    if (itr->filter == EVFILT_READ && itr->udata != NULL && event_mask((Event*)itr->udata) & flag_read)      ((Event*)itr->udata)->event_read();    if (itr->filter == EVFILT_WRITE && itr->udata != NULL && event_mask((Event*)itr->udata) & flag_write)      ((Event*)itr->udata)->event_write();  }  m_waitingEvents = 0;}uint32_tPollKQueue::open_max() const {  return m_table.size();}voidPollKQueue::open(Event* event) {  if (event_mask(event) != 0)    throw internal_error("PollKQueue::open(...) called but the file descriptor is active");}voidPollKQueue::close(Event* event) {  if (event_mask(event) != 0)    throw internal_error("PollKQueue::close(...) called but the file descriptor is active");  for (struct kevent *itr = m_events, *last = m_events + m_waitingEvents; itr != last; ++itr)    if (itr->udata == event)      itr->udata = NULL;  m_changedEvents = std::remove_if(m_changes, m_changes + m_changedEvents, rak::equal(event, rak::mem_ref(&kevent::udata))) - m_changes;}// Use custom defines for EPOLL* to make the below code compile with// and with epoll.boolPollKQueue::in_read(Event* event) {  return event_mask(event) & flag_read;}boolPollKQueue::in_write(Event* event) {  return event_mask(event) & flag_write;}boolPollKQueue::in_error(Event* event) {  return event_mask(event) & flag_error;}voidPollKQueue::insert_read(Event* event) {  if (event_mask(event) & flag_read)    return;  set_event_mask(event, event_mask(event) | flag_read);  modify(event, EV_ADD, EVFILT_READ);}voidPollKQueue::insert_write(Event* event) {  if (event_mask(event) & flag_write)    return;  set_event_mask(event, event_mask(event) | flag_write);  modify(event, EV_ADD, EVFILT_WRITE);}voidPollKQueue::insert_error(Event* event) {}voidPollKQueue::remove_read(Event* event) {  if (!(event_mask(event) & flag_read))    return;  set_event_mask(event, event_mask(event) & ~flag_read);  modify(event, EV_DELETE, EVFILT_READ);}voidPollKQueue::remove_write(Event* event) {  if (!(event_mask(event) & flag_write))    return;  set_event_mask(event, event_mask(event) & ~flag_write);  modify(event, EV_DELETE, EVFILT_WRITE);}voidPollKQueue::remove_error(Event* event) {}#else // USE_QUEUEPollKQueue*PollKQueue::create(__UNUSED int maxOpenSockets) {  return NULL;}PollKQueue::~PollKQueue() {}intPollKQueue::poll(__UNUSED int msec) {  throw internal_error("An PollKQueue function was called, but it is disabled.");}voidPollKQueue::perform() {  throw internal_error("An PollKQueue function was called, but it is disabled.");}uint32_tPollKQueue::open_max() const {  throw internal_error("An PollKQueue function was called, but it is disabled.");}voidPollKQueue::open(__UNUSED torrent::Event* event) {}voidPollKQueue::close(__UNUSED torrent::Event* event) {}boolPollKQueue::in_read(__UNUSED torrent::Event* event) {  throw internal_error("An PollKQueue function was called, but it is disabled.");}boolPollKQueue::in_write(__UNUSED torrent::Event* event) {  throw internal_error("An PollKQueue function was called, but it is disabled.");}boolPollKQueue::in_error(__UNUSED torrent::Event* event) {  throw internal_error("An PollKQueue function was called, but it is disabled.");}voidPollKQueue::insert_read(__UNUSED torrent::Event* event) {}voidPollKQueue::insert_write(__UNUSED torrent::Event* event) {}voidPollKQueue::insert_error(__UNUSED torrent::Event* event) {}voidPollKQueue::remove_read(__UNUSED torrent::Event* event) {}voidPollKQueue::remove_write(__UNUSED torrent::Event* event) {}voidPollKQueue::remove_error(__UNUSED torrent::Event* event) {}PollKQueue::PollKQueue(__UNUSED int fd, __UNUSED int maxEvents, __UNUSED int maxOpenSockets) {  throw internal_error("An PollKQueue function was called, but it is disabled.");}#endif // USE_KQUEUE}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -