GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/malloc_heap.cc
Date: 2025-07-06 02:35:01
Exec Total Coverage
Lines: 69 69 100.0%
Branches: 22 32 68.8%
Line Branch Exec Source
1 /**
2 * This file is part of the CernVM File System.
3 */
4
5
6 #include "malloc_heap.h"
7
8 #include <cassert>
9 #include <cstring>
10 #include <new>
11
12 #include "util/smalloc.h"
13
14 using namespace std; // NOLINT
15
16 5097321 void *MallocHeap::Allocate(uint64_t size, void *header, unsigned header_size) {
17
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 5097321 times.
 5097321 assert(size > 0);
18
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 5097321 times.
 5097321 assert(header_size <= size);
19 5097321 const uint64_t rounded_size = RoundUp8(size);
20 5097321 const int64_t real_size = rounded_size + sizeof(Tag);
21
2/2
✓ Branch 0 taken 196 times.
✓ Branch 1 taken 5097125 times.
 5097321 if (gauge_ + real_size > capacity_)
22 196 return NULL;
23
24 5097125 unsigned char *new_block = heap_ + gauge_;
25 5097125 new (new_block) Tag(rounded_size);
26 5097125 new_block += sizeof(Tag);
27 5097125 memcpy(new_block, header, header_size);
28 5097125 gauge_ += real_size;
29 5097125 stored_ += rounded_size;
30 5097125 num_blocks_++;
31 5097125 return new_block;
32 }
33
34
35 289 void MallocHeap::Compact() {
36
2/2
✓ Branch 0 taken 48 times.
✓ Branch 1 taken 241 times.
 289 if (gauge_ == 0)
37 48 return;
38
39 // Not really a tag, just the top memory address
40 241 Tag *heap_top = reinterpret_cast<Tag *>(heap_ + gauge_);
41 241 Tag *current_tag = reinterpret_cast<Tag *>(heap_);
42 241 Tag *next_tag = current_tag->JumpToNext();
43 // Move a sliding window of two blocks over the heap and compact where
44 // possible
45
2/2
✓ Branch 0 taken 7642367 times.
✓ Branch 1 taken 241 times.
 7642608 while (next_tag < heap_top) {
46
2/2
✓ Branch 1 taken 5046463 times.
✓ Branch 2 taken 2595904 times.
 7642367 if (current_tag->IsFree()) {
47
2/2
✓ Branch 1 taken 2498559 times.
✓ Branch 2 taken 2547904 times.
 5046463 if (next_tag->IsFree()) {
48 // Adjacent free blocks, merge and try again
49 2498559 current_tag->size -= sizeof(Tag) + next_tag->GetSize();
50 2498559 next_tag = next_tag->JumpToNext();
51 } else {
52 // Free block followed by a reserved block, move memory and create a
53 // new free tag at the end of the moved block
54 2547904 const int64_t free_space = current_tag->size;
55 2547904 current_tag->size = next_tag->size;
56 2547904 memmove(current_tag->GetBlock(), next_tag->GetBlock(),
57 next_tag->GetSize());
58
1/2
✓ Branch 3 taken 2547904 times.
✗ Branch 4 not taken.
 2547904 (*callback_ptr_)(BlockPtr(current_tag->GetBlock()));
59 2547904 next_tag = current_tag->JumpToNext();
60 2547904 next_tag->size = free_space;
61 }
62 } else {
63 // Current block allocated, move on
64 2595904 current_tag = next_tag;
65 2595904 next_tag = next_tag->JumpToNext();
66 }
67 }
68
69 241 gauge_ = (reinterpret_cast<unsigned char *>(current_tag) - heap_);
70
2/2
✓ Branch 1 taken 48 times.
✓ Branch 2 taken 193 times.
 241 if (!current_tag->IsFree())
71 48 gauge_ += sizeof(Tag) + current_tag->GetSize();
72 }
73
74
75 98 void *MallocHeap::Expand(void *block, uint64_t new_size) {
76 98 const uint64_t old_size = GetSize(block);
77
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 98 times.
 98 assert(old_size <= new_size);
78 98 void *new_block = Allocate(new_size, block, old_size);
79
1/2
✓ Branch 0 taken 98 times.
✗ Branch 1 not taken.
 98 if (new_block != NULL)
80 98 MarkFree(block);
81 98 return new_block;
82 }
83
84
85 98592 bool MallocHeap::HasSpaceFor(uint64_t nbytes) {
86 98592 return RoundUp8(gauge_ + nbytes + sizeof(Tag)) <= capacity_;
87 }
88
89
90 2498850 void MallocHeap::MarkFree(void *block) {
91 2498850 Tag *tag = reinterpret_cast<Tag *>(block) - 1;
92
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 2498850 times.
 2498850 assert(tag->size > 0);
93 2498850 tag->size = -(tag->size);
94 2498850 stored_ -= tag->GetSize();
95 2498850 num_blocks_--;
96 // TODO(jblomer): if MarkFree() takes place at the top of the heap, one could
97 // move back the gauge_ pointer. If this is an optimization or unnecessary
98 // extra work depends on how the MallocHeap is used.
99 2498850 }
100
101
102 2399618 uint64_t MallocHeap::GetSize(void *block) {
103 2399618 Tag *tag = reinterpret_cast<Tag *>(block) - 1;
104
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 2399618 times.
 2399618 assert(tag->size > 0);
105 2399618 return tag->size;
106 }
107
108
109 771 MallocHeap::MallocHeap(uint64_t capacity, CallbackPtr callback_ptr)
110 771 : callback_ptr_(callback_ptr)
111 771 , capacity_(capacity)
112 771 , gauge_(0)
113 771 , stored_(0)
114 771 , num_blocks_(0) {
115
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 771 times.
 771 assert(capacity_ > kMinCapacity);
116 // Ensure 8-byte alignment
117
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 771 times.
 771 assert((capacity_ % 8) == 0);
118 771 heap_ = reinterpret_cast<unsigned char *>(sxmmap(capacity));
119
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 771 times.
 771 assert(uintptr_t(heap_) % 8 == 0);
120 771 }
121
122
123 770 MallocHeap::~MallocHeap() { sxunmap(heap_, capacity_); }
124