Home
last modified time | relevance | path

Searched refs:minBlock (Results 1 – 24 of 24) sorted by relevance

/dports/emulators/ppsspp-qt5/ppsspp-1.12.3/Core/FileSystems/
H A DBlockDevices.h37 virtual bool ReadBlocks(u32 minBlock, int count, u8 *outPtr) {
39 if (!ReadBlock(minBlock + b, outPtr)) {
62 bool ReadBlocks(u32 minBlock, int count, u8 *outPtr) override;
86 bool ReadBlocks(u32 minBlock, int count, u8 *outPtr) override;
H A DBlockDevices.cpp99 bool FileBlockDevice::ReadBlocks(u32 minBlock, int count, u8 *outPtr) { in ReadBlocks() argument
100 …if (fileLoader_->ReadAt((u64)minBlock * (u64)GetBlockSize(), 2048, count, outPtr) != (size_t)count… in ReadBlocks()
292 bool CISOFileBlockDevice::ReadBlocks(u32 minBlock, int count, u8 *outPtr) { in ReadBlocks() argument
294 return ReadBlock(minBlock, outPtr); in ReadBlocks()
296 if (minBlock >= numBlocks) { in ReadBlocks()
301 const u32 lastBlock = std::min(minBlock + count, numBlocks) - 1; in ReadBlocks()
302 const u32 missingBlocks = (lastBlock + 1 - minBlock) - count; in ReadBlocks()
303 if (lastBlock < minBlock + count) { in ReadBlocks()
307 const u32 minFrameNumber = minBlock >> blockShift; in ReadBlocks()
323 u32 block = minBlock; in ReadBlocks()
/dports/emulators/ppsspp/ppsspp-1.12.3/Core/FileSystems/
H A DBlockDevices.h37 virtual bool ReadBlocks(u32 minBlock, int count, u8 *outPtr) { in ReadBlocks() argument
39 if (!ReadBlock(minBlock + b, outPtr)) { in ReadBlocks()
62 bool ReadBlocks(u32 minBlock, int count, u8 *outPtr) override;
86 bool ReadBlocks(u32 minBlock, int count, u8 *outPtr) override;
H A DBlockDevices.cpp99 bool FileBlockDevice::ReadBlocks(u32 minBlock, int count, u8 *outPtr) { in ReadBlocks() argument
100 …if (fileLoader_->ReadAt((u64)minBlock * (u64)GetBlockSize(), 2048, count, outPtr) != (size_t)count… in ReadBlocks()
292 bool CISOFileBlockDevice::ReadBlocks(u32 minBlock, int count, u8 *outPtr) { in ReadBlocks() argument
294 return ReadBlock(minBlock, outPtr); in ReadBlocks()
296 if (minBlock >= numBlocks) { in ReadBlocks()
301 const u32 lastBlock = std::min(minBlock + count, numBlocks) - 1; in ReadBlocks()
302 const u32 missingBlocks = (lastBlock + 1 - minBlock) - count; in ReadBlocks()
303 if (lastBlock < minBlock + count) { in ReadBlocks()
307 const u32 minFrameNumber = minBlock >> blockShift; in ReadBlocks()
323 u32 block = minBlock; in ReadBlocks()
/dports/emulators/libretro-ppsspp/ppsspp-1.12.3/Core/FileSystems/
H A DBlockDevices.h37 virtual bool ReadBlocks(u32 minBlock, int count, u8 *outPtr) { in ReadBlocks() argument
39 if (!ReadBlock(minBlock + b, outPtr)) { in ReadBlocks()
62 bool ReadBlocks(u32 minBlock, int count, u8 *outPtr) override;
86 bool ReadBlocks(u32 minBlock, int count, u8 *outPtr) override;
H A DBlockDevices.cpp99 bool FileBlockDevice::ReadBlocks(u32 minBlock, int count, u8 *outPtr) { in ReadBlocks() argument
100 …if (fileLoader_->ReadAt((u64)minBlock * (u64)GetBlockSize(), 2048, count, outPtr) != (size_t)count… in ReadBlocks()
292 bool CISOFileBlockDevice::ReadBlocks(u32 minBlock, int count, u8 *outPtr) { in ReadBlocks() argument
294 return ReadBlock(minBlock, outPtr); in ReadBlocks()
296 if (minBlock >= numBlocks) { in ReadBlocks()
301 const u32 lastBlock = std::min(minBlock + count, numBlocks) - 1; in ReadBlocks()
302 const u32 missingBlocks = (lastBlock + 1 - minBlock) - count; in ReadBlocks()
303 if (lastBlock < minBlock + count) { in ReadBlocks()
307 const u32 minFrameNumber = minBlock >> blockShift; in ReadBlocks()
323 u32 block = minBlock; in ReadBlocks()
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/alloc/trace/lsra/
H A DTraceLinearScanWalker.java439 …private int findOptimalSplitPos(AbstractBlockBase<?> minBlock, AbstractBlockBase<?> maxBlock, int …
440 int fromBlockNr = minBlock.getLinearScanNumber();
495 AbstractBlockBase<?> minBlock = allocator.blockForId(minSplitPos - 1);
503 assert minBlock.getLinearScanNumber() <= maxBlock.getLinearScanNumber() : "invalid order";
504 if (minBlock == maxBlock) {
517 return findOptimalSplitPos(minBlock, maxBlock, maxSplitPos);
820 AbstractBlockBase<?> minBlock = allocator.blockForId(minSpillPos);
823 assert minBlock.getLinearScanNumber() <= maxBlock.getLinearScanNumber() : "invalid order";
824 if (minBlock == maxBlock) {
838 return findOptimalSpillPos(minBlock, maxBlock, maxSpillPos);
[all …]
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/alloc/trace/lsra/
H A DTraceLinearScanWalker.java439 …private int findOptimalSplitPos(AbstractBlockBase<?> minBlock, AbstractBlockBase<?> maxBlock, int …
440 int fromBlockNr = minBlock.getLinearScanNumber();
495 AbstractBlockBase<?> minBlock = allocator.blockForId(minSplitPos - 1);
503 assert minBlock.getLinearScanNumber() <= maxBlock.getLinearScanNumber() : "invalid order";
504 if (minBlock == maxBlock) {
517 return findOptimalSplitPos(minBlock, maxBlock, maxSplitPos);
820 AbstractBlockBase<?> minBlock = allocator.blockForId(minSpillPos);
823 assert minBlock.getLinearScanNumber() <= maxBlock.getLinearScanNumber() : "invalid order";
824 if (minBlock == maxBlock) {
838 return findOptimalSpillPos(minBlock, maxBlock, maxSpillPos);
[all …]
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/alloc/lsra/
H A DLinearScanWalker.java297 …int findOptimalSplitPos(AbstractBlockBase<?> minBlock, AbstractBlockBase<?> maxBlock, int maxSplit…
298 int fromBlockNr = minBlock.getLinearScanNumber();
345 AbstractBlockBase<?> minBlock = allocator.blockForId(minSplitPos - 1);
353 … assert minBlock.getLinearScanNumber() <= maxBlock.getLinearScanNumber() : "invalid order";
354 if (minBlock == maxBlock) {
376 …"moving split pos to optimal block boundary between block B%d and B%d", minBlock.getId(), maxBlock…
383 …al.nextUsageExact(RegisterPriority.LiveAtLoopEnd, allocator.getLastLirInstructionId(minBlock) + 2);
402 …assert loopBlock != minBlock : "loopBlock and minBlock must be different because block boundary is…
405 optimalSplitPos = findOptimalSplitPos(minBlock, loopBlock, maxSpillPos);
421 optimalSplitPos = findOptimalSplitPos(minBlock, maxBlock, maxSplitPos);
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/alloc/lsra/
H A DLinearScanWalker.java297 …int findOptimalSplitPos(AbstractBlockBase<?> minBlock, AbstractBlockBase<?> maxBlock, int maxSplit…
298 int fromBlockNr = minBlock.getLinearScanNumber();
345 AbstractBlockBase<?> minBlock = allocator.blockForId(minSplitPos - 1);
353 … assert minBlock.getLinearScanNumber() <= maxBlock.getLinearScanNumber() : "invalid order";
354 if (minBlock == maxBlock) {
376 …"moving split pos to optimal block boundary between block B%d and B%d", minBlock.getId(), maxBlock…
383 …al.nextUsageExact(RegisterPriority.LiveAtLoopEnd, allocator.getLastLirInstructionId(minBlock) + 2);
402 …assert loopBlock != minBlock : "loopBlock and minBlock must be different because block boundary is…
405 optimalSplitPos = findOptimalSplitPos(minBlock, loopBlock, maxSpillPos);
421 optimalSplitPos = findOptimalSplitPos(minBlock, maxBlock, maxSplitPos);
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/alloc/lsra/
H A DLinearScanWalker.java297 …int findOptimalSplitPos(AbstractBlockBase<?> minBlock, AbstractBlockBase<?> maxBlock, int maxSplit…
298 int fromBlockNr = minBlock.getLinearScanNumber();
345 AbstractBlockBase<?> minBlock = allocator.blockForId(minSplitPos - 1);
353 … assert minBlock.getLinearScanNumber() <= maxBlock.getLinearScanNumber() : "invalid order";
354 if (minBlock == maxBlock) {
376 …"moving split pos to optimal block boundary between block B%d and B%d", minBlock.getId(), maxBlock…
383 …al.nextUsageExact(RegisterPriority.LiveAtLoopEnd, allocator.getLastLirInstructionId(minBlock) + 2);
402 …assert loopBlock != minBlock : "loopBlock and minBlock must be different because block boundary is…
405 optimalSplitPos = findOptimalSplitPos(minBlock, loopBlock, maxSpillPos);
421 optimalSplitPos = findOptimalSplitPos(minBlock, maxBlock, maxSplitPos);
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/alloc/lsra/
H A DLinearScanWalker.java297 …int findOptimalSplitPos(AbstractBlockBase<?> minBlock, AbstractBlockBase<?> maxBlock, int maxSplit…
298 int fromBlockNr = minBlock.getLinearScanNumber();
345 AbstractBlockBase<?> minBlock = allocator.blockForId(minSplitPos - 1);
353 … assert minBlock.getLinearScanNumber() <= maxBlock.getLinearScanNumber() : "invalid order";
354 if (minBlock == maxBlock) {
376 …"moving split pos to optimal block boundary between block B%d and B%d", minBlock.getId(), maxBlock…
383 …al.nextUsageExact(RegisterPriority.LiveAtLoopEnd, allocator.getLastLirInstructionId(minBlock) + 2);
402 …assert loopBlock != minBlock : "loopBlock and minBlock must be different because block boundary is…
405 optimalSplitPos = findOptimalSplitPos(minBlock, loopBlock, maxSpillPos);
421 optimalSplitPos = findOptimalSplitPos(minBlock, maxBlock, maxSplitPos);
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/alloc/lsra/
H A DLinearScanWalker.java297 …int findOptimalSplitPos(AbstractBlockBase<?> minBlock, AbstractBlockBase<?> maxBlock, int maxSplit…
298 int fromBlockNr = minBlock.getLinearScanNumber();
345 AbstractBlockBase<?> minBlock = allocator.blockForId(minSplitPos - 1);
353 … assert minBlock.getLinearScanNumber() <= maxBlock.getLinearScanNumber() : "invalid order";
354 if (minBlock == maxBlock) {
376 …"moving split pos to optimal block boundary between block B%d and B%d", minBlock.getId(), maxBlock…
383 …al.nextUsageExact(RegisterPriority.LiveAtLoopEnd, allocator.getLastLirInstructionId(minBlock) + 2);
402 …assert loopBlock != minBlock : "loopBlock and minBlock must be different because block boundary is…
405 optimalSplitPos = findOptimalSplitPos(minBlock, loopBlock, maxSpillPos);
421 optimalSplitPos = findOptimalSplitPos(minBlock, maxBlock, maxSplitPos);
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/alloc/lsra/
H A DLinearScanWalker.java297 …int findOptimalSplitPos(AbstractBlockBase<?> minBlock, AbstractBlockBase<?> maxBlock, int maxSplit…
298 int fromBlockNr = minBlock.getLinearScanNumber();
345 AbstractBlockBase<?> minBlock = allocator.blockForId(minSplitPos - 1);
353 … assert minBlock.getLinearScanNumber() <= maxBlock.getLinearScanNumber() : "invalid order";
354 if (minBlock == maxBlock) {
376 …"moving split pos to optimal block boundary between block B%d and B%d", minBlock.getId(), maxBlock…
383 …al.nextUsageExact(RegisterPriority.LiveAtLoopEnd, allocator.getLastLirInstructionId(minBlock) + 2);
402 …assert loopBlock != minBlock : "loopBlock and minBlock must be different because block boundary is…
405 optimalSplitPos = findOptimalSplitPos(minBlock, loopBlock, maxSpillPos);
421 optimalSplitPos = findOptimalSplitPos(minBlock, maxBlock, maxSplitPos);
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/alloc/lsra/
H A DLinearScanWalker.java297 …int findOptimalSplitPos(AbstractBlockBase<?> minBlock, AbstractBlockBase<?> maxBlock, int maxSplit…
298 int fromBlockNr = minBlock.getLinearScanNumber();
345 AbstractBlockBase<?> minBlock = allocator.blockForId(minSplitPos - 1);
353 … assert minBlock.getLinearScanNumber() <= maxBlock.getLinearScanNumber() : "invalid order";
354 if (minBlock == maxBlock) {
376 …"moving split pos to optimal block boundary between block B%d and B%d", minBlock.getId(), maxBlock…
383 …al.nextUsageExact(RegisterPriority.LiveAtLoopEnd, allocator.getLastLirInstructionId(minBlock) + 2);
402 …assert loopBlock != minBlock : "loopBlock and minBlock must be different because block boundary is…
405 optimalSplitPos = findOptimalSplitPos(minBlock, loopBlock, maxSpillPos);
421 optimalSplitPos = findOptimalSplitPos(minBlock, maxBlock, maxSplitPos);
/dports/net-p2p/bitmark-recorder/bitmarkd-0.13.3/vendor/github.com/btcsuite/btcd/
H A Drpcwebsocket.go2281 func recoverFromReorg(chain *blockchain.BlockChain, minBlock, maxBlock int32, argument
2284 hashList, err := chain.HeightRange(minBlock, maxBlock)
2347 for minBlock < maxBlock {
2354 if maxLoopBlock-minBlock > wire.MaxInvPerMsg {
2355 maxLoopBlock = minBlock + wire.MaxInvPerMsg
2357 hashList, err := chain.HeightRange(minBlock, maxLoopBlock)
2448 minBlock += int32(i)
2450 chain, minBlock, maxBlock, lastBlockHash,
2510 minBlock += int32(len(hashList))
2568 minBlock, err := chain.BlockHeightByHash(minBlockHash)
[all …]
/dports/net-p2p/bitmark-cli/bitmarkd-0.13.3/vendor/github.com/btcsuite/btcd/
H A Drpcwebsocket.go2281 func recoverFromReorg(chain *blockchain.BlockChain, minBlock, maxBlock int32, argument
2284 hashList, err := chain.HeightRange(minBlock, maxBlock)
2347 for minBlock < maxBlock {
2354 if maxLoopBlock-minBlock > wire.MaxInvPerMsg {
2355 maxLoopBlock = minBlock + wire.MaxInvPerMsg
2357 hashList, err := chain.HeightRange(minBlock, maxLoopBlock)
2448 minBlock += int32(i)
2450 chain, minBlock, maxBlock, lastBlockHash,
2510 minBlock += int32(len(hashList))
2568 minBlock, err := chain.BlockHeightByHash(minBlockHash)
[all …]
/dports/net-p2p/bitmark/bitmarkd-0.13.3/vendor/github.com/btcsuite/btcd/
H A Drpcwebsocket.go2281 func recoverFromReorg(chain *blockchain.BlockChain, minBlock, maxBlock int32, argument
2284 hashList, err := chain.HeightRange(minBlock, maxBlock)
2347 for minBlock < maxBlock {
2354 if maxLoopBlock-minBlock > wire.MaxInvPerMsg {
2355 maxLoopBlock = minBlock + wire.MaxInvPerMsg
2357 hashList, err := chain.HeightRange(minBlock, maxLoopBlock)
2448 minBlock += int32(i)
2450 chain, minBlock, maxBlock, lastBlockHash,
2510 minBlock += int32(len(hashList))
2568 minBlock, err := chain.BlockHeightByHash(minBlockHash)
[all …]
/dports/net-p2p/bitmark-daemon/bitmarkd-0.13.3/vendor/github.com/btcsuite/btcd/
H A Drpcwebsocket.go2281 func recoverFromReorg(chain *blockchain.BlockChain, minBlock, maxBlock int32, argument
2284 hashList, err := chain.HeightRange(minBlock, maxBlock)
2347 for minBlock < maxBlock {
2354 if maxLoopBlock-minBlock > wire.MaxInvPerMsg {
2355 maxLoopBlock = minBlock + wire.MaxInvPerMsg
2357 hashList, err := chain.HeightRange(minBlock, maxLoopBlock)
2448 minBlock += int32(i)
2450 chain, minBlock, maxBlock, lastBlockHash,
2510 minBlock += int32(len(hashList))
2568 minBlock, err := chain.BlockHeightByHash(minBlockHash)
[all …]
/dports/net-im/dendrite/dendrite-0.5.1/vendor/github.com/btcsuite/btcd/
H A Drpcwebsocket.go2281 func recoverFromReorg(chain *blockchain.BlockChain, minBlock, maxBlock int32, argument
2284 hashList, err := chain.HeightRange(minBlock, maxBlock)
2347 for minBlock < maxBlock {
2354 if maxLoopBlock-minBlock > wire.MaxInvPerMsg {
2355 maxLoopBlock = minBlock + wire.MaxInvPerMsg
2357 hashList, err := chain.HeightRange(minBlock, maxLoopBlock)
2448 minBlock += int32(i)
2450 chain, minBlock, maxBlock, lastBlockHash,
2510 minBlock += int32(len(hashList))
2568 minBlock, err := chain.BlockHeightByHash(minBlockHash)
[all …]
/dports/net-p2p/go-ethereum/go-ethereum-1.10.14/vendor/github.com/btcsuite/btcd/
H A Drpcwebsocket.go2281 func recoverFromReorg(chain *blockchain.BlockChain, minBlock, maxBlock int32, argument
2284 hashList, err := chain.HeightRange(minBlock, maxBlock)
2347 for minBlock < maxBlock {
2354 if maxLoopBlock-minBlock > wire.MaxInvPerMsg {
2355 maxLoopBlock = minBlock + wire.MaxInvPerMsg
2357 hashList, err := chain.HeightRange(minBlock, maxLoopBlock)
2448 minBlock += int32(i)
2450 chain, minBlock, maxBlock, lastBlockHash,
2510 minBlock += int32(len(hashList))
2568 minBlock, err := chain.BlockHeightByHash(minBlockHash)
[all …]
/dports/audio/faust/faust-2.37.3/tools/physicalModeling/mesh2faust/vega/libraries/wildMagic/rational/
H A Drational.h349 int minBlock = (block0 < block1 ? block0 : block1); in EliminatePowersOfTwo() local
353 int shift = 16*minBlock + minBit; in EliminatePowersOfTwo()
/dports/audio/faust/faust-2.37.3/tools/physicalModeling/mesh2faust/vega/libraries/include/
H A Drational.h349 int minBlock = (block0 < block1 ? block0 : block1); in EliminatePowersOfTwo() local
353 int shift = 16*minBlock + minBit; in EliminatePowersOfTwo()
/dports/graphics/blender/blender-2.91.0/extern/mantaflow/preprocessed/
H A Dmesh.cpp952 Vec3i minBlock = Vec3i( in SDFKernel() local
957 for (int i = minBlock.x; i <= maxBlock.x; i++) in SDFKernel()
958 for (int j = minBlock.y; j <= maxBlock.y; j++) in SDFKernel()
959 for (int k = minBlock.z; k <= maxBlock.z; k++) { in SDFKernel()