priosched.hh
来自「COPE the first practical network coding 」· HH 代码 · 共 47 行
HH
47 行
// -*- c-basic-offset: 4 -*-#ifndef CLICK_PRIOSCHED_HH#define CLICK_PRIOSCHED_HH#include <click/element.hh>#include <click/notifier.hh>CLICK_DECLS/* * =c * PrioSched * =s packet scheduling * pulls from priority-scheduled inputs * =d * Each time a pull comes in the output, PrioSched pulls from * each of the inputs starting from input 0. * The packet from the first successful pull is returned. * This amounts to a strict priority scheduler. * * The inputs usually come from Queues or other pull schedulers. * PrioSched uses notification to avoid pulling from empty inputs. * * =a Queue, RoundRobinSched, StrideSched, DRRSched, SimplePrioSched */class PrioSched : public Element { public: PrioSched(); ~PrioSched(); const char *class_name() const { return "PrioSched"; } const char *processing() const { return PULL; } void notify_ninputs(int); int initialize(ErrorHandler *); void cleanup(CleanupStage); Packet *pull(int port); private: NotifierSignal *_signals; };CLICK_ENDDECLS#endif
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?