| Directory: | cvmfs/ |
|---|---|
| File: | cvmfs/ingestion/task_chunk.cc |
| Date: | 2026-04-05 02:35:23 |
| Exec | Total | Coverage | |
|---|---|---|---|
| Lines: | 89 | 91 | 97.8% |
| Branches: | 91 | 149 | 61.1% |
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | /** | ||
| 2 | * This file is part of the CernVM File System. | ||
| 3 | */ | ||
| 4 | |||
| 5 | #include "ingestion/task_chunk.h" | ||
| 6 | |||
| 7 | #include <unistd.h> | ||
| 8 | |||
| 9 | #include <cassert> | ||
| 10 | |||
| 11 | #include "util/exception.h" | ||
| 12 | |||
| 13 | /** | ||
| 14 | * The tags from the read stage in the pipeline and the tags given in the | ||
| 15 | * chunking stage can safely overlap. Nevertheless, debugging might be easier | ||
| 16 | * if they don't. So let's start with a high number. | ||
| 17 | */ | ||
| 18 | atomic_int64 TaskChunk::tag_seq_ = 2 << 28; | ||
| 19 | |||
| 20 | /** | ||
| 21 | * Consumes the stream of input blocks and produces new output blocks according | ||
| 22 | * to cut marks. The output blocks correspond to chunks. | ||
| 23 | */ | ||
| 24 | 2229668 | void TaskChunk::Process(BlockItem *input_block) { | |
| 25 | 2229668 | FileItem *file_item = input_block->file_item(); | |
| 26 | 2229304 | const int64_t input_tag = input_block->tag(); | |
| 27 |
3/4✓ Branch 0 taken 2231544 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 2230092 times.
✓ Branch 3 taken 1452 times.
|
2231416 | assert((file_item != NULL) && (input_tag >= 0)); |
| 28 | |||
| 29 | 2230092 | ChunkInfo chunk_info; | |
| 30 | // Do we see blocks of the file for the first time? | ||
| 31 |
3/4✓ Branch 1 taken 2236412 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 999052 times.
✓ Branch 4 taken 1237360 times.
|
2229904 | if (!tag_map_.Lookup(input_tag, &chunk_info)) { |
| 32 | // We may have only regular chunks, only a bulk chunk, or both. We may | ||
| 33 | // end up in a situation where we produced only a single non-bulk chunk. | ||
| 34 | // This needs to be fixed up later in the pipeline by the write task. | ||
| 35 |
2/2✓ Branch 1 taken 56 times.
✓ Branch 2 taken 998788 times.
|
999052 | if (file_item->may_have_chunks()) { |
| 36 |
2/4✓ Branch 1 taken 56 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 56 times.
✗ Branch 5 not taken.
|
56 | chunk_info.next_chunk = new ChunkItem(file_item, 0); |
| 37 | 56 | chunk_info.output_tag_chunk = atomic_xadd64(&tag_seq_, 1); | |
| 38 |
2/2✓ Branch 1 taken 43 times.
✓ Branch 2 taken 13 times.
|
56 | if (file_item->has_legacy_bulk_chunk()) { |
| 39 |
2/4✓ Branch 1 taken 43 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 43 times.
✗ Branch 5 not taken.
|
43 | chunk_info.bulk_chunk = new ChunkItem(file_item, 0); |
| 40 | } | ||
| 41 | } else { | ||
| 42 |
2/4✓ Branch 1 taken 999376 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 998588 times.
✗ Branch 5 not taken.
|
998788 | chunk_info.bulk_chunk = new ChunkItem(file_item, 0); |
| 43 | } | ||
| 44 | |||
| 45 |
1/2✓ Branch 0 taken 998647 times.
✗ Branch 1 not taken.
|
998644 | if (chunk_info.bulk_chunk != NULL) { |
| 46 |
1/2✓ Branch 1 taken 997775 times.
✗ Branch 2 not taken.
|
998647 | chunk_info.bulk_chunk->MakeBulkChunk(); |
| 47 | 997775 | chunk_info.bulk_chunk->set_size(file_item->size()); | |
| 48 | 997399 | chunk_info.output_tag_bulk = atomic_xadd64(&tag_seq_, 1); | |
| 49 | } | ||
| 50 |
1/2✓ Branch 1 taken 997832 times.
✗ Branch 2 not taken.
|
1000128 | tag_map_.Insert(input_tag, chunk_info); |
| 51 | } | ||
| 52 |
3/4✓ Branch 0 taken 31085 times.
✓ Branch 1 taken 2204107 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 31085 times.
|
2235192 | assert((chunk_info.bulk_chunk != NULL) || (chunk_info.next_chunk != NULL)); |
| 53 | |||
| 54 | 2235192 | BlockItem *output_block_bulk = NULL; | |
| 55 |
2/2✓ Branch 0 taken 2207511 times.
✓ Branch 1 taken 27681 times.
|
2235192 | if (chunk_info.bulk_chunk != NULL) { |
| 56 |
2/4✓ Branch 1 taken 2207783 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 2203071 times.
✗ Branch 5 not taken.
|
2207511 | output_block_bulk = new BlockItem(chunk_info.output_tag_bulk, allocator_); |
| 57 |
1/2✓ Branch 1 taken 2202347 times.
✗ Branch 2 not taken.
|
2203071 | output_block_bulk->SetFileItem(file_item); |
| 58 |
1/2✓ Branch 1 taken 2203363 times.
✗ Branch 2 not taken.
|
2202347 | output_block_bulk->SetChunkItem(chunk_info.bulk_chunk); |
| 59 | } | ||
| 60 | |||
| 61 | 2231044 | ChunkDetector *chunk_detector = file_item->chunk_detector(); | |
| 62 |
2/3✓ Branch 1 taken 996628 times.
✓ Branch 2 taken 1241332 times.
✗ Branch 3 not taken.
|
2234044 | switch (input_block->type()) { |
| 63 | 996628 | case BlockItem::kBlockStop: | |
| 64 | // End of the file, no more new chunks | ||
| 65 | 996628 | file_item->set_is_fully_chunked(); | |
| 66 |
2/2✓ Branch 0 taken 999203 times.
✓ Branch 1 taken 1 times.
|
999204 | if (output_block_bulk) |
| 67 |
1/2✓ Branch 1 taken 996887 times.
✗ Branch 2 not taken.
|
999203 | output_block_bulk->MakeStop(); |
| 68 |
2/2✓ Branch 0 taken 56 times.
✓ Branch 1 taken 996832 times.
|
996888 | if (chunk_info.next_chunk != NULL) { |
| 69 |
1/2✗ Branch 2 not taken.
✓ Branch 3 taken 56 times.
|
56 | assert(file_item->size() >= chunk_info.next_chunk->offset()); |
| 70 | 112 | chunk_info.next_chunk->set_size(file_item->size() | |
| 71 | 56 | - chunk_info.next_chunk->offset()); | |
| 72 | BlockItem *block_stop = new BlockItem(chunk_info.output_tag_chunk, | ||
| 73 |
2/4✓ Branch 1 taken 56 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 56 times.
✗ Branch 5 not taken.
|
56 | allocator_); |
| 74 |
1/2✓ Branch 1 taken 56 times.
✗ Branch 2 not taken.
|
56 | block_stop->SetFileItem(file_item); |
| 75 |
1/2✓ Branch 1 taken 56 times.
✗ Branch 2 not taken.
|
56 | block_stop->SetChunkItem(chunk_info.next_chunk); |
| 76 |
1/2✓ Branch 1 taken 56 times.
✗ Branch 2 not taken.
|
56 | block_stop->MakeStop(); |
| 77 |
1/2✓ Branch 1 taken 56 times.
✗ Branch 2 not taken.
|
56 | tubes_out_->Dispatch(block_stop); |
| 78 | } | ||
| 79 |
1/2✓ Branch 1 taken 996444 times.
✗ Branch 2 not taken.
|
996888 | tag_map_.Erase(input_tag); |
| 80 | 996444 | break; | |
| 81 | |||
| 82 | 1241332 | case BlockItem::kBlockData: | |
| 83 |
2/2✓ Branch 0 taken 1210200 times.
✓ Branch 1 taken 31132 times.
|
1241332 | if (output_block_bulk) { |
| 84 |
2/2✓ Branch 0 taken 108460 times.
✓ Branch 1 taken 1101740 times.
|
1210200 | if (chunk_info.next_chunk != NULL) { |
| 85 | // Reserve zero-copy for the regular chunk | ||
| 86 |
1/2✓ Branch 3 taken 108532 times.
✗ Branch 4 not taken.
|
108460 | output_block_bulk->MakeDataCopy(input_block->data(), |
| 87 | input_block->size()); | ||
| 88 | } else { | ||
| 89 | // There is only the bulk chunk, zero copy | ||
| 90 |
1/2✓ Branch 1 taken 1101596 times.
✗ Branch 2 not taken.
|
1101740 | output_block_bulk->MakeDataMove(input_block); |
| 91 | } | ||
| 92 | } | ||
| 93 | |||
| 94 |
2/2✓ Branch 0 taken 139608 times.
✓ Branch 1 taken 1101652 times.
|
1241260 | if (chunk_info.next_chunk != NULL) { |
| 95 | 139608 | unsigned offset_in_block = 0; | |
| 96 | 139608 | uint64_t cut_mark = 0; | |
| 97 |
3/4✓ Branch 1 taken 156195 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 16595 times.
✓ Branch 4 taken 139600 times.
|
156203 | while ((cut_mark = chunk_detector->FindNextCutMark(input_block)) != 0) { |
| 98 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 16595 times.
|
16595 | assert(cut_mark >= chunk_info.offset + offset_in_block); |
| 99 | 16595 | const uint64_t cut_mark_in_block = cut_mark - chunk_info.offset; | |
| 100 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 16595 times.
|
16595 | assert(cut_mark_in_block >= offset_in_block); |
| 101 |
1/2✗ Branch 1 not taken.
✓ Branch 2 taken 16595 times.
|
16595 | assert(cut_mark_in_block <= input_block->size()); |
| 102 | 16595 | const unsigned tail_size = cut_mark_in_block - offset_in_block; | |
| 103 | |||
| 104 |
1/2✓ Branch 0 taken 16595 times.
✗ Branch 1 not taken.
|
16595 | if (tail_size > 0) { |
| 105 | BlockItem *block_tail = new BlockItem(chunk_info.output_tag_chunk, | ||
| 106 |
2/4✓ Branch 1 taken 16595 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 16595 times.
✗ Branch 5 not taken.
|
16595 | allocator_); |
| 107 |
1/2✓ Branch 1 taken 16595 times.
✗ Branch 2 not taken.
|
16595 | block_tail->SetFileItem(file_item); |
| 108 |
1/2✓ Branch 1 taken 16595 times.
✗ Branch 2 not taken.
|
16595 | block_tail->SetChunkItem(chunk_info.next_chunk); |
| 109 |
1/2✓ Branch 2 taken 16595 times.
✗ Branch 3 not taken.
|
16595 | block_tail->MakeDataCopy(input_block->data() + offset_in_block, |
| 110 | tail_size); | ||
| 111 |
1/2✓ Branch 1 taken 16595 times.
✗ Branch 2 not taken.
|
16595 | tubes_out_->Dispatch(block_tail); |
| 112 | } | ||
| 113 | |||
| 114 |
1/2✗ Branch 1 not taken.
✓ Branch 2 taken 16595 times.
|
16595 | assert(cut_mark >= chunk_info.next_chunk->offset()); |
| 115 | // If the cut mark happens to at the end of file, let the final | ||
| 116 | // incoming stop block schedule dispatch of the chunk stop block | ||
| 117 |
2/2✓ Branch 1 taken 16592 times.
✓ Branch 2 taken 3 times.
|
16595 | if (cut_mark < file_item->size()) { |
| 118 | 16592 | chunk_info.next_chunk->set_size(cut_mark | |
| 119 | 16592 | - chunk_info.next_chunk->offset()); | |
| 120 | BlockItem *block_stop = new BlockItem(chunk_info.output_tag_chunk, | ||
| 121 |
2/4✓ Branch 1 taken 16592 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 16592 times.
✗ Branch 5 not taken.
|
16592 | allocator_); |
| 122 |
1/2✓ Branch 1 taken 16592 times.
✗ Branch 2 not taken.
|
16592 | block_stop->SetFileItem(file_item); |
| 123 |
1/2✓ Branch 1 taken 16592 times.
✗ Branch 2 not taken.
|
16592 | block_stop->SetChunkItem(chunk_info.next_chunk); |
| 124 |
1/2✓ Branch 1 taken 16592 times.
✗ Branch 2 not taken.
|
16592 | block_stop->MakeStop(); |
| 125 |
1/2✓ Branch 1 taken 16592 times.
✗ Branch 2 not taken.
|
16592 | tubes_out_->Dispatch(block_stop); |
| 126 | |||
| 127 |
2/4✓ Branch 1 taken 16592 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 16592 times.
✗ Branch 5 not taken.
|
16592 | chunk_info.next_chunk = new ChunkItem(file_item, cut_mark); |
| 128 | 16592 | chunk_info.output_tag_chunk = atomic_xadd64(&tag_seq_, 1); | |
| 129 | } | ||
| 130 | 16595 | offset_in_block = cut_mark_in_block; | |
| 131 | } | ||
| 132 | 139600 | chunk_info.offset += offset_in_block; | |
| 133 | |||
| 134 |
1/2✗ Branch 1 not taken.
✓ Branch 2 taken 139592 times.
|
139600 | assert(input_block->size() >= offset_in_block); |
| 135 | 139592 | const unsigned tail_size = input_block->size() - offset_in_block; | |
| 136 |
2/2✓ Branch 0 taken 139382 times.
✓ Branch 1 taken 214 times.
|
139596 | if (tail_size > 0) { |
| 137 | BlockItem *block_tail = new BlockItem(chunk_info.output_tag_chunk, | ||
| 138 |
2/4✓ Branch 1 taken 139342 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 139330 times.
✗ Branch 5 not taken.
|
139382 | allocator_); |
| 139 |
1/2✓ Branch 1 taken 139314 times.
✗ Branch 2 not taken.
|
139330 | block_tail->SetFileItem(file_item); |
| 140 |
1/2✓ Branch 1 taken 139318 times.
✗ Branch 2 not taken.
|
139314 | block_tail->SetChunkItem(chunk_info.next_chunk); |
| 141 |
1/2✓ Branch 2 taken 139390 times.
✗ Branch 3 not taken.
|
139318 | block_tail->MakeDataCopy(input_block->data() + offset_in_block, |
| 142 | tail_size); | ||
| 143 |
1/2✓ Branch 1 taken 139350 times.
✗ Branch 2 not taken.
|
139390 | tubes_out_->Dispatch(block_tail); |
| 144 | 139350 | chunk_info.offset += tail_size; | |
| 145 | } | ||
| 146 | |||
| 147 | // Delete data from incoming block | ||
| 148 |
1/2✓ Branch 1 taken 139596 times.
✗ Branch 2 not taken.
|
139564 | input_block->Reset(); |
| 149 | } | ||
| 150 | |||
| 151 |
1/2✓ Branch 1 taken 1243620 times.
✗ Branch 2 not taken.
|
1241248 | tag_map_.Insert(input_tag, chunk_info); |
| 152 | 1243620 | break; | |
| 153 | |||
| 154 | ✗ | default: | |
| 155 | ✗ | PANIC(NULL); | |
| 156 | } | ||
| 157 | |||
| 158 |
2/2✓ Branch 0 taken 2237248 times.
✓ Branch 1 taken 2816 times.
|
2240064 | delete input_block; |
| 159 |
2/2✓ Branch 0 taken 2211247 times.
✓ Branch 1 taken 31085 times.
|
2242332 | if (output_block_bulk) |
| 160 |
1/2✓ Branch 1 taken 2202719 times.
✗ Branch 2 not taken.
|
2211247 | tubes_out_->Dispatch(output_block_bulk); |
| 161 | 2233804 | } | |
| 162 |