2019-08-20 15:38:40 +00:00
package accounts
import (
"database/sql"
2022-05-11 09:47:17 +00:00
"encoding/json"
2023-05-16 10:48:00 +00:00
"errors"
2023-03-20 07:33:08 +00:00
"fmt"
"strconv"
"strings"
2019-08-20 15:38:40 +00:00
2019-12-11 13:59:37 +00:00
"github.com/status-im/status-go/eth-node/types"
2022-03-23 18:47:00 +00:00
"github.com/status-im/status-go/multiaccounts/settings"
2022-05-20 08:59:36 +00:00
notificationssettings "github.com/status-im/status-go/multiaccounts/settings_notifications"
2022-08-02 12:56:26 +00:00
sociallinkssettings "github.com/status-im/status-go/multiaccounts/settings_social_links"
2022-03-21 14:18:36 +00:00
"github.com/status-im/status-go/nodecfg"
"github.com/status-im/status-go/params"
2019-08-20 15:38:40 +00:00
)
const (
2023-03-20 07:33:08 +00:00
statusWalletRootPath = "m/44'/60'/0'/0/"
2023-05-16 10:48:00 +00:00
zeroAddress = "0x0000000000000000000000000000000000000000"
SyncedFromBackup = "backup" // means a account is coming from backed up data
SyncedFromLocalPairing = "local-pairing" // means a account is coming from another device when user is reocovering Status account
2019-08-20 15:38:40 +00:00
)
2023-05-16 10:48:00 +00:00
var (
errDbTransactionIsNil = errors . New ( "accounts: database transaction is nil" )
ErrDbKeypairNotFound = errors . New ( "accounts: keypair is not found" )
ErrDbAccountNotFound = errors . New ( "accounts: account is not found" )
ErrKeypairDifferentAccountsKeyUID = errors . New ( "cannot store keypair with different accounts' key uid than keypair's key uid" )
ErrKeypairWithoutAccounts = errors . New ( "cannot store keypair without accounts" )
)
type Keypair struct {
KeyUID string ` json:"key-uid" `
Name string ` json:"name" `
Type KeypairType ` json:"type" `
DerivedFrom string ` json:"derived-from" `
LastUsedDerivationIndex uint64 ` json:"last-used-derivation-index,omitempty" `
SyncedFrom string ` json:"synced-from,omitempty" ` // keeps an info which device this keypair is added from can be one of two values defined in constants or device name (custom)
Clock uint64 ` json:"clock,omitempty" `
Accounts [ ] * Account ` json:"accounts" `
}
2019-08-20 15:38:40 +00:00
type Account struct {
2023-05-16 10:48:00 +00:00
Address types . Address ` json:"address" `
KeyUID string ` json:"key-uid" `
Wallet bool ` json:"wallet" `
Chat bool ` json:"chat" `
Type AccountType ` json:"type,omitempty" `
Path string ` json:"path,omitempty" `
PublicKey types . HexBytes ` json:"public-key,omitempty" `
Name string ` json:"name" `
Emoji string ` json:"emoji" `
Color string ` json:"color" `
Hidden bool ` json:"hidden" `
Clock uint64 ` json:"clock,omitempty" `
Removed bool ` json:"removed,omitempty" `
Operable AccountOperable ` json:"operable" ` // describes an account's operability (read an explanation at the top of this file)
2019-08-20 15:38:40 +00:00
}
2023-05-16 10:48:00 +00:00
type KeypairType string
2022-08-25 15:09:08 +00:00
type AccountType string
2023-05-16 10:48:00 +00:00
type AccountOperable string
func ( a KeypairType ) String ( ) string {
return string ( a )
}
2022-08-25 15:09:08 +00:00
func ( a AccountType ) String ( ) string {
return string ( a )
}
2023-05-16 10:48:00 +00:00
func ( a AccountOperable ) String ( ) string {
return string ( a )
}
const (
KeypairTypeProfile KeypairType = "profile"
KeypairTypeKey KeypairType = "key"
KeypairTypeSeed KeypairType = "seed"
)
2020-12-07 14:03:18 +00:00
const (
2022-08-25 15:09:08 +00:00
AccountTypeGenerated AccountType = "generated"
AccountTypeKey AccountType = "key"
AccountTypeSeed AccountType = "seed"
AccountTypeWatch AccountType = "watch"
2020-12-07 14:03:18 +00:00
)
2023-05-16 10:48:00 +00:00
const (
AccountNonOperable AccountOperable = "no" // an account is non operable it is not a keycard account and there is no keystore file for it and no keystore file for the address it is derived from
AccountPartiallyOperable AccountOperable = "partially" // an account is partially operable if it is not a keycard account and there is created keystore file for the address it is derived from
AccountFullyOperable AccountOperable = "fully" // an account is fully operable if it is not a keycard account and there is a keystore file for it
)
2020-12-07 14:03:18 +00:00
// IsOwnAccount returns true if this is an account we have the private key for
// NOTE: Wallet flag can't be used as it actually indicates that it's the default
// Wallet
func ( a * Account ) IsOwnAccount ( ) bool {
2022-07-06 16:12:49 +00:00
return a . Wallet || a . Type == AccountTypeSeed || a . Type == AccountTypeGenerated || a . Type == AccountTypeKey
2020-12-07 14:03:18 +00:00
}
2022-05-11 09:47:17 +00:00
func ( a * Account ) MarshalJSON ( ) ( [ ] byte , error ) {
item := struct {
2023-05-16 10:48:00 +00:00
Address types . Address ` json:"address" `
MixedcaseAddress string ` json:"mixedcase-address" `
KeyUID string ` json:"key-uid" `
Wallet bool ` json:"wallet" `
Chat bool ` json:"chat" `
Type AccountType ` json:"type" `
Path string ` json:"path" `
PublicKey types . HexBytes ` json:"public-key" `
Name string ` json:"name" `
Emoji string ` json:"emoji" `
Color string ` json:"color" `
Hidden bool ` json:"hidden" `
Clock uint64 ` json:"clock" `
Removed bool ` json:"removed" `
Operable AccountOperable ` json:"operable" `
} {
Address : a . Address ,
MixedcaseAddress : a . Address . Hex ( ) ,
KeyUID : a . KeyUID ,
Wallet : a . Wallet ,
Chat : a . Chat ,
Type : a . Type ,
Path : a . Path ,
PublicKey : a . PublicKey ,
Name : a . Name ,
Emoji : a . Emoji ,
Color : a . Color ,
Hidden : a . Hidden ,
Clock : a . Clock ,
Removed : a . Removed ,
Operable : a . Operable ,
}
return json . Marshal ( item )
}
func ( a * Keypair ) MarshalJSON ( ) ( [ ] byte , error ) {
item := struct {
KeyUID string ` json:"key-uid" `
Name string ` json:"name" `
Type KeypairType ` json:"type" `
DerivedFrom string ` json:"derived-from" `
LastUsedDerivationIndex uint64 ` json:"last-used-derivation-index" `
SyncedFrom string ` json:"synced-from" `
Clock uint64 ` json:"clock" `
Accounts [ ] * Account ` json:"accounts" `
2022-05-11 09:47:17 +00:00
} {
2023-03-20 07:33:08 +00:00
KeyUID : a . KeyUID ,
Name : a . Name ,
2023-05-16 10:48:00 +00:00
Type : a . Type ,
2023-03-20 07:33:08 +00:00
DerivedFrom : a . DerivedFrom ,
LastUsedDerivationIndex : a . LastUsedDerivationIndex ,
2023-05-16 10:48:00 +00:00
SyncedFrom : a . SyncedFrom ,
Clock : a . Clock ,
Accounts : a . Accounts ,
2022-05-11 09:47:17 +00:00
}
return json . Marshal ( item )
}
2023-05-16 10:48:00 +00:00
func ( a * Keypair ) CopyKeypair ( ) * Keypair {
kp := & Keypair {
Clock : a . Clock ,
KeyUID : a . KeyUID ,
Name : a . Name ,
Type : a . Type ,
DerivedFrom : a . DerivedFrom ,
LastUsedDerivationIndex : a . LastUsedDerivationIndex ,
SyncedFrom : a . SyncedFrom ,
Accounts : make ( [ ] * Account , len ( a . Accounts ) ) ,
}
for i , acc := range a . Accounts {
kp . Accounts [ i ] = & Account {
Address : acc . Address ,
KeyUID : acc . KeyUID ,
Wallet : acc . Wallet ,
Chat : acc . Chat ,
Type : acc . Type ,
Path : acc . Path ,
PublicKey : acc . PublicKey ,
Name : acc . Name ,
Emoji : acc . Emoji ,
Color : acc . Color ,
Hidden : acc . Hidden ,
Clock : acc . Clock ,
Removed : acc . Removed ,
Operable : acc . Operable ,
}
}
return kp
}
2019-08-20 15:38:40 +00:00
// Database sql wrapper for operations with browser objects.
type Database struct {
2022-03-23 18:47:00 +00:00
* settings . Database
2022-05-20 08:59:36 +00:00
* notificationssettings . NotificationsSettings
2022-08-02 12:56:26 +00:00
* sociallinkssettings . SocialLinksSettings
2023-05-16 10:48:00 +00:00
* Keycards
2019-08-20 15:38:40 +00:00
db * sql . DB
}
2022-03-23 18:47:00 +00:00
// NewDB returns a new instance of *Database
func NewDB ( db * sql . DB ) ( * Database , error ) {
sDB , err := settings . MakeNewDB ( db )
2022-01-12 20:04:43 +00:00
if err != nil {
2022-03-23 18:47:00 +00:00
return nil , err
2022-01-12 20:04:43 +00:00
}
2022-05-20 08:59:36 +00:00
sn := notificationssettings . NewNotificationsSettings ( db )
2022-08-02 12:56:26 +00:00
ssl := sociallinkssettings . NewSocialLinksSettings ( db )
2023-05-16 10:48:00 +00:00
kc := NewKeycards ( db )
2023-03-20 07:33:08 +00:00
2023-05-16 10:48:00 +00:00
return & Database { sDB , sn , ssl , kc , db } , nil
2019-08-20 15:38:40 +00:00
}
2022-03-23 18:47:00 +00:00
// DB Gets db sql.DB
2023-01-06 12:21:14 +00:00
func ( db * Database ) DB ( ) * sql . DB {
2022-03-23 18:47:00 +00:00
return db . db
2019-12-27 09:58:25 +00:00
}
2022-03-23 18:47:00 +00:00
// Close closes database.
2023-01-06 12:21:14 +00:00
func ( db * Database ) Close ( ) error {
2022-03-23 18:47:00 +00:00
return db . db . Close ( )
2019-08-08 07:31:24 +00:00
}
2023-05-16 10:48:00 +00:00
func getAccountTypeForKeypairType ( kpType KeypairType ) AccountType {
switch kpType {
case KeypairTypeProfile :
return AccountTypeGenerated
case KeypairTypeKey :
return AccountTypeKey
case KeypairTypeSeed :
return AccountTypeSeed
default :
return AccountTypeWatch
2023-03-20 07:33:08 +00:00
}
}
2023-05-16 10:48:00 +00:00
func ( db * Database ) processKeypairs ( rows * sql . Rows ) ( [ ] * Keypair , error ) {
keypairMap := make ( map [ string ] * Keypair )
2023-03-20 07:33:08 +00:00
2023-05-16 10:48:00 +00:00
var (
kpKeyUID sql . NullString
kpName sql . NullString
kpType sql . NullString
kpDerivedFrom sql . NullString
kpLastUsedDerivationIndex sql . NullInt64
kpSyncedFrom sql . NullString
kpClock sql . NullInt64
)
2023-03-27 14:33:00 +00:00
2023-03-20 07:33:08 +00:00
var (
2023-05-16 10:48:00 +00:00
accAddress sql . NullString
accKeyUID sql . NullString
accPath sql . NullString
accName sql . NullString
accColor sql . NullString
accEmoji sql . NullString
accWallet sql . NullBool
accChat sql . NullBool
accHidden sql . NullBool
accOperable sql . NullString
accClock sql . NullInt64
2023-03-20 07:33:08 +00:00
)
2023-05-16 10:48:00 +00:00
for rows . Next ( ) {
kp := & Keypair { }
acc := & Account { }
pubkey := [ ] byte { }
err := rows . Scan (
& kpKeyUID , & kpName , & kpType , & kpDerivedFrom , & kpLastUsedDerivationIndex , & kpSyncedFrom , & kpClock ,
& accAddress , & accKeyUID , & pubkey , & accPath , & accName , & accColor , & accEmoji ,
& accWallet , & accChat , & accHidden , & accOperable , & accClock )
2023-03-20 07:33:08 +00:00
if err != nil {
2023-05-16 10:48:00 +00:00
return nil , err
2023-03-20 07:33:08 +00:00
}
2023-05-16 10:48:00 +00:00
// check keypair fields
if kpKeyUID . Valid {
kp . KeyUID = kpKeyUID . String
}
if kpName . Valid {
kp . Name = kpName . String
}
if kpType . Valid {
kp . Type = KeypairType ( kpType . String )
}
if kpDerivedFrom . Valid {
kp . DerivedFrom = kpDerivedFrom . String
}
if kpLastUsedDerivationIndex . Valid {
kp . LastUsedDerivationIndex = uint64 ( kpLastUsedDerivationIndex . Int64 )
}
if kpSyncedFrom . Valid {
kp . SyncedFrom = kpSyncedFrom . String
}
if kpClock . Valid {
kp . Clock = uint64 ( kpClock . Int64 )
2023-03-20 07:33:08 +00:00
}
2023-05-16 10:48:00 +00:00
// check keypair accounts fields
if accAddress . Valid {
acc . Address = types . BytesToAddress ( [ ] byte ( accAddress . String ) )
}
if accKeyUID . Valid {
acc . KeyUID = accKeyUID . String
}
if accPath . Valid {
acc . Path = accPath . String
}
if accName . Valid {
acc . Name = accName . String
}
if accColor . Valid {
acc . Color = accColor . String
}
if accEmoji . Valid {
acc . Emoji = accEmoji . String
}
if accWallet . Valid {
acc . Wallet = accWallet . Bool
}
if accChat . Valid {
acc . Chat = accChat . Bool
}
if accHidden . Valid {
acc . Hidden = accHidden . Bool
}
if accOperable . Valid {
acc . Operable = AccountOperable ( accOperable . String )
}
if accClock . Valid {
acc . Clock = uint64 ( accClock . Int64 )
2023-03-20 07:33:08 +00:00
}
2023-05-16 10:48:00 +00:00
if lth := len ( pubkey ) ; lth > 0 {
acc . PublicKey = make ( types . HexBytes , lth )
copy ( acc . PublicKey , pubkey )
}
acc . Type = getAccountTypeForKeypairType ( kp . Type )
2023-03-20 07:33:08 +00:00
2023-05-16 10:48:00 +00:00
if _ , ok := keypairMap [ kp . KeyUID ] ; ! ok {
keypairMap [ kp . KeyUID ] = kp
2023-03-20 07:33:08 +00:00
}
2023-05-16 10:48:00 +00:00
keypairMap [ kp . KeyUID ] . Accounts = append ( keypairMap [ kp . KeyUID ] . Accounts , acc )
2023-03-20 07:33:08 +00:00
}
2023-05-16 10:48:00 +00:00
if err := rows . Err ( ) ; err != nil {
2023-01-06 12:21:14 +00:00
return nil , err
}
2023-05-16 10:48:00 +00:00
// Convert map to list
keypairs := make ( [ ] * Keypair , 0 , len ( keypairMap ) )
for _ , keypair := range keypairMap {
keypairs = append ( keypairs , keypair )
2023-01-06 12:21:14 +00:00
}
2023-05-16 10:48:00 +00:00
return keypairs , nil
2023-01-06 12:21:14 +00:00
}
2023-05-16 10:48:00 +00:00
// If `keyUID` is passed only keypairs which match the passed `keyUID` will be returned, if `keyUID` is empty, all keypairs will be returned.
func ( db * Database ) getKeypairs ( tx * sql . Tx , keyUID string ) ( [ ] * Keypair , error ) {
var (
rows * sql . Rows
err error
where string
)
if keyUID != "" {
where = "WHERE k.key_uid = ?"
}
query := fmt . Sprintf ( // nolint: gosec
`
2023-05-24 14:42:31 +00:00
SELECT
k . * ,
ka . address ,
2023-05-16 10:48:00 +00:00
ka . key_uid ,
2023-05-24 14:42:31 +00:00
ka . pubkey ,
ka . path ,
ka . name ,
2023-05-16 10:48:00 +00:00
ka . color ,
ka . emoji ,
2023-05-24 14:42:31 +00:00
ka . wallet ,
ka . chat ,
2023-05-16 10:48:00 +00:00
ka . hidden ,
ka . operable ,
ka . clock
2023-05-24 14:42:31 +00:00
FROM
2023-05-16 10:48:00 +00:00
keypairs k
2023-05-24 14:42:31 +00:00
LEFT JOIN
2023-05-16 10:48:00 +00:00
keypairs_accounts ka
ON
k . key_uid = ka . key_uid
% s
2023-05-24 14:42:31 +00:00
ORDER BY
2023-05-16 10:48:00 +00:00
ka . created_at ` , where )
if tx == nil {
if where != "" {
rows , err = db . db . Query ( query , keyUID )
} else {
rows , err = db . db . Query ( query )
}
2019-08-20 15:38:40 +00:00
if err != nil {
return nil , err
}
2023-05-16 10:48:00 +00:00
} else {
stmt , err := tx . Prepare ( query )
if err != nil {
return nil , err
}
defer stmt . Close ( )
if where != "" {
rows , err = stmt . Query ( keyUID )
} else {
rows , err = stmt . Query ( )
}
if err != nil {
return nil , err
2019-08-20 15:38:40 +00:00
}
}
2023-05-16 10:48:00 +00:00
defer rows . Close ( )
return db . processKeypairs ( rows )
}
func ( db * Database ) getKeypairByKeyUID ( tx * sql . Tx , keyUID string ) ( * Keypair , error ) {
keypairs , err := db . getKeypairs ( tx , keyUID )
if err != nil && err != sql . ErrNoRows {
return nil , err
}
if len ( keypairs ) == 0 {
return nil , ErrDbKeypairNotFound
}
return keypairs [ 0 ] , nil
2019-08-20 15:38:40 +00:00
}
2023-05-16 10:48:00 +00:00
// If `address` is passed only accounts which match the passed `address` will be returned, if `address` is empty, all accounts will be returned.
func ( db * Database ) getAccounts ( tx * sql . Tx , address types . Address ) ( [ ] * Account , error ) {
var (
rows * sql . Rows
err error
where string
)
if address . String ( ) != zeroAddress {
where = "WHERE ka.address = ?"
}
query := fmt . Sprintf ( // nolint: gosec
`
2023-05-24 14:42:31 +00:00
SELECT
k . * ,
ka . address ,
2023-05-16 10:48:00 +00:00
ka . key_uid ,
2023-05-24 14:42:31 +00:00
ka . pubkey ,
ka . path ,
ka . name ,
2023-05-16 10:48:00 +00:00
ka . color ,
ka . emoji ,
2023-05-24 14:42:31 +00:00
ka . wallet ,
ka . chat ,
2023-05-16 10:48:00 +00:00
ka . hidden ,
ka . operable ,
ka . clock
2023-05-24 14:42:31 +00:00
FROM
2023-05-16 10:48:00 +00:00
keypairs_accounts ka
2023-05-24 14:42:31 +00:00
LEFT JOIN
2023-05-16 10:48:00 +00:00
keypairs k
ON
ka . key_uid = k . key_uid
% s
2023-05-24 14:42:31 +00:00
ORDER BY
2023-05-16 10:48:00 +00:00
ka . created_at ` , where )
if tx == nil {
if where != "" {
rows , err = db . db . Query ( query , address )
} else {
rows , err = db . db . Query ( query )
}
if err != nil {
return nil , err
}
} else {
stmt , err := tx . Prepare ( query )
if err != nil {
return nil , err
}
defer stmt . Close ( )
if where != "" {
rows , err = stmt . Query ( address )
} else {
rows , err = stmt . Query ( )
}
if err != nil {
return nil , err
}
}
2020-10-28 07:56:14 +00:00
2023-05-16 10:48:00 +00:00
defer rows . Close ( )
2020-10-28 07:56:14 +00:00
2023-05-16 10:48:00 +00:00
keypairs , err := db . processKeypairs ( rows )
2020-10-28 07:56:14 +00:00
if err != nil {
return nil , err
}
2023-05-16 10:48:00 +00:00
allAccounts := [ ] * Account { }
for _ , kp := range keypairs {
allAccounts = append ( allAccounts , kp . Accounts ... )
}
return allAccounts , nil
2020-10-28 07:56:14 +00:00
}
2023-05-16 10:48:00 +00:00
func ( db * Database ) getAccountByAddress ( tx * sql . Tx , address types . Address ) ( * Account , error ) {
accounts , err := db . getAccounts ( tx , address )
if err != nil && err != sql . ErrNoRows {
return nil , err
}
2023-03-20 07:33:08 +00:00
2023-05-16 10:48:00 +00:00
if len ( accounts ) == 0 {
return nil , ErrDbAccountNotFound
}
return accounts [ 0 ] , nil
}
func ( db * Database ) deleteKeypair ( tx * sql . Tx , keyUID string ) error {
keypairs , err := db . getKeypairs ( tx , keyUID )
if err != nil && err != sql . ErrNoRows {
return err
}
if len ( keypairs ) == 0 {
return ErrDbKeypairNotFound
}
query := `
DELETE
FROM
keypairs
WHERE
key_uid = ?
`
if tx == nil {
_ , err := db . db . Exec ( query , keyUID )
return err
}
stmt , err := tx . Prepare ( query )
if err != nil {
return err
}
defer stmt . Close ( )
_ , err = stmt . Exec ( keyUID )
return err
}
func ( db * Database ) GetKeypairs ( ) ( [ ] * Keypair , error ) {
return db . getKeypairs ( nil , "" )
}
func ( db * Database ) GetKeypairByKeyUID ( keyUID string ) ( * Keypair , error ) {
return db . getKeypairByKeyUID ( nil , keyUID )
}
func ( db * Database ) GetAccounts ( ) ( [ ] * Account , error ) {
return db . getAccounts ( nil , types . Address { } )
}
func ( db * Database ) GetAccountByAddress ( address types . Address ) ( * Account , error ) {
return db . getAccountByAddress ( nil , address )
}
func ( db * Database ) GetWatchOnlyAccounts ( ) ( res [ ] * Account , err error ) {
accounts , err := db . getAccounts ( nil , types . Address { } )
if err != nil {
return nil , err
}
for _ , acc := range accounts {
if acc . Type == AccountTypeWatch {
res = append ( res , acc )
}
}
return
}
func ( db * Database ) IsAnyAccountPartalyOrFullyOperableForKeyUID ( keyUID string ) ( bool , error ) {
kp , err := db . getKeypairByKeyUID ( nil , keyUID )
2019-08-20 15:38:40 +00:00
if err != nil {
2023-05-16 10:48:00 +00:00
return false , err
2019-08-20 15:38:40 +00:00
}
2023-05-16 10:48:00 +00:00
for _ , acc := range kp . Accounts {
if acc . Operable != AccountNonOperable {
return true , nil
}
}
return false , nil
}
func ( db * Database ) DeleteKeypair ( keyUID string ) error {
return db . deleteKeypair ( nil , keyUID )
}
func ( db * Database ) DeleteAccount ( address types . Address ) error {
tx , err := db . db . Begin ( )
2019-08-20 15:38:40 +00:00
defer func ( ) {
if err == nil {
err = tx . Commit ( )
return
}
_ = tx . Rollback ( )
} ( )
2023-03-20 07:33:08 +00:00
2019-08-20 15:38:40 +00:00
if err != nil {
return err
}
2023-05-16 10:48:00 +00:00
acc , err := db . getAccountByAddress ( tx , address )
if err != nil {
return err
}
kp , err := db . getKeypairByKeyUID ( tx , acc . KeyUID )
if err != nil && err != ErrDbKeypairNotFound {
return err
}
if kp != nil && len ( kp . Accounts ) == 1 && kp . Accounts [ 0 ] . Address == address {
return db . deleteKeypair ( tx , acc . KeyUID )
}
delete , err := tx . Prepare ( `
DELETE
FROM
keypairs_accounts
WHERE
address = ?
` )
2019-08-20 15:38:40 +00:00
if err != nil {
return err
}
2023-05-16 10:48:00 +00:00
defer delete . Close ( )
_ , err = delete . Exec ( address )
return err
}
func updateKeypairLastUsedIndex ( tx * sql . Tx , keyUID string , index uint64 , clock uint64 ) error {
if tx == nil {
return errDbTransactionIsNil
}
_ , err := tx . Exec ( `
2023-05-24 14:42:31 +00:00
UPDATE
keypairs
SET
2023-05-16 10:48:00 +00:00
last_used_derivation_index = ? ,
clock = ?
2023-05-24 14:42:31 +00:00
WHERE
2023-05-16 10:48:00 +00:00
key_uid = ? ` ,
index , clock , keyUID )
return err
}
func ( db * Database ) saveOrUpdateAccounts ( tx * sql . Tx , accounts [ ] * Account ) ( err error ) {
if tx == nil {
return errDbTransactionIsNil
}
for _ , acc := range accounts {
var relatedKeypair * Keypair
// only watch only accounts have an empty `KeyUID` field
var keyUID * string
if acc . KeyUID != "" {
relatedKeypair , err = db . getKeypairByKeyUID ( tx , acc . KeyUID )
2022-05-18 10:42:51 +00:00
if err != nil {
2023-05-16 10:48:00 +00:00
if err == sql . ErrNoRows {
// all accounts, except watch only accounts, must have a row in `keypairs` table with the same key uid
continue
}
return err
2022-05-18 10:42:51 +00:00
}
2023-05-16 10:48:00 +00:00
keyUID = & acc . KeyUID
2022-05-18 10:42:51 +00:00
}
2023-03-20 07:33:08 +00:00
2023-05-16 10:48:00 +00:00
_ , err = tx . Exec ( `
2023-05-24 14:42:31 +00:00
INSERT OR IGNORE INTO
keypairs_accounts ( address , key_uid , pubkey , path , wallet , chat , created_at , updated_at )
VALUES
2023-05-16 10:48:00 +00:00
( ? , ? , ? , ? , ? , ? , datetime ( ' now ' ) , datetime ( ' now ' ) ) ;
2023-05-24 14:42:31 +00:00
2023-05-16 10:48:00 +00:00
UPDATE
keypairs_accounts
SET
2023-05-24 14:42:31 +00:00
name = ? ,
color = ? ,
emoji = ? ,
2023-05-16 10:48:00 +00:00
hidden = ? ,
operable = ? ,
2023-05-24 14:42:31 +00:00
clock = ?
2023-05-16 10:48:00 +00:00
WHERE
address = ? ;
` ,
acc . Address , keyUID , acc . PublicKey , acc . Path , acc . Wallet , acc . Chat ,
acc . Name , acc . Color , acc . Emoji , acc . Hidden , acc . Operable , acc . Clock , acc . Address )
2019-08-20 15:38:40 +00:00
if err != nil {
2023-05-16 10:48:00 +00:00
return err
2019-08-20 15:38:40 +00:00
}
2023-05-16 10:48:00 +00:00
if strings . HasPrefix ( acc . Path , statusWalletRootPath ) {
accIndex , err := strconv . ParseUint ( acc . Path [ len ( statusWalletRootPath ) : ] , 0 , 64 )
if err != nil {
return err
2019-08-20 15:38:40 +00:00
}
2023-05-16 10:48:00 +00:00
accountsContainPath := func ( accounts [ ] * Account , path string ) bool {
for _ , acc := range accounts {
if acc . Path == path {
return true
}
}
return false
}
expectedNewKeypairIndex := relatedKeypair . LastUsedDerivationIndex
for {
expectedNewKeypairIndex ++
if ! accountsContainPath ( relatedKeypair . Accounts , statusWalletRootPath + strconv . FormatUint ( expectedNewKeypairIndex , 10 ) ) {
break
}
}
if accIndex == expectedNewKeypairIndex {
err = updateKeypairLastUsedIndex ( tx , acc . KeyUID , accIndex , acc . Clock )
if err != nil {
return err
}
}
}
}
return nil
}
func ( db * Database ) SaveOrUpdateAccounts ( accounts [ ] * Account ) error {
if len ( accounts ) == 0 {
return errors . New ( "no provided accounts to save/update" )
}
tx , err := db . db . Begin ( )
if err != nil {
return err
}
defer func ( ) {
if err == nil {
err = tx . Commit ( )
2019-08-20 15:38:40 +00:00
return
}
2023-05-16 10:48:00 +00:00
_ = tx . Rollback ( )
} ( )
2023-03-20 07:33:08 +00:00
2023-05-16 10:48:00 +00:00
return db . saveOrUpdateAccounts ( tx , accounts )
}
func ( db * Database ) SaveOrUpdateKeypair ( keypair * Keypair ) error {
tx , err := db . db . Begin ( )
if err != nil {
return err
}
defer func ( ) {
if err == nil {
err = tx . Commit ( )
2023-03-20 07:33:08 +00:00
return
}
2023-05-16 10:48:00 +00:00
_ = tx . Rollback ( )
} ( )
// If keypair is being saved, not updated, then it must be at least one account and all accounts must have the same key uid.
dbKeypair , err := db . getKeypairByKeyUID ( tx , keypair . KeyUID )
if err != nil && err != ErrDbKeypairNotFound {
return err
}
if dbKeypair == nil {
if len ( keypair . Accounts ) == 0 {
return ErrKeypairWithoutAccounts
}
for _ , acc := range keypair . Accounts {
if acc . KeyUID == "" || acc . KeyUID != keypair . KeyUID {
return ErrKeypairDifferentAccountsKeyUID
}
}
2019-08-20 15:38:40 +00:00
}
2023-03-20 07:33:08 +00:00
2023-05-16 10:48:00 +00:00
_ , err = tx . Exec ( `
2023-05-24 14:42:31 +00:00
INSERT OR IGNORE INTO
keypairs ( key_uid , type , derived_from )
VALUES
2023-05-16 10:48:00 +00:00
( ? , ? , ? ) ;
UPDATE
keypairs
SET
2023-05-24 14:42:31 +00:00
name = ? ,
2023-05-16 10:48:00 +00:00
last_used_derivation_index = ? ,
synced_from = ? ,
clock = ?
WHERE
key_uid = ? ;
` , keypair . KeyUID , keypair . Type , keypair . DerivedFrom ,
keypair . Name , keypair . LastUsedDerivationIndex , keypair . SyncedFrom , keypair . Clock , keypair . KeyUID )
if err != nil {
return err
}
2019-08-20 15:38:40 +00:00
2023-05-16 10:48:00 +00:00
return db . saveOrUpdateAccounts ( tx , keypair . Accounts )
2019-12-16 15:23:36 +00:00
}
2023-05-24 14:42:31 +00:00
func ( db * Database ) UpdateKeypairName ( keyUID string , name string , clock uint64 ) error {
tx , err := db . db . Begin ( )
if err != nil {
return err
}
defer func ( ) {
if err == nil {
err = tx . Commit ( )
return
}
_ = tx . Rollback ( )
} ( )
_ , err = db . getKeypairByKeyUID ( tx , keyUID )
if err != nil {
return err
}
_ , err = tx . Exec ( `
UPDATE
keypairs
SET
name = ? ,
clock = ?
WHERE
key_uid = ? ;
` , name , clock , keyUID )
return err
}
2019-12-11 13:59:37 +00:00
func ( db * Database ) GetWalletAddress ( ) ( rst types . Address , err error ) {
2023-05-16 10:48:00 +00:00
err = db . db . QueryRow ( "SELECT address FROM keypairs_accounts WHERE wallet = 1" ) . Scan ( & rst )
2019-08-20 15:38:40 +00:00
return
}
status-im/status-react#9203 Faster tx fetching with less request
*** How it worked before this PR on multiaccount creation:
- On multiacc creation we scanned chain for eth and erc20 transfers. For
each address of a new empty multiaccount this scan required
1. two `eth_getBalance` requests to find out that there is no any
balance change between zero and the last block, for eth transfers
2. and `chain-size/100000` (currently ~100) `eth_getLogs` requests,
for erc20 transfers
- For some reason we scanned an address of the chat account as well, and
also accounts were not deduplicated. So even for an empty multiacc we
scanned chain twice for each chat and main wallet addresses, in result
app had to execute about 400 requests.
- As mentioned above, `eth_getBalance` requests were used to check if
there were any eth transfers, and that caused empty history in case
if user already used all available eth (so that both zero and latest
blocks show 0 eth for an address). There might have been transactions
but we wouldn't fetch/show them.
- There was no upper limit for the number of rpc requests during the
scan, so it could require indefinite number of requests; the scanning
algorithm was written so that we persisted the whole history of
transactions or tried to scan form the beginning again in case of
failure, giving up only after 10 minutes of failures. In result
addresses with sufficient number of transactions would never be fully
scanned and during these 10 minutes app could use gigabytes of
internet data.
- Failures were caused by `eth_getBlockByNumber`/`eth_getBlockByHash`
requests. These requests return significantly bigger responses than
`eth_getBalance`/`eth_transactionsCount` and it is likely that
execution of thousands of them in parallel caused failures for
accounts with hundreds of transactions. Even for an account with 12k
we could successfully determine blocks with transaction in a few
minutes using `eth_getBalance` requests, but `eth_getBlock...`
couldn't be processed for this acc.
- There was no caching for for `eth_getBalance` requests, and this
caused in average 3-4 times more such requests than is needed.
*** How it works now on multiaccount creation:
- On multiacc creation we scan chain for last ~30 eth transactions and
then check erc20 in the range where these eth transactions were found.
For an empty address in multiacc this means:
1. two `eth_getBalance` transactions to determine that there was no
balance change between zero and the last block; two
`eth_transactionsCount` requests to determine there are no outgoing
transactions for this address; total 4 requests for eth transfers
2. 20 `eth_getLogs` for erc20 transfers. This number can be lowered,
but that's not a big deal
- Deduplication of addresses is added and also we don't scan chat
account, so a new multiacc requires ~25 (we also request latest block
number and probably execute a few other calls) request to determine
that multiacc is empty (comparing to ~400 before)
- In case if address contains transactions we:
1. determine the range which contains 20-25 outgoing eth/erc20
transactions. This usually requires up to 10 `eth_transactionCount`
requests
2. then we scan chain for eth transfers using `eth_getBalance` and
`eth_transactionCount` (for double checking zero balances)
3. we make sure that we do not scan db for more than 30 blocks with
transfers. That's important for accounts with mostly incoming
transactions, because the range found on the first step might
contain any number of incoming transfers, but only 20-25 outgoing
transactions
4. when we found ~30 blocks in a given range, we update initial
range `from` block using the oldest found block
5. and now we scan db for erc20transfers using `eth_getLogs`
`oldest-found-eth-block`-`latest-block`, we make not more than 20 calls
6. when all blocks which contain incoming/outgoing transfers for a
given address are found, we save these blocks to db and mark that
transfers from these blocks are still to be fetched
7. Then we select latest ~30 (the number can be adjusted) blocks from
these which were found and fetch transfers, this requires 3-4
requests per transfer.
8. we persist scanned range so that we know were to start next time
9. we dispatch an event which tells client that transactions are found
10. client fetches latest 20 transfers
- when user presses "fetch more" button we check if app's db contains next
20 transfers, if not we scan chain again and return transfers after
small fixes
2019-12-18 11:01:46 +00:00
func ( db * Database ) GetWalletAddresses ( ) ( rst [ ] types . Address , err error ) {
2023-05-16 10:48:00 +00:00
rows , err := db . db . Query ( "SELECT address FROM keypairs_accounts WHERE chat = 0 ORDER BY created_at" )
status-im/status-react#9203 Faster tx fetching with less request
*** How it worked before this PR on multiaccount creation:
- On multiacc creation we scanned chain for eth and erc20 transfers. For
each address of a new empty multiaccount this scan required
1. two `eth_getBalance` requests to find out that there is no any
balance change between zero and the last block, for eth transfers
2. and `chain-size/100000` (currently ~100) `eth_getLogs` requests,
for erc20 transfers
- For some reason we scanned an address of the chat account as well, and
also accounts were not deduplicated. So even for an empty multiacc we
scanned chain twice for each chat and main wallet addresses, in result
app had to execute about 400 requests.
- As mentioned above, `eth_getBalance` requests were used to check if
there were any eth transfers, and that caused empty history in case
if user already used all available eth (so that both zero and latest
blocks show 0 eth for an address). There might have been transactions
but we wouldn't fetch/show them.
- There was no upper limit for the number of rpc requests during the
scan, so it could require indefinite number of requests; the scanning
algorithm was written so that we persisted the whole history of
transactions or tried to scan form the beginning again in case of
failure, giving up only after 10 minutes of failures. In result
addresses with sufficient number of transactions would never be fully
scanned and during these 10 minutes app could use gigabytes of
internet data.
- Failures were caused by `eth_getBlockByNumber`/`eth_getBlockByHash`
requests. These requests return significantly bigger responses than
`eth_getBalance`/`eth_transactionsCount` and it is likely that
execution of thousands of them in parallel caused failures for
accounts with hundreds of transactions. Even for an account with 12k
we could successfully determine blocks with transaction in a few
minutes using `eth_getBalance` requests, but `eth_getBlock...`
couldn't be processed for this acc.
- There was no caching for for `eth_getBalance` requests, and this
caused in average 3-4 times more such requests than is needed.
*** How it works now on multiaccount creation:
- On multiacc creation we scan chain for last ~30 eth transactions and
then check erc20 in the range where these eth transactions were found.
For an empty address in multiacc this means:
1. two `eth_getBalance` transactions to determine that there was no
balance change between zero and the last block; two
`eth_transactionsCount` requests to determine there are no outgoing
transactions for this address; total 4 requests for eth transfers
2. 20 `eth_getLogs` for erc20 transfers. This number can be lowered,
but that's not a big deal
- Deduplication of addresses is added and also we don't scan chat
account, so a new multiacc requires ~25 (we also request latest block
number and probably execute a few other calls) request to determine
that multiacc is empty (comparing to ~400 before)
- In case if address contains transactions we:
1. determine the range which contains 20-25 outgoing eth/erc20
transactions. This usually requires up to 10 `eth_transactionCount`
requests
2. then we scan chain for eth transfers using `eth_getBalance` and
`eth_transactionCount` (for double checking zero balances)
3. we make sure that we do not scan db for more than 30 blocks with
transfers. That's important for accounts with mostly incoming
transactions, because the range found on the first step might
contain any number of incoming transfers, but only 20-25 outgoing
transactions
4. when we found ~30 blocks in a given range, we update initial
range `from` block using the oldest found block
5. and now we scan db for erc20transfers using `eth_getLogs`
`oldest-found-eth-block`-`latest-block`, we make not more than 20 calls
6. when all blocks which contain incoming/outgoing transfers for a
given address are found, we save these blocks to db and mark that
transfers from these blocks are still to be fetched
7. Then we select latest ~30 (the number can be adjusted) blocks from
these which were found and fetch transfers, this requires 3-4
requests per transfer.
8. we persist scanned range so that we know were to start next time
9. we dispatch an event which tells client that transactions are found
10. client fetches latest 20 transfers
- when user presses "fetch more" button we check if app's db contains next
20 transfers, if not we scan chain again and return transfers after
small fixes
2019-12-18 11:01:46 +00:00
if err != nil {
return nil , err
}
defer rows . Close ( )
2023-05-16 10:48:00 +00:00
status-im/status-react#9203 Faster tx fetching with less request
*** How it worked before this PR on multiaccount creation:
- On multiacc creation we scanned chain for eth and erc20 transfers. For
each address of a new empty multiaccount this scan required
1. two `eth_getBalance` requests to find out that there is no any
balance change between zero and the last block, for eth transfers
2. and `chain-size/100000` (currently ~100) `eth_getLogs` requests,
for erc20 transfers
- For some reason we scanned an address of the chat account as well, and
also accounts were not deduplicated. So even for an empty multiacc we
scanned chain twice for each chat and main wallet addresses, in result
app had to execute about 400 requests.
- As mentioned above, `eth_getBalance` requests were used to check if
there were any eth transfers, and that caused empty history in case
if user already used all available eth (so that both zero and latest
blocks show 0 eth for an address). There might have been transactions
but we wouldn't fetch/show them.
- There was no upper limit for the number of rpc requests during the
scan, so it could require indefinite number of requests; the scanning
algorithm was written so that we persisted the whole history of
transactions or tried to scan form the beginning again in case of
failure, giving up only after 10 minutes of failures. In result
addresses with sufficient number of transactions would never be fully
scanned and during these 10 minutes app could use gigabytes of
internet data.
- Failures were caused by `eth_getBlockByNumber`/`eth_getBlockByHash`
requests. These requests return significantly bigger responses than
`eth_getBalance`/`eth_transactionsCount` and it is likely that
execution of thousands of them in parallel caused failures for
accounts with hundreds of transactions. Even for an account with 12k
we could successfully determine blocks with transaction in a few
minutes using `eth_getBalance` requests, but `eth_getBlock...`
couldn't be processed for this acc.
- There was no caching for for `eth_getBalance` requests, and this
caused in average 3-4 times more such requests than is needed.
*** How it works now on multiaccount creation:
- On multiacc creation we scan chain for last ~30 eth transactions and
then check erc20 in the range where these eth transactions were found.
For an empty address in multiacc this means:
1. two `eth_getBalance` transactions to determine that there was no
balance change between zero and the last block; two
`eth_transactionsCount` requests to determine there are no outgoing
transactions for this address; total 4 requests for eth transfers
2. 20 `eth_getLogs` for erc20 transfers. This number can be lowered,
but that's not a big deal
- Deduplication of addresses is added and also we don't scan chat
account, so a new multiacc requires ~25 (we also request latest block
number and probably execute a few other calls) request to determine
that multiacc is empty (comparing to ~400 before)
- In case if address contains transactions we:
1. determine the range which contains 20-25 outgoing eth/erc20
transactions. This usually requires up to 10 `eth_transactionCount`
requests
2. then we scan chain for eth transfers using `eth_getBalance` and
`eth_transactionCount` (for double checking zero balances)
3. we make sure that we do not scan db for more than 30 blocks with
transfers. That's important for accounts with mostly incoming
transactions, because the range found on the first step might
contain any number of incoming transfers, but only 20-25 outgoing
transactions
4. when we found ~30 blocks in a given range, we update initial
range `from` block using the oldest found block
5. and now we scan db for erc20transfers using `eth_getLogs`
`oldest-found-eth-block`-`latest-block`, we make not more than 20 calls
6. when all blocks which contain incoming/outgoing transfers for a
given address are found, we save these blocks to db and mark that
transfers from these blocks are still to be fetched
7. Then we select latest ~30 (the number can be adjusted) blocks from
these which were found and fetch transfers, this requires 3-4
requests per transfer.
8. we persist scanned range so that we know were to start next time
9. we dispatch an event which tells client that transactions are found
10. client fetches latest 20 transfers
- when user presses "fetch more" button we check if app's db contains next
20 transfers, if not we scan chain again and return transfers after
small fixes
2019-12-18 11:01:46 +00:00
for rows . Next ( ) {
addr := types . Address { }
err = rows . Scan ( & addr )
if err != nil {
return nil , err
}
rst = append ( rst , addr )
}
2023-05-16 10:48:00 +00:00
if err := rows . Err ( ) ; err != nil {
return nil , err
}
status-im/status-react#9203 Faster tx fetching with less request
*** How it worked before this PR on multiaccount creation:
- On multiacc creation we scanned chain for eth and erc20 transfers. For
each address of a new empty multiaccount this scan required
1. two `eth_getBalance` requests to find out that there is no any
balance change between zero and the last block, for eth transfers
2. and `chain-size/100000` (currently ~100) `eth_getLogs` requests,
for erc20 transfers
- For some reason we scanned an address of the chat account as well, and
also accounts were not deduplicated. So even for an empty multiacc we
scanned chain twice for each chat and main wallet addresses, in result
app had to execute about 400 requests.
- As mentioned above, `eth_getBalance` requests were used to check if
there were any eth transfers, and that caused empty history in case
if user already used all available eth (so that both zero and latest
blocks show 0 eth for an address). There might have been transactions
but we wouldn't fetch/show them.
- There was no upper limit for the number of rpc requests during the
scan, so it could require indefinite number of requests; the scanning
algorithm was written so that we persisted the whole history of
transactions or tried to scan form the beginning again in case of
failure, giving up only after 10 minutes of failures. In result
addresses with sufficient number of transactions would never be fully
scanned and during these 10 minutes app could use gigabytes of
internet data.
- Failures were caused by `eth_getBlockByNumber`/`eth_getBlockByHash`
requests. These requests return significantly bigger responses than
`eth_getBalance`/`eth_transactionsCount` and it is likely that
execution of thousands of them in parallel caused failures for
accounts with hundreds of transactions. Even for an account with 12k
we could successfully determine blocks with transaction in a few
minutes using `eth_getBalance` requests, but `eth_getBlock...`
couldn't be processed for this acc.
- There was no caching for for `eth_getBalance` requests, and this
caused in average 3-4 times more such requests than is needed.
*** How it works now on multiaccount creation:
- On multiacc creation we scan chain for last ~30 eth transactions and
then check erc20 in the range where these eth transactions were found.
For an empty address in multiacc this means:
1. two `eth_getBalance` transactions to determine that there was no
balance change between zero and the last block; two
`eth_transactionsCount` requests to determine there are no outgoing
transactions for this address; total 4 requests for eth transfers
2. 20 `eth_getLogs` for erc20 transfers. This number can be lowered,
but that's not a big deal
- Deduplication of addresses is added and also we don't scan chat
account, so a new multiacc requires ~25 (we also request latest block
number and probably execute a few other calls) request to determine
that multiacc is empty (comparing to ~400 before)
- In case if address contains transactions we:
1. determine the range which contains 20-25 outgoing eth/erc20
transactions. This usually requires up to 10 `eth_transactionCount`
requests
2. then we scan chain for eth transfers using `eth_getBalance` and
`eth_transactionCount` (for double checking zero balances)
3. we make sure that we do not scan db for more than 30 blocks with
transfers. That's important for accounts with mostly incoming
transactions, because the range found on the first step might
contain any number of incoming transfers, but only 20-25 outgoing
transactions
4. when we found ~30 blocks in a given range, we update initial
range `from` block using the oldest found block
5. and now we scan db for erc20transfers using `eth_getLogs`
`oldest-found-eth-block`-`latest-block`, we make not more than 20 calls
6. when all blocks which contain incoming/outgoing transfers for a
given address are found, we save these blocks to db and mark that
transfers from these blocks are still to be fetched
7. Then we select latest ~30 (the number can be adjusted) blocks from
these which were found and fetch transfers, this requires 3-4
requests per transfer.
8. we persist scanned range so that we know were to start next time
9. we dispatch an event which tells client that transactions are found
10. client fetches latest 20 transfers
- when user presses "fetch more" button we check if app's db contains next
20 transfers, if not we scan chain again and return transfers after
small fixes
2019-12-18 11:01:46 +00:00
return rst , nil
}
2019-12-11 13:59:37 +00:00
func ( db * Database ) GetChatAddress ( ) ( rst types . Address , err error ) {
2023-05-16 10:48:00 +00:00
err = db . db . QueryRow ( "SELECT address FROM keypairs_accounts WHERE chat = 1" ) . Scan ( & rst )
2019-08-20 15:38:40 +00:00
return
}
2019-12-11 13:59:37 +00:00
func ( db * Database ) GetAddresses ( ) ( rst [ ] types . Address , err error ) {
2023-05-16 10:48:00 +00:00
rows , err := db . db . Query ( "SELECT address FROM keypairs_accounts ORDER BY created_at" )
2019-08-20 15:38:40 +00:00
if err != nil {
return nil , err
}
2020-05-14 10:51:32 +00:00
defer rows . Close ( )
2023-05-16 10:48:00 +00:00
2019-08-20 15:38:40 +00:00
for rows . Next ( ) {
2019-12-11 13:59:37 +00:00
addr := types . Address { }
2019-08-20 15:38:40 +00:00
err = rows . Scan ( & addr )
if err != nil {
return nil , err
}
rst = append ( rst , addr )
}
2023-05-16 10:48:00 +00:00
if err := rows . Err ( ) ; err != nil {
return nil , err
}
2019-08-20 15:38:40 +00:00
return rst , nil
}
2019-08-29 08:06:22 +00:00
// AddressExists returns true if given address is stored in database.
2019-12-11 13:59:37 +00:00
func ( db * Database ) AddressExists ( address types . Address ) ( exists bool , err error ) {
2023-05-16 10:48:00 +00:00
err = db . db . QueryRow ( "SELECT EXISTS (SELECT 1 FROM keypairs_accounts WHERE address = ?)" , address ) . Scan ( & exists )
2019-08-29 08:06:22 +00:00
return exists , err
}
2022-03-21 14:18:36 +00:00
2022-07-06 16:12:49 +00:00
// GetPath returns true if account with given address was recently key and doesn't have a key yet
func ( db * Database ) GetPath ( address types . Address ) ( path string , err error ) {
2023-05-16 10:48:00 +00:00
err = db . db . QueryRow ( "SELECT path FROM keypairs_accounts WHERE address = ?" , address ) . Scan ( & path )
2022-07-06 16:12:49 +00:00
return path , err
}
2022-03-21 14:18:36 +00:00
func ( db * Database ) GetNodeConfig ( ) ( * params . NodeConfig , error ) {
2022-04-22 08:11:40 +00:00
return nodecfg . GetNodeConfigFromDB ( db . db )
2022-03-21 14:18:36 +00:00
}
2023-05-16 10:48:00 +00:00
// this doesn't update clock
func ( db * Database ) UpdateAccountToFullyOperable ( keyUID string , address types . Address ) ( err error ) {
tx , err := db . db . Begin ( )
defer func ( ) {
if err == nil {
err = tx . Commit ( )
return
}
_ = tx . Rollback ( )
} ( )
if err != nil {
return err
}
_ , err = db . getAccountByAddress ( tx , address )
if err != nil {
return err
}
_ , err = tx . Exec ( ` UPDATE keypairs_accounts SET operable = ? WHERE address = ? ` , AccountFullyOperable , address )
return err
}