HomeSort by relevance Sort by last modified time
    Searched refs:CBAndEventMask (Results 1 - 2 of 2) sorted by null

  /external/chromium/net/tools/flip_server/
epoll_server.cc 33 // CBAndEventMask struct. This enables O(1) lookup in the list for a given
35 // and keep a list::iterator in CBAndEventMask to achieve the same effect.
41 // of link pointers makes it easier to retrieve the CBAndEventMask from the
42 // list, easier to check whether an CBAndEventMask is in the list, uses less
45 // - Embed the fd directly into CBAndEventMask and switch to using hash_set.
167 inline void EpollServer::AddToReadyList(CBAndEventMask* cb_and_mask) {
175 const CBAndEventMask& cb_and_mask) {
193 FDToCBMap::iterator fd_i = cb_map_.find(CBAndEventMask(NULL, 0, fd));
214 cb_map_.insert(CBAndEventMask(cb, event_mask, fd));
271 FDToCBMap::iterator fd_i = cb_map_.find(CBAndEventMask(NULL, 0, fd))
    [all...]
epoll_server.h 517 struct CBAndEventMask {
518 CBAndEventMask()
529 CBAndEventMask(EpollCallbackInterface* cb,
539 // standing function. However, since CBAndEventMask is a protected type and
541 bool operator==(const CBAndEventMask& cb_and_mask) const {
548 mutable LIST_ENTRY(CBAndEventMask) entry;
564 size_t operator()(const CBAndEventMask& cb_and_eventmask) const {
569 typedef __gnu_cxx::hash_set<CBAndEventMask, CBAndEventMaskHash> FDToCBMap;
649 // CBAndEventMask to the ready list. If the fd is already on the ready
651 void AddToReadyList(CBAndEventMask* cb_and_mask)
    [all...]

Completed in 35 milliseconds