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

📄 schedordertest.hh

📁 COPE the first practical network coding scheme which is developped on click
💻 HH
字号:
// -*- c-basic-offset: 4 -*-#ifndef CLICK_SCHEDORDERTEST_HH#define CLICK_SCHEDORDERTEST_HH#include <click/element.hh>#include <click/task.hh>#include "elements/standard/simplequeue.hh"CLICK_DECLS/*=cSchedOrderTest(ID, [<keyword> SIZE, LIMIT, STOP])=s testremembers scheduling order=ioNone=dSchedOrderTest elements repeatedly schedule themselves, and keep track of theorder in which they were scheduled.  ID is an integer used to distinguishbetween different SchedOrderTest elements.  The "order" handler reports thesequence of IDs corresponding to the order in which the first SIZESchedOrderTest tasks were scheduled.  Use ScheduleInfo to set SchedOrderTest'stickets.=over 8=item SIZEInteger.  The maximum length of the stored ID sequence.  Default is 1024.=item LIMITUnsigned.  SchedOrderTest will schedule itself at most LIMIT times.  0 meansforever.  Default is 0.=item STOPBoolean.  If true, SchedOrderTest will stop the driver when the ID sequence isfull.  (Note that this has to do with SIZE, not LIMIT.)  Default is false.=h order read-onlyReports the ID sequence as a space-separated list of integers.=aScheduleInfo*/class SchedOrderTest : public Element { public:    SchedOrderTest();    ~SchedOrderTest();    const char *class_name() const		{ return "SchedOrderTest"; }    const char *processing() const		{ return AGNOSTIC; }    int configure(Vector<String> &, ErrorHandler *);    int initialize(ErrorHandler *);    void add_handlers();    bool run_task();  private:    int _id;    uint32_t _count;    uint32_t _limit;    int** _bufpos_ptr;    int* _buf_begin;    int* _bufpos;    int* _buf_end;    int _bufsiz;    Task _task;    bool _stop;    static String read_handler(Element*, void*);    };CLICK_ENDDECLS#endif

⌨️ 快捷键说明

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