Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
Z
ZEO
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
Analytics
Analytics
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
Kirill Smelkov
ZEO
Commits
ad2f27c9
Commit
ad2f27c9
authored
Jan 06, 2004
by
Jeremy Hylton
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
A failing test case provided by Dieter.
parent
fb01c60d
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
94 additions
and
0 deletions
+94
-0
src/ZEO/tests/InvalidationTests.py
src/ZEO/tests/InvalidationTests.py
+94
-0
No files found.
src/ZEO/tests/InvalidationTests.py
View file @
ad2f27c9
...
...
@@ -14,6 +14,7 @@
import
threading
import
time
from
random
import
Random
from
BTrees.check
import
check
,
display
from
BTrees.OOBTree
import
OOBTree
...
...
@@ -55,6 +56,74 @@ class FailableThread(TestThread):
self
.
stop
.
set
()
raise
class
StressTask
:
# Append integers startnum, startnum + step, startnum + 2*step, ...
# to 'tree'. If sleep is given, sleep
# that long after each append. At the end, instance var .added_keys
# is a list of the ints the thread believes it added successfully.
def
__init__
(
self
,
testcase
,
db
,
threadnum
,
startnum
,
step
=
2
,
sleep
=
None
):
self
.
db
=
db
self
.
threadnum
=
threadnum
self
.
startnum
=
startnum
self
.
step
=
step
self
.
sleep
=
sleep
self
.
added_keys
=
[]
self
.
cn
=
self
.
db
.
open
()
self
.
cn
.
setLocalTransaction
()
self
.
cn
.
sync
()
def
doStep
(
self
):
tree
=
self
.
cn
.
root
()[
"tree"
]
key
=
self
.
startnum
tree
[
key
]
=
self
.
threadnum
def
commit
(
self
):
cn
=
self
.
cn
key
=
self
.
startnum
cn
.
getTransaction
().
note
(
"add key %s"
%
key
)
try
:
cn
.
getTransaction
().
commit
()
except
ConflictError
,
msg
:
cn
.
getTransaction
().
abort
()
cn
.
sync
()
else
:
if
self
.
sleep
:
time
.
sleep
(
self
.
sleep
)
self
.
added_keys
.
append
(
key
)
self
.
startnum
+=
self
.
step
def
cleanup
(
self
):
self
.
cn
.
getTransaction
().
abort
()
self
.
cn
.
close
()
def
_runTasks
(
rounds
,
*
tasks
):
'''run *task* interleaved for *rounds* rounds.'''
def
commit
(
run
,
actions
):
actions
.
append
(
':'
)
for
t
in
run
:
t
.
commit
()
del
run
[:]
r
=
Random
()
r
.
seed
(
1064589285
)
# make it deterministic
run
=
[]
actions
=
[]
try
:
for
i
in
range
(
rounds
):
t
=
r
.
choice
(
tasks
)
if
t
in
run
:
commit
(
run
,
actions
)
run
.
append
(
t
)
t
.
doStep
()
actions
.
append
(
`t.startnum`
)
commit
(
run
,
actions
)
# stderr.write(' '.join(actions)+'\n')
finally
:
for
t
in
tasks
:
t
.
cleanup
()
class
StressThread
(
FailableThread
):
# Append integers startnum, startnum + step, startnum + 2*step, ...
...
...
@@ -348,6 +417,31 @@ class InvalidationTests:
for
t
in
threads
:
t
.
cleanup
()
def
checkConcurrentUpdates2Storages_emulated
(
self
):
self
.
_storage
=
storage1
=
self
.
openClientStorage
()
storage2
=
self
.
openClientStorage
()
db1
=
DB
(
storage1
)
db2
=
DB
(
storage2
)
cn
=
db1
.
open
()
tree
=
cn
.
root
()[
"tree"
]
=
OOBTree
()
get_transaction
().
commit
()
# DM: allow time for invalidations to come in and process them
time
.
sleep
(
0.1
)
# Run two threads that update the BTree
t1
=
StressTask
(
self
,
db1
,
1
,
1
,)
t2
=
StressTask
(
self
,
db2
,
2
,
2
,)
_runTasks
(
100
,
t1
,
t2
)
cn
.
sync
()
self
.
_check_tree
(
cn
,
tree
)
self
.
_check_threads
(
tree
,
t1
,
t2
)
cn
.
close
()
db1
.
close
()
db2
.
close
()
def
checkConcurrentUpdates2Storages
(
self
):
self
.
_storage
=
storage1
=
self
.
openClientStorage
()
storage2
=
self
.
openClientStorage
()
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment