asar coverage - build #262

src/asar/
File: src/asar/autoarray.h
Date: 2025-02-27 19:01:43
Lines:
84/84
100.0%
Functions:
134/141
95.0%
Branches:
70/104
67.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 372936 operator T() const
10 {
11
2/4
✗ Branch 0 not taken.
✓ Branch 1 taken 62109 times.
✓ Branch 2 taken 25620 times.
✗ Branch 3 not taken.
 547521 return ptr;
12 }
13
14 615 autoptr& operator=(T ptr_)
15 {
16
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 603 times.
 1218 ptr = ptr_;
17 615 return *this;
18 }
19
20 1578 autoptr()
21 {
22
2/2
✓ Branch 0 taken 603 times.
✓ Branch 1 taken 180 times.
 1578 ptr = nullptr;
23 795 }
24
25 406578 autoptr(T ptr_)
26 {
27
12/19
✓ Branch 0 taken 27 times.
✓ Branch 1 taken 8928 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 85533 times.
✓ Branch 4 taken 8541 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 7176 times.
✓ Branch 7 taken 5166 times.
✗ Branch 8 not taken.
✓ Branch 9 taken 378 times.
✗ Branch 10 not taken.
✓ Branch 11 taken 63 times.
✗ Branch 12 not taken.
✓ Branch 13 taken 18 times.
✓ Branch 14 taken 36 times.
✓ Branch 15 taken 183 times.
✗ Branch 16 not taken.
✓ Branch 17 taken 72 times.
✗ Branch 18 not taken.
 398037 ptr = ptr_;
28 205527 }
29
30 autoptr(const autoptr<T>& ptr_)
31 {
32 ptr = ptr_.ptr;
33 }
34
35 1013658 ~autoptr()
36 {
37
2/2
✓ Branch 0 taken 393090 times.
✓ Branch 1 taken 990 times.
 609990 if (ptr) free((void*)ptr);
38 1013658 }
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 27936 const T& getconst(int id) const
53 {
54
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 13968 times.
 27936 if (id < 0) return dummy;
55
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 13968 times.
 27936 if (id >= count) return dummy;
56 27936 return ptr[id];
57 }
58
59 8378171 T& get(int id)
60 {
61
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 6673724 times.
 8378171 if (id < 0) return dummy;
62
2/2
✓ Branch 0 taken 905 times.
✓ Branch 1 taken 6672819 times.
 8378171 if (id >= bufferlen - 4)
63 {
64 1810 resize(id);
65 }
66
2/2
✓ Branch 0 taken 758993 times.
✓ Branch 1 taken 5914731 times.
 8378171 if (id >= count)
67 {
68
5/7
✓ Branch 0 taken 391015 times.
✓ Branch 1 taken 759145 times.
✓ Branch 2 taken 368185 times.
✓ Branch 3 taken 9 times.
✓ Branch 4 taken 9 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
 3036396 for (int i = count;i <= id;i++) new(ptr + i) T();
69 1517830 count = id + 1;
70 }
71 8378171 return ptr[id];
72 }
73
74 1865 void resize(int size)
75 {
76 1865 int oldlen = count;
77
2/2
✓ Branch 0 taken 960 times.
✓ Branch 1 taken 960 times.
 3730 while (bufferlen <= size + 4) bufferlen *= 2;
78 1865 T *old = ptr;
79 1865 ptr = (T*)malloc(sizeof(T)*(size_t)bufferlen);
80
2/2
✓ Branch 0 taken 206368 times.
✓ Branch 1 taken 960 times.
 413997 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.
 412132 new(ptr + i) T();
82 412132 ptr[i] = static_cast<T &&>(old[i]);
83 }
84 1865 free(old);
85 1865 memset(ptr + oldlen, 0, (size_t)(bufferlen - oldlen) * sizeof(T));
86 1865 }
87
88 public:
89
90 70939 void reset(int keep = 0)
91 {
92
2/2
✓ Branch 0 taken 18723 times.
✓ Branch 1 taken 17530 times.
 70939 if (keep >= count) return;
93
3/3
✓ Branch 0 taken 11257 times.
✓ Branch 1 taken 5260 times.
✓ Branch 2 taken 1543 times.
 34638 for (int i = keep;i < count;i++) ptr[i].~T();
94 9765 memset(ptr + keep, 0, (size_t)(count - keep) * sizeof(T));
95
1/2
✓ Branch 0 taken 5267 times.
✗ Branch 1 not taken.
 9765 if (keep < bufferlen / 2)
96 {
97
3/4
✓ Branch 0 taken 10109 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 4842 times.
✓ Branch 3 taken 5267 times.
 18270 while (keep < bufferlen / 2 && bufferlen>8) bufferlen /= 2;
98 9765 T *old = ptr;
99 9765 ptr = (T*)malloc(sizeof(T)*(size_t)bufferlen);
100
2/2
✓ Branch 0 taken 72 times.
✓ Branch 1 taken 5267 times.
 9909 for(int i = 0; i < keep; i++){
101 144 new(ptr + i) T();
102 144 ptr[i] = static_cast<T &&>(old[i]);
103 }
104 9765 free(old);
105
106 }
107 9765 count = keep;
108 }
109
110 3315529 T& operator[](int id)
111 {
112
8/16
✓ Branch 0 taken 18 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 18 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 18 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 18 times.
✗ Branch 7 not taken.
✓ Branch 8 taken 18 times.
✗ Branch 9 not taken.
✓ Branch 10 taken 36 times.
✗ Branch 11 not taken.
✓ Branch 12 taken 54 times.
✗ Branch 13 not taken.
✓ Branch 14 taken 9 times.
✗ Branch 15 not taken.
 5476756 return get(id);
113 }
114
115 22284 const T& operator[](int id) const
116 {
117
2/4
✓ Branch 0 taken 95 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 2731 times.
✗ Branch 3 not taken.
 25110 return getconst(id);
118 }
119
120 2916 operator T*()
121 {
122
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 127 times.
 3227 return ptr;
123 }
124
125 operator const T*() const
126 {
127 return ptr;
128 }
129
130 1469998 T& append(const T& item)
131 {
132 1469998 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 417381 void insert(int pos, const T& item)
150 {
151
3/4
✓ Branch 0 taken 417381 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 208610 times.
✓ Branch 3 taken 208771 times.
 417381 if (pos<0 || pos>count) return;
152
2/2
✓ Branch 0 taken 55 times.
✓ Branch 1 taken 417326 times.
 417381 if (count >= bufferlen - 4)
153 {
154 55 resize(count);
155 }
156 417381 memmove(ptr + pos + 1, ptr + pos, sizeof(T)*(size_t)(count - pos));
157 417381 memset(ptr + pos, 0, sizeof(T));
158 417381 new(ptr + pos) T();
159 417381 ptr[pos] = item;
160 417381 count++;
161 }
162
163 1116361 void remove(int id)
164 {
165
3/4
✓ Branch 0 taken 1114681 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 569422 times.
✓ Branch 3 taken 545259 times.
 1116361 if (id < 0 || id >= count) return;
166 1116361 count--;
167 1116361 ptr[id].~T();
168
2/2
✓ Branch 0 taken 562037 times.
✓ Branch 1 taken 1114681 times.
 1678398 for(int i = id; i < count; i++){
169 562037 ptr[i] = static_cast<T &&>(ptr[i+1]);
170 }
171 }
172
173 27192 autoarray()
174 9142 {
175 27192 ptr = (T*)malloc(sizeof(T) * default_size);
176 27192 memset(ptr, 0, default_size*sizeof(T));
177 27192 bufferlen = default_size;
178 27192 count = 0;
179 29056 }
180
181 26635 ~autoarray()
182 {
183
3/3
✓ Branch 0 taken 21898 times.
✓ Branch 1 taken 17786 times.
✓ Branch 2 taken 3669 times.
 86303 for (int i = 0;i < count;i++) ptr[i].~T();
184 22135 free(ptr);
185 26635 }
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