Searched defs:child (Results 1 - 5 of 5) sorted by relevance
/bionic/libc/bionic/ |
H A D | pthread_atfork.cpp | 37 void (*child)(void); member in struct:atfork_t 50 // We lock the atfork list here, unlock it in the parent, and reset it in the child. 52 // to the prepare and parent/child handlers. 55 // the list before forking, and have prepare, parent, and child all work on the consistent copy. 59 // handlers should be called in the reverse order of the parent/child 70 if (it->child != NULL) { 71 it->child(); 88 int pthread_atfork(void (*prepare)(void), void (*parent)(void), void(*child)(void)) { 96 entry->child = child; [all...] |
/bionic/tests/ |
H A D | dlext_test.cpp | 203 // child process 208 fprintf(stderr, "in child: %s\n", dlerror()); 317 pid_t child = fork(); local 318 if (child == 0) { 319 // close the 'wrong' ends of the pipes in the child 331 fprintf(stderr, "in child: %s\n", dlerror()); 343 ASSERT_NOERROR(child); 349 // wait for the child to be done 353 // save the child's pid and the parent_done_pipe 354 childpid[i] = child; [all...] |
/bionic/linker/ |
H A D | linker.cpp | 636 current_soinfo->get_children().for_each([&](soinfo* child) { 637 visit_list.push_back(child); 856 si->get_children().for_each([&] (soinfo* child) { 857 TRACE("%s needs to unload %s", si->name, child->name); 858 soinfo_unload(child); 1536 void soinfo::add_child(soinfo* child) { argument 1541 this->children.push_front(child); 1542 child->parents.push_front(this); 1551 children.for_each([&] (soinfo* child) { 1552 child [all...] |
/bionic/libc/kernel/uapi/linux/ |
H A D | fuse.h | 542 uint64_t child; member in struct:fuse_notify_delete_out
|
/bionic/libc/upstream-dlmalloc/ |
H A D | malloc.c | 283 to initialize child lock while holding parent lock. The implementation 2341 | Pointer to left child (child[0]) | 2343 | Pointer to right child (child[1]) | 2380 the tree. Unlike a usual binary tree, where we follow left child 2381 pointers until we reach a null, here we follow the right child 2383 both child pointers null. The smallest chunk in the tree will be 2400 struct malloc_tree_chunk* child[2]; member in struct:malloc_tree_chunk 2410 #define leftmost_child(t) ((t)->child[ [all...] |
Completed in 101 milliseconds