Examples with ContractValue com.hedera.services.state.virtual.ContractValue used on opensource projects

Example 1 with ContractValue

use of com.hedera.services.state.virtual.ContractValue in project hedera-services by hashgraph.

the class EclipseMapBench method setup.

@Setup(Level.Trial)
public void setup() {
    nextIndex = numEntities;
    map = new LongObjectHashMap<ContractValue>().asSynchronized();
    // fill with some data
    for (long i = 0; i < numEntities; i++) {
        map.put(i, new ContractValue(i));
    }
    // print memory usage
    System.out.printf("Memory for initial %,d accounts:\n", numEntities);
    printMemoryUsage();
}

Example 2 with ContractValue

use of com.hedera.services.state.virtual.ContractValue in project hedera-services by hashgraph.

the class EclipseMapBench method add.

@Benchmark
public void add() throws Exception {
    map.put(nextIndex, new ContractValue(nextIndex));
    nextIndex++;
}

Example 3 with ContractValue

use of com.hedera.services.state.virtual.ContractValue in project hedera-services by hashgraph.

the class EclipseMapBench method multiThreadedReadPut10kEach.

@Benchmark
public void multiThreadedReadPut10kEach(Blackhole blackHole) {
    IntStream.range(0, 5).parallel().forEach(jobID -> {
        ThreadLocalRandom random = ThreadLocalRandom.current();
        for (int i = 0; i < 2000; i++) {
            blackHole.consume(map.get((long) random.nextInt(numEntities)));
            map.put((long) random.nextInt(numEntities), new ContractValue(random.nextLong()));
        }
    });
}

Example 4 with ContractValue

use of com.hedera.services.state.virtual.ContractValue in project hedera-services by hashgraph.

the class ContractBench method prepare.

@Setup
public void prepare() throws Exception {
    pipeline = new Pipeline<>();
    final long estimatedNumKeyValuePairs = (long) (numContracts * (1 - bigPercent - hugePercent) * ((kbPerContract * 1024L) / ESTIMATED_KEY_VALUE_SIZE)) + (long) (numContracts * bigPercent * ((kbPerBigContract * 1024L) / ESTIMATED_KEY_VALUE_SIZE)) + (long) (numContracts * hugePercent * ((kbPerHugeContract * 1024L) / ESTIMATED_KEY_VALUE_SIZE));
    System.out.println("estimatedNumKeyValuePairs = " + estimatedNumKeyValuePairs);
    VirtualLeafRecordSerializer<ContractKey, ContractValue> virtualLeafRecordSerializer = new VirtualLeafRecordSerializer<>((short) 1, DigestType.SHA_384, (short) 1, DataFileCommon.VARIABLE_DATA_SIZE, new ContractKeySupplier(), (short) 1, ContractValue.SERIALIZED_SIZE, new ContractValueSupplier(), true);
    Path dataSourcePath = getDataSourcePath(dsType);
    boolean dataSourceDirExisted = Files.exists(dataSourcePath);
    virtualMap = createMap(dsType, virtualLeafRecordSerializer, new ContractKeySerializer(), estimatedNumKeyValuePairs, dataSourcePath, preferDiskBasedIndexes);
    txProcessor = new TransactionProcessor<>(preFetchEventHandlers, (Transaction<Data> tx) -> {
        // preFetch logic
        VirtualMap<ContractKey, ContractValue> map = getVirtualMap();
        final Data data = tx.getData();
        data.value1 = map.getForModify(data.key1);
        data.value2 = map.getForModify(data.key2);
    }, (Transaction<Data> tx) -> {
        // handleTransaction logic
        final Data data = tx.getData();
        data.value1.setValue(data.value1.asLong() - data.transferAmount);
        data.value2.setValue(data.value2.asLong() + data.transferAmount);
    });
    // We generate a different number of key/value pairs depending on whether it is
    // a huge contract, big contract, or normal contract
    int numBigContracts = (int) (numContracts * bigPercent);
    System.out.println("numBigContracts = " + numBigContracts);
    int numHugeContracts = (int) (numContracts * hugePercent);
    System.out.println("numHugeContracts = " + numHugeContracts);
    keyValuePairsPerContract = new int[numContracts];
    for (int i = 0; i < numContracts; i++) {
        final int kb;
        if (i > 0 && (i % 100) == 0 && numHugeContracts > 0) {
            kb = kbPerHugeContract;
            numHugeContracts--;
        } else if (i > 0 && (i % 10) == 0 && numBigContracts > 0) {
            kb = kbPerBigContract;
            numBigContracts--;
        } else {
            kb = kbPerContract;
        }
        final var numKeyValuePairs = (kb * 1024L) / ESTIMATED_KEY_VALUE_SIZE;
        keyValuePairsPerContract[i] = (int) numKeyValuePairs;
    }
    if (!dataSourceDirExisted && preFill) {
        long countOfKeyValuePairs = 0;
        long lastCountOfKeyValuePairs = 0;
        for (int i = 0; i < numContracts; i++) {
            if ((countOfKeyValuePairs - lastCountOfKeyValuePairs) > 100_000) {
                lastCountOfKeyValuePairs = countOfKeyValuePairs;
                System.out.printf("Completed: %,d contracts and %,d key/value pairs\n", i, countOfKeyValuePairs);
                virtualMap = pipeline.endRound(virtualMap);
            }
            if (i > 0 && i % 10000 == 0) {
                System.out.println("=============== GC =======================");
                // loading is really intense so give GC a chance to catch up
                System.gc();
                Thread.sleep(1000);
            }
            final int numKeyValuePairs = keyValuePairsPerContract[i];
            for (int j = 0; j < numKeyValuePairs; j++) {
                final var key = asContractKey(i, j);
                final var value = new ContractValue(j);
                try {
                    virtualMap.put(key, value);
                } catch (Exception e) {
                    e.printStackTrace();
                    System.err.println(i + ":" + j);
                    throw e;
                }
            }
            countOfKeyValuePairs += numKeyValuePairs;
        }
        // During setup, we perform the full hashing and release the old copy. This way,
        // during the tests, we don't have an initial slow hash.
        System.out.printf("Completed: %,d contracts and %,d key/value pairs\n", numContracts, countOfKeyValuePairs);
        virtualMap = pipeline.endRound(virtualMap);
    } else {
        System.out.println("NOT PRE_FILLING AS LOADED FROM FILES OR TURNED OFF WITH FLAG!");
    }
    printDataStoreSize();
    // create a snapshot every 15min
    DateFormat df = new SimpleDateFormat("yyyy-MM-dd--HH-mm");
    ScheduledExecutorService snapshotting = Executors.newScheduledThreadPool(1, runnable -> new Thread(runnable, "Snapshot"));
    snapshotting.scheduleWithFixedDelay(() -> {
        final Path snapshotDir = Path.of("jasperdb_snapshot_" + df.format(new Date()));
        System.out.println("************ STARTING SNAPSHOT [" + snapshotDir.toAbsolutePath() + "] ***********");
        long START = System.currentTimeMillis();
        try {
            virtualMap.getDataSource().snapshot(snapshotDir);
        } catch (IOException e) {
            e.printStackTrace();
        }
        double tookSeconds = (System.currentTimeMillis() - START) * Units.MILLISECONDS_TO_SECONDS;
        System.out.printf("************ SNAPSHOT FINISHED took %,3f seconds [%s] ***********\n", tookSeconds, snapshotDir.toAbsolutePath());
    }, 0, 5, TimeUnit.MINUTES);
}

Example 5 with ContractValue

use of com.hedera.services.state.virtual.ContractValue in project hedera-services by hashgraph.

the class UpdateBench method updateLeavesAndInternals.

@Benchmark
public void updateLeavesAndInternals(DatabaseMergingState databaseState) throws IOException {
    var internalRecordStream = IntStream.range(0, NUMBER_OF_INTERNALS_CHANGED_PER_FLUSH).mapToObj(i -> new VirtualInternalRecord(randomInternalPaths[i], hash((int) randomInternalPaths[i])));
    var leafRecordStream = IntStream.range(0, NUMBER_OF_LEAVES_CHANGED_PER_FLUSH).mapToObj(i -> {
        final long path = randomLeafPaths[i];
        return new VirtualLeafRecord<>(path, hash((int) path), new ContractKey(path, path), new ContractValue(path));
    });
    databaseState.dataSource.saveRecords(databaseState.dataSource.getFirstLeafPath(), databaseState.dataSource.getLastLeafPath(), internalRecordStream, leafRecordStream, Stream.empty());
}