| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Rework upstreams library | Vsevolod Stakhov | 2015-12-03 | 1 | -19/+39 |
| | | | | | Now each address has its own errors count, so rspamd will prefer upstream addrs with no errors to addrs with errors. This might help to resolve issues on systems where ipv6 does not work. | ||||
| * | Use new rotation logic in the code | Vsevolod Stakhov | 2015-11-21 | 1 | -3/+3 |
| | | |||||
| * | Rework upstreams initialization | Vsevolod Stakhov | 2015-11-20 | 1 | -6/+3 |
| | | |||||
| * | Fix tests | Vsevolod Stakhov | 2015-11-20 | 1 | -6/+5 |
| | | |||||
| * | Fix parsing of fixed length IP addresses. | Vsevolod Stakhov | 2015-10-13 | 1 | -2/+2 |
| | | |||||
| * | Reorganize includes to reduce namespace pollution. | Vsevolod Stakhov | 2015-10-08 | 1 | -1/+1 |
| | | |||||
| * | Rename main.h and main.c to `rspamd.X` | Vsevolod Stakhov | 2015-09-22 | 1 | -1/+1 |
| | | |||||
| * | Add tags to rspamd_mempool. | Vsevolod Stakhov | 2015-08-27 | 1 | -1/+1 |
| | | |||||
| * | Fix upstream test. | Vsevolod Stakhov | 2015-03-14 | 1 | -1/+3 |
| | | |||||
| * | Fix order of upstream in test rotation. | Vsevolod Stakhov | 2015-03-12 | 1 | -2/+2 |
| | | |||||
| * | Fix test framework. | Vsevolod Stakhov | 2015-03-12 | 1 | -7/+6 |
| | | |||||
| * | Rework IP addresses in upstreams. | Vsevolod Stakhov | 2014-11-07 | 1 | -0/+27 |
| | | | | | | | | | | - Select ipv4/unix addresses if they exist and use ipv6 for ipv6 only upstreams (since the support of ipv6 is poor in many OSes and environments). - Free IP list on upstream destruction. - Add test cases for addresses selection. - Allow adding of free form IP addresses to upstreams. | ||||
| * | Improve upstream tests. | Vsevolod Stakhov | 2014-11-03 | 1 | -1/+31 |
| | | |||||
| * | Configure upstreams in workers. | Vsevolod Stakhov | 2014-11-03 | 1 | -2/+4 |
| | | |||||
| * | Add consistent hash test. | Vsevolod Stakhov | 2014-11-02 | 1 | -5/+43 |
| | | | | | | | | | | | P value is calculated as following: when we add/remove M upstreams from the list, the probability of hash miss should be close to the relation N / (N + M), where N is the size of the previous upstreams list. So far, the algorithm described in http://arxiv.org/abs/1406.2294 shows p value more than 0.99. | ||||
| * | Some more fixes to the test. | Vsevolod Stakhov | 2014-11-02 | 1 | -1/+4 |
| | | |||||
| * | Add a simple upstreams test. | Vsevolod Stakhov | 2014-11-02 | 1 | -0/+73 |
 |
index : rspamd.git | |
| Rapid spam filtering system: https://github.com/rspamd/rspamd | www-data |
| aboutsummaryrefslogtreecommitdiffstats |