All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.bitcoinj.core.GetBlocksMessage Maven / Gradle / Ivy

There is a newer version: 0.15-cm06
Show newest version
/*
 * Copyright 2011 Google Inc.
 * Copyright 2015 Andreas Schildbach
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *    http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package org.bitcoinj.core;

import java.io.IOException;
import java.io.OutputStream;
import java.util.ArrayList;
import java.util.List;

/**
 * 

Represents the "getblocks" P2P network message, which requests the hashes of the parts of the block chain we're * missing. Those blocks can then be downloaded with a {@link GetDataMessage}.

* *

Instances of this class are not safe for use by multiple threads.

*/ public class GetBlocksMessage extends Message { protected long version; protected List locator; protected Sha256Hash stopHash; public GetBlocksMessage(NetworkParameters params, List locator, Sha256Hash stopHash) { super(params); this.version = protocolVersion; this.locator = locator; this.stopHash = stopHash; } public GetBlocksMessage(NetworkParameters params, byte[] payload) throws ProtocolException { super(params, payload, 0); } @Override protected void parse() throws ProtocolException { cursor = offset; version = readUint32(); int startCount = (int) readVarInt(); if (startCount > 500) throw new ProtocolException("Number of locators cannot be > 500, received: " + startCount); length = cursor - offset + ((startCount + 1) * 32); locator = new ArrayList<>(startCount); for (int i = 0; i < startCount; i++) { locator.add(readHash()); } stopHash = readHash(); } public List getLocator() { return locator; } public Sha256Hash getStopHash() { return stopHash; } @Override public String toString() { return "getblocks: " + Utils.SPACE_JOINER.join(locator); } @Override protected void bitcoinSerializeToStream(OutputStream stream) throws IOException { // Version, for some reason. Utils.uint32ToByteStreamLE(params.getProtocolVersionNum(NetworkParameters.ProtocolVersion.CURRENT), stream); // Then a vector of block hashes. This is actually a "block locator", a set of block // identifiers that spans the entire chain with exponentially increasing gaps between // them, until we end up at the genesis block. See CBlockLocator::Set() stream.write(new VarInt(locator.size()).encode()); for (Sha256Hash hash : locator) { // Have to reverse as wire format is little endian. stream.write(hash.getReversedBytes()); } // Next, a block ID to stop at. stream.write(stopHash.getReversedBytes()); } @Override public boolean equals(Object o) { if (this == o) return true; if (o == null || getClass() != o.getClass()) return false; GetBlocksMessage other = (GetBlocksMessage) o; return version == other.version && stopHash.equals(other.stopHash) && locator.size() == other.locator.size() && locator.containsAll(other.locator); // ignores locator ordering } @Override public int hashCode() { int hashCode = (int)version ^ "getblocks".hashCode() ^ stopHash.hashCode(); for (Sha256Hash aLocator : locator) hashCode ^= aLocator.hashCode(); // ignores locator ordering return hashCode; } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy