sidecoin/src/script.cpp at master · superstacked/sidecoin · GitHub

History

2072 lines (1836 loc) · 69.5 KB

Raw

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

286

287

288

289

290

291

292

293

294

295

296

297

298

299

300

301

302

303

304

305

306

307

308

309

310

311

312

313

314

315

316

317

318

319

320

321

322

323

324

325

326

327

328

329

330

331

332

333

334

335

336

337

338

339

340

341

342

343

344

345

346

347

348

349

350

351

352

353

354

355

356

357

358

359

360

361

362

363

364

365

366

367

368

369

370

371

372

373

374

375

376

377

378

379

380

381

382

383

384

385

386

387

388

389

390

391

392

393

394

395

396

397

398

399

400

401

402

403

404

405

406

407

408

409

410

411

412

413

414

415

416

417

418

419

420

421

422

423

424

425

426

427

428

429

430

431

432

433

434

435

436

437

438

439

440

441

442

443

444

445

446

447

448

449

450

451

452

453

454

455

456

457

458

459

460

461

462

463

464

465

466

467

468

469

470

471

472

473

474

475

476

477

478

479

480

481

482

483

484

485

486

487

488

489

490

491

492

493

494

495

496

497

498

499

500

501

502

503

504

505

506

507

508

509

510

511

512

513

514

515

516

517

518

519

520

521

522

523

524

525

526

527

528

529

530

531

532

533

534

535

536

537

538

539

540

541

542

543

544

545

546

547

548

549

550

551

552

553

554

555

556

557

558

559

560

561

562

563

564

565

566

567

568

569

570

571

572

573

574

575

576

577

578

579

580

581

582

583

584

585

586

587

588

589

590

591

592

593

594

595

596

597

598

599

600

601

602

603

604

605

606

607

608

609

610

611

612

613

614

615

616

617

618

619

620

621

622

623

624

625

626

627

628

629

630

631

632

633

634

635

636

637

638

639

640

641

642

643

644

645

646

647

648

649

650

651

652

653

654

655

656

657

658

659

660

661

662

663

664

665

666

667

668

669

670

671

672

673

674

675

676

677

678

679

680

681

682

683

684

685

686

687

688

689

690

691

692

693

694

695

696

697

698

699

700

701

702

703

704

705

706

707

708

709

710

711

712

713

714

715

716

717

718

719

720

721

722

723

724

725

726

727

728

729

730

731

732

733

734

735

736

737

738

739

740

741

742

743

744

745

746

747

748

749

750

751

752

753

754

755

756

757

758

759

760

761

762

763

764

765

766

767

768

769

770

771

772

773

774

775

776

777

778

779

780

781

782

783

784

785

786

787

788

789

790

791

792

793

794

795

796

797

798

799

800

801

802

803

804

805

806

807

808

809

810

811

812

813

814

815

816

817

818

819

820

821

822

823

824

825

826

827

828

829

830

831

832

833

834

835

836

837

838

839

840

841

842

843

844

845

846

847

848

849

850

851

852

853

854

855

856

857

858

859

860

861

862

863

864

865

866

867

868

869

870

871

872

873

874

875

876

877

878

879

880

881

882

883

884

885

886

887

888

889

890

891

892

893

894

895

896

897

898

899

900

901

902

903

904

905

906

907

908

909

910

911

912

913

914

915

916

917

918

919

920

921

922

923

924

925

926

927

928

929

930

931

932

933

934

935

936

937

938

939

940

941

942

943

944

945

946

947

948

949

950

951

952

953

954

955

956

957

958

959

960

961

962

963

964

965

966

967

968

969

970

971

972

973

974

975

976

977

978

979

980

981

982

983

984

985

986

987

988

989

990

991

992

993

994

995

996

997

998

999

1000

// Distributed under the MIT/X11 software license, see the accompanying

// file COPYING or http://www.opensource.org/licenses/mit-license.php.

#include "script.h"

#include "bignum.h"

#include "core.h"

#include "hash.h"

#include "key.h"

#include "keystore.h"

#include "sync.h"

#include "uint256.h"

#include "util.h"

#include <boost/foreach.hpp>

#include <boost/tuple/tuple.hpp>

#include <boost/tuple/tuple_comparison.hpp>

using namespace std;

using namespace boost;

typedef vector<unsigned char> valtype;

static const valtype vchFalse(0);

static const valtype vchZero(0);

static const valtype vchTrue(1, 1);

static const CBigNum bnZero(0);

static const CBigNum bnOne(1);

static const CBigNum bnFalse(0);

static const CBigNum bnTrue(1);

static const size_t nMaxNumSize = 4;

bool CheckSig(vector<unsigned char> vchSig, const vector<unsigned char> &vchPubKey, const CScript &scriptCode, const CTransaction& txTo, unsigned int nIn, int nHashType, int flags);

CBigNum CastToBigNum(const valtype& vch)

{

if (vch.size() > nMaxNumSize)

throw runtime_error("CastToBigNum() : overflow");

// Get rid of extra leading zeros

return CBigNum(CBigNum(vch).getvch());

}

bool CastToBool(const valtype& vch)

{

for (unsigned int i = 0; i < vch.size(); i++)

{

if (vch[i] != 0)

{

// Can be negative zero

if (i == vch.size()-1 && vch[i] == 0x80)

return false;

return true;

}

return false;

}

// Script is a stack machine (like Forth) that evaluates a predicate

// returning a bool indicating valid or not. There are no loops.

#define stacktop(i) (stack.at(stack.size()+(i)))

#define altstacktop(i) (altstack.at(altstack.size()+(i)))

static inline void popstack(vector<valtype>& stack)

{

if (stack.empty())

throw runtime_error("popstack() : stack empty");

stack.pop_back();

}

const char* GetTxnOutputType(txnouttype t)

{

// why LABEL -> string?

switch (t)

{

case TX_NONSTANDARD: return "nonstandard";

case TX_PUBKEY: return "pubkey";

case TX_PUBKEYHASH: return "pubkeyhash";

case TX_SCRIPTHASH: return "scripthash";

case TX_MULTISIG: return "multisig";

case TX_NULL_DATA: return "nulldata";

}

return NULL;

}

const char* GetOpName(opcodetype opcode)

{

switch (opcode)

{

// push value

case OP_0 : return "0";

case OP_PUSHDATA1 : return "OP_PUSHDATA1";

case OP_PUSHDATA2 : return "OP_PUSHDATA2";

case OP_PUSHDATA4 : return "OP_PUSHDATA4";

case OP_1NEGATE : return "-1";

case OP_RESERVED : return "OP_RESERVED";

case OP_1 : return "1";

case OP_2 : return "2";

case OP_3 : return "3";

case OP_4 : return "4";

case OP_5 : return "5";

case OP_6 : return "6";

case OP_7 : return "7";

case OP_8 : return "8";

case OP_9 : return "9";

case OP_10 : return "10";

case OP_11 : return "11";

case OP_12 : return "12";

case OP_13 : return "13";

case OP_14 : return "14";

case OP_15 : return "15";

case OP_16 : return "16";

// control

case OP_NOP : return "OP_NOP";

case OP_VER : return "OP_VER";

case OP_IF : return "OP_IF";

case OP_NOTIF : return "OP_NOTIF";

case OP_VERIF : return "OP_VERIF";

case OP_VERNOTIF : return "OP_VERNOTIF";

case OP_ELSE : return "OP_ELSE";

case OP_ENDIF : return "OP_ENDIF";

case OP_VERIFY : return "OP_VERIFY";

case OP_RETURN : return "OP_RETURN";

// stack ops

case OP_TOALTSTACK : return "OP_TOALTSTACK";

case OP_FROMALTSTACK : return "OP_FROMALTSTACK";

case OP_2DROP : return "OP_2DROP";

case OP_2DUP : return "OP_2DUP";

case OP_3DUP : return "OP_3DUP";

case OP_2OVER : return "OP_2OVER";

case OP_2ROT : return "OP_2ROT";

case OP_2SWAP : return "OP_2SWAP";

case OP_IFDUP : return "OP_IFDUP";

case OP_DEPTH : return "OP_DEPTH";

case OP_DROP : return "OP_DROP";

case OP_DUP : return "OP_DUP";

case OP_NIP : return "OP_NIP";

case OP_OVER : return "OP_OVER";

case OP_PICK : return "OP_PICK";

case OP_ROLL : return "OP_ROLL";

case OP_ROT : return "OP_ROT";

case OP_SWAP : return "OP_SWAP";

case OP_TUCK : return "OP_TUCK";

// splice ops

case OP_CAT : return "OP_CAT";

case OP_SUBSTR : return "OP_SUBSTR";

case OP_LEFT : return "OP_LEFT";

case OP_RIGHT : return "OP_RIGHT";

case OP_SIZE : return "OP_SIZE";

// bit logic

case OP_INVERT : return "OP_INVERT";

case OP_AND : return "OP_AND";

case OP_OR : return "OP_OR";

case OP_XOR : return "OP_XOR";

case OP_EQUAL : return "OP_EQUAL";

case OP_EQUALVERIFY : return "OP_EQUALVERIFY";

case OP_RESERVED1 : return "OP_RESERVED1";

case OP_RESERVED2 : return "OP_RESERVED2";

// numeric

case OP_1ADD : return "OP_1ADD";

case OP_1SUB : return "OP_1SUB";

case OP_2MUL : return "OP_2MUL";

case OP_2DIV : return "OP_2DIV";

case OP_NEGATE : return "OP_NEGATE";

case OP_ABS : return "OP_ABS";

case OP_NOT : return "OP_NOT";

case OP_0NOTEQUAL : return "OP_0NOTEQUAL";

case OP_ADD : return "OP_ADD";

case OP_SUB : return "OP_SUB";

case OP_MUL : return "OP_MUL";

case OP_DIV : return "OP_DIV";

case OP_MOD : return "OP_MOD";

case OP_LSHIFT : return "OP_LSHIFT";

case OP_RSHIFT : return "OP_RSHIFT";

case OP_BOOLAND : return "OP_BOOLAND";

case OP_BOOLOR : return "OP_BOOLOR";

case OP_NUMEQUAL : return "OP_NUMEQUAL";

case OP_NUMEQUALVERIFY : return "OP_NUMEQUALVERIFY";

case OP_NUMNOTEQUAL : return "OP_NUMNOTEQUAL";

case OP_LESSTHAN : return "OP_LESSTHAN";

case OP_GREATERTHAN : return "OP_GREATERTHAN";

case OP_LESSTHANOREQUAL : return "OP_LESSTHANOREQUAL";

case OP_GREATERTHANOREQUAL : return "OP_GREATERTHANOREQUAL";

case OP_MIN : return "OP_MIN";

case OP_MAX : return "OP_MAX";

case OP_WITHIN : return "OP_WITHIN";

// crypto

case OP_RIPEMD160 : return "OP_RIPEMD160";

case OP_SHA1 : return "OP_SHA1";

case OP_SHA256 : return "OP_SHA256";

case OP_HASH160 : return "OP_HASH160";

case OP_HASH256 : return "OP_HASH256";

case OP_CODESEPARATOR : return "OP_CODESEPARATOR";

case OP_CHECKSIG : return "OP_CHECKSIG";

case OP_CHECKSIGVERIFY : return "OP_CHECKSIGVERIFY";

case OP_CHECKMULTISIG : return "OP_CHECKMULTISIG";

case OP_CHECKMULTISIGVERIFY : return "OP_CHECKMULTISIGVERIFY";

// expanson

case OP_NOP1 : return "OP_NOP1";

case OP_NOP2 : return "OP_NOP2";

case OP_NOP3 : return "OP_NOP3";

case OP_NOP4 : return "OP_NOP4";

case OP_NOP5 : return "OP_NOP5";

case OP_NOP6 : return "OP_NOP6";

case OP_NOP7 : return "OP_NOP7";

case OP_NOP8 : return "OP_NOP8";

case OP_NOP9 : return "OP_NOP9";

case OP_NOP10 : return "OP_NOP10";

// template matching params

case OP_PUBKEYHASH : return "OP_PUBKEYHASH";

case OP_PUBKEY : return "OP_PUBKEY";

case OP_SMALLDATA : return "OP_SMALLDATA";

case OP_INVALIDOPCODE : return "OP_INVALIDOPCODE";

default:

return "OP_UNKNOWN";

}

bool IsCanonicalPubKey(const valtype &vchPubKey, unsigned int flags) {

if (!(flags & SCRIPT_VERIFY_STRICTENC))

return true;

if (vchPubKey.size() < 33)

return error("Non-canonical public key: too short");

if (vchPubKey[0] == 0x04) {

if (vchPubKey.size() != 65)

return error("Non-canonical public key: invalid length for uncompressed key");

} else if (vchPubKey[0] == 0x02 || vchPubKey[0] == 0x03) {

if (vchPubKey.size() != 33)

return error("Non-canonical public key: invalid length for compressed key");

} else {

return error("Non-canonical public key: compressed nor uncompressed");

}

return true;

}

bool IsCanonicalSignature(const valtype &vchSig, unsigned int flags) {

if (!(flags & SCRIPT_VERIFY_STRICTENC))

return true;

// See https://bitcointalk.org/index.php?topic=8392.msg127623#msg127623

// A canonical signature exists of: <30> <total len> <02> <len R> <R> <02> <len S> <S> <hashtype>

// Where R and S are not negative (their first byte has its highest bit not set), and not

// excessively padded (do not start with a 0 byte, unless an otherwise negative number follows,

// in which case a single 0 byte is necessary and even required).

if (vchSig.size() < 9)

return error("Non-canonical signature: too short");

if (vchSig.size() > 73)

return error("Non-canonical signature: too long");

unsigned char nHashType = vchSig[vchSig.size() - 1] & (~(SIGHASH_ANYONECANPAY));

if (nHashType < SIGHASH_ALL || nHashType > SIGHASH_SINGLE)

return error("Non-canonical signature: unknown hashtype byte");

if (vchSig[0] != 0x30)

return error("Non-canonical signature: wrong type");

if (vchSig[1] != vchSig.size()-3)

return error("Non-canonical signature: wrong length marker");

unsigned int nLenR = vchSig[3];

if (5 + nLenR >= vchSig.size())

return error("Non-canonical signature: S length misplaced");

unsigned int nLenS = vchSig[5+nLenR];

if ((unsigned long)(nLenR+nLenS+7) != vchSig.size())

return error("Non-canonical signature: R+S length mismatch");

const unsigned char *R = &vchSig[4];

if (R[-2] != 0x02)

return error("Non-canonical signature: R value type mismatch");

if (nLenR == 0)

return error("Non-canonical signature: R length is zero");

if (R[0] & 0x80)

return error("Non-canonical signature: R value negative");

if (nLenR > 1 && (R[0] == 0x00) && !(R[1] & 0x80))

return error("Non-canonical signature: R value excessively padded");

const unsigned char *S = &vchSig[6+nLenR];

if (S[-2] != 0x02)

return error("Non-canonical signature: S value type mismatch");

if (nLenS == 0)

return error("Non-canonical signature: S length is zero");

if (S[0] & 0x80)

return error("Non-canonical signature: S value negative");

if (nLenS > 1 && (S[0] == 0x00) && !(S[1] & 0x80))

return error("Non-canonical signature: S value excessively padded");

if (flags & SCRIPT_VERIFY_EVEN_S) {

if (S[nLenS-1] & 1)

return error("Non-canonical signature: S value odd");

}

return true;

}

bool EvalScript(vector<vector<unsigned char> >& stack, const CScript& script, const CTransaction& txTo, unsigned int nIn, unsigned int flags, int nHashType)

{

CAutoBN_CTX pctx;

CScript::const_iterator pc = script.begin();

CScript::const_iterator pend = script.end();

CScript::const_iterator pbegincodehash = script.begin();

opcodetype opcode;

valtype vchPushValue;

vector<bool> vfExec;

vector<valtype> altstack;

if (script.size() > 10000)

return false;

int nOpCount = 0;

try

{

while (pc < pend)

{

bool fExec = !count(vfExec.begin(), vfExec.end(), false);

// Read instruction

if (!script.GetOp(pc, opcode, vchPushValue))

return false;

if (vchPushValue.size() > MAX_SCRIPT_ELEMENT_SIZE)

return false;

// Note how OP_RESERVED does not count towards the opcode limit.

if (opcode > OP_16 && ++nOpCount > 201)

return false;

if (opcode == OP_CAT ||

opcode == OP_SUBSTR ||

opcode == OP_LEFT ||

opcode == OP_RIGHT ||

opcode == OP_INVERT ||

opcode == OP_AND ||

opcode == OP_OR ||

opcode == OP_XOR ||

opcode == OP_2MUL ||

opcode == OP_2DIV ||

opcode == OP_MUL ||

opcode == OP_DIV ||

opcode == OP_MOD ||

opcode == OP_LSHIFT ||

opcode == OP_RSHIFT)

return false; // Disabled opcodes.

if (fExec && 0 <= opcode && opcode <= OP_PUSHDATA4)

stack.push_back(vchPushValue);

else if (fExec || (OP_IF <= opcode && opcode <= OP_ENDIF))

switch (opcode)

{

// Push value

case OP_1NEGATE:

case OP_1:

case OP_2:

case OP_3:

case OP_4:

case OP_5:

case OP_6:

case OP_7:

case OP_8:

case OP_9:

case OP_10:

case OP_11:

case OP_12:

case OP_13:

case OP_14:

case OP_15:

case OP_16:

{

// ( -- value)

CBigNum bn((int)opcode - (int)(OP_1 - 1));

stack.push_back(bn.getvch());

}

break;

// Control

case OP_NOP:

case OP_NOP1: case OP_NOP2: case OP_NOP3: case OP_NOP4: case OP_NOP5:

case OP_NOP6: case OP_NOP7: case OP_NOP8: case OP_NOP9: case OP_NOP10:

break;

case OP_IF:

case OP_NOTIF:

{

// <expression> if [statements] [else [statements]] endif

bool fValue = false;

if (fExec)

{

if (stack.size() < 1)

return false;

valtype& vch = stacktop(-1);

fValue = CastToBool(vch);

if (opcode == OP_NOTIF)

fValue = !fValue;

popstack(stack);

}

vfExec.push_back(fValue);

}

break;

case OP_ELSE:

{

if (vfExec.empty())

return false;

vfExec.back() = !vfExec.back();

}

break;

case OP_ENDIF:

{

if (vfExec.empty())

return false;

vfExec.pop_back();

}

break;

case OP_VERIFY:

{

// (true -- ) or

// (false -- false) and return

if (stack.size() < 1)

return false;

bool fValue = CastToBool(stacktop(-1));

if (fValue)

popstack(stack);

else

return false;

}

break;

case OP_RETURN:

{

return false;

}

break;

// Stack ops

case OP_TOALTSTACK:

{

if (stack.size() < 1)

return false;

altstack.push_back(stacktop(-1));

popstack(stack);

}

break;

case OP_FROMALTSTACK:

{

if (altstack.size() < 1)

return false;

stack.push_back(altstacktop(-1));

popstack(altstack);

}

break;

case OP_2DROP:

{

// (x1 x2 -- )

if (stack.size() < 2)

return false;

popstack(stack);

}

break;

case OP_2DUP:

{

// (x1 x2 -- x1 x2 x1 x2)

if (stack.size() < 2)

return false;

valtype vch1 = stacktop(-2);

valtype vch2 = stacktop(-1);

stack.push_back(vch1);

stack.push_back(vch2);

}

break;

case OP_3DUP:

{

// (x1 x2 x3 -- x1 x2 x3 x1 x2 x3)

if (stack.size() < 3)

return false;

valtype vch1 = stacktop(-3);

valtype vch2 = stacktop(-2);

valtype vch3 = stacktop(-1);

stack.push_back(vch1);

stack.push_back(vch2);

stack.push_back(vch3);

}

break;

case OP_2OVER:

{

// (x1 x2 x3 x4 -- x1 x2 x3 x4 x1 x2)

if (stack.size() < 4)

return false;

valtype vch1 = stacktop(-4);

valtype vch2 = stacktop(-3);

stack.push_back(vch1);

stack.push_back(vch2);

}

break;

case OP_2ROT:

{

// (x1 x2 x3 x4 x5 x6 -- x3 x4 x5 x6 x1 x2)

if (stack.size() < 6)

return false;

valtype vch1 = stacktop(-6);

valtype vch2 = stacktop(-5);

stack.erase(stack.end()-6, stack.end()-4);

stack.push_back(vch1);

stack.push_back(vch2);

}

break;

case OP_2SWAP:

{

// (x1 x2 x3 x4 -- x3 x4 x1 x2)

if (stack.size() < 4)

return false;

swap(stacktop(-4), stacktop(-2));

swap(stacktop(-3), stacktop(-1));

}

break;

case OP_IFDUP:

{

// (x - 0 | x x)

if (stack.size() < 1)

return false;

valtype vch = stacktop(-1);

if (CastToBool(vch))

stack.push_back(vch);

}

break;

case OP_DEPTH:

{

// -- stacksize

CBigNum bn(stack.size());

stack.push_back(bn.getvch());

}

break;

case OP_DROP:

{

// (x -- )

if (stack.size() < 1)

return false;

popstack(stack);

}

break;

case OP_DUP:

{

// (x -- x x)

if (stack.size() < 1)

return false;

valtype vch = stacktop(-1);

stack.push_back(vch);

}

break;

case OP_NIP:

{

// (x1 x2 -- x2)

if (stack.size() < 2)

return false;

stack.erase(stack.end() - 2);

}

break;

case OP_OVER:

{

// (x1 x2 -- x1 x2 x1)

if (stack.size() < 2)

return false;

valtype vch = stacktop(-2);

stack.push_back(vch);

}

break;

case OP_PICK:

case OP_ROLL:

{

// (xn ... x2 x1 x0 n - xn ... x2 x1 x0 xn)

// (xn ... x2 x1 x0 n - ... x2 x1 x0 xn)

if (stack.size() < 2)

return false;

int n = CastToBigNum(stacktop(-1)).getint();

popstack(stack);

if (n < 0 || n >= (int)stack.size())

return false;

valtype vch = stacktop(-n-1);

if (opcode == OP_ROLL)

stack.erase(stack.end()-n-1);

stack.push_back(vch);

}

break;

case OP_ROT:

{

// (x1 x2 x3 -- x2 x3 x1)

// x2 x1 x3 after first swap

// x2 x3 x1 after second swap

if (stack.size() < 3)

return false;

swap(stacktop(-3), stacktop(-2));

swap(stacktop(-2), stacktop(-1));

}

break;

case OP_SWAP:

{

// (x1 x2 -- x2 x1)

if (stack.size() < 2)

return false;

swap(stacktop(-2), stacktop(-1));

}

break;

case OP_TUCK:

{

// (x1 x2 -- x2 x1 x2)

if (stack.size() < 2)

return false;

valtype vch = stacktop(-1);

stack.insert(stack.end()-2, vch);

}

break;

case OP_SIZE:

{

// (in -- in size)

if (stack.size() < 1)

return false;

CBigNum bn(stacktop(-1).size());

stack.push_back(bn.getvch());

}

break;

// Bitwise logic

case OP_EQUAL:

case OP_EQUALVERIFY:

//case OP_NOTEQUAL: // use OP_NUMNOTEQUAL

{

// (x1 x2 - bool)

if (stack.size() < 2)

return false;

valtype& vch1 = stacktop(-2);

valtype& vch2 = stacktop(-1);

bool fEqual = (vch1 == vch2);

// OP_NOTEQUAL is disabled because it would be too easy to say

// something like n != 1 and have some wiseguy pass in 1 with extra

// zero bytes after it (numerically, 0x01 == 0x0001 == 0x000001)

//if (opcode == OP_NOTEQUAL)

// fEqual = !fEqual;

popstack(stack);

stack.push_back(fEqual ? vchTrue : vchFalse);

if (opcode == OP_EQUALVERIFY)

{

if (fEqual)

popstack(stack);

else

return false;

}

break;

// Numeric

case OP_1ADD:

case OP_1SUB:

case OP_NEGATE:

case OP_ABS:

case OP_NOT:

case OP_0NOTEQUAL:

{

// (in -- out)

if (stack.size() < 1)

return false;

CBigNum bn = CastToBigNum(stacktop(-1));

switch (opcode)

{

case OP_1ADD: bn += bnOne; break;

case OP_1SUB: bn -= bnOne; break;

case OP_NEGATE: bn = -bn; break;

case OP_ABS: if (bn < bnZero) bn = -bn; break;

case OP_NOT: bn = (bn == bnZero); break;

case OP_0NOTEQUAL: bn = (bn != bnZero); break;

default: assert(!"invalid opcode"); break;

}

popstack(stack);

stack.push_back(bn.getvch());

}

break;

case OP_ADD:

case OP_SUB:

case OP_BOOLAND:

case OP_BOOLOR:

case OP_NUMEQUAL:

case OP_NUMEQUALVERIFY:

case OP_NUMNOTEQUAL:

case OP_LESSTHAN:

case OP_GREATERTHAN:

case OP_LESSTHANOREQUAL:

case OP_GREATERTHANOREQUAL:

case OP_MIN:

case OP_MAX:

{

// (x1 x2 -- out)

if (stack.size() < 2)

return false;

CBigNum bn1 = CastToBigNum(stacktop(-2));

CBigNum bn2 = CastToBigNum(stacktop(-1));

CBigNum bn;

switch (opcode)

{

case OP_ADD:

bn = bn1 + bn2;

break;

case OP_SUB:

bn = bn1 - bn2;

break;

case OP_BOOLAND: bn = (bn1 != bnZero && bn2 != bnZero); break;

case OP_BOOLOR: bn = (bn1 != bnZero || bn2 != bnZero); break;

case OP_NUMEQUAL: bn = (bn1 == bn2); break;

case OP_NUMEQUALVERIFY: bn = (bn1 == bn2); break;

case OP_NUMNOTEQUAL: bn = (bn1 != bn2); break;

case OP_LESSTHAN: bn = (bn1 < bn2); break;

case OP_GREATERTHAN: bn = (bn1 > bn2); break;

case OP_LESSTHANOREQUAL: bn = (bn1 <= bn2); break;

case OP_GREATERTHANOREQUAL: bn = (bn1 >= bn2); break;

case OP_MIN: bn = (bn1 < bn2 ? bn1 : bn2); break;

case OP_MAX: bn = (bn1 > bn2 ? bn1 : bn2); break;

default: assert(!"invalid opcode"); break;

}

popstack(stack);

stack.push_back(bn.getvch());

if (opcode == OP_NUMEQUALVERIFY)

{

if (CastToBool(stacktop(-1)))

popstack(stack);

else

return false;

}

break;

case OP_WITHIN:

{

// (x min max -- out)

if (stack.size() < 3)

return false;

CBigNum bn1 = CastToBigNum(stacktop(-3));

CBigNum bn2 = CastToBigNum(stacktop(-2));

CBigNum bn3 = CastToBigNum(stacktop(-1));

bool fValue = (bn2 <= bn1 && bn1 < bn3);

popstack(stack);

stack.push_back(fValue ? vchTrue : vchFalse);

}

break;

// Crypto

case OP_RIPEMD160:

case OP_SHA1:

case OP_SHA256:

case OP_HASH160:

case OP_HASH256:

{

// (in -- hash)

if (stack.size() < 1)

return false;

valtype& vch = stacktop(-1);

valtype vchHash((opcode == OP_RIPEMD160 || opcode == OP_SHA1 || opcode == OP_HASH160) ? 20 : 32);

if (opcode == OP_RIPEMD160)

RIPEMD160(&vch[0], vch.size(), &vchHash[0]);

else if (opcode == OP_SHA1)

SHA1(&vch[0], vch.size(), &vchHash[0]);

else if (opcode == OP_SHA256)

SHA256(&vch[0], vch.size(), &vchHash[0]);

else if (opcode == OP_HASH160)

{

uint160 hash160 = Hash160(vch);

memcpy(&vchHash[0], &hash160, sizeof(hash160));

}

else if (opcode == OP_HASH256)

{

uint256 hash = Hash(vch.begin(), vch.end());

memcpy(&vchHash[0], &hash, sizeof(hash));

}

popstack(stack);

stack.push_back(vchHash);

}

break;

case OP_CODESEPARATOR:

{

// Hash starts after the code separator

pbegincodehash = pc;

}

break;

case OP_CHECKSIG:

case OP_CHECKSIGVERIFY:

{

// (sig pubkey -- bool)

if (stack.size() < 2)

return false;

valtype& vchSig = stacktop(-2);

valtype& vchPubKey = stacktop(-1);

////// debug print

//PrintHex(vchSig.begin(), vchSig.end(), "sig: %s\n");

//PrintHex(vchPubKey.begin(), vchPubKey.end(), "pubkey: %s\n");

// Subset of script starting at the most recent codeseparator

CScript scriptCode(pbegincodehash, pend);

// Drop the signature, since there's no way for a signature to sign itself

scriptCode.FindAndDelete(CScript(vchSig));

bool fSuccess = IsCanonicalSignature(vchSig, flags) && IsCanonicalPubKey(vchPubKey, flags) &&

CheckSig(vchSig, vchPubKey, scriptCode, txTo, nIn, nHashType, flags);

popstack(stack);

stack.push_back(fSuccess ? vchTrue : vchFalse);

if (opcode == OP_CHECKSIGVERIFY)

{

if (fSuccess)

popstack(stack);

else

return false;

}

break;

case OP_CHECKMULTISIG:

case OP_CHECKMULTISIGVERIFY:

{

// ([sig ...] num_of_signatures [pubkey ...] num_of_pubkeys -- bool)

int i = 1;

if ((int)stack.size() < i)

return false;

int nKeysCount = CastToBigNum(stacktop(-i)).getint();

if (nKeysCount < 0 || nKeysCount > 20)

return false;

nOpCount += nKeysCount;

if (nOpCount > 201)

return false;

int ikey = ++i;

i += nKeysCount;

if ((int)stack.size() < i)

return false;

int nSigsCount = CastToBigNum(stacktop(-i)).getint();

if (nSigsCount < 0 || nSigsCount > nKeysCount)

return false;

int isig = ++i;

i += nSigsCount;

if ((int)stack.size() < i)

return false;

// Subset of script starting at the most recent codeseparator

CScript scriptCode(pbegincodehash, pend);

// Drop the signatures, since there's no way for a signature to sign itself

for (int k = 0; k < nSigsCount; k++)

{

valtype& vchSig = stacktop(-isig-k);

scriptCode.FindAndDelete(CScript(vchSig));

}

bool fSuccess = true;

while (fSuccess && nSigsCount > 0)

{

valtype& vchSig = stacktop(-isig);

valtype& vchPubKey = stacktop(-ikey);

// Check signature

bool fOk = IsCanonicalSignature(vchSig, flags) && IsCanonicalPubKey(vchPubKey, flags) &&

CheckSig(vchSig, vchPubKey, scriptCode, txTo, nIn, nHashType, flags);

if (fOk) {

isig++;

nSigsCount--;

}

ikey++;

nKeysCount--;

// If there are more signatures left than keys left,

// then too many signatures have failed

if (nSigsCount > nKeysCount)

fSuccess = false;

}

while (i-- > 0)

popstack(stack);

stack.push_back(fSuccess ? vchTrue : vchFalse);

if (opcode == OP_CHECKMULTISIGVERIFY)

{

if (fSuccess)

popstack(stack);

else

return false;

}

break;

default:

return false;

}

// Size limits

if (stack.size() + altstack.size() > 1000)

return false;

}

catch (...)

{

return false;

}

if (!vfExec.empty())

return false;

return true;

}

namespace {

/** Wrapper that serializes like CTransaction, but with the modifications

* required for the signature hash done in-place

class CTransactionSignatureSerializer {

private:

const CTransaction &txTo; // reference to the spending transaction (the one being serialized)

const CScript &scriptCode; // output script being consumed

const unsigned int nIn; // input index of txTo being signed

const bool fAnyoneCanPay; // whether the hashtype has the SIGHASH_ANYONECANPAY flag set

const bool fHashSingle; // whether the hashtype is SIGHASH_SINGLE

const bool fHashNone; // whether the hashtype is SIGHASH_NONE

public:

CTransactionSignatureSerializer(const CTransaction &txToIn, const CScript &scriptCodeIn, unsigned int nInIn, int nHashTypeIn) :

txTo(txToIn), scriptCode(scriptCodeIn), nIn(nInIn),

fAnyoneCanPay(!!(nHashTypeIn & SIGHASH_ANYONECANPAY)),

fHashSingle((nHashTypeIn & 0x1f) == SIGHASH_SINGLE),

fHashNone((nHashTypeIn & 0x1f) == SIGHASH_NONE) {}

/** Serialize the passed scriptCode, skipping OP_CODESEPARATORs */

View remainder of file in raw view

sidecoin/src/script.cpp at master · superstacked/sidecoin · GitHub

Expand file tree

Breadcrumbs

script.cpp

Latest commit

History

Breadcrumbs

script.cpp

File metadata and controls