Searched refs:child (Results 1 - 25 of 283) sorted by relevance

1234567891011>>

/haiku/src/system/libroot/posix/pthread/
H A Dpthread_atfork.c12 pthread_atfork(void (*prepare)(void), void (*parent)(void), void (*child)(void)) argument
14 return __register_atfork(prepare, parent, child);
/haiku/src/tests/add-ons/print/ppd/ui/
H A DUIUtils.cpp24 BView* child; local
25 while ((child = view->ChildAt(0)) != NULL) {
26 child->RemoveSelf();
27 delete child;
/haiku/headers/private/interface/
H A DViewPort.h20 BViewPort(BView* child = NULL);
21 BViewPort(BLayoutItem* child);
23 BView* child = NULL);
25 BLayoutItem* child);
29 void SetChildView(BView* child);
32 void SetChildItem(BLayoutItem* child);
/haiku/src/tests/system/libroot/posix/
H A Duser_thread_fork_test.cpp14 pid_t child = fork(); local
15 if (child < 0) {
20 if (child > 0) {
21 // the parent process -- wait for the child to finish
23 wait_for_thread(child, &result);
H A Dinit_rld_after_fork_test.cpp25 pid_t child = fork(); local
26 if (child < 0) {
31 if (child > 0) {
32 // the parent process -- wait for the child to finish
34 wait_for_thread(child, &result);
37 list_semaphores(child == 0 ? "child" : "parent");
/haiku/src/tests/system/kernel/
H A Dcow_bug113_test.cpp29 pid_t child = fork(); local
30 if (child == 0) {
31 // child
32 child = find_thread(NULL);
38 printf("[%ld] child: after kernel read: globalVar: \"%s\"\n",
39 child, globalVar);
44 printf("[%ld] child: after change: globalVar: \"%s\"\n", child,
50 // wait for the child
52 while (wait_for_thread(child,
[all...]
H A Dwait_test_2.cpp16 an error (and errno to ECHILD), since there is no child with that process group ID.
28 //! exits before child 2
35 pid_t child = fork(); local
36 if (child == 0)
49 pid_t child = fork(); local
50 if (child == 0)
60 printf("wait() returned %ld (%s), child status %d\n",
H A Dwait_test_3.cpp22 printf("child 2 1. parent id = %ld\n", getppid());
24 printf("child 2 2. parent id = %ld\n", getppid());
29 //! exits before child 2
33 printf("child 1 process group: %ld\n", getpgrp());
35 pid_t child = fork(); local
36 if (child == 0)
48 pid_t child = fork(); local
49 if (child == 0)
56 printf("waitpid() returned %ld (%s), child status %d\n", pid, strerror(errno), childStatus);
H A Dwait_test_4.cpp16 an error (and errno to ECHILD), since there is no child with that process group ID.
28 //! exits before child 2
32 pid_t child = fork(); local
33 if (child == 0)
49 pid_t child = fork(); local
50 if (child == 0)
60 printf("wait() returned %ld (%s), child status %d\n",
H A Dpage_fault_cache_merge_test.cpp32 pid_t child = fork(); local
33 if (child < 0) {
38 if (child == 0) {
39 // child
54 while (wait(&status) != child);
/haiku/headers/private/libroot/
H A Dfork.h17 void(*child)(void));
/haiku/src/libs/posix_error_mapper/
H A Dpthread_misc.cpp12 (void (*prepare)(void), void (*parent)(void), void (*child)(void)),
13 return B_TO_POSITIVE_ERROR(sReal_pthread_atfork(prepare, parent, child));
/haiku/src/system/libroot/posix/sys/
H A Dwait.cpp31 pid_t child = _kern_wait_for_child(pid, options | WEXITED, &info, local
36 if (child < 0) {
37 // When not getting a child status when WNOHANG was specified, don't
39 if (child == B_WOULD_BLOCK && (options & WNOHANG) != 0)
41 RETURN_AND_SET_ERRNO(child);
83 return child;
100 // any child
105 // the child with the given ID
111 // any child in the given process group
121 pid_t child local
[all...]
/haiku/src/add-ons/kernel/file_systems/ramfs/
H A DDirectoryEntryTable.h56 status_t AddEntry(Directory *node, Entry *child);
57 status_t AddEntry(ino_t, Entry *child);
58 status_t RemoveEntry(Directory *node, Entry *child);
59 status_t RemoveEntry(ino_t id, Entry *child);
94 DirectoryEntryTable::AddEntry(Directory *node, Entry *child) argument
96 status_t error = (node && child ? B_OK : B_BAD_VALUE);
98 error = AddEntry(node->GetID(), child);
104 DirectoryEntryTable::AddEntry(ino_t id, Entry *child) argument
106 status_t error = (child ? B_OK : B_BAD_VALUE);
108 RemoveEntry(id, child);
116 RemoveEntry(Directory *node, Entry *child) argument
126 RemoveEntry(ino_t id, Entry *child) argument
138 Entry* child = fTable.Lookup(DirectoryEntryHash::Key(id, name)); local
148 Entry *child = fTable.Lookup(DirectoryEntryHash::Key(id, name)); local
[all...]
/haiku/src/kits/storage/disk_device/
H A DPartitionDelegate.cpp117 BMutablePartition* child = fMutablePartition.ChildAt(index); local
118 return child ? child->GetDelegate() : NULL;
151 BPartition::Delegate::SupportedChildOperations(Delegate* child, argument
157 return fPartitionHandle->SupportedChildOperations(child->MutablePartition(),
195 BPartition::Delegate::ValidateResizeChild(Delegate* child, off_t* size) const argument
197 if (!fPartitionHandle || !child)
200 return fPartitionHandle->ValidateResizeChild(&child->fMutablePartition,
218 BPartition::Delegate::ResizeChild(Delegate* child, off_t size) argument
220 if (!fPartitionHandle || !child)
240 ValidateMoveChild(Delegate* child, off_t* offset) const argument
263 MoveChild(Delegate* child, off_t offset) argument
285 ValidateSetName(Delegate* child, BString* name) const argument
307 SetName(Delegate* child, const char* name) argument
318 ValidateSetType(Delegate* child, const char* type) const argument
329 SetType(Delegate* child, const char* type) argument
351 SetParameters(Delegate* child, const char* parameters) argument
363 GetNextSupportedChildType(Delegate* child, int32* cookie, BString* type) const argument
381 IsSubSystem(Delegate* child, const char* diskSystem) const argument
521 CreateChild(off_t start, off_t size, const char* type, const char* name, const char* parameters, BPartition** child) argument
542 DeleteChild(Delegate* child) argument
[all...]
H A DDiskDeviceJob.cpp13 PartitionReference* child)
16 fChild(child)
12 DiskDeviceJob(PartitionReference* partition, PartitionReference* child) argument
H A DPartitionDelegate.h40 uint32 SupportedChildOperations(Delegate* child,
49 status_t ValidateResizeChild(Delegate* child,
52 status_t ResizeChild(Delegate* child, off_t size);
55 status_t ValidateMoveChild(Delegate* child,
58 status_t MoveChild(Delegate* child, off_t offset);
61 status_t ValidateSetName(Delegate* child,
64 status_t SetName(Delegate* child, const char* name);
66 status_t ValidateSetType(Delegate* child,
68 status_t SetType(Delegate* child, const char* type);
71 status_t SetParameters(Delegate* child,
[all...]
/haiku/src/kits/interface/
H A DViewPort.cpp115 BLayoutItem* child = ItemAt(0); local
116 if (child == NULL)
124 BSize childMin = child->MinSize();
125 BSize childMax = child->MaxSize();
137 child->AlignInFrame(BRect(BPoint(0, 0), layoutSize));
161 if (BLayoutItem* child = ItemAt(0)) {
162 fMin = child->MinSize();
167 fMax = child->MaxSize();
168 fPreferred = child->PreferredSize();
220 BViewPort::BViewPort(BView* child) argument
230 BViewPort(BLayoutItem* child) argument
240 BViewPort(const char* name, BView* child) argument
250 BViewPort(const char* name, BLayoutItem* child) argument
273 SetChildView(BView* child) argument
288 SetChildItem(BLayoutItem* child) argument
[all...]
/haiku/src/kits/debugger/value/
H A DValueNodeContainer.cpp55 ValueNodeContainer::AddChild(ValueNodeChild* child) argument
59 if (!fChildren.AddItem(child))
62 child->AcquireReference();
63 child->SetContainer(this);
70 ValueNodeContainer::RemoveChild(ValueNodeChild* child) argument
72 if (child->Container() != this || !fChildren.RemoveItem(child))
75 child->SetNode(NULL);
76 child->SetContainer(NULL);
77 child
[all...]
/haiku/src/add-ons/disk_systems/gpt/
H A DGPTPartitionHandle.cpp81 // creating child
95 GPTPartitionHandle::SupportedChildOperations(const BMutablePartition* child, argument
108 GPTPartitionHandle::GetNextSupportedType(const BMutablePartition* child, argument
112 TRACE("GPTPartitionHandle::GetNextSupportedType(child: %p, cookie: %" B_PRId32 ")\n",
113 child, index);
140 BMutablePartition* child = Partition()->ChildAt(index); local
141 status = info->ExcludeOccupiedSpace(child->Offset(), child->Size());
168 GPTPartitionHandle::ValidateSetName(const BMutablePartition *child, BString* name) argument
192 GPTPartitionHandle::SetName(BMutablePartition* child, cons argument
213 BMutablePartition* child; local
230 DeleteChild(BMutablePartition* child) argument
[all...]
/haiku/src/kits/device/
H A DUSBRoster.cpp79 WatchedEntry *child = new(std::nothrow) WatchedEntry(fRoster, local
81 if (child == NULL)
84 child->fLink = fEntries;
85 fEntries = child;
112 WatchedEntry *child = fEntries; local
113 while (child) {
114 WatchedEntry *next = child->fLink;
115 delete child;
116 child = next;
134 WatchedEntry *child local
144 WatchedEntry *child = new(std::nothrow) WatchedEntry(fRoster, fMessenger, local
[all...]
/haiku/src/tests/kits/interface/layout/widget_layout_test/
H A DView.cpp196 View::AddChild(View* child) argument
198 if (!child)
201 if (child->Parent() || child->Container()) {
203 "or is the container view\n", child);
207 if (!fChildren.AddItem(child))
210 child->_AddedToParent(this);
212 child->Invalidate();
220 View::RemoveChild(View* child) argument
222 if (!child)
283 View* child = view->ChildAt(point); local
[all...]
/haiku/src/apps/icon-o-matic/generic/gui/scrollview/
H A DScrollableView.cpp35 for (int32 i = 0; BView* child = view->ChildAt(i); i++)
36 child->MoveTo(child->Frame().LeftTop() + oldOffset - newOffset);
/haiku/headers/private/storage/
H A DDiskSystemAddOn.h47 virtual bool IsSubSystemFor(const BMutablePartition* child);
64 const BMutablePartition* child,
68 const BMutablePartition* child,
72 const BMutablePartition* child,
74 // child can be NULL
84 const BMutablePartition* child,
87 virtual status_t ResizeChild(BMutablePartition* child,
92 const BMutablePartition* child,
95 virtual status_t MoveChild(BMutablePartition* child,
99 virtual status_t ValidateSetName(const BMutablePartition* child,
[all...]
/haiku/src/system/libroot/posix/stdlib/
H A Dheapsort.c79 #define CREATE(initval, nmemb, par_i, child_i, par, child, size, count, tmp) { \
82 child = base + child_i * size; \
83 if (child_i < nmemb && compar(child, child + size) < 0) { \
84 child += size; \
88 if (compar(child, par) <= 0) \
90 SWAP(par, child, count, size, tmp); \
99 * heapify, always maintaining the invariant that the larger child is copied
111 #define SELECT(par_i, child_i, nmemb, par, child, size, k, count, tmp1, tmp2) { \
113 child
[all...]

Completed in 268 milliseconds

1234567891011>>