| | 1 | /* Modified by: xChaos, 20131029 */\r |
| | 2 | \r |
| | 3 | struct IP\r |
| | 4 | {\r |
| | 5 | char *addr;\r |
| | 6 | char *name;\r |
| | 7 | char *sharing;\r |
| | 8 | int min;\r |
| | 9 | int desired;\r |
| | 10 | int max;\r |
| | 11 | int mark;\r |
| | 12 | int prio;\r |
| | 13 | int aggregated;\r |
| | 14 | int fixedprio;\r |
| | 15 | int group;\r |
| | 16 | int lmsid;\r |
| | 17 | int pps_limit;\r |
| | 18 | unsigned long long direct;\r |
| | 19 | unsigned long long proxy;\r |
| | 20 | unsigned long long traffic_down;\r |
| | 21 | unsigned long long traffic_up;\r |
| | 22 | unsigned long long upload;\r |
| | 23 | unsigned long long traffic;\r |
| | 24 | unsigned long long credit;\r |
| | 25 | unsigned long long realquota;\r |
| | 26 | unsigned long pktsup;\r |
| | 27 | unsigned long pktsdown;\r |
| | 28 | struct Keyword *keyword;\r |
| | 29 | int v6;\r |
| | 30 | int mask;\r |
| | 31 | struct IP *uplink;\r |
| | 32 | list(IP);\r |
| | 33 | };\r |
| | 34 | \r |
| | 35 | struct Group\r |
| | 36 | {\r |
| | 37 | int min;\r |
| | 38 | int count;\r |
| | 39 | int desired;\r |
| | 40 | int id;\r |
| | 41 | list(Group);\r |
| | 42 | };\r |
| | 43 | \r |
| | 44 | struct Keyword\r |
| | 45 | {\r |
| | 46 | char *key;\r |
| | 47 | \r |
| | 48 | float asymetry_ratio; /* ratio for ADSL-like upload */\r |
| | 49 | int asymetry_fixed; /* fixed treshold for ADSL-like upload */\r |
| | 50 | int data_limit; /* hard shaping: apply magic_treshold if max*data_limit MB exceeded */\r |
| | 51 | int data_prio; /* soft shaping (qos): reduce HTB prio if max*data_prio MB exceeded */\r |
| | 52 | long fixed_limit; /* fixed data limit for setting lower HTB ceil */\r |
| | 53 | long fixed_prio; /* fixed data lmit for setting lower HTB prio */\r |
| | 54 | int reserve_min; /* bonus for nominal HTB rate bandwidth (in kbps) */\r |
| | 55 | int reserve_max; /* malus for nominal HTB ceil (in kbps) */\r |
| | 56 | // int divide_max; /* relative malus: new_ceil=rate+(old_ceil-rate)/divide_max */\r |
| | 57 | // int htb_ceil_bonus_divide; /* relative bonus: new_ceil=old_ceil+old_ceil/htb_ceil_bonus_divide */\r |
| | 58 | int default_prio; /* default HTB priority for this keyword */\r |
| | 59 | int download_aggregation; /* apply agregation with -s start_shaping switch */\r |
| | 60 | int upload_aggregation; /* apply agregation with -s start_shaping switch */\r |
| | 61 | char *html_color;\r |
| | 62 | int ip_count;\r |
| | 63 | char *leaf_discipline;\r |
| | 64 | int allowed_avgmtu; /* this is for calculating packet limits, 0 = no limit*/ \r |
| | 65 | list(Keyword);\r |
| | 66 | };\r |
| | 67 | \r |
| | 68 | struct Macro\r |
| | 69 | {\r |
| | 70 | char *rewrite_from;\r |
| | 71 | char *rewrite_to;\r |
| | 72 | list(Macro);\r |
| | 73 | };\r |
| | 74 | \r |
| | 75 | struct Index\r |
| | 76 | {\r |
| | 77 | char *addr;\r |
| | 78 | char *id;\r |
| | 79 | struct Index *parent;\r |
| | 80 | int bitmask;\r |
| | 81 | int children;\r |
| | 82 | int ipv6;\r |
| | 83 | list(Index);\r |
| | 84 | };\r |
| | 85 | \r |
| | 86 | struct Interface \r |
| | 87 | {\r |
| | 88 | char *name;\r |
| | 89 | long long speed;\r |
| | 90 | int is_upstream;\r |
| | 91 | char *chain;\r |
| | 92 | char *idxprefix;\r |
| | 93 | list(Interface);\r |
| | 94 | };\r |
| | 95 | \r |
| | 96 | void TheIP(char *ipaddr, int is_network);\r |
| | 97 | /* function implemented in parsehosts.c */\r |
GIT.Harvie.CZ / svn / Prometheus-QoS / .git / blame_incremental