summaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAgeFilesLines
* Wrote new documentation for VQMatthew Sackman2010-01-211-30/+92
|
* doc improvementMatthew Sackman2010-01-211-2/+2
|
* Added documentation for qiMatthew Sackman2010-01-211-0/+70
|
* merge in from defaultMatthew Sackman2010-01-217-34/+77
|\
| * this looks prettierMatthias Radestock2010-01-211-1/+1
| |
| * merge v1_7 into defaultMatthias Radestock2010-01-196-31/+78
| |\
| | * merge bug22223 into v1_7Matthias Radestock2010-01-191-1/+1
| | |\
| | | * Bumped priority of acks to match that of the unblock and notify_sent callsMatthew Sackman2010-01-181-1/+1
| | | |
| | * | merge bug22221 into v1_7Matthias Radestock2010-01-192-22/+29
| | |\ \ | | | |/ | | |/|
| | | * no need to match on 'ok' twiceMatthias Radestock2010-01-191-5/+5
| | | |
| | | * vertical alignment of -> in queue_foldDavid R. MacIver2010-01-191-1/+1
| | | |
| | | * rebranch off v1_7 rather than defaultDavid R. MacIver2010-01-192-24/+31
| | |/
| | * merge bug22013 into v1_7Matthias Radestock2010-01-152-8/+12
| | |\
| | | * The DEFAULT_ values should not be available to the .conf fileMatthew Sackman2010-01-152-4/+4
| | | |
| | | * Fixed. If the env vars are not set, combine them from the .conf file ↵Matthew Sackman2010-01-152-8/+12
| | | | | | | | | | | | | | | | (non-RABBITMQ_-prefixed). In the case of one set but not the other, use the DEFAULT_ values.
| | * | merge bug19111 into v1_7Matthias Radestock2010-01-151-0/+36
| | |\ \
| | | * | recreate branch in correct placeMatthias Radestock2010-01-151-0/+36
| | |/ /
| * | | bug22209: added a comment to use upmap carefully.Alexander Schmolck2010-01-131-2/+5
| | | |
* | | | merge bug22218 into bug21673Matthias Radestock2010-01-213-34/+64
|\ \ \ \
| * | | | fixed²Matthew Sackman2010-01-211-3/+3
| | | | |
| * | | | fixedMatthew Sackman2010-01-211-1/+2
| | | | |
| * | | | Given we know all of those processes are about to be enabled, the order in ↵Matthew Sackman2010-01-201-1/+1
| | | | | | | | | | | | | | | | | | | | which we do that is actually irrelevant
| * | | | A mistake in the error case in accept, and elimination of one reverseMatthew Sackman2010-01-202-6/+6
| | | | |
| * | | | documentationMatthew Sackman2010-01-191-0/+8
| | | | |
| * | | | merging in from bug21673Matthew Sackman2010-01-191-8/+9
| |\ \ \ \
| * | | | | The motivation for the cast in init is that if the first obtain blocks then ↵Matthew Sackman2010-01-193-11/+12
| | | | | | | | | | | | | | | | | | | | | | | | without the cast, rabbit won't startup because of the fact that start_link blocks on init thus the boot process won't finish. Switched to monitoring the spawned process which is much much nicer than passing through a fun to be run at the end of the process and is a much more generic solution anyway.
| * | | | | Initial pass at solution. Seems to work. Interesting realisation that the ↵Matthew Sackman2010-01-184-29/+54
| | | | | | | | | | | | | | | | | | | | | | | | fhc server was never previously running (post new boot sequence).
* | | | | | documentationMatthew Sackman2010-01-191-17/+47
| | | | | |
* | | | | | Added behaviour for msg_store_index and tidied includes, and updated ↵Matthew Sackman2010-01-194-2/+112
| |/ / / / |/| | | | | | | | | | | | | | makefile appropriately. Good lord it'd be nice if erlang did proper build dependencies...
* | | | | documentation tweaksMatthew Sackman2010-01-191-8/+9
| | | | |
* | | | | Make sure the fhc server is started early on in the boot processMatthew Sackman2010-01-191-0/+5
|/ / / /
* | | | Of course, there's no reason not to add into the current file cache ↵Matthew Sackman2010-01-181-5/+9
| | | | | | | | | | | | | | | | immediately, thus allowing a write followed by a read to have no delay at all
* | | | Of course, we should only delete messages when they're, err, due to be ↵Matthew Sackman2010-01-181-4/+4
| | | | | | | | | | | | | | | | deleted...
* | | | Refactored and generally tidied the msg_store. Also added a write-back cache ↵Matthew Sackman2010-01-172-144/+144
| | | | | | | | | | | | | | | | for the current file. This means that the clients don't need to go to the server when reading a msg from the current file. Managed to avoid using any further lines!
* | | | Correction of modes in readingMatthew Sackman2010-01-161-1/+1
| | | |
* | | | When publishing delivered, the fact is, the message has already been ↵Matthew Sackman2010-01-161-1/+1
| | | | | | | | | | | | | | | | delivered. Thus it should be marked as such, otherwise bad things happen when you eventually try to delete the queue (i.e. crash).
* | | | Inability to do basic mathsMatthew Sackman2010-01-161-9/+11
| | | |
* | | | Refactoring of bpqMatthew Sackman2010-01-152-132/+85
| | | |
* | | | Extensive testing suggests the batch size was previous set too highMatthew Sackman2010-01-141-1/+1
| | | |
* | | | Should actually be working on the ratio of betas to betas+alphas. Thus ↵Matthew Sackman2010-01-141-2/+3
| | | | | | | | | | | | | | | | subtract out deltacount
* | | | the ratio should always be 1. Hence removed.Matthew Sackman2010-01-131-7/+1
| | | |
* | | | Much better. The reason why batching is important is because if you're ↵Matthew Sackman2010-01-133-75/+192
| | | | | | | | | | | | | | | | walking through the bpqueue and doing very little work before stopping then you don't really get the amortised constant time behaviour. But the goal is achieved - throughput is maintained and very slowly diminishes with no major interruptions and the queue gets fuller and the transition is made to betas and then deltas.
* | | | Forgot to remove an io:formatMatthew Sackman2010-01-131-2/+1
| | | |
* | | | Mechanism to limit the number of betas which don't have their index on disk ↵Matthew Sackman2010-01-133-3/+206
| | | | | | | | | | | | | | | | is now in. Testing showed that if the queue is long, the change in target_ram_msg_count can be large, thus driving the number of ram indices directly off that still doesn't solve the problem. Thus am driving it from publish, with a limit on the maximum amount of work that can be done. This should allow the queue to remain responsive, as it works towards its goal. However, further testing, tuning and thinking is still needed.
* | | | Refactoring of vq - pulled out the inlined block-prefix queue code and ↵Matthew Sackman2010-01-133-200/+324
| | | | | | | | | | | | | | | | generally tidied profusely. Also efficiency fix in remove_queue_entries by avoiding an intermediate list (which could potentially be massive).
* | | | Right, getting there - some major reworkings to vq which have fixed bugs. It ↵Matthew Sackman2010-01-123-360/+467
| | | | | | | | | | | | | | | | doesn't quite do everything I want it to do it - in particular, on memory reduction, it needs to ensure that the inner queues nearest δ have sufficient non-ram-index msgs, but all thet tests pass and adding that feature shouldn't be too painful.
* | | | some minor refactoring (more to do), and spotted and fixed a race conditionMatthew Sackman2010-01-091-20/+38
| | | |
* | | | Scanning the common operation, so that should be prioritied. The open->close ↵Matthew Sackman2010-01-081-6/+6
| | | | | | | | | | | | | | | | transition is much rarer (only on GC startup and file deletion) so can be slower.
* | | | Correct the closing mech. Sadly I'm currently scanning the whole table every ↵Matthew Sackman2010-01-081-22/+17
| | | | | | | | | | | | | | | | time, which is bad. I might change that to scan every, say, 1000 reads
* | | | Whoops, forgot to remove an io:formatMatthew Sackman2010-01-081-1/+0
| | | |