Searched refs:child (Results 1 - 12 of 12) 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/libc/arch-arm64/bionic/ |
| H A D | __bionic_clone.S | 34 # Copy 'fn' and 'arg' onto the child stack.
41 # Are we the child?
52 # We're in the child now. Set the end of the frame record chain...
56 # ...and call __start_thread with the 'fn' and 'arg' we stored on the child stack.
|
| /bionic/libc/arch-mips/bionic/ |
| H A D | __bionic_clone.S | 39 # set up child stack
57 # Clear return address in child so we don't unwind further.
|
| /bionic/libc/arch-mips64/bionic/ |
| H A D | __bionic_clone.S | 50 # set up child stack
58 PTR_L t0,FRAME_GP(sp) # copy gp to child stack
78 # Clear return address in child so we don't unwind further.
87 * For O32 etc the child stack must have space for a0..a3 to be stored
88 * For N64 etc, the child stack can be restored to the original value
|
| /bionic/libc/arch-arm/bionic/ |
| H A D | __bionic_clone.S | 45 # store 'fn' and 'arg' to the child stack
62 1: # The child.
|
| /bionic/libc/arch-x86_64/bionic/ |
| H A D | __bionic_clone.S | 33 # Copy 'fn' and 'arg' onto the child stack.
65 # We're in the child now, so call __start_thread
66 # with the arguments from the child stack moved into
|
| /bionic/libc/arch-x86/bionic/ |
| H A D | __bionic_clone.S | 16 # Copy 'fn' and 'arg' onto the child stack
|
| /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...] |
| /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.h | 202 void add_child(soinfo* child);
|
| 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
|
Completed in 284 milliseconds