summaryrefslogtreecommitdiff
path: root/ChangeLog-97a
diff options
context:
space:
mode:
authorirfan <irfan@ae88bc3d-4319-0410-8dbf-d08b4c9d3795>1997-05-08 07:00:44 +0000
committerirfan <irfan@ae88bc3d-4319-0410-8dbf-d08b4c9d3795>1997-05-08 07:00:44 +0000
commitc427a7032a3614b17ff3780a731a922370738d08 (patch)
treee0ec6bfe97294fb2d4b7c60bfbfb1d81acf11808 /ChangeLog-97a
parent23996fd603ff10dd02ea9d3374b563e579af0630 (diff)
downloadATCD-c427a7032a3614b17ff3780a731a922370738d08.tar.gz
*** empty log message ***
Diffstat (limited to 'ChangeLog-97a')
-rw-r--r--ChangeLog-97a22
1 files changed, 22 insertions, 0 deletions
diff --git a/ChangeLog-97a b/ChangeLog-97a
index 307c21ceafc..49ca5fe5875 100644
--- a/ChangeLog-97a
+++ b/ChangeLog-97a
@@ -1,3 +1,25 @@
+Thu May 08 01:12:59 1997 <irfan@TWOSTEP>
+
+ * tests/Message_Block_Test.cpp: I was incorrect about each data
+ block having its own lock. Since *many* data blocks can share
+ the same lock, for the case of message block chains, we would
+ like to optimize locking.
+
+ Therefore, the first guy in the chain grabs the lock and passes
+ it to the continuation chain. When each guy in the chain gets
+ it, it compares the passed lock to its own locking strategy. If
+ it is the same lock, no need to acquire the lock again. If our
+ lock is different, then we do our own locking.
+
+ * tests/Simple_Message_Block_Test.cpp: This test program is a
+ torture test that illustrates how ACE_Message_Block reference
+ counting works, how and when locks are used, how memory is
+ managed, and how continuation chains of message blocks are
+ made. Ideally used with purify :-)
+
+ * tests: Added new test. Following changed:
+ Makefile run_tests.bat run_tests.sh tests.mak tests.mdp
+
Thu May 8 00:40:57 1997 Douglas C. Schmidt <schmidt@tango.cs.wustl.edu>
* ace/Containers.i (size): Changed <TYPE> to <T> so that this