Searched refs:roots (Results 1 – 4 of 4) sorted by relevance
48 gc_globals->roots.next = &gc_globals->roots; in gc_globals_ctor_ex()49 gc_globals->roots.prev = &gc_globals->roots; in gc_globals_ctor_ex()106 GC_G(roots).next = &GC_G(roots); in gc_reset()107 GC_G(roots).prev = &GC_G(roots); in gc_reset()173 newRoot->next = GC_G(roots).next; in gc_zval_possible_root()174 newRoot->prev = &GC_G(roots); in gc_zval_possible_root()176 GC_G(roots).next = newRoot; in gc_zval_possible_root()228 newRoot->prev = &GC_G(roots); in gc_zobj_possible_root()230 GC_G(roots).next = newRoot; in gc_zobj_possible_root()477 while (current != &GC_G(roots)) { in gc_mark_roots()[all …]
104 gc_root_buffer roots; /* list of possible roots of cycles */ member
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 12 milliseconds
