summaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAgeFilesLines
* Merge bug25948Simon MacMullen2014-01-080-0/+0
|\
* \ merge default into bug25948Matthias Radestock2014-01-083-14/+14
|\ \ | |/
| * stable to default (noop)Simon MacMullen2014-01-080-0/+0
| |\
| | * Merge bug25936Simon MacMullen2014-01-081-1/+3
| | |\
| | * | consumers/1 returns a list of 4-tuples now.Simon MacMullen2014-01-071-1/+1
| | | |
| * | | Merge bug25937Simon MacMullen2014-01-082-12/+21
| |\ \ \
| | * \ \ (re)merge bug25942 into defaultMatthias Radestock2014-01-071-1/+1
| | |\ \ \
| | | * | | grrr, forgot oneMatthias Radestock2014-01-071-1/+1
| | | | | |
| | * | | | (re)merge bug25942 into defaultMatthias Radestock2014-01-071-10/+10
| | |\ \ \ \ | | | |/ / /
| | | * | | it turns out that dialyzer dislikes improper listsMatthias Radestock2014-01-071-10/+10
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | ...and spits out "Cons will produce an improper list" errors *sigh*
| * | | | | Rename this againSimon MacMullen2014-01-082-3/+3
| | | | | |
* | | | | | simpler and more efficientMatthias Radestock2014-01-081-3/+1
| | | | | |
* | | | | | merge bug25937 into bug25948Matthias Radestock2014-01-083-64/+52
|\ \ \ \ \ \ | |/ / / / / | | | | | | | | | | | | and largely rewrite it in the process
| * | | | | Even clearer?Simon MacMullen2014-01-072-18/+18
| | | | | |
| * | | | | Maybe this is clearer?Simon MacMullen2014-01-072-17/+17
| | | | | |
| * | | | | Simplify further, don't use a proplistSimon MacMullen2014-01-072-4/+5
| | | | | |
| * | | | | Simplfy (although perhaps not as much as we had hoped) by only informing ↵Simon MacMullen2014-01-073-52/+38
| | | | | | | | | | | | | | | | | | | | | | | | queue decorators when the active consumers may have changed, rather than trying to give them more information about what is happening.
* | | | | | simplifyMatthias Radestock2014-01-071-13/+12
| | | | | |
* | | | | | simplify rabbit_queue_consumers:deliver even furtherMatthias Radestock2014-01-072-33/+29
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | turns out we can ditch another parameter to both that function and the FetchFun we pass on. Also reverted state shrinking in attempt_delivery call site. While it is the right thing in principle, I am not convinced the resulting code is actually easier to grok.
* | | | | | better helperMatthias Radestock2014-01-071-26/+22
| | | | | |
* | | | | | keep State out of one of the FetchFunsMatthias Radestock2014-01-071-10/+14
| | | | | | | | | | | | | | | | | | | | | | | | This is cleaner.
* | | | | | make rabbit_queue_consumers:deliver deliver at most one messageMatthias Radestock2014-01-072-75/+88
| |/ / / / |/| | | | | | | | | | | | | | ...which makes the control flow more obvious
* | | | | Merge bug25935Simon MacMullen2014-01-071-1/+10
|\ \ \ \ \
| * | | | | Accept this from federation.Simon MacMullen2014-01-071-1/+10
|/ / / / /
* | | | | stable to defaultSimon MacMullen2014-01-070-0/+0
|\ \ \ \ \ | |/ / / / |/| | | / | | |_|/ | |/| |
| * | | Merge bug25945 againSimon MacMullen2014-01-071-1/+3
| |\ \ \ | | |_|/ | |/| |
| | * | Uh, that function needs another headerSimon MacMullen2014-01-071-1/+3
| | | |
* | | | Merge bug25938Simon MacMullen2014-01-073-353/+503
|\ \ \ \
| * | | | Multi-headsSimon MacMullen2014-01-071-6/+4
| | | | |
| * | | | Fix handling of credit arriving with drain=true and an empty queue - we need ↵Simon MacMullen2014-01-072-9/+13
| | | | | | | | | | | | | | | | | | | | to not really add the credit (since it is "used up" immediately and thus not unblock if needed).
| * | | | Merge in defaultSimon MacMullen2014-01-075-112/+127
| |\ \ \ \ | |/ / / / |/| | | |
* | | | | Stable to defaultSimon MacMullen2014-01-0716-272/+431
|\ \ \ \ \ | |_|/ / / |/| | | |
| * | | | Merge bug 25943Simon MacMullen2014-01-071-40/+34
| |\ \ \ \
| | * | | | cosmeticMatthias Radestock2014-01-031-6/+5
| | | | | |
| | * | | | lift buffer vars from stateMatthias Radestock2014-01-031-36/+32
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | This improves performance by reducing state update and also makes it clear that these vars are only updated in the two loop functions.
| | * | | | merge bug25939 into bug25943Matthias Radestock2014-01-031-23/+41
| | |\ \ \ \
| * | \ \ \ \ Merge bug25939Simon MacMullen2014-01-061-23/+41
| |\ \ \ \ \ \
| | * | | | | | Simplify binlist_split from /4 to /3.Simon MacMullen2014-01-061-6/+6
| | | |/ / / / | | |/| | | |
| | * | | | | become 1.0 with the correct stateMatthias Radestock2014-01-021-2/+7
| | | | | | |
| | * | | | | eliminate unnecessary state modificationMatthias Radestock2014-01-021-3/+1
| | | | | | | | | | | | | | | | | | | | | | | | | | | | amazingly this actually yields a few % performance improvement
| | * | | | | further optimise frame readingMatthias Radestock2014-01-021-21/+25
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | Handle complete frames in one go, if possible, rather than header and payload separately. This essentially halves the amount of binary splitting in the framing code. Note that we only do this when the buffer contains just one binary. Tests have shown that attempting to introduce this optimisation when the buffer comprises multiple binaries hurts performance for large messages. That's presumably because we end up constructing larger intermediate binaries.
| | * | | | | merge stable into bug25939Matthias Radestock2014-01-011-6/+17
| | |\ \ \ \ \ | | | |/ / / / | | |/| | | |
| | | * | | | refactor: better var namesMatthias Radestock2013-12-271-4/+4
| | | | | | |
| | | * | | | restore short message performanceMatthias Radestock2013-12-271-2/+7
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | it turns out that short message performance had actually gotten worse, but this was masked by the scheduler.
| | | * | | | more efficient data splitting in readerMatthias Radestock2013-12-251-6/+12
| | | | | | |
| * | | | | | Merge bug 25942Simon MacMullen2014-01-0616-175/+323
| |\ \ \ \ \ \ | | |_|_|_|_|/ | |/| | | | |
| | * | | | | stable to defaultSimon MacMullen2014-01-062-2/+2
| | |\ \ \ \ \
| | * \ \ \ \ \ merge stable into defaultMatthias Radestock2014-01-0115-173/+321
| | |\ \ \ \ \ \ | | | |_|/ / / / | | |/| | | | |
| * | | | | | | some small codec optimisationsMatthias Radestock2014-01-022-46/+45
| |/ / / / / / | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | - encode and decode field types as characters rather than strings - construct shallower iolists by cons'ing instead of appending - avoid construction of intermediate binary for tables and arrays
* | | | | | | Merge bug25945Simon MacMullen2014-01-070-0/+0
|\ \ \ \ \ \ \ | | |_|/ / / / | |/| | | | / | |_|_|_|_|/ |/| | | | |