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
1
Issues
1
List
Boards
Labels
Milestones
Merge Requests
2
Merge Requests
2
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
nexedi
neoppod
Commits
dbf128b7
Commit
dbf128b7
authored
Jul 25, 2019
by
Julien Muchembled
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Update comments
parent
910d1e91
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
3 additions
and
3 deletions
+3
-3
neo/client/transactions.py
neo/client/transactions.py
+2
-1
neo/tests/threaded/test.py
neo/tests/threaded/test.py
+1
-2
No files found.
neo/client/transactions.py
View file @
dbf128b7
...
...
@@ -117,10 +117,11 @@ class Transaction(object):
return
if
lockless
:
if
lockless
!=
serial
:
# late lockless write
# Oops! We shouldn't have executed the above 'remove'. Readd.
assert
lockless
<
serial
,
(
lockless
,
serial
)
uuid_list
.
append
(
uuid
)
return
# It's safe to do this after the above except
s
: either the cell is
# It's safe to do this after the above except: either the cell is
# already marked as lockless or the node will be reported as failed.
lockless
=
self
.
lockless_dict
if
not
lockless
:
...
...
neo/tests/threaded/test.py
View file @
dbf128b7
...
...
@@ -345,7 +345,6 @@ class Test(NEOThreadedTest):
[
DelayEvent
,
DelayEvent
,
ConflictError
,
ConflictError
])
def
testDeadlockAvoidance
(
self
):
# This test fail because deadlock avoidance is not fully implemented.
# 0: C1 -> S1
# 1: C2 -> S1, S2 (delayed)
# 2: C1 -> S2 (deadlock)
...
...
@@ -2653,7 +2652,7 @@ class Test(NEOThreadedTest):
work in itself, the code was hazardous and the client can't easily
discard such "positive" answers, or process them early enough.
The scenario focuses on transaction t1 (storing o
bject A
)
The scenario focuses on transaction t1 (storing o
id 1
)
and node s1 (initially replicating the only partition):
1. t1 stores: conflict on s0, lockless write on s1
2. t2 stores: locked on s0, lockless write on s1
...
...
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