summaryrefslogtreecommitdiff
path: root/src
Commit message (Expand)AuthorAgeFilesLines
* Cache both ends of the queue to give O(1) peek and peek_rMatthew Sackman2011-10-121-37/+68
* Do not use q1+q4 length when calculating permitted ?s - if you do, then as th...Matthew Sackman2011-10-111-5/+4
* Add peek and peek_r to lqueue, and use them in needs_timeout. Whilst this is ...Matthew Sackman2011-10-112-10/+18
* When under memory pressure, we want to limit the size of q2 and q3, not just ...Matthew Sackman2011-10-112-161/+132
* Merging default to bug24455Matthew Sackman2011-10-116-219/+211
|\
| * Merged bug24461 into defaultEmile Joubert2011-10-0611-128/+146
| |\
| | * inline publish/5Matthias Radestock2011-10-061-31/+25
| | * Merged bug24459 into defaultEmile Joubert2011-10-051-30/+34
| | |\
| | | * merge default into bug24459Matthias Radestock2011-10-011-30/+34
| | | |\
| | | | * keep track of uncommitted acks in a list instead of a queueMatthias Radestock2011-10-011-17/+15
| | | | * collect acks in lists rather than queuesMatthias Radestock2011-10-011-20/+26
| | * | | Merged bug24462 into defaultEmile Joubert2011-10-041-1/+1
| | |\ \ \
| | | * | | Don't blow up when nodes policy is used.Simon MacMullen2011-10-031-1/+1
| * | | | | make the rabbit_event API more pleasant to use and less costlyMatthias Radestock2011-10-014-157/+151
| | |_|/ / | |/| | |
* | | | | Ensure that we push ?-bordering ?s into ? eagerly.Matthew Sackman2011-10-112-10/+22
* | | | | Merging default into bug24455Matthew Sackman2011-10-044-648/+271
|\ \ \ \ \ | |_|/ / / |/| | | |
| * | | | simplify delta calculation in push_betas_to_deltasMatthias Radestock2011-10-031-65/+47
| * | | | fix indentationMatthias Radestock2011-10-021-2/+1
| * | | | save a lineMatthias Radestock2011-10-021-3/+2
| * | | | merge headsMatthias Radestock2011-10-021-1/+1
| |\ \ \ \
| | * | | | Make lqueue opaqueMatthew Sackman2011-10-021-1/+1
| * | | | | refactor: get rid of #merge_funsMatthias Radestock2011-10-021-54/+29
| * | | | | some small cosmetic changes and tiny tweaksMatthias Radestock2011-10-021-13/+13
| |/ / / /
| * | | | Drop unneeded queue impls, tidy lqueue, add specs etcMatthew Sackman2011-10-026-820/+28
| * | | | Avoid lots of combine_delta callsMatthew Sackman2011-10-022-45/+87
| * | | | Merging default into bug24455Matthew Sackman2011-10-027-80/+87
| |\ \ \ \
| * | | | | Avoid delta's low end extending beyond the low end of q3Matthew Sackman2011-09-301-16/+21
| * | | | | Merging default into bug24455Matthew Sackman2011-09-304-240/+380
| |\ \ \ \ \
| * | | | | | Count the quota properly on beta -> delta. Also, fprof shows that the queue:l...Matthew Sackman2011-09-292-51/+97
| * | | | | | Count properlyMatthew Sackman2011-09-281-4/+4
| * | | | | | Change one or two things around a little bitMatthew Sackman2011-09-282-114/+83
| * | | | | | Add 2,3-finger_tree implementation.Matthew Sackman2011-09-263-1/+288
| * | | | | | Merging default into bug24455Matthew Sackman2011-09-268-18/+34
| |\ \ \ \ \ \
| * | | | | | | bpqueue is very dependent on the performance of queue:join. fqueue makes queu...Matthew Sackman2011-09-232-32/+152
* | | | | | | | merge bug24323 into defaultMatthias Radestock2011-10-0353-1153/+1701
|\ \ \ \ \ \ \ \ | | |_|_|_|_|/ / | |/| | | | | |
| * | | | | | | optimise resource lookupMatthias Radestock2011-10-032-8/+10
| * | | | | | | improve performance by bypassing mnesia for queue lookupMatthias Radestock2011-10-031-11/+10
| | |_|_|/ / / | |/| | | | |
| * | | | | | optimise interaction of limiter with single queuesMatthias Radestock2011-10-011-0/+1
| * | | | | | switch vq pending_ack from dict to gb_treesMatthias Radestock2011-10-011-14/+13
| * | | | | | optimise vq:drain_confirmed for the common caseMatthias Radestock2011-10-011-1/+5
| | |_|_|/ / | |/| | | |
| * | | | | yes, this really does gain ~1% with MCM with two erlang schedulersMatthias Radestock2011-10-011-3/+9
| | |_|_|/ | |/| | |
| * | | | speed up acks a bitMatthias Radestock2011-10-011-10/+5
| * | | | refactor: extract gb_trees_fold/3 and gb_trees_foreach/2Matthias Radestock2011-10-013-11/+17
| * | | | refactor: eliminate gratuitous differences in 'confirm' codeMatthias Radestock2011-10-012-17/+17
| * | | | refactor: one gb_trees_cons is quite enoughMatthias Radestock2011-10-013-15/+11
| * | | | a few minor tweaks, essentially cosmeticMatthias Radestock2011-09-301-7/+7
| * | | | avoid creation of intermediate binaries by using io_listsMatthias Radestock2011-09-301-3/+2
| * | | | performance improving short cutMatthias Radestock2011-09-301-0/+2
| * | | | cosmeticMatthias Radestock2011-09-301-2/+1
| | |_|/ | |/| |
| * | | correct formattingMatthias Radestock2011-09-301-13/+14