ipstruct.h

   1 struct IP
   2 {
   3  char *addr;
   4  char *name;
   5  char *sharing;
   6  int min;
   7  int desired;
   8  int max;
   9  int mark;
  10  int prio;
  11  int fixedprio;
  12  int group;
  13  int lmsid;
  14  unsigned long long direct;
  15  unsigned long long proxy;
  16  unsigned long long upload;
  17  unsigned long long traffic;
  18  unsigned long long credit;
  19  unsigned long pktsup;
  20  unsigned long pktsdown;
  21  struct Keyword *keyword;
  22  list(IP);
  23 };
  24
  25 struct Group
  26 {
  27  int min;
  28  int count;
  29  int desired;
  30  int id;
  31  list(Group);
  32 };
  33
  34 struct Keyword
  35 {
  36  char *key;
  37
  38  int asymetry_ratio;        /* ratio for ADSL-like upload */
  39  int asymetry_fixed;        /* fixed treshold for ADSL-like upload */
  40  int data_limit;            /* hard shaping: apply magic_treshold if max*data_limit MB exceeded */
  41  int data_prio;             /* soft shaping (qos): reduce HTB prio if max*data_prio MB exceeded */
  42  long fixed_limit;          /* fixed data limit for setting lower HTB ceil */
  43  long fixed_prio;           /* fixed data lmit for setting lower HTB prio */
  44  int reserve_min;           /* bonus for nominal HTB rate bandwidth (in kbps) */
  45  int reserve_max;           /* malus for nominal HTB ceil (in kbps) */
  46 // int divide_max;          /* relative malus: new_ceil=rate+(old_ceil-rate)/divide_max */
  47 // int htb_ceil_bonus_divide; /* relative bonus: new_ceil=old_ceil+old_ceil/htb_ceil_bonus_divide */
  48  int default_prio;          /* default HTB priority for this keyword */
  49  char *html_color;
  50  int ip_count;
  51  char *leaf_discipline;
  52
  53  list(Keyword);
  54 };