subversion-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From gst...@apache.org
Subject svn commit: r1148593 - /subversion/trunk/notes/ra-serf-testing.txt
Date Wed, 20 Jul 2011 01:17:59 GMT
Author: gstein
Date: Wed Jul 20 01:17:58 2011
New Revision: 1148593

URL: http://svn.apache.org/viewvc?rev=1148593&view=rev
Log:
Add more information on each of the operation sequences needed to perform
the specific tests.

* notes/ra-serf-testing.txt: more data for each TEST x.y

Modified:
    subversion/trunk/notes/ra-serf-testing.txt

Modified: subversion/trunk/notes/ra-serf-testing.txt
URL: http://svn.apache.org/viewvc/subversion/trunk/notes/ra-serf-testing.txt?rev=1148593&r1=1148592&r2=1148593&view=diff
==============================================================================
--- subversion/trunk/notes/ra-serf-testing.txt (original)
+++ subversion/trunk/notes/ra-serf-testing.txt Wed Jul 20 01:17:58 2011
@@ -124,33 +124,121 @@ arrange to test:
 
 TEST 1.1
 
-A simple pause with arriving data will test this.
+Force the parser to pause the first time, then have arriving content
+saved to the pending data.
 
 Exits in state (3).
 
 
 TEST 1.2
 
+We need to force the parser to pause, then we need content saved (to
+reach state (3)), then unpause the parser and inject all the content,
+returning to state (2). Then force the parser to pause again, and
+stash some data to pending.
+
+Exits in state (3).
+
+
 TEST 1.3
 
+Two blocks of content from the network must arrive while the parser is
+paused, and assume no spill file. The first block moves us from state
+(1) or (2) into state (3). The second block performs this test.
+
+Exits in state (3) or (4).
+
+Note: while technically, we want to test the transition to *both*
+states (3) and (4), the setup requirements for 1.4 tests the second
+condition. We merely want to add more memory content while already in
+state (3).
+
+
 TEST 1.4
 
+Pause the parser, then force enough content into pending to create a
+spill file (now in state (4)). Then have one more block arrive.
+
+Exits in state (4).
+
+
 TEST 1.6
 
+Pause the parser, then force enough content into pending to create a
+spill file (state (4)). Then unpause the parser and force the
+injection of the memory content (but not the spill file) into the
+parser to move to state (6). Then pause the parser again and get one
+more block of content.
+
+Exits in state (6).
+
+
 TEST 1.7
 
+Pause the parser, then force enough content into pending to create a
+spill file (state (4)). Then unpause the parser and force the
+injection of ALL that content (memory and disk) to move into state
+(7). Then pause the parser again and save one more block to pending.
+
+Exits in state (6).
+
+
 TEST 2.3
 
+Pause the parser, then save one block of content to move to state
+(3). Unpause the parser and receive one more block of content (before
+injecting the saved content).
+
+Exits in state (3).
+
+
 TEST 2.4
 
+Pause the parser, then save enough content to state (4).  Unpause the
+parser and receive one more block of content.
+
+Exits in state (4).
+
+
 TEST 2.6
 
+Pause the parser, then save enough content to reach state (4). Unpause
+the parser and inject all the memory content, moving to state
+(6). Stop the injection, then receive one block of content from the
+network.
+
+Exits in state (6).
+
+
 TEST 3.3
 
+Pause the parser, then save enough content to reach state (3). Unpause
+the parser and inject some content.
+
+Exits in state (2) or (3).
+
+
 TEST 3.4
 
+Pause the parser, then save enough content to reach state (4). Unpause
+the parser and inject some content.
+
+Exits in state (2), (3), (4), (6), or (7).
+
+Note: if we merely inject from memory, then we exit in (4) or (6).
+
+
 TEST 3.6
 
+Pause the parser, then save enough content to reach state (4). Unpause
+the parser and inject all memory content to reach state (6). Then
+inject some disk content.
+
+Exits in state (6) or (7).
+
+
+------------
+OLD NOTES
 
 These combine into the following test scenarios to exercise the two
 actions against each of the ten data states.



Mime
View raw message