asar coverage - build #265

src/asar/
File: src/asar/autoarray.h
Date: 2025-02-28 06:59:41
Lines:
84/84
100.0%
Functions:
133/141
94.3%
Branches:
51/73
69.9%
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 244515 operator T() const
10 {
11 244515 return ptr;
12 }
13
14 414 autoptr& operator=(T ptr_)
15 {
16 414 ptr = ptr_;
17 414 return *this;
18 }
19
20 534 autoptr()
21 {
22 534 ptr = nullptr;
23 534 }
24
25 133083 autoptr(T ptr_)
26 {
27 133083 ptr = ptr_;
28 133083 }
29
30 autoptr(const autoptr<T>& ptr_)
31 {
32 ptr = ptr_.ptr;
33 }
34
35 133617 ~autoptr()
36 {
37
2/2
✓ Branch 0 taken 123903 times.
✓ Branch 1 taken 330 times.
 133617 if (ptr) free((void*)ptr);
38 133617 }
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 56 const T& getconst(int id) const
53 {
54
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 28 times.
 56 if (id < 0) return dummy;
55
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 28 times.
 56 if (id >= count) return dummy;
56 56 return ptr[id];
57 }
58
59 2606053 T& get(int id)
60 {
61
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 2128193 times.
 2606053 if (id < 0) return dummy;
62
2/2
✓ Branch 0 taken 301 times.
✓ Branch 1 taken 2127892 times.
 2606053 if (id >= bufferlen - 4)
63 {
64 602 resize(id);
65 }
66
2/2
✓ Branch 0 taken 229425 times.
✓ Branch 1 taken 1898768 times.
 2606053 if (id >= count)
67 {
68
6/7
✓ Branch 0 taken 109052 times.
✓ Branch 1 taken 226666 times.
✓ Branch 2 taken 117659 times.
✓ Branch 3 taken 36 times.
✓ Branch 4 taken 2780 times.
✓ Branch 5 taken 2777 times.
✗ Branch 6 not taken.
 917824 for (int i = count;i <= id;i++) new(ptr + i) T();
69 458798 count = id + 1;
70 }
71 2606053 return ptr[id];
72 }
73
74 629 void resize(int size)
75 {
76 629 int oldlen = count;
77
2/2
✓ Branch 0 taken 328 times.
✓ Branch 1 taken 328 times.
 1258 while (bufferlen <= size + 4) bufferlen *= 2;
78 629 T *old = ptr;
79 629 ptr = (T*)malloc(sizeof(T)*(size_t)bufferlen);
80
2/2
✓ Branch 0 taken 38768 times.
✓ Branch 1 taken 328 times.
 77865 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.
 77236 new(ptr + i) T();
82
0/2
✗ Branch 0 not taken.
✗ Branch 1 not taken.
 77236 ptr[i] = static_cast<T &&>(old[i]);
83 }
84 629 free(old);
85
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 165 times.
 629 memset(ptr + oldlen, 0, (size_t)(bufferlen - oldlen) * sizeof(T));
86 629 }
87
88 public:
89
90 25826 void reset(int keep = 0)
91 {
92
2/2
✓ Branch 0 taken 11405 times.
✓ Branch 1 taken 1788 times.
 25826 if (keep >= count) return;
93
4/4
✓ Branch 0 taken 6792 times.
✓ Branch 1 taken 1601 times.
✓ Branch 2 taken 1308 times.
✓ Branch 3 taken 505 times.
 19604 for (int i = keep;i < count;i++) ptr[i].~T();
94
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 948 times.
 3345 memset(ptr + keep, 0, (size_t)(count - keep) * sizeof(T));
95
1/2
✓ Branch 0 taken 1788 times.
✗ Branch 1 not taken.
 3345 if (keep < bufferlen / 2)
96 {
97
5/6
✓ Branch 0 taken 2318 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 530 times.
✓ Branch 3 taken 1788 times.
✓ Branch 4 taken 311 times.
✓ Branch 5 taken 948 times.
 4334 while (keep < bufferlen / 2 && bufferlen>8) bufferlen /= 2;
98 3345 T *old = ptr;
99 3345 ptr = (T*)malloc(sizeof(T)*(size_t)bufferlen);
100
2/2
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 1788 times.
 3393 for(int i = 0; i < keep; i++){
101 48 new(ptr + i) T();
102 48 ptr[i] = static_cast<T &&>(old[i]);
103 }
104 3345 free(old);
105
106 }
107 3345 count = keep;
108 }
109
110 2147666 T& operator[](int id)
111 {
112 2147666 return get(id);
113 }
114
115 56 const T& operator[](int id) const
116 {
117 56 return getconst(id);
118 }
119
120 1610 operator T*()
121 {
122 1610 return ptr;
123 }
124
125 operator const T*() const
126 {
127 return ptr;
128 }
129
130 447079 T& append(const T& item)
131 {
132 447079 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 138423 void insert(int pos, const T& item)
150 {
151
2/4
✓ Branch 0 taken 138423 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 138423 times.
 138423 if (pos<0 || pos>count) return;
152
2/2
✓ Branch 0 taken 27 times.
✓ Branch 1 taken 138396 times.
 138423 if (count >= bufferlen - 4)
153 {
154 27 resize(count);
155 }
156
2/4
✗ Branch 0 not taken.
✓ Branch 1 taken 69295 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 69295 times.
 138423 memmove(ptr + pos + 1, ptr + pos, sizeof(T)*(size_t)(count - pos));
157
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 69295 times.
 138423 memset(ptr + pos, 0, sizeof(T));
158 138423 new(ptr + pos) T();
159 138423 ptr[pos] = item;
160 138423 count++;
161 }
162
163 354025 void remove(int id)
164 {
165
2/4
✓ Branch 0 taken 353461 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 353461 times.
 354025 if (id < 0 || id >= count) return;
166 354025 count--;
167 354025 ptr[id].~T();
168
2/2
✓ Branch 0 taken 186709 times.
✓ Branch 1 taken 353461 times.
 540734 for(int i = id; i < count; i++){
169 186709 ptr[i] = static_cast<T &&>(ptr[i+1]);
170 }
171 }
172
173 5949 autoarray()
174 3142 {
175 5949 ptr = (T*)malloc(sizeof(T) * default_size);
176
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 1621 times.
 5949 memset(ptr, 0, default_size*sizeof(T));
177 5949 bufferlen = default_size;
178 5949 count = 0;
179 5949 }
180
181 5900 ~autoarray()
182 {
183
4/4
✓ Branch 0 taken 326 times.
✓ Branch 1 taken 5097 times.
✓ Branch 2 taken 2752 times.
✓ Branch 3 taken 856 times.
 18044 for (int i = 0;i < count;i++) ptr[i].~T();
184 5900 free(ptr);
185 5900 }
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