mirror of
https://github.com/XRPLF/rippled.git
synced 2025-12-06 17:27:55 +00:00
Move sources to src and build objs in obj.
This commit is contained in:
124
src/HashedObject.cpp
Normal file
124
src/HashedObject.cpp
Normal file
@@ -0,0 +1,124 @@
|
||||
|
||||
#include "boost/lexical_cast.hpp"
|
||||
|
||||
#include "HashedObject.h"
|
||||
#include "Serializer.h"
|
||||
#include "Application.h"
|
||||
|
||||
|
||||
|
||||
bool HashedObject::checkHash() const
|
||||
{
|
||||
uint256 hash=Serializer::getSHA512Half(mData);
|
||||
return hash==mHash;
|
||||
}
|
||||
|
||||
bool HashedObject::checkFixHash()
|
||||
{
|
||||
uint256 hash=Serializer::getSHA512Half(mData);
|
||||
if(hash==mHash) return true;
|
||||
mHash=hash;
|
||||
return false;
|
||||
}
|
||||
|
||||
void HashedObject::setHash()
|
||||
{
|
||||
mHash=Serializer::getSHA512Half(mData);
|
||||
}
|
||||
|
||||
/*
|
||||
CREATE TABLE CommittedObjects ( -- used to synch nodes
|
||||
Hash BLOB PRIMARY KEY,
|
||||
ObjType CHAR(1) NOT NULL, -- (L)edger, (T)ransaction, (A)ccount node, transaction (N)ode
|
||||
LedgerIndex BIGINT UNSIGNED, -- 0 if none
|
||||
Object BLOB
|
||||
);
|
||||
CREATE INDEX ObjectLocate ON CommittedObjects(LedgerIndex, ObjType);
|
||||
*/
|
||||
|
||||
bool HashedObject::store(HashedObjectType type, uint32 index, const std::vector<unsigned char>& data,
|
||||
const uint256& hash)
|
||||
{
|
||||
if(!theApp->getHashNodeDB()) return true;
|
||||
#ifdef DEBUG
|
||||
Serializer s(data);
|
||||
assert(hash==s.getSHA512Half());
|
||||
#endif
|
||||
std::string sql="INSERT INTO CommitedObjects (Hash,ObjType,LedgerIndex,Object) VALUES ('";
|
||||
sql.append(hash.GetHex());
|
||||
switch(type)
|
||||
{
|
||||
case LEDGER: sql.append("','L','"); break;
|
||||
case TRANSACTION: sql.append("','T','"); break;
|
||||
case ACCOUNT_NODE: sql.append("','A','"); break;
|
||||
case TRANSACTION_NODE: sql.append("','N','"); break;
|
||||
default: sql.append("','U','"); break;
|
||||
}
|
||||
sql.append(boost::lexical_cast<std::string>(index));
|
||||
sql.append("',");
|
||||
|
||||
std::string obj;
|
||||
theApp->getHashNodeDB()->getDB()->escape(&(data.front()), data.size(), obj);
|
||||
sql.append(obj);
|
||||
sql.append(");");
|
||||
|
||||
ScopedLock sl(theApp->getHashNodeDB()->getDBLock());
|
||||
Database* db=theApp->getHashNodeDB()->getDB();
|
||||
return db->executeSQL(sql.c_str());
|
||||
}
|
||||
|
||||
bool HashedObject::store() const
|
||||
{
|
||||
#ifdef DEBUG
|
||||
assert(checkHash());
|
||||
#endif
|
||||
return store(mType, mLedgerIndex, mData, mHash);
|
||||
}
|
||||
|
||||
HashedObject::pointer HashedObject::retrieve(const uint256& hash)
|
||||
{
|
||||
if(!theApp->getHashNodeDB()) return HashedObject::pointer();
|
||||
std::string sql="SELECT * from CommitedObjects WHERE Hash='";
|
||||
sql.append(hash.GetHex());
|
||||
sql.append("';");
|
||||
|
||||
std::string type;
|
||||
uint32 index;
|
||||
std::vector<unsigned char> data;
|
||||
data.reserve(8192);
|
||||
if(1)
|
||||
{
|
||||
ScopedLock sl(theApp->getHashNodeDB()->getDBLock());
|
||||
Database* db=theApp->getHashNodeDB()->getDB();
|
||||
|
||||
if(!db->executeSQL(sql.c_str()) || !db->startIterRows() || !db->getNextRow())
|
||||
return HashedObject::pointer();
|
||||
|
||||
std::string type;
|
||||
db->getStr("ObjType", type);
|
||||
if(type.size()==0) return HashedObject::pointer();
|
||||
|
||||
index=db->getBigInt("LedgerIndex");
|
||||
|
||||
int size=db->getBinary("Object", NULL, 0);
|
||||
data.resize(size);
|
||||
db->getBinary("Object", &(data.front()), size);
|
||||
db->endIterRows();
|
||||
}
|
||||
|
||||
HashedObjectType htype=UNKNOWN;
|
||||
switch(type[0])
|
||||
{
|
||||
case 'L': htype=LEDGER; break;
|
||||
case 'T': htype=TRANSACTION; break;
|
||||
case 'A': htype=ACCOUNT_NODE; break;
|
||||
case 'N': htype=TRANSACTION_NODE; break;
|
||||
}
|
||||
|
||||
HashedObject::pointer obj(new HashedObject(htype, index, data));
|
||||
obj->mHash=hash;
|
||||
#ifdef DEBUG
|
||||
assert(obj->checkHash());
|
||||
#endif
|
||||
return obj;
|
||||
}
|
||||
Reference in New Issue
Block a user