OK -- all 15 topology tests still pass using the latest version of the P-200
patch ( diff3 ).
- Original Message -
From: Michael Goulish mgoul...@redhat.com
To: proton@qpid.apache.org
Sent: Wednesday, February 20, 2013 9:36:58 AM
Subject: Re: topology: all tests pass!
1. Yes! I'll do that today.
2. Yes! I just talked to Cliff about ctest. Something I had already started
should work well for that.
- Original Message -
From: Rafael Schloming r...@alum.mit.edu
To: proton@qpid.apache.org
Sent: Tuesday, February 19, 2013 11:35:06 PM
Subject: Re: topology: all tests pass!
Cool, can you rerun this with the update version of the proton-200 -1
patch? (https://reviews.apache.org/r/9503/)
Also,would it make sense to set these tests up to run as part of the new
ctest stuff?
--Rafael
On Tue, Feb 19, 2013 at 2:05 PM, Michael Goulish mgoul...@redhat.comwrote:
Green across the board.
Same program running in 1, 2, or 3 instances.
1 messenger in each process. No recompile
needed between tests -- only the command line args
change.
All possible combinations of 3 or fewer nodes,
with 0, 1, or 2 (bi-directional) links between each
pair. Including single node, with self-loop.
To pass a test, I have to see that all nodes are receiving
messages simultaneously, and when one node is receiving from
2 senders, its incoming messages should be interleaved ( i.e.
*not* all the messages from node A, followed by all the messages
from node B ) and getting them in similar proportions from both
sources.
This is using Proton 0.4 RC1 code, with the infinite credit
patch -- but none of the messengers are actually asking for
infinite credit.
The tests are easy to re-run for future versions, and I will
do that.
... pretty picture attached ...
