Skip to content
Snippets Groups Projects
Commit 4bfa4b85 authored by Roman Khlopkov's avatar Roman Khlopkov 🔜
Browse files

Merge branch 'hotfix-12157_fix' into 'release-5.3' 

hotfix-12157_fix

See merge request !1698
parents a2823695 2f4146d0
No related branches found
No related tags found
1 merge request!1698hotfix-12157_fix
Pipeline #41318 passed with stage
in 13 minutes and 49 seconds
Hide whitespace changes
Inline Side-by-side
modules/net/dap_chain_net_anchor.c
+ 3
− 3
View file @ 4bfa4b85
...@@ -346,7 +346,7 @@ int dap_chain_net_anchor_unload(dap_chain_datum_anchor_t * a_anchor, dap_chain_t ...@@ -346,7 +346,7 @@ int dap_chain_net_anchor_unload(dap_chain_datum_anchor_t * a_anchor, dap_chain_t
case DAP_CHAIN_DATUM_DECREE_COMMON_SUBTYPE_STAKE_INVALIDATE:{ case DAP_CHAIN_DATUM_DECREE_COMMON_SUBTYPE_STAKE_INVALIDATE:{
// Find previous anchor with this stake approve and apply it // Find previous anchor with this stake approve and apply it
dap_chain_net_decree_reset_applied(l_net, &l_hash); dap_chain_net_decree_reset_applied(l_net, &l_hash);
dap_chain_datum_anchor_t * l_new_anchor = s_find_previous_anchor(a_anchor, a_chain); dap_chain_datum_anchor_t * l_new_anchor = s_find_previous_anchor(a_anchor_hash, l_net);
s_delete_anchor(l_net, a_anchor_hash); s_delete_anchor(l_net, a_anchor_hash);
if (l_new_anchor){// if previous anchor is founded apply it if (l_new_anchor){// if previous anchor is founded apply it
dap_chain_hash_fast_t l_hash = {0}; dap_chain_hash_fast_t l_hash = {0};
...@@ -363,7 +363,7 @@ int dap_chain_net_anchor_unload(dap_chain_datum_anchor_t * a_anchor, dap_chain_t ...@@ -363,7 +363,7 @@ int dap_chain_net_anchor_unload(dap_chain_datum_anchor_t * a_anchor, dap_chain_t
break; break;
case DAP_CHAIN_DATUM_DECREE_COMMON_SUBTYPE_STAKE_MIN_VALUE:{ case DAP_CHAIN_DATUM_DECREE_COMMON_SUBTYPE_STAKE_MIN_VALUE:{
dap_chain_net_decree_reset_applied(l_net, &l_hash); dap_chain_net_decree_reset_applied(l_net, &l_hash);
dap_chain_datum_anchor_t * l_new_anchor = s_find_previous_anchor(a_anchor, a_chain); dap_chain_datum_anchor_t * l_new_anchor = s_find_previous_anchor(a_anchor_hash, l_net);
s_delete_anchor(l_net, a_anchor_hash); s_delete_anchor(l_net, a_anchor_hash);
if (l_new_anchor){// if previous anchor is founded apply it if (l_new_anchor){// if previous anchor is founded apply it
dap_chain_hash_fast_t l_hash = {0}; dap_chain_hash_fast_t l_hash = {0};
...@@ -383,7 +383,7 @@ int dap_chain_net_anchor_unload(dap_chain_datum_anchor_t * a_anchor, dap_chain_t ...@@ -383,7 +383,7 @@ int dap_chain_net_anchor_unload(dap_chain_datum_anchor_t * a_anchor, dap_chain_t
break; break;
case DAP_CHAIN_DATUM_DECREE_COMMON_SUBTYPE_STAKE_MIN_VALIDATORS_COUNT:{ case DAP_CHAIN_DATUM_DECREE_COMMON_SUBTYPE_STAKE_MIN_VALIDATORS_COUNT:{
dap_chain_net_decree_reset_applied(l_net, &l_hash); dap_chain_net_decree_reset_applied(l_net, &l_hash);
dap_chain_datum_anchor_t * l_new_anchor = s_find_previous_anchor(a_anchor, a_chain); dap_chain_datum_anchor_t * l_new_anchor = s_find_previous_anchor(a_anchor_hash, l_net);
s_delete_anchor(l_net, a_anchor_hash); s_delete_anchor(l_net, a_anchor_hash);
if (l_new_anchor){// if previous anchor is founded apply it if (l_new_anchor){// if previous anchor is founded apply it
dap_chain_hash_fast_t l_hash = {0}; dap_chain_hash_fast_t l_hash = {0};
......
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment