+#endif
+#if SYSV_SEM
+ /* Release SYSV semaphores */
+ semexit(p);
+#endif
+
+#if PSYNCH
+ pth_proc_hashdelete(p);
+#endif /* PSYNCH */
+
+ sessp = proc_session(p);
+ if (SESS_LEADER(p, sessp)) {
+ if (sessp->s_ttyvp != NULLVP) {
+ struct vnode *ttyvp;
+ int ttyvid;
+ int cttyflag = 0;
+ struct vfs_context context;
+ struct tty *tp;
+
+ /*
+ * Controlling process.
+ * Signal foreground pgrp,
+ * drain controlling terminal
+ * and revoke access to controlling terminal.
+ */
+ session_lock(sessp);
+ tp = SESSION_TP(sessp);
+ if ((tp != TTY_NULL) && (tp->t_session == sessp)) {
+ session_unlock(sessp);
+
+ tty_pgsignal(tp, SIGHUP, 1);
+
+ session_lock(sessp);
+ tp = SESSION_TP(sessp);
+ }
+ cttyflag = sessp->s_flags & S_CTTYREF;
+ sessp->s_flags &= ~S_CTTYREF;
+ ttyvp = sessp->s_ttyvp;
+ ttyvid = sessp->s_ttyvid;
+ sessp->s_ttyvp = NULLVP;
+ sessp->s_ttyvid = 0;
+ sessp->s_ttyp = TTY_NULL;
+ sessp->s_ttypgrpid = NO_PID;
+ session_unlock(sessp);
+
+ if ((ttyvp != NULLVP) && (vnode_getwithvid(ttyvp, ttyvid) == 0)) {
+ if (tp != TTY_NULL) {
+ tty_lock(tp);
+ (void) ttywait(tp);
+ tty_unlock(tp);
+ }
+
+ context.vc_thread = NULL;
+ context.vc_ucred = kauth_cred_proc_ref(p);
+ VNOP_REVOKE(ttyvp, REVOKEALL, &context);
+ if (cttyflag) {
+ /*
+ * Release the extra usecount taken in cttyopen.
+ * usecount should be released after VNOP_REVOKE is called.
+ * This usecount was taken to ensure that
+ * the VNOP_REVOKE results in a close to
+ * the tty since cttyclose is a no-op.
+ */
+ vnode_rele(ttyvp);
+ }
+ vnode_put(ttyvp);
+ kauth_cred_unref(&context.vc_ucred);
+ ttyvp = NULLVP;
+ }
+ if (tp) {
+ ttyfree(tp);
+ }
+ }
+ session_lock(sessp);
+ sessp->s_leader = NULL;
+ session_unlock(sessp);
+ }
+ session_rele(sessp);
+
+ pg = proc_pgrp(p);
+ fixjobc(p, pg, 0);
+ pg_rele(pg);
+
+ /*
+ * Change RLIMIT_FSIZE for accounting/debugging. proc_limitsetcur_internal() will COW the current plimit
+ * before making changes if the current plimit is shared. The COW'ed plimit will be freed
+ * below by calling proc_limitdrop().
+ */
+ proc_limitsetcur_internal(p, RLIMIT_FSIZE, RLIM_INFINITY);
+
+ (void)acct_process(p);
+
+ proc_list_lock();
+
+ if ((p->p_listflag & P_LIST_EXITCOUNT) == P_LIST_EXITCOUNT) {
+ p->p_listflag &= ~P_LIST_EXITCOUNT;
+ proc_shutdown_exitcount--;
+ if (proc_shutdown_exitcount == 0) {
+ wakeup(&proc_shutdown_exitcount);
+ }
+ }
+
+ /* wait till parentrefs are dropped and grant no more */
+ proc_childdrainstart(p);
+ while ((q = p->p_children.lh_first) != NULL) {
+ int reparentedtoinit = (q->p_listflag & P_LIST_DEADPARENT) ? 1 : 0;
+ if (q->p_stat == SZOMB) {
+ if (p != q->p_pptr) {
+ panic("parent child linkage broken");
+ }
+ /* check for sysctl zomb lookup */
+ while ((q->p_listflag & P_LIST_WAITING) == P_LIST_WAITING) {
+ msleep(&q->p_stat, proc_list_mlock, PWAIT, "waitcoll", 0);
+ }
+ q->p_listflag |= P_LIST_WAITING;
+ /*
+ * This is a named reference and it is not granted
+ * if the reap is already in progress. So we get
+ * the reference here exclusively and their can be
+ * no waiters. So there is no need for a wakeup
+ * after we are done. Also the reap frees the structure
+ * and the proc struct cannot be used for wakeups as well.
+ * It is safe to use q here as this is system reap
+ */
+ (void)reap_child_locked(p, q, 1, reparentedtoinit, 1, 0);
+ } else {
+ /*
+ * Traced processes are killed
+ * since their existence means someone is messing up.
+ */
+ if (q->p_lflag & P_LTRACED) {
+ struct proc *opp;
+
+ /*
+ * Take a reference on the child process to
+ * ensure it doesn't exit and disappear between
+ * the time we drop the list_lock and attempt
+ * to acquire its proc_lock.
+ */
+ if (proc_ref_locked(q) != q) {
+ continue;
+ }
+
+ proc_list_unlock();
+
+ opp = proc_find(q->p_oppid);
+ if (opp != PROC_NULL) {
+ proc_list_lock();
+ q->p_oppid = 0;
+ proc_list_unlock();
+ proc_reparentlocked(q, opp, 0, 0);
+ proc_rele(opp);
+ } else {
+ /* original parent exited while traced */
+ proc_list_lock();
+ q->p_listflag |= P_LIST_DEADPARENT;
+ q->p_oppid = 0;
+ proc_list_unlock();
+ proc_reparentlocked(q, initproc, 0, 0);
+ }
+
+ proc_lock(q);
+ q->p_lflag &= ~P_LTRACED;
+
+ if (q->sigwait_thread) {
+ thread_t thread = q->sigwait_thread;
+
+ proc_unlock(q);
+ /*
+ * The sigwait_thread could be stopped at a
+ * breakpoint. Wake it up to kill.
+ * Need to do this as it could be a thread which is not
+ * the first thread in the task. So any attempts to kill
+ * the process would result into a deadlock on q->sigwait.
+ */
+ thread_resume(thread);
+ clear_wait(thread, THREAD_INTERRUPTED);
+ threadsignal(thread, SIGKILL, 0, TRUE);
+ } else {
+ proc_unlock(q);
+ }
+
+ psignal(q, SIGKILL);
+ proc_list_lock();
+ proc_rele_locked(q);
+ } else {
+ q->p_listflag |= P_LIST_DEADPARENT;
+ proc_reparentlocked(q, initproc, 0, 1);
+ }
+ }
+ }
+
+ proc_childdrainend(p);
+ proc_list_unlock();
+
+#if CONFIG_MACF
+ /*
+ * Notify MAC policies that proc is dead.
+ * This should be replaced with proper label management
+ * (rdar://problem/32126399).
+ */
+ mac_proc_notify_exit(p);
+#endif
+
+ /*
+ * Release reference to text vnode
+ */
+ tvp = p->p_textvp;
+ p->p_textvp = NULL;
+ if (tvp != NULLVP) {
+ vnode_rele(tvp);
+ }
+
+ /*
+ * Save exit status and final rusage info, adding in child rusage
+ * info and self times. If we were unable to allocate a zombie
+ * structure, this information is lost.
+ */
+ if (p->p_ru != NULL) {
+ calcru(p, &p->p_stats->p_ru.ru_utime, &p->p_stats->p_ru.ru_stime, NULL);
+ p->p_ru->ru = p->p_stats->p_ru;
+
+ ruadd(&(p->p_ru->ru), &p->p_stats->p_cru);
+ }
+
+ /*
+ * Free up profiling buffers.
+ */
+ {
+ struct uprof *p0 = &p->p_stats->p_prof, *p1, *pn;
+
+ p1 = p0->pr_next;
+ p0->pr_next = NULL;
+ p0->pr_scale = 0;
+
+ for (; p1 != NULL; p1 = pn) {
+ pn = p1->pr_next;
+ kfree(p1, sizeof *p1);
+ }
+ }
+
+ proc_free_realitimer(p);
+
+ /*
+ * Other substructures are freed from wait().
+ */
+ zfree(proc_stats_zone, p->p_stats);
+ p->p_stats = NULL;
+
+ zfree(proc_sigacts_zone, p->p_sigacts);
+ p->p_sigacts = NULL;
+
+ proc_limitdrop(p);
+
+ /*
+ * Finish up by terminating the task
+ * and halt this thread (only if a
+ * member of the task exiting).
+ */
+ p->task = TASK_NULL;
+ set_bsdtask_info(task, NULL);
+
+ knote_hint = NOTE_EXIT | (p->p_xstat & 0xffff);
+ proc_knote(p, knote_hint);
+
+ /* mark the thread as the one that is doing proc_exit
+ * no need to hold proc lock in uthread_free
+ */
+ uth->uu_flag |= UT_PROCEXIT;
+ /*
+ * Notify parent that we're gone.
+ */
+ pp = proc_parent(p);
+ if (pp->p_flag & P_NOCLDWAIT) {
+ if (p->p_ru != NULL) {
+ proc_lock(pp);
+#if 3839178
+ /*
+ * If the parent is ignoring SIGCHLD, then POSIX requires
+ * us to not add the resource usage to the parent process -
+ * we are only going to hand it off to init to get reaped.
+ * We should contest the standard in this case on the basis
+ * of RLIMIT_CPU.
+ */
+#else /* !3839178 */
+ /*
+ * Add child resource usage to parent before giving
+ * zombie to init. If we were unable to allocate a
+ * zombie structure, this information is lost.
+ */
+ ruadd(&pp->p_stats->p_cru, &p->p_ru->ru);
+#endif /* !3839178 */
+ update_rusage_info_child(&pp->p_stats->ri_child, &p->p_ru->ri);
+ proc_unlock(pp);
+ }
+
+ /* kernel can reap this one, no need to move it to launchd */
+ proc_list_lock();
+ p->p_listflag |= P_LIST_DEADPARENT;
+ proc_list_unlock();
+ }
+ if ((p->p_listflag & P_LIST_DEADPARENT) == 0 || p->p_oppid) {
+ if (pp != initproc) {
+ proc_lock(pp);
+ pp->si_pid = p->p_pid;
+ pp->p_xhighbits = p->p_xhighbits;
+ p->p_xhighbits = 0;
+ pp->si_status = p->p_xstat;
+ pp->si_code = CLD_EXITED;
+ /*
+ * p_ucred usage is safe as it is an exiting process
+ * and reference is dropped in reap
+ */
+ pp->si_uid = kauth_cred_getruid(p->p_ucred);
+ proc_unlock(pp);
+ }
+ /* mark as a zombie */
+ /* No need to take proc lock as all refs are drained and
+ * no one except parent (reaping ) can look at this.
+ * The write is to an int and is coherent. Also parent is
+ * keyed off of list lock for reaping
+ */
+ DTRACE_PROC2(exited, proc_t, p, int, exitval);
+ KERNEL_DEBUG_CONSTANT_IST(KDEBUG_COMMON,
+ BSDDBG_CODE(DBG_BSD_PROC, BSD_PROC_EXIT) | DBG_FUNC_END,
+ pid, exitval, 0, 0, 0);
+ p->p_stat = SZOMB;
+ /*
+ * The current process can be reaped so, no one
+ * can depend on this
+ */
+
+ psignal(pp, SIGCHLD);
+
+ /* and now wakeup the parent */
+ proc_list_lock();
+ wakeup((caddr_t)pp);
+ proc_list_unlock();
+ } else {
+ /* should be fine as parent proc would be initproc */
+ /* mark as a zombie */
+ /* No need to take proc lock as all refs are drained and
+ * no one except parent (reaping ) can look at this.
+ * The write is to an int and is coherent. Also parent is
+ * keyed off of list lock for reaping
+ */
+ DTRACE_PROC2(exited, proc_t, p, int, exitval);
+ proc_list_lock();
+ KERNEL_DEBUG_CONSTANT_IST(KDEBUG_COMMON,
+ BSDDBG_CODE(DBG_BSD_PROC, BSD_PROC_EXIT) | DBG_FUNC_END,
+ pid, exitval, 0, 0, 0);
+ /* check for sysctl zomb lookup */
+ while ((p->p_listflag & P_LIST_WAITING) == P_LIST_WAITING) {
+ msleep(&p->p_stat, proc_list_mlock, PWAIT, "waitcoll", 0);
+ }
+ /* safe to use p as this is a system reap */
+ p->p_stat = SZOMB;
+ p->p_listflag |= P_LIST_WAITING;
+
+ /*
+ * This is a named reference and it is not granted
+ * if the reap is already in progress. So we get
+ * the reference here exclusively and their can be
+ * no waiters. So there is no need for a wakeup
+ * after we are done. AlsO the reap frees the structure
+ * and the proc struct cannot be used for wakeups as well.
+ * It is safe to use p here as this is system reap
+ */
+ (void)reap_child_locked(pp, p, 1, 0, 1, 1);
+ /* list lock dropped by reap_child_locked */
+ }
+ if (uth->uu_lowpri_window) {
+ /*
+ * task is marked as a low priority I/O type and we've
+ * somehow picked up another throttle during exit processing...
+ * no need to throttle this thread since its going away
+ * but we do need to update our bookeeping w/r to throttled threads
+ */
+ throttle_lowpri_io(0);
+ }
+
+ proc_rele(pp);
+}
+
+
+/*
+ * reap_child_locked
+ *
+ * Description: Given a process from which all status information needed
+ * has already been extracted, if the process is a ptrace
+ * attach process, detach it and give it back to its real
+ * parent, else recover all resources remaining associated
+ * with it.
+ *
+ * Parameters: proc_t parent Parent of process being reaped
+ * proc_t child Process to reap
+ *
+ * Returns: 0 Process was not reaped because it
+ * came from an attach
+ * 1 Process was reaped
+ */
+static int
+reap_child_locked(proc_t parent, proc_t child, int deadparent, int reparentedtoinit, int locked, int droplock)
+{
+ proc_t trace_parent = PROC_NULL; /* Traced parent process, if tracing */
+
+ if (locked == 1) {
+ proc_list_unlock();
+ }
+
+ /*
+ * If we got the child via a ptrace 'attach',
+ * we need to give it back to the old parent.
+ *
+ * Exception: someone who has been reparented to launchd before being
+ * ptraced can simply be reaped, refer to radar 5677288
+ * p_oppid -> ptraced
+ * trace_parent == initproc -> away from launchd
+ * reparentedtoinit -> came to launchd by reparenting
+ */
+ if (child->p_oppid) {
+ int knote_hint;
+ pid_t oppid;
+
+ proc_lock(child);
+ oppid = child->p_oppid;
+ child->p_oppid = 0;
+ knote_hint = NOTE_EXIT | (child->p_xstat & 0xffff);
+ proc_unlock(child);
+
+ if ((trace_parent = proc_find(oppid))
+ && !((trace_parent == initproc) && reparentedtoinit)) {
+ if (trace_parent != initproc) {
+ /*
+ * proc internal fileds and p_ucred usage safe
+ * here as child is dead and is not reaped or
+ * reparented yet
+ */
+ proc_lock(trace_parent);
+ trace_parent->si_pid = child->p_pid;
+ trace_parent->si_status = child->p_xstat;
+ trace_parent->si_code = CLD_CONTINUED;
+ trace_parent->si_uid = kauth_cred_getruid(child->p_ucred);
+ proc_unlock(trace_parent);
+ }
+ proc_reparentlocked(child, trace_parent, 1, 0);
+
+ /* resend knote to original parent (and others) after reparenting */
+ proc_knote(child, knote_hint);
+
+ psignal(trace_parent, SIGCHLD);
+ proc_list_lock();
+ wakeup((caddr_t)trace_parent);
+ child->p_listflag &= ~P_LIST_WAITING;
+ wakeup(&child->p_stat);
+ proc_list_unlock();
+ proc_rele(trace_parent);
+ if ((locked == 1) && (droplock == 0)) {
+ proc_list_lock();
+ }
+ return 0;
+ }
+
+ /*
+ * If we can't reparent (e.g. the original parent exited while child was being debugged, or
+ * original parent is the same as the debugger currently exiting), we still need to satisfy
+ * the knote lifecycle for other observers on the system. While the debugger was attached,
+ * the NOTE_EXIT would not have been broadcast during initial child termination.
+ */
+ proc_knote(child, knote_hint);
+
+ if (trace_parent != PROC_NULL) {
+ proc_rele(trace_parent);
+ }
+ }
+
+#pragma clang diagnostic push
+#pragma clang diagnostic ignored "-Wdeprecated-declarations"
+ proc_knote(child, NOTE_REAP);
+#pragma clang diagnostic pop
+
+ proc_knote_drain(child);
+
+ child->p_xstat = 0;
+ if (child->p_ru) {
+ proc_lock(parent);
+#if 3839178
+ /*
+ * If the parent is ignoring SIGCHLD, then POSIX requires
+ * us to not add the resource usage to the parent process -
+ * we are only going to hand it off to init to get reaped.
+ * We should contest the standard in this case on the basis
+ * of RLIMIT_CPU.
+ */
+ if (!(parent->p_flag & P_NOCLDWAIT))
+#endif /* 3839178 */
+ ruadd(&parent->p_stats->p_cru, &child->p_ru->ru);
+ update_rusage_info_child(&parent->p_stats->ri_child, &child->p_ru->ri);
+ proc_unlock(parent);
+ zfree(zombie_zone, child->p_ru);
+ child->p_ru = NULL;
+ } else {
+ printf("Warning : lost p_ru for %s\n", child->p_comm);
+ }
+
+ AUDIT_SESSION_PROCEXIT(child);
+
+ /*
+ * Decrement the count of procs running with this uid.
+ * p_ucred usage is safe here as it is an exited process.
+ * and refernce is dropped after these calls down below
+ * (locking protection is provided by list lock held in chgproccnt)
+ */
+#if CONFIG_PERSONAS
+ /*
+ * persona_proc_drop calls chgproccnt(-1) on the persona uid,
+ * and (+1) on the child->p_ucred uid
+ */
+ persona_proc_drop(child);
+#endif
+ (void)chgproccnt(kauth_cred_getruid(child->p_ucred), -1);
+
+ os_reason_free(child->p_exit_reason);
+
+ /*
+ * Finally finished with old proc entry.
+ * Unlink it from its process group and free it.
+ */
+ leavepgrp(child);
+
+ proc_list_lock();
+ LIST_REMOVE(child, p_list); /* off zombproc */
+ parent->p_childrencnt--;
+ LIST_REMOVE(child, p_sibling);
+ /* If there are no more children wakeup parent */
+ if ((deadparent != 0) && (LIST_EMPTY(&parent->p_children))) {
+ wakeup((caddr_t)parent); /* with list lock held */
+ }
+ child->p_listflag &= ~P_LIST_WAITING;
+ wakeup(&child->p_stat);
+
+ /* Take it out of process hash */
+ LIST_REMOVE(child, p_hash);
+ child->p_listflag &= ~P_LIST_INHASH;
+ proc_checkdeadrefs(child);
+ nprocs--;
+
+ if (deadparent) {
+ /*
+ * If a child zombie is being reaped because its parent
+ * is exiting, make sure we update the list flag
+ */
+ child->p_listflag |= P_LIST_DEADPARENT;
+ }
+
+ proc_list_unlock();
+
+ /*
+ * Free up credentials.
+ */
+ if (IS_VALID_CRED(child->p_ucred)) {
+ kauth_cred_t tmp_ucred = child->p_ucred;
+ kauth_cred_unref(&tmp_ucred);
+ child->p_ucred = NOCRED;
+ }
+
+ lck_mtx_destroy(&child->p_mlock, proc_mlock_grp);
+ lck_mtx_destroy(&child->p_ucred_mlock, proc_ucred_mlock_grp);
+ lck_mtx_destroy(&child->p_fdmlock, proc_fdmlock_grp);
+#if CONFIG_DTRACE
+ lck_mtx_destroy(&child->p_dtrace_sprlock, proc_lck_grp);
+#endif
+ lck_spin_destroy(&child->p_slock, proc_slock_grp);
+
+ zfree(proc_zone, child);
+ if ((locked == 1) && (droplock == 0)) {
+ proc_list_lock();
+ }
+
+ return 1;
+}
+
+
+int
+wait1continue(int result)
+{
+ proc_t p;
+ thread_t thread;
+ uthread_t uth;
+ struct _wait4_data *wait4_data;
+ struct wait4_nocancel_args *uap;
+ int *retval;
+
+ if (result) {
+ return result;
+ }
+
+ p = current_proc();
+ thread = current_thread();
+ uth = (struct uthread *)get_bsdthread_info(thread);
+
+ wait4_data = &uth->uu_save.uus_wait4_data;
+ uap = wait4_data->args;
+ retval = wait4_data->retval;
+ return wait4_nocancel(p, uap, retval);
+}
+
+int
+wait4(proc_t q, struct wait4_args *uap, int32_t *retval)
+{
+ __pthread_testcancel(1);
+ return wait4_nocancel(q, (struct wait4_nocancel_args *)uap, retval);
+}
+
+int
+wait4_nocancel(proc_t q, struct wait4_nocancel_args *uap, int32_t *retval)
+{
+ int nfound;
+ int sibling_count;
+ proc_t p;
+ int status, error;
+ uthread_t uth;
+ struct _wait4_data *wait4_data;
+
+ AUDIT_ARG(pid, uap->pid);
+
+ if (uap->pid == 0) {
+ uap->pid = -q->p_pgrpid;
+ }
+
+loop:
+ proc_list_lock();
+loop1:
+ nfound = 0;
+ sibling_count = 0;
+
+ PCHILDREN_FOREACH(q, p) {
+ if (p->p_sibling.le_next != 0) {
+ sibling_count++;
+ }
+ if (uap->pid != WAIT_ANY &&
+ p->p_pid != uap->pid &&
+ p->p_pgrpid != -(uap->pid)) {
+ continue;
+ }
+
+ nfound++;
+
+ /* XXX This is racy because we don't get the lock!!!! */
+
+ if (p->p_listflag & P_LIST_WAITING) {
+ /* we're not using a continuation here but we still need to stash
+ * the args for stackshot. */
+ uth = current_uthread();
+ wait4_data = &uth->uu_save.uus_wait4_data;
+ wait4_data->args = uap;
+ thread_set_pending_block_hint(current_thread(), kThreadWaitOnProcess);
+
+ (void)msleep(&p->p_stat, proc_list_mlock, PWAIT, "waitcoll", 0);
+ goto loop1;
+ }
+ p->p_listflag |= P_LIST_WAITING; /* only allow single thread to wait() */
+
+
+ if (p->p_stat == SZOMB) {
+ int reparentedtoinit = (p->p_listflag & P_LIST_DEADPARENT) ? 1 : 0;
+
+ proc_list_unlock();
+#if CONFIG_MACF
+ if ((error = mac_proc_check_wait(q, p)) != 0) {
+ goto out;
+ }
+#endif
+ retval[0] = p->p_pid;
+ if (uap->status) {
+ /* Legacy apps expect only 8 bits of status */
+ status = 0xffff & p->p_xstat; /* convert to int */
+ error = copyout((caddr_t)&status,
+ uap->status,
+ sizeof(status));
+ if (error) {
+ goto out;
+ }
+ }
+ if (uap->rusage) {
+ if (p->p_ru == NULL) {
+ error = ENOMEM;
+ } else {
+ if (IS_64BIT_PROCESS(q)) {
+ struct user64_rusage my_rusage = {};
+ munge_user64_rusage(&p->p_ru->ru, &my_rusage);
+ error = copyout((caddr_t)&my_rusage,
+ uap->rusage,
+ sizeof(my_rusage));
+ } else {
+ struct user32_rusage my_rusage = {};
+ munge_user32_rusage(&p->p_ru->ru, &my_rusage);
+ error = copyout((caddr_t)&my_rusage,
+ uap->rusage,
+ sizeof(my_rusage));
+ }
+ }
+ /* information unavailable? */
+ if (error) {
+ goto out;
+ }
+ }
+
+ /* Conformance change for 6577252.
+ * When SIGCHLD is blocked and wait() returns because the status
+ * of a child process is available and there are no other
+ * children processes, then any pending SIGCHLD signal is cleared.
+ */
+ if (sibling_count == 0) {
+ int mask = sigmask(SIGCHLD);
+ uth = current_uthread();
+
+ if ((uth->uu_sigmask & mask) != 0) {
+ /* we are blocking SIGCHLD signals. clear any pending SIGCHLD.
+ * This locking looks funny but it is protecting access to the
+ * thread via p_uthlist.
+ */
+ proc_lock(q);
+ uth->uu_siglist &= ~mask; /* clear pending signal */
+ proc_unlock(q);
+ }
+ }
+
+ /* Clean up */
+ (void)reap_child_locked(q, p, 0, reparentedtoinit, 0, 0);
+
+ return 0;
+ }
+ if (p->p_stat == SSTOP && (p->p_lflag & P_LWAITED) == 0 &&
+ (p->p_lflag & P_LTRACED || uap->options & WUNTRACED)) {
+ proc_list_unlock();
+#if CONFIG_MACF
+ if ((error = mac_proc_check_wait(q, p)) != 0) {
+ goto out;
+ }
+#endif
+ proc_lock(p);
+ p->p_lflag |= P_LWAITED;
+ proc_unlock(p);
+ retval[0] = p->p_pid;
+ if (uap->status) {
+ status = W_STOPCODE(p->p_xstat);
+ error = copyout((caddr_t)&status,
+ uap->status,
+ sizeof(status));
+ } else {
+ error = 0;
+ }
+ goto out;
+ }
+ /*
+ * If we are waiting for continued processses, and this
+ * process was continued
+ */
+ if ((uap->options & WCONTINUED) &&
+ (p->p_flag & P_CONTINUED)) {
+ proc_list_unlock();
+#if CONFIG_MACF
+ if ((error = mac_proc_check_wait(q, p)) != 0) {
+ goto out;
+ }
+#endif
+
+ /* Prevent other process for waiting for this event */
+ OSBitAndAtomic(~((uint32_t)P_CONTINUED), &p->p_flag);
+ retval[0] = p->p_pid;
+ if (uap->status) {
+ status = W_STOPCODE(SIGCONT);
+ error = copyout((caddr_t)&status,
+ uap->status,
+ sizeof(status));
+ } else {
+ error = 0;
+ }
+ goto out;
+ }
+ p->p_listflag &= ~P_LIST_WAITING;
+ wakeup(&p->p_stat);
+ }
+ /* list lock is held when we get here any which way */
+ if (nfound == 0) {
+ proc_list_unlock();
+ return ECHILD;
+ }
+
+ if (uap->options & WNOHANG) {
+ retval[0] = 0;
+ proc_list_unlock();
+ return 0;
+ }
+
+ /* Save arguments for continuation. Backing storage is in uthread->uu_arg, and will not be deallocated */
+ uth = current_uthread();
+ wait4_data = &uth->uu_save.uus_wait4_data;
+ wait4_data->args = uap;
+ wait4_data->retval = retval;
+
+ thread_set_pending_block_hint(current_thread(), kThreadWaitOnProcess);
+ if ((error = msleep0((caddr_t)q, proc_list_mlock, PWAIT | PCATCH | PDROP, "wait", 0, wait1continue))) {
+ return error;
+ }
+
+ goto loop;
+out:
+ proc_list_lock();
+ p->p_listflag &= ~P_LIST_WAITING;
+ wakeup(&p->p_stat);
+ proc_list_unlock();
+ return error;
+}
+
+#if DEBUG
+#define ASSERT_LCK_MTX_OWNED(lock) \
+ lck_mtx_assert(lock, LCK_MTX_ASSERT_OWNED)
+#else
+#define ASSERT_LCK_MTX_OWNED(lock) /* nothing */
+#endif
+
+int
+waitidcontinue(int result)
+{
+ proc_t p;
+ thread_t thread;
+ uthread_t uth;
+ struct _waitid_data *waitid_data;
+ struct waitid_nocancel_args *uap;
+ int *retval;
+
+ if (result) {
+ return result;
+ }
+
+ p = current_proc();
+ thread = current_thread();
+ uth = (struct uthread *)get_bsdthread_info(thread);
+
+ waitid_data = &uth->uu_save.uus_waitid_data;
+ uap = waitid_data->args;
+ retval = waitid_data->retval;
+ return waitid_nocancel(p, uap, retval);
+}
+
+/*
+ * Description: Suspend the calling thread until one child of the process
+ * containing the calling thread changes state.
+ *
+ * Parameters: uap->idtype one of P_PID, P_PGID, P_ALL
+ * uap->id pid_t or gid_t or ignored
+ * uap->infop Address of siginfo_t struct in
+ * user space into which to return status
+ * uap->options flag values
+ *
+ * Returns: 0 Success
+ * !0 Error returning status to user space
+ */
+int
+waitid(proc_t q, struct waitid_args *uap, int32_t *retval)
+{
+ __pthread_testcancel(1);
+ return waitid_nocancel(q, (struct waitid_nocancel_args *)uap, retval);
+}
+
+int
+waitid_nocancel(proc_t q, struct waitid_nocancel_args *uap,
+ __unused int32_t *retval)
+{
+ user_siginfo_t siginfo; /* siginfo data to return to caller */
+ boolean_t caller64 = IS_64BIT_PROCESS(q);
+ int nfound;
+ proc_t p;
+ int error;
+ uthread_t uth;
+ struct _waitid_data *waitid_data;
+
+ if (uap->options == 0 ||
+ (uap->options & ~(WNOHANG | WNOWAIT | WCONTINUED | WSTOPPED | WEXITED))) {
+ return EINVAL; /* bits set that aren't recognized */
+ }
+ switch (uap->idtype) {
+ case P_PID: /* child with process ID equal to... */
+ case P_PGID: /* child with process group ID equal to... */
+ if (((int)uap->id) < 0) {
+ return EINVAL;
+ }
+ break;
+ case P_ALL: /* any child */
+ break;
+ }
+
+loop:
+ proc_list_lock();
+loop1:
+ nfound = 0;
+
+ PCHILDREN_FOREACH(q, p) {
+ switch (uap->idtype) {
+ case P_PID: /* child with process ID equal to... */
+ if (p->p_pid != (pid_t)uap->id) {
+ continue;
+ }
+ break;
+ case P_PGID: /* child with process group ID equal to... */
+ if (p->p_pgrpid != (pid_t)uap->id) {
+ continue;
+ }
+ break;
+ case P_ALL: /* any child */
+ break;
+ }
+
+ /* XXX This is racy because we don't get the lock!!!! */
+
+ /*
+ * Wait collision; go to sleep and restart; used to maintain
+ * the single return for waited process guarantee.
+ */
+ if (p->p_listflag & P_LIST_WAITING) {
+ (void) msleep(&p->p_stat, proc_list_mlock,
+ PWAIT, "waitidcoll", 0);
+ goto loop1;
+ }
+ p->p_listflag |= P_LIST_WAITING; /* mark busy */
+
+ nfound++;
+
+ bzero(&siginfo, sizeof(siginfo));
+
+ switch (p->p_stat) {
+ case SZOMB: /* Exited */
+ if (!(uap->options & WEXITED)) {
+ break;
+ }
+ proc_list_unlock();
+#if CONFIG_MACF
+ if ((error = mac_proc_check_wait(q, p)) != 0) {
+ goto out;
+ }
+#endif
+ siginfo.si_signo = SIGCHLD;
+ siginfo.si_pid = p->p_pid;
+
+ /* If the child terminated abnormally due to a signal, the signum
+ * needs to be preserved in the exit status.
+ */
+ if (WIFSIGNALED(p->p_xstat)) {
+ siginfo.si_code = WCOREDUMP(p->p_xstat) ?
+ CLD_DUMPED : CLD_KILLED;
+ siginfo.si_status = WTERMSIG(p->p_xstat);
+ } else {
+ siginfo.si_code = CLD_EXITED;
+ siginfo.si_status = WEXITSTATUS(p->p_xstat) & 0x00FFFFFF;
+ }
+ siginfo.si_status |= (((uint32_t)(p->p_xhighbits) << 24) & 0xFF000000);
+ p->p_xhighbits = 0;
+
+ if ((error = copyoutsiginfo(&siginfo,
+ caller64, uap->infop)) != 0) {
+ goto out;
+ }
+
+ /* Prevent other process for waiting for this event? */
+ if (!(uap->options & WNOWAIT)) {
+ (void) reap_child_locked(q, p, 0, 0, 0, 0);
+ return 0;
+ }
+ goto out;
+
+ case SSTOP: /* Stopped */
+ /*
+ * If we are not interested in stopped processes, then
+ * ignore this one.
+ */
+ if (!(uap->options & WSTOPPED)) {
+ break;
+ }
+
+ /*
+ * If someone has already waited it, we lost a race
+ * to be the one to return status.
+ */
+ if ((p->p_lflag & P_LWAITED) != 0) {
+ break;
+ }
+ proc_list_unlock();
+#if CONFIG_MACF
+ if ((error = mac_proc_check_wait(q, p)) != 0) {
+ goto out;
+ }
+#endif
+ siginfo.si_signo = SIGCHLD;
+ siginfo.si_pid = p->p_pid;
+ siginfo.si_status = p->p_xstat; /* signal number */
+ siginfo.si_code = CLD_STOPPED;
+
+ if ((error = copyoutsiginfo(&siginfo,
+ caller64, uap->infop)) != 0) {
+ goto out;
+ }
+
+ /* Prevent other process for waiting for this event? */
+ if (!(uap->options & WNOWAIT)) {
+ proc_lock(p);
+ p->p_lflag |= P_LWAITED;
+ proc_unlock(p);
+ }
+ goto out;
+
+ default: /* All other states => Continued */
+ if (!(uap->options & WCONTINUED)) {
+ break;
+ }
+
+ /*
+ * If the flag isn't set, then this process has not
+ * been stopped and continued, or the status has
+ * already been reaped by another caller of waitid().
+ */
+ if ((p->p_flag & P_CONTINUED) == 0) {
+ break;
+ }
+ proc_list_unlock();
+#if CONFIG_MACF
+ if ((error = mac_proc_check_wait(q, p)) != 0) {
+ goto out;
+ }
+#endif
+ siginfo.si_signo = SIGCHLD;
+ siginfo.si_code = CLD_CONTINUED;
+ proc_lock(p);
+ siginfo.si_pid = p->p_contproc;
+ siginfo.si_status = p->p_xstat;
+ proc_unlock(p);
+
+ if ((error = copyoutsiginfo(&siginfo,
+ caller64, uap->infop)) != 0) {
+ goto out;
+ }
+
+ /* Prevent other process for waiting for this event? */
+ if (!(uap->options & WNOWAIT)) {
+ OSBitAndAtomic(~((uint32_t)P_CONTINUED),
+ &p->p_flag);
+ }
+ goto out;
+ }
+ ASSERT_LCK_MTX_OWNED(proc_list_mlock);
+
+ /* Not a process we are interested in; go on to next child */
+
+ p->p_listflag &= ~P_LIST_WAITING;
+ wakeup(&p->p_stat);
+ }
+ ASSERT_LCK_MTX_OWNED(proc_list_mlock);
+
+ /* No child processes that could possibly satisfy the request? */
+
+ if (nfound == 0) {
+ proc_list_unlock();
+ return ECHILD;
+ }
+
+ if (uap->options & WNOHANG) {
+ proc_list_unlock();
+#if CONFIG_MACF
+ if ((error = mac_proc_check_wait(q, p)) != 0) {
+ return error;
+ }
+#endif
+ /*
+ * The state of the siginfo structure in this case
+ * is undefined. Some implementations bzero it, some
+ * (like here) leave it untouched for efficiency.
+ *
+ * Thus the most portable check for "no matching pid with
+ * WNOHANG" is to store a zero into si_pid before
+ * invocation, then check for a non-zero value afterwards.
+ */
+ return 0;
+ }
+
+ /* Save arguments for continuation. Backing storage is in uthread->uu_arg, and will not be deallocated */
+ uth = current_uthread();
+ waitid_data = &uth->uu_save.uus_waitid_data;
+ waitid_data->args = uap;
+ waitid_data->retval = retval;
+
+ if ((error = msleep0(q, proc_list_mlock,
+ PWAIT | PCATCH | PDROP, "waitid", 0, waitidcontinue)) != 0) {
+ return error;
+ }
+
+ goto loop;
+out:
+ proc_list_lock();
+ p->p_listflag &= ~P_LIST_WAITING;
+ wakeup(&p->p_stat);
+ proc_list_unlock();
+ return error;
+}
+
+/*
+ * make process 'parent' the new parent of process 'child'.
+ */
+void
+proc_reparentlocked(proc_t child, proc_t parent, int signallable, int locked)
+{
+ proc_t oldparent = PROC_NULL;
+
+ if (child->p_pptr == parent) {
+ return;
+ }
+
+ if (locked == 0) {
+ proc_list_lock();
+ }
+
+ oldparent = child->p_pptr;
+#if __PROC_INTERNAL_DEBUG
+ if (oldparent == PROC_NULL) {
+ panic("proc_reparent: process %p does not have a parent\n", child);
+ }
+#endif
+
+ LIST_REMOVE(child, p_sibling);
+#if __PROC_INTERNAL_DEBUG
+ if (oldparent->p_childrencnt == 0) {
+ panic("process children count already 0\n");
+ }
+#endif
+ oldparent->p_childrencnt--;
+#if __PROC_INTERNAL_DEBUG
+ if (oldparent->p_childrencnt < 0) {
+ panic("process children count -ve\n");
+ }
+#endif
+ LIST_INSERT_HEAD(&parent->p_children, child, p_sibling);
+ parent->p_childrencnt++;
+ child->p_pptr = parent;
+ child->p_ppid = parent->p_pid;
+
+ proc_list_unlock();
+
+ if ((signallable != 0) && (initproc == parent) && (child->p_stat == SZOMB)) {
+ psignal(initproc, SIGCHLD);
+ }
+ if (locked == 1) {
+ proc_list_lock();
+ }
+}
+
+/*
+ * Exit: deallocate address space and other resources, change proc state
+ * to zombie, and unlink proc from allproc and parent's lists. Save exit
+ * status and rusage for wait(). Check for child processes and orphan them.
+ */
+
+void
+vfork_exit(proc_t p, int rv)
+{
+ vfork_exit_internal(p, rv, 0);
+}
+
+void
+vfork_exit_internal(proc_t p, int rv, int forceexit)
+{
+ thread_t self = current_thread();
+#ifdef FIXME
+ struct task *task = p->task;
+#endif
+ struct uthread *ut;
+
+ /*
+ * If a thread in this task has already
+ * called exit(), then halt any others
+ * right here.
+ */
+
+ ut = get_bsdthread_info(self);
+
+
+ proc_lock(p);
+ if ((p->p_lflag & P_LPEXIT) == P_LPEXIT) {
+ /*
+ * This happens when a parent exits/killed and vfork is in progress
+ * other threads. But shutdown code for ex has already called exit1()
+ */
+ proc_unlock(p);
+ return;
+ }
+ p->p_lflag |= (P_LEXIT | P_LPEXIT);
+ proc_unlock(p);
+
+ if (forceexit == 0) {
+ /*
+ * parent of a vfork child has already called exit() and the
+ * thread that has vfork in proress terminates. So there is no
+ * separate address space here and it has already been marked for
+ * termination. This was never covered before and could cause problems
+ * if we block here for outside code.
+ */
+ /* Notify the perf server */
+ (void)sys_perf_notify(self, p->p_pid);
+ }
+
+ /*
+ * Remove proc from allproc queue and from pidhash chain.
+ * Need to do this before we do anything that can block.
+ * Not doing causes things like mount() find this on allproc
+ * in partially cleaned state.
+ */
+
+ proc_list_lock();
+
+#if CONFIG_MEMORYSTATUS
+ proc_memorystatus_remove(p);
+#endif
+
+ LIST_REMOVE(p, p_list);
+ LIST_INSERT_HEAD(&zombproc, p, p_list); /* Place onto zombproc. */
+ /* will not be visible via proc_find */
+ p->p_listflag |= P_LIST_EXITED;
+
+ proc_list_unlock();
+
+ proc_lock(p);
+ p->p_xstat = rv;
+ p->p_lflag &= ~(P_LTRACED | P_LPPWAIT);
+ p->p_sigignore = ~0;
+ proc_unlock(p);
+
+ ut->uu_siglist = 0;
+
+ /* begin vproc_exit */
+
+ proc_t q;
+ proc_t pp;
+
+ vnode_t tvp;
+
+ struct pgrp * pg;
+ struct session *sessp;
+ struct rusage_superset *rup;
+
+ rup = zalloc(zombie_zone);
+
+ proc_refdrain(p);
+
+ /*
+ * Close open files and release open-file table.
+ * This may block!
+ */
+ fdfree(p);
+
+ sessp = proc_session(p);
+ if (SESS_LEADER(p, sessp)) {
+ panic("vfork child is session leader");
+ }
+ session_rele(sessp);
+
+ pg = proc_pgrp(p);
+ fixjobc(p, pg, 0);
+ pg_rele(pg);
+
+ /*
+ * Change RLIMIT_FSIZE for accounting/debugging. proc_limitsetcur_internal() will COW the current plimit
+ * before making changes if the current plimit is shared. The COW'ed plimit will be freed
+ * below by calling proc_limitdrop().
+ */
+ proc_limitsetcur_internal(p, RLIMIT_FSIZE, RLIM_INFINITY);
+
+ proc_list_lock();
+
+ proc_childdrainstart(p);
+ while ((q = p->p_children.lh_first) != NULL) {
+ if (q->p_stat == SZOMB) {
+ if (p != q->p_pptr) {
+ panic("parent child linkage broken");
+ }
+ /* check for lookups by zomb sysctl */
+ while ((q->p_listflag & P_LIST_WAITING) == P_LIST_WAITING) {
+ msleep(&q->p_stat, proc_list_mlock, PWAIT, "waitcoll", 0);
+ }
+ q->p_listflag |= P_LIST_WAITING;
+ /*
+ * This is a named reference and it is not granted
+ * if the reap is already in progress. So we get
+ * the reference here exclusively and their can be
+ * no waiters. So there is no need for a wakeup
+ * after we are done. AlsO the reap frees the structure
+ * and the proc struct cannot be used for wakeups as well.
+ * It is safe to use q here as this is system reap
+ */
+ (void)reap_child_locked(p, q, 1, 0, 1, 0);
+ } else {
+ /*
+ * Traced processes are killed
+ * since their existence means someone is messing up.
+ */
+ if (q->p_lflag & P_LTRACED) {
+ struct proc *opp;
+
+ proc_list_unlock();
+
+ opp = proc_find(q->p_oppid);
+ if (opp != PROC_NULL) {
+ proc_list_lock();
+ q->p_oppid = 0;
+ proc_list_unlock();
+ proc_reparentlocked(q, opp, 0, 0);
+ proc_rele(opp);
+ } else {
+ /* original parent exited while traced */
+ proc_list_lock();
+ q->p_listflag |= P_LIST_DEADPARENT;
+ q->p_oppid = 0;
+ proc_list_unlock();
+ proc_reparentlocked(q, initproc, 0, 0);
+ }
+
+ proc_lock(q);
+ q->p_lflag &= ~P_LTRACED;
+
+ if (q->sigwait_thread) {
+ thread_t thread = q->sigwait_thread;
+
+ proc_unlock(q);
+ /*
+ * The sigwait_thread could be stopped at a
+ * breakpoint. Wake it up to kill.
+ * Need to do this as it could be a thread which is not
+ * the first thread in the task. So any attempts to kill
+ * the process would result into a deadlock on q->sigwait.
+ */
+ thread_resume(thread);
+ clear_wait(thread, THREAD_INTERRUPTED);
+ threadsignal(thread, SIGKILL, 0, TRUE);
+ } else {
+ proc_unlock(q);
+ }
+
+ psignal(q, SIGKILL);
+ proc_list_lock();
+ } else {
+ q->p_listflag |= P_LIST_DEADPARENT;
+ proc_reparentlocked(q, initproc, 0, 1);
+ }
+ }
+ }
+
+ proc_childdrainend(p);
+ proc_list_unlock();
+
+ /*
+ * Release reference to text vnode
+ */
+ tvp = p->p_textvp;
+ p->p_textvp = NULL;
+ if (tvp != NULLVP) {
+ vnode_rele(tvp);
+ }
+
+ /*
+ * Save exit status and final rusage info, adding in child rusage
+ * info and self times. If we were unable to allocate a zombie
+ * structure, this information is lost.
+ */
+ if (rup != NULL) {
+ rup->ru = p->p_stats->p_ru;
+ timerclear(&rup->ru.ru_utime);
+ timerclear(&rup->ru.ru_stime);
+
+#ifdef FIXME
+ if (task) {
+ mach_task_basic_info_data_t tinfo;
+ task_thread_times_info_data_t ttimesinfo;
+ int task_info_stuff, task_ttimes_stuff;
+ struct timeval ut, st;
+
+ task_info_stuff = MACH_TASK_BASIC_INFO_COUNT;
+ task_info(task, MACH_TASK_BASIC_INFO,
+ &tinfo, &task_info_stuff);
+ p->p_ru->ru.ru_utime.tv_sec = tinfo.user_time.seconds;
+ p->p_ru->ru.ru_utime.tv_usec = tinfo.user_time.microseconds;
+ p->p_ru->ru.ru_stime.tv_sec = tinfo.system_time.seconds;
+ p->p_ru->ru.ru_stime.tv_usec = tinfo.system_time.microseconds;
+
+ task_ttimes_stuff = TASK_THREAD_TIMES_INFO_COUNT;
+ task_info(task, TASK_THREAD_TIMES_INFO,
+ &ttimesinfo, &task_ttimes_stuff);
+
+ ut.tv_sec = ttimesinfo.user_time.seconds;
+ ut.tv_usec = ttimesinfo.user_time.microseconds;
+ st.tv_sec = ttimesinfo.system_time.seconds;
+ st.tv_usec = ttimesinfo.system_time.microseconds;
+ timeradd(&ut, &p->p_ru->ru.ru_utime, &p->p_ru->ru.ru_utime);
+ timeradd(&st, &p->p_ru->ru.ru_stime, &p->p_ru->ru.ru_stime);
+ }
+#endif /* FIXME */
+
+ ruadd(&rup->ru, &p->p_stats->p_cru);
+
+ gather_rusage_info(p, &rup->ri, RUSAGE_INFO_CURRENT);
+ rup->ri.ri_phys_footprint = 0;
+ rup->ri.ri_proc_exit_abstime = mach_absolute_time();
+
+ /*
+ * Now that we have filled in the rusage info, make it
+ * visible to an external observer via proc_pid_rusage().
+ */
+ p->p_ru = rup;
+ }
+
+ /*
+ * Free up profiling buffers.
+ */
+ {
+ struct uprof *p0 = &p->p_stats->p_prof, *p1, *pn;
+
+ p1 = p0->pr_next;
+ p0->pr_next = NULL;
+ p0->pr_scale = 0;
+
+ for (; p1 != NULL; p1 = pn) {
+ pn = p1->pr_next;
+ kfree(p1, sizeof *p1);
+ }
+ }
+
+#if PSYNCH
+ pth_proc_hashdelete(p);
+#endif /* PSYNCH */
+
+ proc_free_realitimer(p);
+
+ /*
+ * Other substructures are freed from wait().
+ */
+ zfree(proc_stats_zone, p->p_stats);
+ p->p_stats = NULL;
+
+ zfree(proc_sigacts_zone, p->p_sigacts);
+ p->p_sigacts = NULL;
+
+ FREE(p->p_subsystem_root_path, M_SBUF);
+ p->p_subsystem_root_path = NULL;
+
+ proc_limitdrop(p);
+
+ /*
+ * Finish up by terminating the task
+ * and halt this thread (only if a
+ * member of the task exiting).
+ */
+ p->task = TASK_NULL;
+
+ /*
+ * Notify parent that we're gone.
+ */
+ pp = proc_parent(p);
+ if ((p->p_listflag & P_LIST_DEADPARENT) == 0) {
+ if (pp != initproc) {
+ proc_lock(pp);
+ pp->si_pid = p->p_pid;
+ pp->p_xhighbits = p->p_xhighbits;
+ p->p_xhighbits = 0;
+ pp->si_status = p->p_xstat;
+ pp->si_code = CLD_EXITED;
+ /*
+ * p_ucred usage is safe as it is an exiting process
+ * and reference is dropped in reap
+ */
+ pp->si_uid = kauth_cred_getruid(p->p_ucred);
+ proc_unlock(pp);
+ }
+ /* mark as a zombie */
+ /* mark as a zombie */
+ /* No need to take proc lock as all refs are drained and
+ * no one except parent (reaping ) can look at this.
+ * The write is to an int and is coherent. Also parent is
+ * keyed off of list lock for reaping
+ */
+ p->p_stat = SZOMB;
+
+ psignal(pp, SIGCHLD);
+
+ /* and now wakeup the parent */
+ proc_list_lock();
+ wakeup((caddr_t)pp);
+ proc_list_unlock();
+ } else {
+ proc_list_lock();
+ /* check for lookups by zomb sysctl */
+ while ((p->p_listflag & P_LIST_WAITING) == P_LIST_WAITING) {
+ msleep(&p->p_stat, proc_list_mlock, PWAIT, "waitcoll", 0);
+ }
+ p->p_stat = SZOMB;
+ p->p_listflag |= P_LIST_WAITING;
+
+ /*
+ * This is a named reference and it is not granted
+ * if the reap is already in progress. So we get
+ * the reference here exclusively and their can be
+ * no waiters. So there is no need for a wakeup
+ * after we are done. AlsO the reap frees the structure
+ * and the proc struct cannot be used for wakeups as well.
+ * It is safe to use p here as this is system reap
+ */
+ (void)reap_child_locked(pp, p, 0, 0, 1, 1);
+ /* list lock dropped by reap_child_locked */
+ }
+ proc_rele(pp);
+}
+
+
+/*
+ * munge_rusage
+ * LP64 support - long is 64 bits if we are dealing with a 64 bit user
+ * process. We munge the kernel version of rusage into the
+ * 64 bit version.
+ */
+__private_extern__ void
+munge_user64_rusage(struct rusage *a_rusage_p, struct user64_rusage *a_user_rusage_p)
+{
+ /* Zero-out struct so that padding is cleared */
+ bzero(a_user_rusage_p, sizeof(struct user64_rusage));
+
+ /* timeval changes size, so utime and stime need special handling */
+ a_user_rusage_p->ru_utime.tv_sec = a_rusage_p->ru_utime.tv_sec;
+ a_user_rusage_p->ru_utime.tv_usec = a_rusage_p->ru_utime.tv_usec;
+ a_user_rusage_p->ru_stime.tv_sec = a_rusage_p->ru_stime.tv_sec;
+ a_user_rusage_p->ru_stime.tv_usec = a_rusage_p->ru_stime.tv_usec;
+ /*
+ * everything else can be a direct assign, since there is no loss
+ * of precision implied boing 32->64.
+ */
+ a_user_rusage_p->ru_maxrss = a_rusage_p->ru_maxrss;
+ a_user_rusage_p->ru_ixrss = a_rusage_p->ru_ixrss;
+ a_user_rusage_p->ru_idrss = a_rusage_p->ru_idrss;
+ a_user_rusage_p->ru_isrss = a_rusage_p->ru_isrss;
+ a_user_rusage_p->ru_minflt = a_rusage_p->ru_minflt;
+ a_user_rusage_p->ru_majflt = a_rusage_p->ru_majflt;
+ a_user_rusage_p->ru_nswap = a_rusage_p->ru_nswap;
+ a_user_rusage_p->ru_inblock = a_rusage_p->ru_inblock;
+ a_user_rusage_p->ru_oublock = a_rusage_p->ru_oublock;
+ a_user_rusage_p->ru_msgsnd = a_rusage_p->ru_msgsnd;
+ a_user_rusage_p->ru_msgrcv = a_rusage_p->ru_msgrcv;
+ a_user_rusage_p->ru_nsignals = a_rusage_p->ru_nsignals;
+ a_user_rusage_p->ru_nvcsw = a_rusage_p->ru_nvcsw;
+ a_user_rusage_p->ru_nivcsw = a_rusage_p->ru_nivcsw;
+}
+
+/* For a 64-bit kernel and 32-bit userspace, munging may be needed */
+__private_extern__ void
+munge_user32_rusage(struct rusage *a_rusage_p, struct user32_rusage *a_user_rusage_p)
+{
+ bzero(a_user_rusage_p, sizeof(struct user32_rusage));
+
+ /* timeval changes size, so utime and stime need special handling */
+ a_user_rusage_p->ru_utime.tv_sec = (user32_time_t)a_rusage_p->ru_utime.tv_sec;
+ a_user_rusage_p->ru_utime.tv_usec = a_rusage_p->ru_utime.tv_usec;
+ a_user_rusage_p->ru_stime.tv_sec = (user32_time_t)a_rusage_p->ru_stime.tv_sec;
+ a_user_rusage_p->ru_stime.tv_usec = a_rusage_p->ru_stime.tv_usec;
+ /*
+ * everything else can be a direct assign. We currently ignore
+ * the loss of precision
+ */
+ a_user_rusage_p->ru_maxrss = (user32_long_t)a_rusage_p->ru_maxrss;
+ a_user_rusage_p->ru_ixrss = (user32_long_t)a_rusage_p->ru_ixrss;
+ a_user_rusage_p->ru_idrss = (user32_long_t)a_rusage_p->ru_idrss;
+ a_user_rusage_p->ru_isrss = (user32_long_t)a_rusage_p->ru_isrss;
+ a_user_rusage_p->ru_minflt = (user32_long_t)a_rusage_p->ru_minflt;
+ a_user_rusage_p->ru_majflt = (user32_long_t)a_rusage_p->ru_majflt;
+ a_user_rusage_p->ru_nswap = (user32_long_t)a_rusage_p->ru_nswap;
+ a_user_rusage_p->ru_inblock = (user32_long_t)a_rusage_p->ru_inblock;
+ a_user_rusage_p->ru_oublock = (user32_long_t)a_rusage_p->ru_oublock;
+ a_user_rusage_p->ru_msgsnd = (user32_long_t)a_rusage_p->ru_msgsnd;
+ a_user_rusage_p->ru_msgrcv = (user32_long_t)a_rusage_p->ru_msgrcv;
+ a_user_rusage_p->ru_nsignals = (user32_long_t)a_rusage_p->ru_nsignals;
+ a_user_rusage_p->ru_nvcsw = (user32_long_t)a_rusage_p->ru_nvcsw;
+ a_user_rusage_p->ru_nivcsw = (user32_long_t)a_rusage_p->ru_nivcsw;
+}
+
+void
+kdp_wait4_find_process(thread_t thread, __unused event64_t wait_event, thread_waitinfo_t *waitinfo)
+{
+ assert(thread != NULL);
+ assert(waitinfo != NULL);
+
+ struct uthread *ut = get_bsdthread_info(thread);
+ waitinfo->context = 0;
+ // ensure wmesg is consistent with a thread waiting in wait4
+ assert(!strcmp(ut->uu_wmesg, "waitcoll") || !strcmp(ut->uu_wmesg, "wait"));
+ struct wait4_nocancel_args *args = ut->uu_save.uus_wait4_data.args;
+ // May not actually contain a pid; this is just the argument to wait4.
+ // See man wait4 for other valid wait4 arguments.
+ waitinfo->owner = args->pid;
+}
+
+#if __has_feature(ptrauth_calls)
+int
+exit_with_pac_exception(proc_t p, exception_type_t exception, mach_exception_code_t code,
+ mach_exception_subcode_t subcode)
+{
+ thread_t self = current_thread();
+ struct uthread *ut = get_bsdthread_info(self);
+
+ os_reason_t exception_reason = os_reason_create(OS_REASON_PAC_EXCEPTION, (uint64_t)code);
+ assert(exception_reason != OS_REASON_NULL);
+ exception_reason->osr_flags |= OS_REASON_FLAG_GENERATE_CRASH_REPORT;
+ ut->uu_exception = exception;
+ ut->uu_code = code;
+ ut->uu_subcode = subcode;
+
+ return exit_with_reason(p, W_EXITCODE(0, SIGKILL), (int *)NULL, TRUE, FALSE,
+ 0, exception_reason);