asar coverage - build #123

src/asar/
File: src/asar/autoarray.h
Date: 2024-01-21 07:59:03
Lines:
84/84
100.0%
Functions:
138/145
95.2%
Branches:
70/93
75.3%
Line Branch Exec Source
1 #pragma once
2
3 #include "std-includes.h"
4
5 //Note: T must be a pointer type, or stuff will screw up. To make a pointer last longer than this object, assign nullptr to it and it won't free the old one.
6 template<typename T> class autoptr {
7 T ptr;
8 public:
9 357800 operator T() const
10 {
11
12/13
✗ Branch 0 not taken.
✓ Branch 1 taken 7833 times.
✓ Branch 2 taken 81 times.
✓ Branch 3 taken 81 times.
✓ Branch 4 taken 54 times.
✓ Branch 5 taken 51 times.
✓ Branch 6 taken 48 times.
✓ Branch 7 taken 99 times.
✓ Branch 8 taken 57 times.
✓ Branch 9 taken 54 times.
✓ Branch 10 taken 6 times.
✓ Branch 11 taken 126 times.
✓ Branch 12 taken 33 times.
 368231 return ptr;
12 }
13
14 1035 autoptr& operator=(T ptr_)
15 {
16
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 603 times.
 1692 ptr = ptr_;
17 1035 return *this;
18 }
19
20 2052 autoptr()
21 {
22
2/2
✓ Branch 0 taken 657 times.
✓ Branch 1 taken 180 times.
 2052 ptr = nullptr;
23 1215 }
24
25 388305 autoptr(T ptr_)
26 {
27
11/17
✓ Branch 0 taken 18 times.
✓ Branch 1 taken 8883 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 1107 times.
✓ Branch 4 taken 7479 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 4212 times.
✓ Branch 7 taken 7851 times.
✗ Branch 8 not taken.
✓ Branch 9 taken 63 times.
✗ Branch 10 not taken.
✓ Branch 11 taken 18 times.
✓ Branch 12 taken 36 times.
✓ Branch 13 taken 486 times.
✗ Branch 14 not taken.
✓ Branch 15 taken 180 times.
✗ Branch 16 not taken.
 379764 ptr = ptr_;
28 194889 }
29
30 autoptr(const autoptr<T>& ptr_)
31 {
32 ptr = ptr_.ptr;
33 }
34
35 973614 ~autoptr()
36 {
37
2/2
✓ Branch 0 taken 375213 times.
✓ Branch 1 taken 990 times.
 584832 if (ptr) free((void*)ptr);
38 973614 }
39 };
40
41 template<typename T> class autoarray {
42 public:
43 int count;
44
45 private:
46 T* ptr;
47 int bufferlen;
48
49 T dummy;
50 static const int default_size = 128;
51
52 26738 const T& getconst(int id) const
53 {
54
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 13369 times.
 26738 if (id < 0) return dummy;
55
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 13369 times.
 26738 if (id >= count) return dummy;
56 26738 return ptr[id];
57 }
58
59 8275827 T& get(int id)
60 {
61
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 6650244 times.
 8275827 if (id < 0) return dummy;
62
2/2
✓ Branch 0 taken 827 times.
✓ Branch 1 taken 6649417 times.
 8275827 if (id >= bufferlen - 4)
63 {
64 1654 resize(id);
65 }
66
2/2
✓ Branch 0 taken 718287 times.
✓ Branch 1 taken 5931957 times.
 8275827 if (id >= count)
67 {
68
5/7
✓ Branch 0 taken 22740 times.
✓ Branch 1 taken 718363 times.
✓ Branch 2 taken 695736 times.
✓ Branch 3 taken 9 times.
✓ Branch 4 taken 9 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
 2873468 for (int i = count;i <= id;i++) new(ptr + i) T();
69 1436460 count = id + 1;
70 }
71 8275827 return ptr[id];
72 }
73
74 1705 void resize(int size)
75 {
76 1705 int oldlen = count;
77
2/2
✓ Branch 0 taken 878 times.
✓ Branch 1 taken 878 times.
 3410 while (bufferlen <= size + 4) bufferlen *= 2;
78 1705 T *old = ptr;
79 1705 ptr = (T*)malloc(sizeof(T)*(size_t)bufferlen);
80
2/2
✓ Branch 0 taken 205848 times.
✓ Branch 1 taken 878 times.
 412813 for(int i = 0; i < oldlen; i++){
81
0/4
✗ Branch 0 not taken.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
 411108 new(ptr + i) T();
82 411108 ptr[i] = static_cast<T &&>(old[i]);
83 }
84 1705 free(old);
85 1705 memset(ptr + oldlen, 0, (size_t)(bufferlen - oldlen) * sizeof(T));
86 1705 }
87
88 public:
89
90 64405 void reset(int keep = 0)
91 {
92
2/2
✓ Branch 0 taken 16846 times.
✓ Branch 1 taken 16075 times.
 64405 if (keep >= count) return;
93
3/3
✓ Branch 0 taken 10427 times.
✓ Branch 1 taken 4587 times.
✓ Branch 2 taken 1286 times.
 31252 for (int i = keep;i < count;i++) ptr[i].~T();
94 8495 memset(ptr + keep, 0, (size_t)(count - keep) * sizeof(T));
95
1/2
✓ Branch 0 taken 4598 times.
✗ Branch 1 not taken.
 8495 if (keep < bufferlen / 2)
96 {
97
3/4
✓ Branch 0 taken 9033 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 4435 times.
✓ Branch 3 taken 4598 times.
 16286 while (keep < bufferlen / 2 && bufferlen>8) bufferlen /= 2;
98 8495 T *old = ptr;
99 8495 ptr = (T*)malloc(sizeof(T)*(size_t)bufferlen);
100
2/2
✓ Branch 0 taken 54 times.
✓ Branch 1 taken 4598 times.
 8603 for(int i = 0; i < keep; i++){
101 108 new(ptr + i) T();
102 108 ptr[i] = static_cast<T &&>(old[i]);
103 }
104 8495 free(old);
105
106 }
107 8495 count = keep;
108 }
109
110 3272893 T& operator[](int id)
111 {
112
1/2
✓ Branch 0 taken 9 times.
✗ Branch 1 not taken.
 5338213 return get(id);
113 }
114
115 21320 const T& operator[](int id) const
116 {
117 24029 return getconst(id);
118 }
119
120 1976 operator T*()
121 {
122
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 118 times.
 3042 return ptr;
123 }
124
125 operator const T*() const
126 {
127 return ptr;
128 }
129
130 1391549 T& append(const T& item)
131 {
132 1391549 return (get(count) = item);
133 }
134
135 //insert is not safe for non pod types!!!
136 void insert(int pos)
137 {
138 if (pos<0 || pos>count) return;
139 if (count >= bufferlen - 4)
140 {
141 resize(count);
142 }
143 memmove(ptr + pos + 1, ptr + pos, sizeof(T)*(count - pos));
144 memset(ptr + pos, 0, sizeof(T));
145 new(ptr + pos) T();
146 count++;
147 }
148
149 477094 void insert(int pos, const T& item)
150 {
151
3/4
✓ Branch 0 taken 477094 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 238464 times.
✓ Branch 3 taken 238630 times.
 477094 if (pos<0 || pos>count) return;
152
2/2
✓ Branch 0 taken 51 times.
✓ Branch 1 taken 477043 times.
 477094 if (count >= bufferlen - 4)
153 {
154 51 resize(count);
155 }
156 477094 memmove(ptr + pos + 1, ptr + pos, sizeof(T)*(size_t)(count - pos));
157 477094 memset(ptr + pos, 0, sizeof(T));
158 477094 new(ptr + pos) T();
159 477094 ptr[pos] = item;
160 477094 count++;
161 }
162
163 1138880 void remove(int id)
164 {
165
3/4
✓ Branch 0 taken 1137206 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 584393 times.
✓ Branch 3 taken 552813 times.
 1138880 if (id < 0 || id >= count) return;
166 1138880 count--;
167 1138880 ptr[id].~T();
168
2/2
✓ Branch 0 taken 582915 times.
✓ Branch 1 taken 1137206 times.
 1721795 for(int i = id; i < count; i++){
169 582915 ptr[i] = static_cast<T &&>(ptr[i+1]);
170 }
171 }
172
173 25796 autoarray()
174 13369 {
175 25796 ptr = (T*)malloc(sizeof(T) * default_size);
176 25796 memset(ptr, 0, default_size*sizeof(T));
177 25796 bufferlen = default_size;
178 25796 count = 0;
179 27585 }
180
181 25489 ~autoarray()
182 {
183
3/3
✓ Branch 0 taken 21621 times.
✓ Branch 1 taken 16139 times.
✓ Branch 2 taken 3439 times.
 82035 for (int i = 0;i < count;i++) ptr[i].~T();
184 21127 free(ptr);
185 25489 }
186
187 #ifdef SERIALIZER
188 void serialize(serializer& s)
189 {
190 if (s.serializing) s(count);
191 else
192 {
193 int i;
194 s(i);
195 get(i - 1);
196 }
197 for (int i = 0;i < count;i++) s(ptr[i]);
198 }
199 #endif
200 #define SERIALIZER_BANNED
201 };
202