Mercurial > projects > ldc
annotate tango/lib/compiler/llvmdc/lifetime.d @ 209:c4c9b4ac021b trunk
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
| author | lindquist |
|---|---|
| date | Wed, 14 May 2008 01:22:40 +0200 |
| parents | e881c9b1c738 |
| children | f66219e0d530 |
| rev | line source |
|---|---|
| 132 | 1 /** |
| 2 * This module contains all functions related to an object's lifetime: | |
| 3 * allocation, resizing, deallocation, and finalization. | |
| 4 * | |
| 5 * Copyright: Copyright (C) 2004-2007 Digital Mars, www.digitalmars.com. | |
| 6 * All rights reserved. | |
| 7 * License: | |
| 8 * This software is provided 'as-is', without any express or implied | |
| 9 * warranty. In no event will the authors be held liable for any damages | |
| 10 * arising from the use of this software. | |
| 11 * | |
| 12 * Permission is granted to anyone to use this software for any purpose, | |
| 13 * including commercial applications, and to alter it and redistribute it | |
| 14 * freely, in both source and binary form, subject to the following | |
| 15 * restrictions: | |
| 16 * | |
| 17 * o The origin of this software must not be misrepresented; you must not | |
| 18 * claim that you wrote the original software. If you use this software | |
| 19 * in a product, an acknowledgment in the product documentation would be | |
| 20 * appreciated but is not required. | |
| 21 * o Altered source versions must be plainly marked as such, and must not | |
| 22 * be misrepresented as being the original software. | |
| 23 * o This notice may not be removed or altered from any source | |
| 24 * distribution. | |
| 25 * Authors: Walter Bright, Sean Kelly, Tomas Lindquist Olsen | |
| 26 */ | |
| 27 module lifetime; | |
| 28 | |
|
133
44a95ac7368a
[svn r137] Many fixes towards tango.io.Console working, but not quite there yet...
lindquist
parents:
132
diff
changeset
|
29 //debug=PRINTF; |
| 137 | 30 //debug=PRINTF2; |
| 132 | 31 |
| 32 private | |
| 33 { | |
| 34 import tango.stdc.stdlib; | |
| 35 import tango.stdc.string; | |
| 36 import tango.stdc.stdarg; | |
| 37 debug(PRINTF) import tango.stdc.stdio; | |
|
133
44a95ac7368a
[svn r137] Many fixes towards tango.io.Console working, but not quite there yet...
lindquist
parents:
132
diff
changeset
|
38 else debug(PRINTF2) import tango.stdc.stdio; |
| 132 | 39 } |
| 40 | |
| 41 | |
| 42 private | |
| 43 { | |
| 44 enum BlkAttr : uint | |
| 45 { | |
| 46 FINALIZE = 0b0000_0001, | |
| 47 NO_SCAN = 0b0000_0010, | |
| 48 NO_MOVE = 0b0000_0100, | |
| 49 ALL_BITS = 0b1111_1111 | |
| 50 } | |
| 51 | |
| 52 struct BlkInfo | |
| 53 { | |
| 54 void* base; | |
| 55 size_t size; | |
| 56 uint attr; | |
| 57 } | |
| 58 | |
| 59 extern (C) uint gc_getAttr( void* p ); | |
| 60 extern (C) uint gc_setAttr( void* p, uint a ); | |
| 61 extern (C) uint gc_clrAttr( void* p, uint a ); | |
| 62 | |
| 63 extern (C) void* gc_malloc( size_t sz, uint ba = 0 ); | |
| 64 extern (C) void* gc_calloc( size_t sz, uint ba = 0 ); | |
| 65 extern (C) size_t gc_extend( void* p, size_t mx, size_t sz ); | |
| 66 extern (C) void gc_free( void* p ); | |
| 67 | |
| 68 extern (C) void* gc_addrOf( void* p ); | |
| 69 extern (C) size_t gc_sizeOf( void* p ); | |
| 70 extern (C) BlkInfo gc_query( void* p ); | |
| 71 | |
| 72 extern (C) bool onCollectResource( Object o ); | |
| 73 extern (C) void onFinalizeError( ClassInfo c, Exception e ); | |
| 74 extern (C) void onOutOfMemoryError(); | |
| 75 | |
| 76 extern (C) void _d_monitordelete(Object h, bool det = true); | |
| 77 | |
| 78 enum | |
| 79 { | |
| 80 PAGESIZE = 4096 | |
| 81 } | |
| 82 } | |
| 83 | |
| 84 | |
| 85 /** | |
| 86 * | |
| 87 */ | |
| 88 extern (C) Object _d_newclass(ClassInfo ci) | |
| 89 { | |
| 90 void* p; | |
| 91 | |
| 137 | 92 debug(PRINTF2) printf("_d_newclass(ci = %p, %s)\n", ci, cast(char *)ci.name.ptr); |
|
133
44a95ac7368a
[svn r137] Many fixes towards tango.io.Console working, but not quite there yet...
lindquist
parents:
132
diff
changeset
|
93 /+ |
| 132 | 94 if (ci.flags & 1) // if COM object |
| 95 { /* COM objects are not garbage collected, they are reference counted | |
| 96 * using AddRef() and Release(). They get free'd by C's free() | |
| 97 * function called by Release() when Release()'s reference count goes | |
| 98 * to zero. | |
| 99 */ | |
| 100 p = tango.stdc.stdlib.malloc(ci.init.length); | |
| 101 if (!p) | |
| 102 onOutOfMemoryError(); | |
| 103 } | |
| 104 else | |
|
133
44a95ac7368a
[svn r137] Many fixes towards tango.io.Console working, but not quite there yet...
lindquist
parents:
132
diff
changeset
|
105 +/ |
| 132 | 106 { |
| 107 p = gc_malloc(ci.init.length, | |
| 108 BlkAttr.FINALIZE | (ci.flags & 2 ? BlkAttr.NO_SCAN : 0)); | |
|
133
44a95ac7368a
[svn r137] Many fixes towards tango.io.Console working, but not quite there yet...
lindquist
parents:
132
diff
changeset
|
109 debug(PRINTF2) printf(" p = %p\n", p); |
| 132 | 110 } |
| 111 | |
| 137 | 112 debug(PRINTF2) |
| 132 | 113 { |
| 114 printf("p = %p\n", p); | |
| 137 | 115 printf("ci = %p, ci.init = %p, len = %d\n", ci, ci.init.ptr, ci.init.length); |
| 116 printf("vptr = %p\n", *cast(void**) ci.init.ptr); | |
| 117 printf("vtbl[0] = %p\n", (*cast(void***) ci.init.ptr)[0]); | |
| 118 printf("vtbl[1] = %p\n", (*cast(void***) ci.init.ptr)[1]); | |
| 119 printf("init[0] = %p\n", (cast(uint**) ci.init.ptr)[0]); | |
| 120 printf("init[1] = %p\n", (cast(uint**) ci.init.ptr)[1]); | |
| 121 printf("init[2] = %p\n", (cast(uint**) ci.init.ptr)[2]); | |
| 122 printf("init[3] = %p\n", (cast(uint**) ci.init.ptr)[3]); | |
| 123 printf("init[4] = %p\n", (cast(uint**) ci.init.ptr)[4]); | |
| 132 | 124 } |
| 125 | |
| 126 // initialize it | |
|
133
44a95ac7368a
[svn r137] Many fixes towards tango.io.Console working, but not quite there yet...
lindquist
parents:
132
diff
changeset
|
127 // llvmdc does this inline |
|
44a95ac7368a
[svn r137] Many fixes towards tango.io.Console working, but not quite there yet...
lindquist
parents:
132
diff
changeset
|
128 //(cast(byte*) p)[0 .. ci.init.length] = ci.init[]; |
| 132 | 129 |
| 130 debug(PRINTF) printf("initialization done\n"); | |
| 131 return cast(Object) p; | |
| 132 } | |
| 133 | |
| 134 /** | |
| 135 * | |
| 136 */ | |
|
209
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
137 extern (C) void _d_delinterface(void* p) |
| 132 | 138 { |
|
209
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
139 if (p) |
| 132 | 140 { |
|
209
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
141 Interface* pi = **cast(Interface ***)p; |
|
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
142 Object o = cast(Object)(p - pi.offset); |
| 132 | 143 |
|
209
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
144 _d_delclass(o); |
|
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
145 //*p = null; |
| 132 | 146 } |
| 147 } | |
| 148 | |
| 149 // used for deletion | |
| 150 private extern (D) alias void function(Object) fp_t; | |
| 151 | |
| 152 | |
| 153 /** | |
| 154 * | |
| 155 */ | |
|
209
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
156 extern (C) void _d_delclass(Object p) |
| 132 | 157 { |
|
209
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
158 if (p) |
| 132 | 159 { |
|
209
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
160 debug(PRINTF) printf("_d_delclass(%p)\n", p); |
| 132 | 161 |
|
209
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
162 ClassInfo **pc = cast(ClassInfo **)p; |
| 132 | 163 if (*pc) |
| 164 { | |
| 165 ClassInfo c = **pc; | |
| 166 | |
|
209
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
167 rt_finalize(cast(void*) p); |
| 132 | 168 |
| 169 if (c.deallocator) | |
| 170 { | |
| 171 fp_t fp = cast(fp_t)c.deallocator; | |
|
209
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
172 (*fp)(p); // call deallocator |
|
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
173 //*p = null; |
| 132 | 174 return; |
| 175 } | |
| 176 } | |
| 177 else | |
| 178 { | |
|
209
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
179 rt_finalize(cast(void*) p); |
| 132 | 180 } |
|
209
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
181 gc_free(cast(void*) p); |
|
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
182 //*p = null; |
| 132 | 183 } |
| 184 } | |
| 185 | |
|
209
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
186 /+ |
|
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
187 |
| 132 | 188 /** |
| 189 * | |
| 190 */ | |
| 191 struct Array | |
| 192 { | |
| 193 size_t length; | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
194 void* data; |
| 132 | 195 } |
| 196 | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
197 +/ |
| 132 | 198 |
| 199 /** | |
| 200 * Allocate a new array of length elements. | |
| 201 * ti is the type of the resulting array, or pointer to element. | |
| 202 * (For when the array is initialized to 0) | |
| 203 */ | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
204 extern (C) void* _d_newarrayT(TypeInfo ti, size_t length) |
| 132 | 205 { |
| 206 void* p; | |
| 207 auto size = ti.next.tsize(); // array element size | |
| 208 | |
| 209 debug(PRINTF) printf("_d_newarrayT(length = x%x, size = %d)\n", length, size); | |
| 210 if (length == 0 || size == 0) | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
211 return null; |
| 132 | 212 |
| 213 version (D_InlineAsm_X86) | |
| 214 { | |
| 215 asm | |
| 216 { | |
| 217 mov EAX,size ; | |
| 218 mul EAX,length ; | |
| 219 mov size,EAX ; | |
| 220 jc Loverflow ; | |
| 221 } | |
| 222 } | |
| 223 else | |
| 224 size *= length; | |
| 225 p = gc_malloc(size + 1, !(ti.next.flags() & 1) ? BlkAttr.NO_SCAN : 0); | |
| 226 debug(PRINTF) printf(" p = %p\n", p); | |
| 227 memset(p, 0, size); | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
228 return p; |
| 132 | 229 |
| 230 Loverflow: | |
| 231 onOutOfMemoryError(); | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
232 return null; |
| 132 | 233 } |
| 234 | |
| 235 /** | |
| 236 * For when the array has a non-zero initializer. | |
| 237 */ | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
238 extern (C) void* _d_newarrayiT(TypeInfo ti, size_t length) |
| 132 | 239 { |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
240 void* result; |
| 132 | 241 auto size = ti.next.tsize(); // array element size |
| 242 | |
| 243 debug(PRINTF) printf("_d_newarrayiT(length = %d, size = %d)\n", length, size); | |
| 244 | |
| 245 if (length == 0 || size == 0) | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
246 result = null; |
| 132 | 247 else |
| 248 { | |
| 249 auto initializer = ti.next.init(); | |
| 250 auto isize = initializer.length; | |
| 251 auto q = initializer.ptr; | |
| 252 version (D_InlineAsm_X86) | |
| 253 { | |
| 254 asm | |
| 255 { | |
| 256 mov EAX,size ; | |
| 257 mul EAX,length ; | |
| 258 mov size,EAX ; | |
| 259 jc Loverflow ; | |
| 260 } | |
| 261 } | |
| 262 else | |
| 263 size *= length; | |
| 264 auto p = gc_malloc(size + 1, !(ti.next.flags() & 1) ? BlkAttr.NO_SCAN : 0); | |
| 265 debug(PRINTF) printf(" p = %p\n", p); | |
| 266 if (isize == 1) | |
| 267 memset(p, *cast(ubyte*)q, size); | |
| 268 else if (isize == int.sizeof) | |
| 269 { | |
| 270 int init = *cast(int*)q; | |
| 271 size /= int.sizeof; | |
| 272 for (size_t u = 0; u < size; u++) | |
| 273 { | |
| 274 (cast(int*)p)[u] = init; | |
| 275 } | |
| 276 } | |
| 277 else | |
| 278 { | |
| 279 for (size_t u = 0; u < size; u += isize) | |
| 280 { | |
| 281 memcpy(p + u, q, isize); | |
| 282 } | |
| 283 } | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
284 result = p; |
| 132 | 285 } |
| 286 return result; | |
| 287 | |
| 288 Loverflow: | |
| 289 onOutOfMemoryError(); | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
290 return null; |
| 132 | 291 } |
| 292 | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
293 /+ |
|
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
294 |
| 132 | 295 /** |
| 296 * | |
| 297 */ | |
| 298 extern (C) Array _d_newarraymT(TypeInfo ti, int ndims, ...) | |
| 299 { | |
| 300 Array result; | |
| 301 | |
| 302 debug(PRINTF) printf("_d_newarraymT(ndims = %d)\n", ndims); | |
| 303 if (ndims == 0) | |
| 304 result = Array(); | |
| 305 else | |
| 306 { va_list q; | |
| 307 va_start!(int)(q, ndims); | |
| 308 | |
| 309 void[] foo(TypeInfo ti, size_t* pdim, int ndims) | |
| 310 { | |
| 311 size_t dim = *pdim; | |
| 312 void[] p; | |
| 313 | |
| 314 debug(PRINTF) printf("foo(ti = %p, ti.next = %p, dim = %d, ndims = %d\n", ti, ti.next, dim, ndims); | |
| 315 if (ndims == 1) | |
| 316 { | |
| 317 return _d_newarrayT(ti, dim); | |
| 318 } | |
| 319 else | |
| 320 { | |
| 321 p = gc_malloc(dim * (void[]).sizeof + 1)[0 .. dim]; | |
| 322 for (int i = 0; i < dim; i++) | |
| 323 { | |
| 324 (cast(void[]*)p.ptr)[i] = foo(ti.next, pdim + 1, ndims - 1); | |
| 325 } | |
| 326 } | |
| 327 return p; | |
| 328 } | |
| 329 | |
| 330 size_t* pdim = cast(size_t *)q; | |
| 331 void[] arr = foo(ti, pdim, ndims); | |
| 332 result = Arra | |
| 333 debug(PRINTF) printf("result = %llx\n", result); | |
| 334 | |
| 335 version (none) | |
| 336 { | |
| 337 for (int i = 0; i < ndims; i++) | |
| 338 { | |
| 339 printf("index %d: %d\n", i, va_arg!(int)(q)); | |
| 340 } | |
| 341 } | |
| 342 va_end(q); | |
| 343 } | |
| 344 return result; | |
| 345 } | |
| 346 | |
| 347 | |
| 348 /** | |
| 349 * | |
| 350 */ | |
| 351 extern (C) Array _d_newarraymiT(TypeInfo ti, int ndims, ...) | |
| 352 { | |
| 353 Array result; | |
| 354 | |
| 355 debug(PRINTF) printf("_d_newarraymiT(ndims = %d)\n", ndims); | |
| 356 if (ndims == 0) | |
| 357 result = 0; | |
| 358 else | |
| 359 { | |
| 360 va_list q; | |
| 361 va_start!(int)(q, ndims); | |
| 362 | |
| 363 void[] foo(TypeInfo ti, size_t* pdim, int ndims) | |
| 364 { | |
| 365 size_t dim = *pdim; | |
| 366 void[] p; | |
| 367 | |
| 368 if (ndims == 1) | |
| 369 { | |
| 370 auto r = _d_newarrayiT(ti, dim); | |
| 371 p = *cast(void[]*)(&r); | |
| 372 } | |
| 373 else | |
| 374 { | |
| 375 p = gc_malloc(dim * (void[]).sizeof + 1)[0 .. dim]; | |
| 376 for (int i = 0; i < dim; i++) | |
| 377 { | |
| 378 (cast(void[]*)p.ptr)[i] = foo(ti.next, pdim + 1, ndims - 1); | |
| 379 } | |
| 380 } | |
| 381 return p; | |
| 382 } | |
| 383 | |
| 384 size_t* pdim = cast(size_t *)q; | |
| 385 result = cast(ulong)foo(ti, pdim, ndims); | |
| 386 debug(PRINTF) printf("result = %llx\n", result); | |
| 387 | |
| 388 version (none) | |
| 389 { | |
| 390 for (int i = 0; i < ndims; i++) | |
| 391 { | |
| 392 printf("index %d: %d\n", i, va_arg!(int)(q)); | |
| 393 printf("init = %d\n", va_arg!(int)(q)); | |
| 394 } | |
| 395 } | |
| 396 va_end(q); | |
| 397 } | |
| 398 return result; | |
| 399 } | |
| 400 | |
| 401 /** | |
| 402 * | |
| 403 */ | |
| 404 void* _d_allocmemory(size_t nbytes) | |
| 405 { | |
| 406 return gc_malloc(nbytes); | |
| 407 } | |
| 408 | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
409 +/ |
|
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
410 |
|
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
411 /** |
|
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
412 * for allocating a single POD value |
|
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
413 */ |
|
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
414 extern (C) void* _d_allocmemoryT(TypeInfo ti) |
|
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
415 { |
|
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
416 return gc_malloc(ti.tsize(), (ti.flags() & 1) ? BlkAttr.NO_SCAN : 0); |
|
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
417 } |
|
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
418 |
|
209
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
419 /** |
|
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
420 * |
|
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
421 */ |
|
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
422 extern (C) void _d_delarray(size_t plength, void* pdata) |
|
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
423 { |
|
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
424 // if (p) |
|
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
425 // { |
|
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
426 assert(!plength || pdata); |
|
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
427 |
|
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
428 if (pdata) |
|
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
429 gc_free(pdata); |
|
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
430 // p.data = null; |
|
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
431 // p.length = 0; |
|
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
432 // } |
|
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
433 } |
| 132 | 434 |
| 435 /** | |
| 436 * | |
| 437 */ | |
|
209
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
438 extern (C) void _d_delmemory(void* p) |
| 132 | 439 { |
| 440 if (p) | |
| 441 { | |
|
209
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
442 gc_free(p); |
|
c4c9b4ac021b
[svn r225] Fixed: delete expressions no longer use llvm's free instruction, which crashes on a GC provided pointer.
lindquist
parents:
203
diff
changeset
|
443 //*p = null; |
| 132 | 444 } |
| 445 } | |
| 446 | |
| 447 | |
| 448 /** | |
| 449 * | |
| 450 */ | |
| 451 extern (C) void _d_callfinalizer(void* p) | |
| 452 { | |
| 453 rt_finalize( p ); | |
| 454 } | |
| 455 | |
| 456 | |
| 457 /** | |
| 458 * | |
| 459 */ | |
| 460 extern (C) void rt_finalize(void* p, bool det = true) | |
| 461 { | |
| 462 debug(PRINTF) printf("rt_finalize(p = %p)\n", p); | |
| 463 | |
| 464 if (p) // not necessary if called from gc | |
| 465 { | |
| 466 ClassInfo** pc = cast(ClassInfo**)p; | |
| 467 | |
| 468 if (*pc) | |
| 469 { | |
| 470 ClassInfo c = **pc; | |
| 471 | |
| 472 try | |
| 473 { | |
| 474 if (det || onCollectResource(cast(Object)p)) | |
| 475 { | |
| 476 do | |
| 477 { | |
| 478 if (c.destructor) | |
| 479 { | |
| 480 fp_t fp = cast(fp_t)c.destructor; | |
| 481 (*fp)(cast(Object)p); // call destructor | |
| 482 } | |
| 483 c = c.base; | |
| 484 } while (c); | |
| 485 } | |
| 486 if ((cast(void**)p)[1]) // if monitor is not null | |
| 487 _d_monitordelete(cast(Object)p, det); | |
| 488 } | |
| 489 catch (Exception e) | |
| 490 { | |
| 491 onFinalizeError(**pc, e); | |
| 492 } | |
| 493 finally | |
| 494 { | |
| 495 *pc = null; // zero vptr | |
| 496 } | |
| 497 } | |
| 498 } | |
| 499 } | |
| 500 | |
| 501 /** | |
| 502 * Resize dynamic arrays with 0 initializers. | |
| 503 */ | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
504 extern (C) byte* _d_arraysetlengthT(TypeInfo ti, size_t newlength, size_t plength, byte* pdata) |
| 132 | 505 in |
| 506 { | |
| 507 assert(ti); | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
508 assert(!plength || pdata); |
| 132 | 509 } |
| 510 body | |
| 511 { | |
| 512 byte* newdata; | |
| 513 size_t sizeelem = ti.next.tsize(); | |
| 514 | |
| 515 debug(PRINTF) | |
| 516 { | |
| 517 printf("_d_arraysetlengthT(p = %p, sizeelem = %d, newlength = %d)\n", p, sizeelem, newlength); | |
| 518 if (p) | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
519 printf("\tp.data = %p, p.length = %d\n", pdata, plength); |
| 132 | 520 } |
| 521 | |
| 522 if (newlength) | |
| 523 { | |
| 524 version (D_InlineAsm_X86) | |
| 525 { | |
| 526 size_t newsize = void; | |
| 527 | |
| 528 asm | |
| 529 { | |
| 530 mov EAX, newlength; | |
| 531 mul EAX, sizeelem; | |
| 532 mov newsize, EAX; | |
| 533 jc Loverflow; | |
| 534 } | |
| 535 } | |
| 536 else | |
| 537 { | |
| 538 size_t newsize = sizeelem * newlength; | |
| 539 | |
| 540 if (newsize / newlength != sizeelem) | |
| 541 goto Loverflow; | |
| 542 } | |
| 543 | |
| 544 debug(PRINTF) printf("newsize = %x, newlength = %x\n", newsize, newlength); | |
| 545 | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
546 if (pdata) |
| 132 | 547 { |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
548 newdata = pdata; |
|
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
549 if (newlength > plength) |
| 132 | 550 { |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
551 size_t size = plength * sizeelem; |
|
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
552 auto info = gc_query(pdata); |
| 132 | 553 |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
554 if (info.size <= newsize || info.base != pdata) |
| 132 | 555 { |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
556 if (info.size >= PAGESIZE && info.base == pdata) |
| 132 | 557 { // Try to extend in-place |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
558 auto u = gc_extend(pdata, (newsize + 1) - info.size, (newsize + 1) - info.size); |
| 132 | 559 if (u) |
| 560 { | |
| 561 goto L1; | |
| 562 } | |
| 563 } | |
| 564 newdata = cast(byte *)gc_malloc(newsize + 1, info.attr); | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
565 newdata[0 .. size] = pdata[0 .. size]; |
| 132 | 566 } |
| 567 L1: | |
| 568 newdata[size .. newsize] = 0; | |
| 569 } | |
| 570 } | |
| 571 else | |
| 572 { | |
| 573 newdata = cast(byte *)gc_calloc(newsize + 1, !(ti.next.flags() & 1) ? BlkAttr.NO_SCAN : 0); | |
| 574 } | |
| 575 } | |
| 576 else | |
| 577 { | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
578 newdata = pdata; |
| 132 | 579 } |
| 580 | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
581 return newdata; |
| 132 | 582 |
| 583 Loverflow: | |
| 584 onOutOfMemoryError(); | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
585 return null; |
| 132 | 586 } |
| 587 | |
| 588 | |
| 589 /** | |
| 590 * Resize arrays for non-zero initializers. | |
| 591 * p pointer to array lvalue to be updated | |
| 592 * newlength new .length property of array | |
| 593 * sizeelem size of each element of array | |
| 594 * initsize size of initializer | |
| 595 * ... initializer | |
| 596 */ | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
597 extern (C) byte* _d_arraysetlengthiT(TypeInfo ti, size_t newlength, size_t plength, byte* pdata) |
| 132 | 598 in |
| 599 { | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
600 assert(!plength || pdata); |
| 132 | 601 } |
| 602 body | |
| 603 { | |
| 604 byte* newdata; | |
| 605 size_t sizeelem = ti.next.tsize(); | |
| 606 void[] initializer = ti.next.init(); | |
| 607 size_t initsize = initializer.length; | |
| 608 | |
| 609 assert(sizeelem); | |
| 610 assert(initsize); | |
| 611 assert(initsize <= sizeelem); | |
| 612 assert((sizeelem / initsize) * initsize == sizeelem); | |
| 613 | |
| 614 debug(PRINTF) | |
| 615 { | |
| 616 printf("_d_arraysetlengthiT(p = %p, sizeelem = %d, newlength = %d, initsize = %d)\n", p, sizeelem, newlength, initsize); | |
| 617 if (p) | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
618 printf("\tp.data = %p, p.length = %d\n", pdata, plength); |
| 132 | 619 } |
| 620 | |
| 621 if (newlength) | |
| 622 { | |
| 623 version (D_InlineAsm_X86) | |
| 624 { | |
| 625 size_t newsize = void; | |
| 626 | |
| 627 asm | |
| 628 { | |
| 629 mov EAX,newlength ; | |
| 630 mul EAX,sizeelem ; | |
| 631 mov newsize,EAX ; | |
| 632 jc Loverflow ; | |
| 633 } | |
| 634 } | |
| 635 else | |
| 636 { | |
| 637 size_t newsize = sizeelem * newlength; | |
| 638 | |
| 639 if (newsize / newlength != sizeelem) | |
| 640 goto Loverflow; | |
| 641 } | |
| 642 debug(PRINTF) printf("newsize = %x, newlength = %x\n", newsize, newlength); | |
| 643 | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
644 size_t size = plength * sizeelem; |
| 132 | 645 |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
646 if (pdata) |
| 132 | 647 { |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
648 newdata = pdata; |
|
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
649 if (newlength > plength) |
| 132 | 650 { |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
651 auto info = gc_query(pdata); |
| 132 | 652 |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
653 if (info.size <= newsize || info.base != pdata) |
| 132 | 654 { |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
655 if (info.size >= PAGESIZE && info.base == pdata) |
| 132 | 656 { // Try to extend in-place |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
657 auto u = gc_extend(pdata, (newsize + 1) - info.size, (newsize + 1) - info.size); |
| 132 | 658 if (u) |
| 659 { | |
| 660 goto L1; | |
| 661 } | |
| 662 } | |
| 663 newdata = cast(byte *)gc_malloc(newsize + 1, info.attr); | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
664 newdata[0 .. size] = pdata[0 .. size]; |
| 132 | 665 L1: ; |
| 666 } | |
| 667 } | |
| 668 } | |
| 669 else | |
| 670 { | |
| 671 newdata = cast(byte *)gc_malloc(newsize + 1, !(ti.next.flags() & 1) ? BlkAttr.NO_SCAN : 0); | |
| 672 } | |
| 673 | |
| 674 auto q = initializer.ptr; // pointer to initializer | |
| 675 | |
| 676 if (newsize > size) | |
| 677 { | |
| 678 if (initsize == 1) | |
| 679 { | |
| 680 debug(PRINTF) printf("newdata = %p, size = %d, newsize = %d, *q = %d\n", newdata, size, newsize, *cast(byte*)q); | |
| 681 newdata[size .. newsize] = *(cast(byte*)q); | |
| 682 } | |
| 683 else | |
| 684 { | |
| 685 for (size_t u = size; u < newsize; u += initsize) | |
| 686 { | |
| 687 memcpy(newdata + u, q, initsize); | |
| 688 } | |
| 689 } | |
| 690 } | |
| 691 } | |
| 692 else | |
| 693 { | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
694 newdata = pdata; |
| 132 | 695 } |
| 696 | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
697 return newdata; |
| 132 | 698 |
| 699 Loverflow: | |
| 700 onOutOfMemoryError(); | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
701 return null; |
| 132 | 702 } |
| 703 | |
|
203
e881c9b1c738
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
lindquist
parents:
137
diff
changeset
|
704 /+ |
| 132 | 705 |
| 706 /** | |
| 707 * Append y[] to array x[]. | |
| 708 * size is size of each array element. | |
| 709 */ | |
| 710 extern (C) long _d_arrayappendT(TypeInfo ti, Array *px, byte[] y) | |
| 711 { | |
| 712 auto sizeelem = ti.next.tsize(); // array element size | |
| 713 auto info = gc_query(px.data); | |
| 714 auto length = px.length; | |
| 715 auto newlength = length + y.length; | |
| 716 auto newsize = newlength * sizeelem; | |
| 717 | |
| 718 if (info.size < newsize || info.base != px.data) | |
| 719 { byte* newdata; | |
| 720 | |
| 721 if (info.size >= PAGESIZE && info.base == px.data) | |
| 722 { // Try to extend in-place | |
| 723 auto u = gc_extend(px.data, (newsize + 1) - info.size, (newsize + 1) - info.size); | |
| 724 if (u) | |
| 725 { | |
| 726 goto L1; | |
| 727 } | |
| 728 } | |
| 729 newdata = cast(byte *)gc_malloc(newCapacity(newlength, sizeelem) + 1, info.attr); | |
| 730 memcpy(newdata, px.data, length * sizeelem); | |
| 731 px.data = newdata; | |
| 732 } | |
| 733 L1: | |
| 734 px.length = newlength; | |
| 735 memcpy(px.data + length * sizeelem, y.ptr, y.length * sizeelem); | |
| 736 return *cast(long*)px; | |
| 737 } | |
| 738 | |
| 739 | |
| 740 /** | |
| 741 * | |
| 742 */ | |
| 743 size_t newCapacity(size_t newlength, size_t size) | |
| 744 { | |
| 745 version(none) | |
| 746 { | |
| 747 size_t newcap = newlength * size; | |
| 748 } | |
| 749 else | |
| 750 { | |
| 751 /* | |
| 752 * Better version by Dave Fladebo: | |
| 753 * This uses an inverse logorithmic algorithm to pre-allocate a bit more | |
| 754 * space for larger arrays. | |
| 755 * - Arrays smaller than PAGESIZE bytes are left as-is, so for the most | |
| 756 * common cases, memory allocation is 1 to 1. The small overhead added | |
| 757 * doesn't affect small array perf. (it's virtually the same as | |
| 758 * current). | |
| 759 * - Larger arrays have some space pre-allocated. | |
| 760 * - As the arrays grow, the relative pre-allocated space shrinks. | |
| 761 * - The logorithmic algorithm allocates relatively more space for | |
| 762 * mid-size arrays, making it very fast for medium arrays (for | |
| 763 * mid-to-large arrays, this turns out to be quite a bit faster than the | |
| 764 * equivalent realloc() code in C, on Linux at least. Small arrays are | |
| 765 * just as fast as GCC). | |
| 766 * - Perhaps most importantly, overall memory usage and stress on the GC | |
| 767 * is decreased significantly for demanding environments. | |
| 768 */ | |
| 769 size_t newcap = newlength * size; | |
| 770 size_t newext = 0; | |
| 771 | |
| 772 if (newcap > PAGESIZE) | |
| 773 { | |
| 774 //double mult2 = 1.0 + (size / log10(pow(newcap * 2.0,2.0))); | |
| 775 | |
| 776 // redo above line using only integer math | |
| 777 | |
| 778 static int log2plus1(size_t c) | |
| 779 { int i; | |
| 780 | |
| 781 if (c == 0) | |
| 782 i = -1; | |
| 783 else | |
| 784 for (i = 1; c >>= 1; i++) | |
| 785 { | |
| 786 } | |
| 787 return i; | |
| 788 } | |
| 789 | |
| 790 /* The following setting for mult sets how much bigger | |
| 791 * the new size will be over what is actually needed. | |
| 792 * 100 means the same size, more means proportionally more. | |
| 793 * More means faster but more memory consumption. | |
| 794 */ | |
| 795 //long mult = 100 + (1000L * size) / (6 * log2plus1(newcap)); | |
| 796 long mult = 100 + (1000L * size) / log2plus1(newcap); | |
| 797 | |
| 798 // testing shows 1.02 for large arrays is about the point of diminishing return | |
| 799 if (mult < 102) | |
| 800 mult = 102; | |
| 801 newext = cast(size_t)((newcap * mult) / 100); | |
| 802 newext -= newext % size; | |
| 803 debug(PRINTF) printf("mult: %2.2f, alloc: %2.2f\n",mult/100.0,newext / cast(double)size); | |
| 804 } | |
| 805 newcap = newext > newcap ? newext : newcap; | |
| 806 debug(PRINTF) printf("newcap = %d, newlength = %d, size = %d\n", newcap, newlength, size); | |
| 807 } | |
| 808 return newcap; | |
| 809 } | |
| 810 | |
| 811 | |
| 812 /** | |
| 813 * | |
| 814 */ | |
| 815 extern (C) byte[] _d_arrayappendcT(TypeInfo ti, inout byte[] x, ...) | |
| 816 { | |
| 817 auto sizeelem = ti.next.tsize(); // array element size | |
| 818 auto info = gc_query(x.ptr); | |
| 819 auto length = x.length; | |
| 820 auto newlength = length + 1; | |
| 821 auto newsize = newlength * sizeelem; | |
| 822 | |
| 823 assert(info.size == 0 || length * sizeelem <= info.size); | |
| 824 | |
| 825 debug(PRINTF) printf("_d_arrayappendcT(sizeelem = %d, ptr = %p, length = %d, cap = %d)\n", sizeelem, x.ptr, x.length, info.size); | |
| 826 | |
| 827 if (info.size <= newsize || info.base != x.ptr) | |
| 828 { byte* newdata; | |
| 829 | |
| 830 if (info.size >= PAGESIZE && info.base == x.ptr) | |
| 831 { // Try to extend in-place | |
| 832 auto u = gc_extend(x.ptr, (newsize + 1) - info.size, (newsize + 1) - info.size); | |
| 833 if (u) | |
| 834 { | |
| 835 goto L1; | |
| 836 } | |
| 837 } | |
| 838 debug(PRINTF) printf("_d_arrayappendcT(length = %d, newlength = %d, cap = %d)\n", length, newlength, info.size); | |
| 839 auto newcap = newCapacity(newlength, sizeelem); | |
| 840 assert(newcap >= newlength * sizeelem); | |
| 841 newdata = cast(byte *)gc_malloc(newcap + 1, info.attr); | |
| 842 memcpy(newdata, x.ptr, length * sizeelem); | |
| 843 (cast(void**)(&x))[1] = newdata; | |
| 844 } | |
| 845 L1: | |
| 846 byte *argp = cast(byte *)(&ti + 2); | |
| 847 | |
| 848 *cast(size_t *)&x = newlength; | |
| 849 x.ptr[length * sizeelem .. newsize] = argp[0 .. sizeelem]; | |
| 850 assert((cast(size_t)x.ptr & 15) == 0); | |
| 851 assert(gc_sizeOf(x.ptr) > x.length * sizeelem); | |
| 852 return x; | |
| 853 } | |
| 854 | |
| 855 | |
| 856 /** | |
| 857 * | |
| 858 */ | |
| 859 extern (C) byte[] _d_arraycatT(TypeInfo ti, byte[] x, byte[] y) | |
| 860 out (result) | |
| 861 { | |
| 862 auto sizeelem = ti.next.tsize(); // array element size | |
| 863 debug(PRINTF) printf("_d_arraycatT(%d,%p ~ %d,%p sizeelem = %d => %d,%p)\n", x.length, x.ptr, y.length, y.ptr, sizeelem, result.length, result.ptr); | |
| 864 assert(result.length == x.length + y.length); | |
| 865 for (size_t i = 0; i < x.length * sizeelem; i++) | |
| 866 assert((cast(byte*)result)[i] == (cast(byte*)x)[i]); | |
| 867 for (size_t i = 0; i < y.length * sizeelem; i++) | |
| 868 assert((cast(byte*)result)[x.length * sizeelem + i] == (cast(byte*)y)[i]); | |
| 869 | |
| 870 size_t cap = gc_sizeOf(result.ptr); | |
| 871 assert(!cap || cap > result.length * sizeelem); | |
| 872 } | |
| 873 body | |
| 874 { | |
| 875 version (none) | |
| 876 { | |
| 877 /* Cannot use this optimization because: | |
| 878 * char[] a, b; | |
| 879 * char c = 'a'; | |
| 880 * b = a ~ c; | |
| 881 * c = 'b'; | |
| 882 * will change the contents of b. | |
| 883 */ | |
| 884 if (!y.length) | |
| 885 return x; | |
| 886 if (!x.length) | |
| 887 return y; | |
| 888 } | |
| 889 | |
| 890 debug(PRINTF) printf("_d_arraycatT(%d,%p ~ %d,%p)\n", x.length, x.ptr, y.length, y.ptr); | |
| 891 auto sizeelem = ti.next.tsize(); // array element size | |
| 892 debug(PRINTF) printf("_d_arraycatT(%d,%p ~ %d,%p sizeelem = %d)\n", x.length, x.ptr, y.length, y.ptr, sizeelem); | |
| 893 size_t xlen = x.length * sizeelem; | |
| 894 size_t ylen = y.length * sizeelem; | |
| 895 size_t len = xlen + ylen; | |
| 896 | |
| 897 if (!len) | |
| 898 return null; | |
| 899 | |
| 900 byte* p = cast(byte*)gc_malloc(len + 1, !(ti.next.flags() & 1) ? BlkAttr.NO_SCAN : 0); | |
| 901 memcpy(p, x.ptr, xlen); | |
| 902 memcpy(p + xlen, y.ptr, ylen); | |
| 903 p[len] = 0; | |
| 904 return p[0 .. x.length + y.length]; | |
| 905 } | |
| 906 | |
| 907 | |
| 908 /** | |
| 909 * | |
| 910 */ | |
| 911 extern (C) byte[] _d_arraycatnT(TypeInfo ti, uint n, ...) | |
| 912 { void* a; | |
| 913 size_t length; | |
| 914 byte[]* p; | |
| 915 uint i; | |
| 916 byte[] b; | |
| 917 auto size = ti.next.tsize(); // array element size | |
| 918 | |
| 919 p = cast(byte[]*)(&n + 1); | |
| 920 | |
| 921 for (i = 0; i < n; i++) | |
| 922 { | |
| 923 b = *p++; | |
| 924 length += b.length; | |
| 925 } | |
| 926 if (!length) | |
| 927 return null; | |
| 928 | |
| 929 a = gc_malloc(length * size, !(ti.next.flags() & 1) ? BlkAttr.NO_SCAN : 0); | |
| 930 p = cast(byte[]*)(&n + 1); | |
| 931 | |
| 932 uint j = 0; | |
| 933 for (i = 0; i < n; i++) | |
| 934 { | |
| 935 b = *p++; | |
| 936 if (b.length) | |
| 937 { | |
| 938 memcpy(a + j, b.ptr, b.length * size); | |
| 939 j += b.length * size; | |
| 940 } | |
| 941 } | |
| 942 | |
| 943 byte[] result; | |
| 944 *cast(int *)&result = length; // jam length | |
| 945 (cast(void **)&result)[1] = a; // jam ptr | |
| 946 return result; | |
| 947 } | |
| 948 | |
| 949 | |
| 950 /** | |
| 951 * | |
| 952 */ | |
| 953 extern (C) void* _d_arrayliteralT(TypeInfo ti, size_t length, ...) | |
| 954 { | |
| 955 auto sizeelem = ti.next.tsize(); // array element size | |
| 956 void* result; | |
| 957 | |
| 958 debug(PRINTF) printf("_d_arrayliteralT(sizeelem = %d, length = %d)\n", sizeelem, length); | |
| 959 if (length == 0 || sizeelem == 0) | |
| 960 result = null; | |
| 961 else | |
| 962 { | |
| 963 result = gc_malloc(length * sizeelem, !(ti.next.flags() & 1) ? BlkAttr.NO_SCAN : 0); | |
| 964 | |
| 965 va_list q; | |
| 966 va_start!(size_t)(q, length); | |
| 967 | |
| 968 size_t stacksize = (sizeelem + int.sizeof - 1) & ~(int.sizeof - 1); | |
| 969 | |
| 970 if (stacksize == sizeelem) | |
| 971 { | |
| 972 memcpy(result, q, length * sizeelem); | |
| 973 } | |
| 974 else | |
| 975 { | |
| 976 for (size_t i = 0; i < length; i++) | |
| 977 { | |
| 978 memcpy(result + i * sizeelem, q, sizeelem); | |
| 979 q += stacksize; | |
| 980 } | |
| 981 } | |
| 982 | |
| 983 va_end(q); | |
| 984 } | |
| 985 return result; | |
| 986 } | |
| 987 | |
| 988 +/ | |
| 989 | |
| 990 | |
| 991 /** | |
| 992 * Support for array.dup property. | |
| 993 */ | |
| 994 struct Array2 | |
| 995 { | |
| 996 size_t length; | |
| 997 void* ptr; | |
| 998 } | |
| 999 | |
| 1000 | |
| 1001 /** | |
| 1002 * | |
| 1003 */ | |
| 1004 extern (C) Array2 _adDupT(TypeInfo ti, Array2 a) | |
| 1005 out (result) | |
| 1006 { | |
| 1007 auto sizeelem = ti.next.tsize(); // array element size | |
| 1008 assert(memcmp(result.ptr, a.ptr, a.length * sizeelem) == 0); | |
| 1009 } | |
| 1010 body | |
| 1011 { | |
| 1012 Array2 r; | |
| 1013 | |
| 1014 if (a.length) | |
| 1015 { | |
| 1016 auto sizeelem = ti.next.tsize(); // array element size | |
| 1017 auto size = a.length * sizeelem; | |
| 1018 r.ptr = gc_malloc(size, !(ti.next.flags() & 1) ? BlkAttr.NO_SCAN : 0); | |
| 1019 r.length = a.length; | |
| 1020 memcpy(r.ptr, a.ptr, size); | |
| 1021 } | |
| 1022 return r; | |
| 1023 } | |
| 1024 | |
| 1025 | |
| 1026 unittest | |
| 1027 { | |
| 1028 int[] a; | |
| 1029 int[] b; | |
| 1030 int i; | |
| 1031 | |
| 1032 a = new int[3]; | |
| 1033 a[0] = 1; a[1] = 2; a[2] = 3; | |
| 1034 b = a.dup; | |
| 1035 assert(b.length == 3); | |
| 1036 for (i = 0; i < 3; i++) | |
| 1037 assert(b[i] == i + 1); | |
| 1038 } |