Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
N
neoppod
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
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Jérome Perrin
neoppod
Commits
15bcd495
Commit
15bcd495
authored
Mar 08, 2016
by
Julien Muchembled
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
tests: new helper to synchronize threads
parent
645920e8
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
46 additions
and
34 deletions
+46
-34
neo/tests/threaded/__init__.py
neo/tests/threaded/__init__.py
+34
-2
neo/tests/threaded/test.py
neo/tests/threaded/test.py
+12
-32
No files found.
neo/tests/threaded/__init__.py
View file @
15bcd495
...
...
@@ -16,13 +16,14 @@
# XXX: Consider using ClusterStates.STOPPING to stop clusters
import
os
,
random
,
select
,
socket
,
sys
,
tempfile
,
threading
,
time
,
weakref
import
t
raceback
import
os
,
random
,
select
,
socket
,
sys
,
tempfile
import
t
hread
,
threading
,
time
,
traceback
,
weakref
from
collections
import
deque
from
ConfigParser
import
SafeConfigParser
from
contextlib
import
contextmanager
from
itertools
import
count
from
functools
import
wraps
from
thread
import
get_ident
from
zlib
import
decompress
from
mock
import
Mock
import
transaction
,
ZODB
...
...
@@ -44,6 +45,37 @@ BIND = IP_VERSION_FORMAT_DICT[ADDRESS_TYPE], 0
LOCAL_IP
=
socket
.
inet_pton
(
ADDRESS_TYPE
,
IP_VERSION_FORMAT_DICT
[
ADDRESS_TYPE
])
class
LockLock
(
object
):
"""Double lock used as synchronisation point between 2 threads
Used to wait that a slave thread has reached a specific location, and to
keep it suspended there. It resumes on __exit__
"""
def
__init__
(
self
):
self
.
_l
=
threading
.
Lock
(),
threading
.
Lock
()
def
__call__
(
self
):
"""Define synchronisation point for both threads"""
if
self
.
_owner
==
thread
.
get_ident
():
self
.
_l
[
0
].
acquire
()
else
:
self
.
_l
[
0
].
release
()
self
.
_l
[
1
].
acquire
()
def
__enter__
(
self
):
self
.
_owner
=
thread
.
get_ident
()
for
l
in
self
.
_l
:
l
.
acquire
(
0
)
return
self
def
__exit__
(
self
,
t
,
v
,
tb
):
try
:
self
.
_l
[
1
].
release
()
except
thread
.
error
:
pass
class
FairLock
(
deque
):
"""Same as a threading.Lock except that waiting threads are queued, so that
the first one waiting for the lock is the first to get it. This is useful
...
...
neo/tests/threaded/test.py
View file @
15bcd495
...
...
@@ -30,7 +30,7 @@ from neo.lib.exception import DatabaseFailure, StoppedOperation
from
neo.lib.protocol
import
CellStates
,
ClusterStates
,
NodeStates
,
Packets
,
\
ZERO_TID
from
..
import
expectedFailure
,
_ExpectedFailure
,
_UnexpectedSuccess
,
Patch
from
.
import
NEOCluster
,
NEOThreadedTest
from
.
import
LockLock
,
NEOCluster
,
NEOThreadedTest
from
neo.lib.util
import
add64
,
makeChecksum
,
p64
,
u64
from
neo.client.exception
import
NEOStorageError
from
neo.client.pool
import
CELL_CONNECTED
,
CELL_GOOD
...
...
@@ -751,12 +751,9 @@ class Test(NEOThreadedTest):
self
.
assertEqual
(
list
(
s
.
dm
.
getPartitionTable
()),
pt
)
def
testInternalInvalidation
(
self
):
l1
=
threading
.
Lock
();
l1
.
acquire
()
l2
=
threading
.
Lock
();
l2
.
acquire
()
def
_handlePacket
(
orig
,
conn
,
packet
,
kw
=
{},
handler
=
None
):
if
type
(
packet
)
is
Packets
.
AnswerTransactionFinished
:
l1
.
release
()
l2
.
acquire
()
ll
()
orig
(
conn
,
packet
,
kw
,
handler
)
cluster
=
NEOCluster
()
try
:
...
...
@@ -768,15 +765,11 @@ class Test(NEOThreadedTest):
x1
.
value
=
1
t2
,
c2
=
cluster
.
getTransaction
()
x2
=
c2
.
root
()[
'x'
]
p
=
Patch
(
cluster
.
client
,
_handlePacket
=
_handlePacket
)
try
:
p
.
apply
()
with
LockLock
()
as
ll
,
Patch
(
cluster
.
client
,
_handlePacket
=
_handlePacket
):
t
=
self
.
newThread
(
t1
.
commit
)
l
1
.
acquire
()
l
l
()
t2
.
begin
()
finally
:
del
p
l2
.
release
()
t
.
join
()
self
.
assertEqual
(
x2
.
value
,
1
)
finally
:
...
...
@@ -824,22 +817,18 @@ class Test(NEOThreadedTest):
self
.
assertEqual
(
x2
.
value
,
1
)
# Now test cache invalidation during a load from a storage
l1
=
threading
.
Lock
();
l1
.
acquire
()
l2
=
threading
.
Lock
();
l2
.
acquire
()
ll
=
LockLock
()
def
_loadFromStorage
(
orig
,
*
args
):
try
:
return
orig
(
*
args
)
finally
:
l1
.
release
()
l2
.
acquire
()
ll
()
x2
.
_p_deactivate
()
# Remove last version of x from cache
cache
.
_remove
(
cache
.
_oid_dict
[
x2
.
_p_oid
].
pop
())
p
=
Patch
(
cluster
.
client
,
_loadFromStorage
=
_loadFromStorage
)
try
:
p
.
apply
()
with
ll
,
Patch
(
cluster
.
client
,
_loadFromStorage
=
_loadFromStorage
):
t
=
self
.
newThread
(
x2
.
_p_activate
)
l
1
.
acquire
()
l
l
()
# At this point, x could not be found the cache and the result
# from the storage (which is <value=1, next_tid=None>) is about
# to be processed.
...
...
@@ -849,11 +838,8 @@ class Test(NEOThreadedTest):
client
.
store
(
x2
.
_p_oid
,
tid
,
x
,
''
,
txn
)
# value=0
tid
=
client
.
tpc_finish
(
txn
,
None
)
t1
.
begin
()
# make sure invalidation is processed
finally
:
del
p
# Resume processing of answer from storage. An entry should be
# added in cache for x=1 with a fixed next_tid (i.e. not None)
l2
.
release
()
t
.
join
()
self
.
assertEqual
(
x2
.
value
,
1
)
self
.
assertEqual
(
x1
.
value
,
0
)
...
...
@@ -863,24 +849,18 @@ class Test(NEOThreadedTest):
# is suspended at the beginning of the transaction t1,
# between Storage.sync() and flush of invalidations.
def
_flush_invalidations
(
orig
):
l1
.
release
()
l2
.
acquire
()
ll
()
orig
()
x1
.
_p_deactivate
()
t1
.
abort
()
p
=
Patch
(
c1
,
_flush_invalidations
=
_flush_invalidations
)
try
:
p
.
apply
()
with
ll
,
Patch
(
c1
,
_flush_invalidations
=
_flush_invalidations
):
t
=
self
.
newThread
(
t1
.
begin
)
l
1
.
acquire
()
l
l
()
txn
=
transaction
.
Transaction
()
client
.
tpc_begin
(
txn
)
client
.
store
(
x2
.
_p_oid
,
tid
,
y
,
''
,
txn
)
tid
=
client
.
tpc_finish
(
txn
,
None
)
client
.
close
()
finally
:
del
p
l2
.
release
()
t
.
join
()
# A transaction really begins when it acquires the lock to flush
# invalidations. The previous lastTransaction() only does a ping
...
...
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