/usr/lib/gcc/x86_64-linux-gnu/6/include/d/gcstub/gc.d is in libgphobos-6-dev 6.4.0-17ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 | /**
* This module contains a minimal garbage collector implementation according to
* published requirements. This library is mostly intended to serve as an
* example, but it is usable in applications which do not rely on a garbage
* collector to clean up memory (ie. when dynamic array resizing is not used,
* and all memory allocated with 'new' is freed deterministically with
* 'delete').
*
* Please note that block attribute data must be tracked, or at a minimum, the
* FINALIZE bit must be tracked for any allocated memory block because calling
* rt_finalize on a non-object block can result in an access violation. In the
* allocator below, this tracking is done via a leading uint bitmask. A real
* allocator may do better to store this data separately, similar to the basic
* GC.
*
* Copyright: Copyright Sean Kelly 2005 - 2009.
* License: $(WEB www.boost.org/LICENSE_1_0.txt, Boost License 1.0).
* Authors: Sean Kelly
*/
/* Copyright Sean Kelly 2005 - 2009.
* Distributed under the Boost Software License, Version 1.0.
* (See accompanying file LICENSE or copy at
* http://www.boost.org/LICENSE_1_0.txt)
*/
module gc.gc;
private
{
import core.stdc.stdlib;
import core.stdc.stdio;
static import core.memory;
private alias BlkAttr = core.memory.GC.BlkAttr;
private alias BlkInfo = core.memory.GC.BlkInfo;
extern (C) void thread_init();
extern (C) void onOutOfMemoryError(void* pretend_sideffect = null) @trusted pure nothrow @nogc; /* dmd @@@BUG11461@@@ */
struct Proxy
{
extern (C) void function() gc_enable;
extern (C) void function() gc_disable;
extern (C) void function() gc_collect;
extern (C) void function() gc_minimize;
extern (C) uint function(void*) gc_getAttr;
extern (C) uint function(void*, uint) gc_setAttr;
extern (C) uint function(void*, uint) gc_clrAttr;
extern (C) void* function(size_t, uint, const TypeInfo) gc_malloc;
extern (C) BlkInfo function(size_t, uint, const TypeInfo) gc_qalloc;
extern (C) void* function(size_t, uint, const TypeInfo) gc_calloc;
extern (C) void* function(void*, size_t, uint ba, const TypeInfo) gc_realloc;
extern (C) size_t function(void*, size_t, size_t, const TypeInfo) gc_extend;
extern (C) size_t function(size_t) gc_reserve;
extern (C) void function(void*) gc_free;
extern (C) void* function(void*) gc_addrOf;
extern (C) size_t function(void*) gc_sizeOf;
extern (C) BlkInfo function(void*) gc_query;
extern (C) void function(void*) gc_addRoot;
extern (C) void function(void*, size_t, const TypeInfo ti) gc_addRange;
extern (C) void function(void*) gc_removeRoot;
extern (C) void function(void*) gc_removeRange;
extern (C) void function(in void[]) gc_runFinalizers;
}
__gshared Proxy pthis;
__gshared Proxy* proxy;
void initProxy()
{
pthis.gc_enable = &gc_enable;
pthis.gc_disable = &gc_disable;
pthis.gc_collect = &gc_collect;
pthis.gc_minimize = &gc_minimize;
pthis.gc_getAttr = &gc_getAttr;
pthis.gc_setAttr = &gc_setAttr;
pthis.gc_clrAttr = &gc_clrAttr;
pthis.gc_malloc = &gc_malloc;
pthis.gc_qalloc = &gc_qalloc;
pthis.gc_calloc = &gc_calloc;
pthis.gc_realloc = &gc_realloc;
pthis.gc_extend = &gc_extend;
pthis.gc_reserve = &gc_reserve;
pthis.gc_free = &gc_free;
pthis.gc_addrOf = &gc_addrOf;
pthis.gc_sizeOf = &gc_sizeOf;
pthis.gc_query = &gc_query;
pthis.gc_addRoot = &gc_addRoot;
pthis.gc_addRange = &gc_addRange;
pthis.gc_removeRoot = &gc_removeRoot;
pthis.gc_removeRange = &gc_removeRange;
pthis.gc_runFinalizers = &gc_runFinalizers;
}
__gshared void** roots = null;
__gshared size_t nroots = 0;
struct Range
{
void* pos;
size_t len;
TypeInfo ti; // should be tail const, but doesn't exist for references
}
__gshared Range* ranges = null;
__gshared size_t nranges = 0;
}
extern (C) void gc_init()
{
// NOTE: The GC must initialize the thread library before its first
// collection, and always before returning from gc_init().
thread_init();
initProxy();
}
extern (C) void gc_term()
{
free( roots );
free( ranges );
}
extern (C) void gc_enable()
{
if( proxy is null )
return;
return proxy.gc_enable();
}
extern (C) void gc_disable()
{
if( proxy is null )
return;
return proxy.gc_disable();
}
extern (C) void gc_collect()
{
if( proxy is null )
return;
return proxy.gc_collect();
}
extern (C) void gc_minimize()
{
if( proxy is null )
return;
return proxy.gc_minimize();
}
extern (C) uint gc_getAttr( void* p )
{
if( proxy is null )
return 0;
return proxy.gc_getAttr( p );
}
extern (C) uint gc_setAttr( void* p, uint a )
{
if( proxy is null )
return 0;
return proxy.gc_setAttr( p, a );
}
extern (C) uint gc_clrAttr( void* p, uint a )
{
if( proxy is null )
return 0;
return proxy.gc_clrAttr( p, a );
}
extern (C) void* gc_malloc( size_t sz, uint ba = 0, const TypeInfo ti = null )
{
if( proxy is null )
{
void* p = malloc( sz );
if( sz && p is null )
onOutOfMemoryError();
return p;
}
return proxy.gc_malloc( sz, ba, ti );
}
extern (C) BlkInfo gc_qalloc( size_t sz, uint ba = 0, const TypeInfo ti = null )
{
if( proxy is null )
{
BlkInfo retval;
retval.base = gc_malloc(sz, ba);
retval.size = sz;
retval.attr = ba;
return retval;
}
return proxy.gc_qalloc( sz, ba, ti );
}
extern (C) void* gc_calloc( size_t sz, uint ba = 0, const TypeInfo ti = null )
{
if( proxy is null )
{
void* p = calloc( 1, sz );
if( sz && p is null )
onOutOfMemoryError();
return p;
}
return proxy.gc_calloc( sz, ba, ti );
}
extern (C) void* gc_realloc( void* p, size_t sz, uint ba = 0, const TypeInfo ti = null )
{
if( proxy is null )
{
p = realloc( p, sz );
if( sz && p is null )
onOutOfMemoryError();
return p;
}
return proxy.gc_realloc( p, sz, ba, ti );
}
extern (C) size_t gc_extend( void* p, size_t mx, size_t sz, const TypeInfo ti = null )
{
if( proxy is null )
return 0;
return proxy.gc_extend( p, mx, sz, ti );
}
extern (C) size_t gc_reserve( size_t sz )
{
if( proxy is null )
return 0;
return proxy.gc_reserve( sz );
}
extern (C) void gc_free( void* p )
{
if( proxy is null )
return free( p );
return proxy.gc_free( p );
}
extern (C) void* gc_addrOf( void* p )
{
if( proxy is null )
return null;
return proxy.gc_addrOf( p );
}
extern (C) size_t gc_sizeOf( void* p )
{
if( proxy is null )
return 0;
return proxy.gc_sizeOf( p );
}
extern (C) BlkInfo gc_query( void* p )
{
if( proxy is null )
return BlkInfo.init;
return proxy.gc_query( p );
}
extern (C) void gc_addRoot( void* p )
{
if( proxy is null )
{
void** r = cast(void**) realloc( roots,
(nroots+1) * roots[0].sizeof );
if( r is null )
onOutOfMemoryError();
r[nroots++] = p;
roots = r;
return;
}
return proxy.gc_addRoot( p );
}
extern (C) void gc_addRange( void* p, size_t sz, const TypeInfo ti = null )
{
//printf("gcstub::gc_addRange() proxy = %p\n", proxy);
if( proxy is null )
{
Range* r = cast(Range*) realloc( ranges,
(nranges+1) * ranges[0].sizeof );
if( r is null )
onOutOfMemoryError();
r[nranges].pos = p;
r[nranges].len = sz;
r[nranges].ti = cast()ti;
ranges = r;
++nranges;
return;
}
return proxy.gc_addRange( p, sz, ti );
}
extern (C) void gc_removeRoot( void *p )
{
if( proxy is null )
{
for( size_t i = 0; i < nroots; ++i )
{
if( roots[i] is p )
{
roots[i] = roots[--nroots];
return;
}
}
assert( false );
}
return proxy.gc_removeRoot( p );
}
extern (C) void gc_removeRange( void *p )
{
if( proxy is null )
{
for( size_t i = 0; i < nranges; ++i )
{
if( ranges[i].pos is p )
{
ranges[i] = ranges[--nranges];
return;
}
}
assert( false );
}
return proxy.gc_removeRange( p );
}
extern (C) void gc_runFinalizers( in void[] segment )
{
if( proxy !is null )
proxy.gc_runFinalizers( segment );
}
extern (C) Proxy* gc_getProxy()
{
return &pthis;
}
export extern (C) void gc_setProxy( Proxy* p )
{
if( proxy !is null )
{
// TODO: Decide if this is an error condition.
}
proxy = p;
foreach( r; roots[0 .. nroots] )
proxy.gc_addRoot( r );
foreach( r; ranges[0 .. nranges] )
proxy.gc_addRange( r.pos, r.len, r.ti );
}
export extern (C) void gc_clrProxy()
{
foreach( r; ranges[0 .. nranges] )
proxy.gc_removeRange( r.pos );
foreach( r; roots[0 .. nroots] )
proxy.gc_removeRoot( r );
proxy = null;
}
|