asar coverage - build #185

src/asar/
File: src/asar/autoarray.h
Date: 2024-01-30 00:10:53
Lines:
84/84
100.0%
Functions:
138/145
95.2%
Branches:
70/94
74.5%
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 364600 operator T() const
10 {
11
12/13
✗ Branch 0 not taken.
✓ Branch 1 taken 7665 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.
 374863 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 398713 autoptr(T ptr_)
26 {
27
11/18
✗ Branch 0 not taken.
✓ Branch 1 taken 8892 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 85443 times.
✓ Branch 4 taken 7443 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 4284 times.
✓ Branch 7 taken 954 times.
✓ Branch 8 taken 7140 times.
✗ Branch 9 not taken.
✓ Branch 10 taken 63 times.
✗ Branch 11 not taken.
✓ Branch 12 taken 18 times.
✓ Branch 13 taken 36 times.
✓ Branch 14 taken 168 times.
✗ Branch 15 not taken.
✓ Branch 16 taken 60 times.
✗ Branch 17 not taken.
 390172 ptr = ptr_;
28 200200 }
29
30 autoptr(const autoptr<T>& ptr_)
31 {
32 ptr = ptr_.ptr;
33 }
34
35 999313 ~autoptr()
36 {
37
2/2
✓ Branch 0 taken 385621 times.
✓ Branch 1 taken 990 times.
 600337 if (ptr) free((void*)ptr);
38 999313 }
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 27638 const T& getconst(int id) const
53 {
54
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 13819 times.
 27638 if (id < 0) return dummy;
55
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 13819 times.
 27638 if (id >= count) return dummy;
56 27638 return ptr[id];
57 }
58
59 8289945 T& get(int id)
60 {
61
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 6631767 times.
 8289945 if (id < 0) return dummy;
62
2/2
✓ Branch 0 taken 883 times.
✓ Branch 1 taken 6630884 times.
 8289945 if (id >= bufferlen - 4)
63 {
64 1766 resize(id);
65 }
66
2/2
✓ Branch 0 taken 740492 times.
✓ Branch 1 taken 5891275 times.
 8289945 if (id >= count)
67 {
68
5/7
✓ Branch 0 taken 23570 times.
✓ Branch 1 taken 740640 times.
✓ Branch 2 taken 717091 times.
✓ Branch 3 taken 9 times.
✓ Branch 4 taken 9 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
 2962308 for (int i = count;i <= id;i++) new(ptr + i) T();
69 1480828 count = id + 1;
70 }
71 8289945 return ptr[id];
72 }
73
74 1821 void resize(int size)
75 {
76 1821 int oldlen = count;
77
2/2
✓ Branch 0 taken 938 times.
✓ Branch 1 taken 938 times.
 3642 while (bufferlen <= size + 4) bufferlen *= 2;
78 1821 T *old = ptr;
79 1821 ptr = (T*)malloc(sizeof(T)*(size_t)bufferlen);
80
2/2
✓ Branch 0 taken 206248 times.
✓ Branch 1 taken 938 times.
 413713 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.
 411892 new(ptr + i) T();
82 411892 ptr[i] = static_cast<T &&>(old[i]);
83 }
84 1821 free(old);
85 1821 memset(ptr + oldlen, 0, (size_t)(bufferlen - oldlen) * sizeof(T));
86 1821 }
87
88 public:
89
90 67631 void reset(int keep = 0)
91 {
92
2/2
✓ Branch 0 taken 17686 times.
✓ Branch 1 taken 16879 times.
 67631 if (keep >= count) return;
93
3/3
✓ Branch 0 taken 10980 times.
✓ Branch 1 taken 5023 times.
✓ Branch 2 taken 1463 times.
 33489 for (int i = keep;i < count;i++) ptr[i].~T();
94 9300 memset(ptr + keep, 0, (size_t)(count - keep) * sizeof(T));
95
1/2
✓ Branch 0 taken 5020 times.
✗ Branch 1 not taken.
 9300 if (keep < bufferlen / 2)
96 {
97
3/4
✓ Branch 0 taken 9676 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 4656 times.
✓ Branch 3 taken 5020 times.
 17473 while (keep < bufferlen / 2 && bufferlen>8) bufferlen /= 2;
98 9300 T *old = ptr;
99 9300 ptr = (T*)malloc(sizeof(T)*(size_t)bufferlen);
100
2/2
✓ Branch 0 taken 54 times.
✓ Branch 1 taken 5020 times.
 9408 for(int i = 0; i < keep; i++){
101 108 new(ptr + i) T();
102 108 ptr[i] = static_cast<T &&>(old[i]);
103 }
104 9300 free(old);
105
106 }
107 9300 count = keep;
108 }
109
110 3260048 T& operator[](int id)
111 {
112
1/2
✓ Branch 0 taken 9 times.
✗ Branch 1 not taken.
 5422172 return get(id);
113 }
114
115 22036 const T& operator[](int id) const
116 {
117 24837 return getconst(id);
118 }
119
120 2074 operator T*()
121 {
122
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 123 times.
 3193 return ptr;
123 }
124
125 operator const T*() const
126 {
127 return ptr;
128 }
129
130 1433937 T& append(const T& item)
131 {
132 1433937 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 417612 void insert(int pos, const T& item)
150 {
151
3/4
✓ Branch 0 taken 417612 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 208753 times.
✓ Branch 3 taken 208859 times.
 417612 if (pos<0 || pos>count) return;
152
2/2
✓ Branch 0 taken 55 times.
✓ Branch 1 taken 417557 times.
 417612 if (count >= bufferlen - 4)
153 {
154 55 resize(count);
155 }
156 417612 memmove(ptr + pos + 1, ptr + pos, sizeof(T)*(size_t)(count - pos));
157 417612 memset(ptr + pos, 0, sizeof(T));
158 417612 new(ptr + pos) T();
159 417612 ptr[pos] = item;
160 417612 count++;
161 }
162
163 1100031 void remove(int id)
164 {
165
3/4
✓ Branch 0 taken 1098357 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 564728 times.
✓ Branch 3 taken 533629 times.
 1100031 if (id < 0 || id >= count) return;
166 1100031 count--;
167 1100031 ptr[id].~T();
168
2/2
✓ Branch 0 taken 563465 times.
✓ Branch 1 taken 1098357 times.
 1663496 for(int i = id; i < count; i++){
169 563465 ptr[i] = static_cast<T &&>(ptr[i+1]);
170 }
171 }
172
173 26392 autoarray()
174 13703 {
175 26392 ptr = (T*)malloc(sizeof(T) * default_size);
176 26392 memset(ptr, 0, default_size*sizeof(T));
177 26392 bufferlen = default_size;
178 26392 count = 0;
179 28201 }
180
181 25960 ~autoarray()
182 {
183
3/3
✓ Branch 0 taken 21807 times.
✓ Branch 1 taken 16382 times.
✓ Branch 2 taken 3526 times.
 83052 for (int i = 0;i < count;i++) ptr[i].~T();
184 21528 free(ptr);
185 25960 }
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