37 std::memcpy(&
v,
data +
i *
sizeof(T),
sizeof(T));
39 std::memcpy(
data +
i *
sizeof(T), &
v,
sizeof(T));
46 if constexpr (std::endian::native == std::endian::big) {
97void BranchDecoder::checkBaskets(
BranchInfo const& branch)
const
100 for (
auto&
b : branch.baskets) {
101 if (
b.firstEntry != next ||
b.nEntries < 0) {
102 throw CorruptData(mUrl,
b.seek,
"baskets of branch " + branch.
name +
" do not cover its entries contiguously");
112void BranchDecoder::forEachBasket(BranchInfo
const& branch,
bool parallel, F&& fn)
114 checkBaskets(branch);
115 auto task = [
this, &branch, &fn](
size_t i) {
116 auto const&
ref = branch.baskets[
i];
118 std::vector<uint8_t> storage;
121 values.border =
ref.embeddedPayload.size();
126 throw CorruptData(mUrl,
ref.seek,
"basket of branch " + branch.name +
" past the end of the file");
128 storage.resize(
ref.nbytes);
134 auto nbytes =
header.nbytes;
135 auto objlen =
header.objlen;
136 auto keylen =
header.keylen;
138 if (nbytes !=
ref.nbytes || keylen > nbytes ||
header.nevbuf !=
ref.nEntries || last < keylen || (
uint32_t)(last - keylen) > objlen) {
139 c.fail(
"basket header of branch " + branch.name +
" does not match its TBranch");
142 auto payload =
bytes.subspan(keylen);
143 if (objlen != nbytes - keylen) {
144 values.compressed.emplace(payload, objlen, mUrl,
ref.seek + keylen);
152 auto n = branch.baskets.size();
155 for (
size_t i = 0;
i <
n; ++
i) {
161 std::atomic<size_t> next = 0;
162 std::exception_ptr
error;
163 std::mutex errorMutex;
164 std::vector<std::thread> workers;
165 for (
int t = 0;
t < threads; ++
t) {
166 workers.emplace_back([&] {
167 for (
size_t i; (
i = next.fetch_add(1)) <
n;) {
171 std::lock_guard lock{errorMutex};
173 error = std::current_exception();
180 for (
auto&
w : workers) {
184 std::rethrow_exception(
error);
190void checkNeeded(std::string
const&
url, BranchInfo
const& branch, BasketRef
const&
ref,
size_t needed,
size_t border)
201 size_t rowBytes = elementSize * branch.
fixedLen;
202 if (nbytes != branch.
entries * rowBytes) {
207 size_t needed =
ref.nEntries * rowBytes;
208 checkNeeded(mUrl, branch,
ref, needed,
values.border);
209 auto* out =
dst +
ref.firstEntry * rowBytes;
210 values.readAll(out, needed);
221 if (nbytes != (
size_t)
offsets.back() * elementSize) {
231 size_t needed = (size_t)(
end - begin) * elementSize;
232 checkNeeded(mUrl, branch,
ref, needed,
values.border);
233 auto* out =
dst + (size_t)begin * elementSize;
234 values.readAll(out, needed);
242 if (nbytes * 8 < total) {
245 std::memset(bitmap, 0, nbytes);
252 size_t remaining = (size_t)
ref.nEntries * branch.
fixedLen;
253 checkNeeded(mUrl, branch,
ref, remaining,
values.border);
254 while (remaining > 0) {
255 auto k = std::min(remaining, window.size());
256 values.read(window.data(), k);
257 for (
size_t j = 0;
j < k; ++
j, ++
index) {
271 checkBaskets(sizeBranch);
280 if (total > INT32_MAX) {
std::vector< std::string > header
configStandalone Reconstruction rec_tpc multiplier for the combined cluster track error during track following area in cm for the search of for z only used if decrease removal by when above this local occupancy rowx Shift of TPC revert cluster flag edge bit distance to edge exceeds this ZOffset for secondary multiple of radius max P of electron K BB bands crossing max P of electron p BB bands crossing max P of electron d BB bands crossing max P of electron t BB bands crossing min accepted dEdxMaxTPC of the track Additive extra cluster error for Y2 if edge flag set Additive extra cluster error for Y2 if single set Additive extra cluster error for Y2 if or single set Additive extra cluster error for Z2 if or single set Extra errors to add to track when crossing depending on addErrorsCECrossing Inner portion of y range in sector that is not used in searching for extrapolated track candidates factor2YS for track merging factor2K for track merging Margin in cm of Y position when rejecting edge clusters based on uncorrected track Y Max fraction of shared clusters for tracklet Except pad from cluster finding if total number of charges in a fragment is above this Except pad from cluster finding if number of consecutive charges in a fragment is above this Threshold where a timebin is considered disabling the noisy pad check for that pad Treat signal above this minimum as saturated Smoothing factor for the exponential Highly Ionising Particle tail filter Number of timebins to use for the averaging Add additional custom track errors when crossing relative as fraction of Do N fit passes in final fit of< 0:reject at max -n hits") AddOptionRTC(rejectIFCLowRadiusCluster, uint8_t, 1, "", 0, "Reject clusters that get the IFC mask error during refit") AddOptionRTC(dEdxTruncLow, uint8_t, 2, "", 0, "Low truncation threshold, fraction of 128") AddOptionRTC(dEdxTruncHigh, uint8_t, 77, "", 0, "High truncation threshold, fraction of 128") AddOptionRTC(extrapolationTracking, int8_t, 1, "", 0, "Enable Extrapolation Tracking(prolong tracks to adjacent sectors to find short segments)") AddOptionRTC(disableRefitAttachment, uint8_t, 0, "", 0, "Bitmask to disable certain attachment steps during refit(1:attachment, 2:propagation, 4:loop following, 8:mirroring)") AddOptionRTC(rejectionStrategy, uint8_t, o2::gpu::GPUSettings::RejectionStrategyA, "", 0, "Enable rejection of TPC clusters for compression(0=no, 1=strategy A, 2=strategy B)") AddOptionRTC(mergeLoopersAfterburner, uint8_t, 1, "", 0, "Run afterburner for additional looper merging") AddOptionRTC(compressionTypeMask, uint8_t, o2::gpu::GPUSettings::CompressionFull, "", 0, "TPC Compression mode bits(1=truncate charge/width LSB, 2=differences, 4=track-model)") AddOptionRTC(compressionSortOrder, uint8_t, o2::gpu::GPUSettings::SortTime, "", 0, "Sort order of TPC compression(0=time, 1=pad, 2=Z-time-pad, 3=Z-pad-time, 4=no sorting(use incoming order))") AddOptionRTC(sigBitsCharge, uint8_t, 4, "", 0, "Number of significant bits for TPC cluster charge in compression mode 1") AddOptionRTC(sigBitsWidth, uint8_t, 3, "", 0, "Number of significant bits for TPC cluster width in compression mode 1") AddOptionRTC(dropLoopers, uint8_t, 0, "", 0, "Drop looping tracks starting from second loop") AddOptionRTC(mergerInterpolateErrors, uint8_t, 1, "", 0, "Use interpolation instead of extrapolation for chi2 based cluster rejection") AddOptionRTC(mergerInterpolateRejectAlsoOnCurrentPosition, uint8_t, 1, "", 0, "When using mergerInterpolateErrors, reject based on chi2 twice computed with interpolated and current track position starting from NDF > mergerNonInterpolateRejectMinNDF Merge tracks accross the central electrode Enable PID response Add sub threshold clusters in TPC dEdx computation OR mask of TPC flags that will reject the cluster in alternative dEdx Reject edge clusters based on uncorrected track Y during track fit Increase decrease removal by when on this number of pads from the edge h configStandalone Reconstruction rec_trd Max chi2 for TRD tracklets to be matched to a track Chi2 cut for strict matching mode Number of sigmas for ITS TPC track time error estimate Addition to search road around track prolongation along Y in cm Optimal tracklet rphi resolution in maximum chi2 per attached tracklet for TRD tracks take into account the full likelihood of the slope including exponential tails Tracks with less attached tracklets are discarded after the tracking Post trigger Pile up integration time in BCs fits all iterations but the last one in projections Use material lookup table for TPC refit Apply workarounds to avoid cyclic merge should not be needed tpc dyn configStandalone Processing proc_rtc Replace constant variables static by constexpr expressions Compile RTC in deterministic with NO_FAST_MATH flags and GPUCA_DETERMINISTIC_MODE define Use RTC to optimize GPU code h configStandalone Processing proc_rtctech Use a file lock to serialize access to the cache folder int32_t
char error[CURL_ERROR_SIZE]
void decodeVLAValues(BranchInfo const &branch, std::span< const int32_t > offsets, uint8_t *dst, size_t nbytes)
std::vector< int32_t > decodeOffsets(BranchInfo const &sizeBranch)
Decodes a <col>_size branch into entries + 1 int32 offsets.
void decodeValues(BranchInfo const &branch, uint8_t *dst, size_t nbytes)
BranchDecoder(ByteSource &source, Options const &options)
static constexpr size_t kBooleanWindow
Size of the boolean window, the only decode-side scratch memory.
void decodeBooleans(BranchInfo const &branch, uint8_t *bitmap, size_t nbytes)
virtual uint64_t size() const =0
virtual void readInto(uint64_t off, size_t len, void *dst)=0
Throws IoError, or CorruptData when the range is past the end of the file.
virtual std::span< const uint8_t > tryMap(uint64_t off, size_t len)
A view of the bytes without copying them, if the backend can provide it.
GLint GLint GLsizei GLint border
GLuint GLsizei const GLuint const GLintptr * offsets
GLboolean GLboolean GLboolean b
GLsizei GLsizei GLchar * source
GLenum GLsizei GLsizei GLint * values
GLubyte GLubyte GLubyte GLubyte w
BasketHeader readBasketHeader(Cursor &c)
size_t leafElementSize(char leafClass)
Size in bytes of one value of a leaf class on disk.
void byteswapInPlace(uint8_t *data, size_t count, size_t typeSize)
Byteswaps count big-endian values of typeSize bytes in place.
WorkflowSpec parallel(DataProcessorSpec original, size_t maxIndex, std::function< void(DataProcessorSpec &, size_t id)> amendCallback)
std::string to_string(gsl::span< T, Size > span)
void readAll(uint8_t *dst, size_t n)
The first n value bytes as the only read: lets zstd decode in place.
void read(uint8_t *dst, size_t n)
std::span< const uint8_t > plain
std::optional< PayloadDecompressor > compressed
std::vector< BasketRef > baskets