Searched refs:roots (Results 1 – 7 of 7) sorted by relevance
180 gc_globals->roots.next = &gc_globals->roots; in gc_globals_ctor_ex()181 gc_globals->roots.prev = &gc_globals->roots; in gc_globals_ctor_ex()234 GC_G(roots).next = &GC_G(roots); in gc_reset()235 GC_G(roots).prev = &GC_G(roots); in gc_reset()315 GC_G(roots).next = newRoot; in gc_possible_root()755 buf->prev = &GC_G(roots); in gc_add_garbage()757 GC_G(roots).next = buf; in gc_add_garbage()926 if (GC_G(roots).next != &GC_G(roots)) {941 GC_G(roots).next = &GC_G(roots);942 GC_G(roots).prev = &GC_G(roots);[all …]
87 gc_root_buffer roots; /* list of possible roots of cycles */ member
15 unset($GLOBALS["a"]); // this will be called in gc_colloct_roots and put $a into gc roots buf40 unset($a); // This one can not be putted into roots buf because it's full, thus gc_colloct_roots wi…42 // which will make $a be putted into gc roots buf twice
13 /* remove the self-reference array out of roots */19 /* let's full the gc roots */
626 if gc_globals->roots627 set $current = gc_globals->roots->next628 printf "looking ref %p in roots\n", $arg0629 while $current != &gc_globals->roots
183 (For example, a function in a library to compute square roots has188 root function must still compute square roots.)
122 string. (Going back to my roots: see Historical Note 1 above.) This function
Completed in 30 milliseconds
