Now available: The Design and Implementation of the FreeBSD Operating System (Second Edition)
[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]
FreeBSD/Linux Kernel Cross Reference
sys/kern/sys_process.c
Version:
- FREEBSD - FREEBSD-13-STABLE - FREEBSD-13-0 - FREEBSD-12-STABLE - FREEBSD-12-0 - FREEBSD-11-STABLE - FREEBSD-11-0 - FREEBSD-10-STABLE - FREEBSD-10-0 - FREEBSD-9-STABLE - FREEBSD-9-0 - FREEBSD-8-STABLE - FREEBSD-8-0 - FREEBSD-7-STABLE - FREEBSD-7-0 - FREEBSD-6-STABLE - FREEBSD-6-0 - FREEBSD-5-STABLE - FREEBSD-5-0 - FREEBSD-4-STABLE - FREEBSD-3-STABLE - FREEBSD22 - l41 - OPENBSD - linux-2.6 - MK84 - PLAN9 - xnu-8792
SearchContext: - none - 3 - 10
SearchContext: - none - 3 - 10
1 /*- 2 * Copyright (c) 1994, Sean Eric Fagan 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by Sean Eric Fagan. 16 * 4. The name of the author may not be used to endorse or promote products 17 * derived from this software without specific prior written permission. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29 * SUCH DAMAGE. 30 */ 31 32 #include <sys/cdefs.h> 33 __FBSDID("$FreeBSD$"); 34 35 #include "opt_compat.h" 36 37 #include <sys/param.h> 38 #include <sys/systm.h> 39 #include <sys/lock.h> 40 #include <sys/mutex.h> 41 #include <sys/syscallsubr.h> 42 #include <sys/sysproto.h> 43 #include <sys/proc.h> 44 #include <sys/vnode.h> 45 #include <sys/ptrace.h> 46 #include <sys/sx.h> 47 #include <sys/malloc.h> 48 #include <sys/signalvar.h> 49 50 #include <machine/reg.h> 51 52 #include <security/audit/audit.h> 53 54 #include <vm/vm.h> 55 #include <vm/pmap.h> 56 #include <vm/vm_extern.h> 57 #include <vm/vm_map.h> 58 #include <vm/vm_kern.h> 59 #include <vm/vm_object.h> 60 #include <vm/vm_page.h> 61 62 #ifdef COMPAT_IA32 63 #include <sys/procfs.h> 64 #include <machine/fpu.h> 65 #include <compat/ia32/ia32_reg.h> 66 67 extern struct sysentvec ia32_freebsd_sysvec; 68 69 struct ptrace_io_desc32 { 70 int piod_op; 71 u_int32_t piod_offs; 72 u_int32_t piod_addr; 73 u_int32_t piod_len; 74 }; 75 #endif 76 77 /* 78 * Functions implemented using PROC_ACTION(): 79 * 80 * proc_read_regs(proc, regs) 81 * Get the current user-visible register set from the process 82 * and copy it into the regs structure (<machine/reg.h>). 83 * The process is stopped at the time read_regs is called. 84 * 85 * proc_write_regs(proc, regs) 86 * Update the current register set from the passed in regs 87 * structure. Take care to avoid clobbering special CPU 88 * registers or privileged bits in the PSL. 89 * Depending on the architecture this may have fix-up work to do, 90 * especially if the IAR or PCW are modified. 91 * The process is stopped at the time write_regs is called. 92 * 93 * proc_read_fpregs, proc_write_fpregs 94 * deal with the floating point register set, otherwise as above. 95 * 96 * proc_read_dbregs, proc_write_dbregs 97 * deal with the processor debug register set, otherwise as above. 98 * 99 * proc_sstep(proc) 100 * Arrange for the process to trap after executing a single instruction. 101 */ 102 103 #define PROC_ACTION(action) do { \ 104 int error; \ 105 \ 106 PROC_LOCK_ASSERT(td->td_proc, MA_OWNED); \ 107 if ((td->td_proc->p_flag & P_INMEM) == 0) \ 108 error = EIO; \ 109 else \ 110 error = (action); \ 111 return (error); \ 112 } while(0) 113 114 int 115 proc_read_regs(struct thread *td, struct reg *regs) 116 { 117 118 PROC_ACTION(fill_regs(td, regs)); 119 } 120 121 int 122 proc_write_regs(struct thread *td, struct reg *regs) 123 { 124 125 PROC_ACTION(set_regs(td, regs)); 126 } 127 128 int 129 proc_read_dbregs(struct thread *td, struct dbreg *dbregs) 130 { 131 132 PROC_ACTION(fill_dbregs(td, dbregs)); 133 } 134 135 int 136 proc_write_dbregs(struct thread *td, struct dbreg *dbregs) 137 { 138 139 PROC_ACTION(set_dbregs(td, dbregs)); 140 } 141 142 /* 143 * Ptrace doesn't support fpregs at all, and there are no security holes 144 * or translations for fpregs, so we can just copy them. 145 */ 146 int 147 proc_read_fpregs(struct thread *td, struct fpreg *fpregs) 148 { 149 150 PROC_ACTION(fill_fpregs(td, fpregs)); 151 } 152 153 int 154 proc_write_fpregs(struct thread *td, struct fpreg *fpregs) 155 { 156 157 PROC_ACTION(set_fpregs(td, fpregs)); 158 } 159 160 #ifdef COMPAT_IA32 161 /* For 32 bit binaries, we need to expose the 32 bit regs layouts. */ 162 int 163 proc_read_regs32(struct thread *td, struct reg32 *regs32) 164 { 165 166 PROC_ACTION(fill_regs32(td, regs32)); 167 } 168 169 int 170 proc_write_regs32(struct thread *td, struct reg32 *regs32) 171 { 172 173 PROC_ACTION(set_regs32(td, regs32)); 174 } 175 176 int 177 proc_read_dbregs32(struct thread *td, struct dbreg32 *dbregs32) 178 { 179 180 PROC_ACTION(fill_dbregs32(td, dbregs32)); 181 } 182 183 int 184 proc_write_dbregs32(struct thread *td, struct dbreg32 *dbregs32) 185 { 186 187 PROC_ACTION(set_dbregs32(td, dbregs32)); 188 } 189 190 int 191 proc_read_fpregs32(struct thread *td, struct fpreg32 *fpregs32) 192 { 193 194 PROC_ACTION(fill_fpregs32(td, fpregs32)); 195 } 196 197 int 198 proc_write_fpregs32(struct thread *td, struct fpreg32 *fpregs32) 199 { 200 201 PROC_ACTION(set_fpregs32(td, fpregs32)); 202 } 203 #endif 204 205 int 206 proc_sstep(struct thread *td) 207 { 208 209 PROC_ACTION(ptrace_single_step(td)); 210 } 211 212 int 213 proc_rwmem(struct proc *p, struct uio *uio) 214 { 215 vm_map_t map; 216 vm_object_t backing_object, object = NULL; 217 vm_offset_t pageno = 0; /* page number */ 218 vm_prot_t reqprot; 219 int error, writing; 220 221 /* 222 * Assert that someone has locked this vmspace. (Should be 223 * curthread but we can't assert that.) This keeps the process 224 * from exiting out from under us until this operation completes. 225 */ 226 KASSERT(p->p_lock >= 1, ("%s: process %p (pid %d) not held", __func__, 227 p, p->p_pid)); 228 229 /* 230 * The map we want... 231 */ 232 map = &p->p_vmspace->vm_map; 233 234 writing = uio->uio_rw == UIO_WRITE; 235 reqprot = writing ? (VM_PROT_WRITE | VM_PROT_OVERRIDE_WRITE) : 236 VM_PROT_READ; 237 238 /* 239 * Only map in one page at a time. We don't have to, but it 240 * makes things easier. This way is trivial - right? 241 */ 242 do { 243 vm_map_t tmap; 244 vm_offset_t uva; 245 int page_offset; /* offset into page */ 246 vm_map_entry_t out_entry; 247 vm_prot_t out_prot; 248 boolean_t wired; 249 vm_pindex_t pindex; 250 u_int len; 251 vm_page_t m; 252 253 object = NULL; 254 255 uva = (vm_offset_t)uio->uio_offset; 256 257 /* 258 * Get the page number of this segment. 259 */ 260 pageno = trunc_page(uva); 261 page_offset = uva - pageno; 262 263 /* 264 * How many bytes to copy 265 */ 266 len = min(PAGE_SIZE - page_offset, uio->uio_resid); 267 268 /* 269 * Fault the page on behalf of the process 270 */ 271 error = vm_fault(map, pageno, reqprot, VM_FAULT_NORMAL); 272 if (error) { 273 error = EFAULT; 274 break; 275 } 276 277 /* 278 * Now we need to get the page. out_entry, out_prot, wired, 279 * and single_use aren't used. One would think the vm code 280 * would be a *bit* nicer... We use tmap because 281 * vm_map_lookup() can change the map argument. 282 */ 283 tmap = map; 284 error = vm_map_lookup(&tmap, pageno, reqprot, &out_entry, 285 &object, &pindex, &out_prot, &wired); 286 if (error) { 287 error = EFAULT; 288 break; 289 } 290 VM_OBJECT_LOCK(object); 291 while ((m = vm_page_lookup(object, pindex)) == NULL && 292 !writing && 293 (backing_object = object->backing_object) != NULL) { 294 /* 295 * Allow fallback to backing objects if we are reading. 296 */ 297 VM_OBJECT_LOCK(backing_object); 298 pindex += OFF_TO_IDX(object->backing_object_offset); 299 VM_OBJECT_UNLOCK(object); 300 object = backing_object; 301 } 302 VM_OBJECT_UNLOCK(object); 303 if (m == NULL) { 304 vm_map_lookup_done(tmap, out_entry); 305 error = EFAULT; 306 break; 307 } 308 309 /* 310 * Hold the page in memory. 311 */ 312 vm_page_lock_queues(); 313 vm_page_hold(m); 314 vm_page_unlock_queues(); 315 316 /* 317 * We're done with tmap now. 318 */ 319 vm_map_lookup_done(tmap, out_entry); 320 321 /* 322 * Now do the i/o move. 323 */ 324 error = uiomove_fromphys(&m, page_offset, len, uio); 325 326 /* 327 * Release the page. 328 */ 329 vm_page_lock_queues(); 330 vm_page_unhold(m); 331 vm_page_unlock_queues(); 332 333 } while (error == 0 && uio->uio_resid > 0); 334 335 return (error); 336 } 337 338 /* 339 * Process debugging system call. 340 */ 341 #ifndef _SYS_SYSPROTO_H_ 342 struct ptrace_args { 343 int req; 344 pid_t pid; 345 caddr_t addr; 346 int data; 347 }; 348 #endif 349 350 #ifdef COMPAT_IA32 351 /* 352 * This CPP subterfuge is to try and reduce the number of ifdefs in 353 * the body of the code. 354 * COPYIN(uap->addr, &r.reg, sizeof r.reg); 355 * becomes either: 356 * copyin(uap->addr, &r.reg, sizeof r.reg); 357 * or 358 * copyin(uap->addr, &r.reg32, sizeof r.reg32); 359 * .. except this is done at runtime. 360 */ 361 #define COPYIN(u, k, s) wrap32 ? \ 362 copyin(u, k ## 32, s ## 32) : \ 363 copyin(u, k, s) 364 #define COPYOUT(k, u, s) wrap32 ? \ 365 copyout(k ## 32, u, s ## 32) : \ 366 copyout(k, u, s) 367 #else 368 #define COPYIN(u, k, s) copyin(u, k, s) 369 #define COPYOUT(k, u, s) copyout(k, u, s) 370 #endif 371 int 372 ptrace(struct thread *td, struct ptrace_args *uap) 373 { 374 /* 375 * XXX this obfuscation is to reduce stack usage, but the register 376 * structs may be too large to put on the stack anyway. 377 */ 378 union { 379 struct ptrace_io_desc piod; 380 struct ptrace_lwpinfo pl; 381 struct dbreg dbreg; 382 struct fpreg fpreg; 383 struct reg reg; 384 #ifdef COMPAT_IA32 385 struct dbreg32 dbreg32; 386 struct fpreg32 fpreg32; 387 struct reg32 reg32; 388 struct ptrace_io_desc32 piod32; 389 #endif 390 } r; 391 void *addr; 392 int error = 0; 393 #ifdef COMPAT_IA32 394 int wrap32 = 0; 395 396 if (td->td_proc->p_sysent == &ia32_freebsd_sysvec) 397 wrap32 = 1; 398 #endif 399 AUDIT_ARG(pid, uap->pid); 400 AUDIT_ARG(cmd, uap->req); 401 AUDIT_ARG(addr, uap->addr); 402 AUDIT_ARG(value, uap->data); 403 addr = &r; 404 switch (uap->req) { 405 case PT_GETREGS: 406 case PT_GETFPREGS: 407 case PT_GETDBREGS: 408 case PT_LWPINFO: 409 break; 410 case PT_SETREGS: 411 error = COPYIN(uap->addr, &r.reg, sizeof r.reg); 412 break; 413 case PT_SETFPREGS: 414 error = COPYIN(uap->addr, &r.fpreg, sizeof r.fpreg); 415 break; 416 case PT_SETDBREGS: 417 error = COPYIN(uap->addr, &r.dbreg, sizeof r.dbreg); 418 break; 419 case PT_IO: 420 error = COPYIN(uap->addr, &r.piod, sizeof r.piod); 421 break; 422 default: 423 addr = uap->addr; 424 break; 425 } 426 if (error) 427 return (error); 428 429 error = kern_ptrace(td, uap->req, uap->pid, addr, uap->data); 430 if (error) 431 return (error); 432 433 switch (uap->req) { 434 case PT_IO: 435 error = COPYOUT(&r.piod, uap->addr, sizeof r.piod); 436 break; 437 case PT_GETREGS: 438 error = COPYOUT(&r.reg, uap->addr, sizeof r.reg); 439 break; 440 case PT_GETFPREGS: 441 error = COPYOUT(&r.fpreg, uap->addr, sizeof r.fpreg); 442 break; 443 case PT_GETDBREGS: 444 error = COPYOUT(&r.dbreg, uap->addr, sizeof r.dbreg); 445 break; 446 case PT_LWPINFO: 447 error = copyout(&r.pl, uap->addr, uap->data); 448 break; 449 } 450 451 return (error); 452 } 453 #undef COPYIN 454 #undef COPYOUT 455 456 #ifdef COMPAT_IA32 457 /* 458 * PROC_READ(regs, td2, addr); 459 * becomes either: 460 * proc_read_regs(td2, addr); 461 * or 462 * proc_read_regs32(td2, addr); 463 * .. except this is done at runtime. There is an additional 464 * complication in that PROC_WRITE disallows 32 bit consumers 465 * from writing to 64 bit address space targets. 466 */ 467 #define PROC_READ(w, t, a) wrap32 ? \ 468 proc_read_ ## w ## 32(t, a) : \ 469 proc_read_ ## w (t, a) 470 #define PROC_WRITE(w, t, a) wrap32 ? \ 471 (safe ? proc_write_ ## w ## 32(t, a) : EINVAL ) : \ 472 proc_write_ ## w (t, a) 473 #else 474 #define PROC_READ(w, t, a) proc_read_ ## w (t, a) 475 #define PROC_WRITE(w, t, a) proc_write_ ## w (t, a) 476 #endif 477 478 int 479 kern_ptrace(struct thread *td, int req, pid_t pid, void *addr, int data) 480 { 481 struct iovec iov; 482 struct uio uio; 483 struct proc *curp, *p, *pp; 484 struct thread *td2 = NULL; 485 struct ptrace_io_desc *piod = NULL; 486 struct ptrace_lwpinfo *pl; 487 int error, write, tmp, num; 488 int proctree_locked = 0; 489 lwpid_t tid = 0, *buf; 490 #ifdef COMPAT_IA32 491 int wrap32 = 0, safe = 0; 492 struct ptrace_io_desc32 *piod32 = NULL; 493 #endif 494 495 curp = td->td_proc; 496 497 /* Lock proctree before locking the process. */ 498 switch (req) { 499 case PT_TRACE_ME: 500 case PT_ATTACH: 501 case PT_STEP: 502 case PT_CONTINUE: 503 case PT_TO_SCE: 504 case PT_TO_SCX: 505 case PT_SYSCALL: 506 case PT_DETACH: 507 sx_xlock(&proctree_lock); 508 proctree_locked = 1; 509 break; 510 default: 511 break; 512 } 513 514 write = 0; 515 if (req == PT_TRACE_ME) { 516 p = td->td_proc; 517 PROC_LOCK(p); 518 } else { 519 if (pid <= PID_MAX) { 520 if ((p = pfind(pid)) == NULL) { 521 if (proctree_locked) 522 sx_xunlock(&proctree_lock); 523 return (ESRCH); 524 } 525 } else { 526 /* this is slow, should be optimized */ 527 sx_slock(&allproc_lock); 528 FOREACH_PROC_IN_SYSTEM(p) { 529 PROC_LOCK(p); 530 PROC_SLOCK(p); 531 FOREACH_THREAD_IN_PROC(p, td2) { 532 if (td2->td_tid == pid) 533 break; 534 } 535 PROC_SUNLOCK(p); 536 if (td2 != NULL) 537 break; /* proc lock held */ 538 PROC_UNLOCK(p); 539 } 540 sx_sunlock(&allproc_lock); 541 if (p == NULL) { 542 if (proctree_locked) 543 sx_xunlock(&proctree_lock); 544 return (ESRCH); 545 } 546 tid = pid; 547 pid = p->p_pid; 548 } 549 } 550 AUDIT_ARG(process, p); 551 552 if ((p->p_flag & P_WEXIT) != 0) { 553 error = ESRCH; 554 goto fail; 555 } 556 if ((error = p_cansee(td, p)) != 0) 557 goto fail; 558 559 if ((error = p_candebug(td, p)) != 0) 560 goto fail; 561 562 /* 563 * System processes can't be debugged. 564 */ 565 if ((p->p_flag & P_SYSTEM) != 0) { 566 error = EINVAL; 567 goto fail; 568 } 569 570 if (tid == 0) { 571 if ((p->p_flag & P_STOPPED_TRACE) != 0) { 572 KASSERT(p->p_xthread != NULL, ("NULL p_xthread")); 573 td2 = p->p_xthread; 574 } else { 575 td2 = FIRST_THREAD_IN_PROC(p); 576 } 577 tid = td2->td_tid; 578 } 579 580 #ifdef COMPAT_IA32 581 /* 582 * Test if we're a 32 bit client and what the target is. 583 * Set the wrap controls accordingly. 584 */ 585 if (td->td_proc->p_sysent == &ia32_freebsd_sysvec) { 586 if (td2->td_proc->p_sysent == &ia32_freebsd_sysvec) 587 safe = 1; 588 wrap32 = 1; 589 } 590 #endif 591 /* 592 * Permissions check 593 */ 594 switch (req) { 595 case PT_TRACE_ME: 596 /* Always legal. */ 597 break; 598 599 case PT_ATTACH: 600 /* Self */ 601 if (p->p_pid == td->td_proc->p_pid) { 602 error = EINVAL; 603 goto fail; 604 } 605 606 /* Already traced */ 607 if (p->p_flag & P_TRACED) { 608 error = EBUSY; 609 goto fail; 610 } 611 612 /* Can't trace an ancestor if you're being traced. */ 613 if (curp->p_flag & P_TRACED) { 614 for (pp = curp->p_pptr; pp != NULL; pp = pp->p_pptr) { 615 if (pp == p) { 616 error = EINVAL; 617 goto fail; 618 } 619 } 620 } 621 622 623 /* OK */ 624 break; 625 626 case PT_CLEARSTEP: 627 /* Allow thread to clear single step for itself */ 628 if (td->td_tid == tid) 629 break; 630 631 /* FALLTHROUGH */ 632 default: 633 /* not being traced... */ 634 if ((p->p_flag & P_TRACED) == 0) { 635 error = EPERM; 636 goto fail; 637 } 638 639 /* not being traced by YOU */ 640 if (p->p_pptr != td->td_proc) { 641 error = EBUSY; 642 goto fail; 643 } 644 645 /* not currently stopped */ 646 if ((p->p_flag & (P_STOPPED_SIG | P_STOPPED_TRACE)) == 0 || 647 p->p_suspcount != p->p_numthreads || 648 (p->p_flag & P_WAITED) == 0) { 649 error = EBUSY; 650 goto fail; 651 } 652 653 if ((p->p_flag & P_STOPPED_TRACE) == 0) { 654 static int count = 0; 655 if (count++ == 0) 656 printf("P_STOPPED_TRACE not set.\n"); 657 } 658 659 /* OK */ 660 break; 661 } 662 663 /* Keep this process around until we finish this request. */ 664 _PHOLD(p); 665 666 #ifdef FIX_SSTEP 667 /* 668 * Single step fixup ala procfs 669 */ 670 FIX_SSTEP(td2); 671 #endif 672 673 /* 674 * Actually do the requests 675 */ 676 677 td->td_retval[0] = 0; 678 679 switch (req) { 680 case PT_TRACE_ME: 681 /* set my trace flag and "owner" so it can read/write me */ 682 p->p_flag |= P_TRACED; 683 p->p_oppid = p->p_pptr->p_pid; 684 break; 685 686 case PT_ATTACH: 687 /* security check done above */ 688 p->p_flag |= P_TRACED; 689 p->p_oppid = p->p_pptr->p_pid; 690 if (p->p_pptr != td->td_proc) 691 proc_reparent(p, td->td_proc); 692 data = SIGSTOP; 693 goto sendsig; /* in PT_CONTINUE below */ 694 695 case PT_CLEARSTEP: 696 error = ptrace_clear_single_step(td2); 697 break; 698 699 case PT_SETSTEP: 700 error = ptrace_single_step(td2); 701 break; 702 703 case PT_SUSPEND: 704 thread_lock(td2); 705 td2->td_flags |= TDF_DBSUSPEND; 706 thread_unlock(td2); 707 break; 708 709 case PT_RESUME: 710 thread_lock(td2); 711 td2->td_flags &= ~TDF_DBSUSPEND; 712 thread_unlock(td2); 713 break; 714 715 case PT_STEP: 716 case PT_CONTINUE: 717 case PT_TO_SCE: 718 case PT_TO_SCX: 719 case PT_SYSCALL: 720 case PT_DETACH: 721 /* Zero means do not send any signal */ 722 if (data < 0 || data > _SIG_MAXSIG) { 723 error = EINVAL; 724 break; 725 } 726 727 switch (req) { 728 case PT_STEP: 729 error = ptrace_single_step(td2); 730 if (error) 731 goto out; 732 break; 733 case PT_TO_SCE: 734 p->p_stops |= S_PT_SCE; 735 break; 736 case PT_TO_SCX: 737 p->p_stops |= S_PT_SCX; 738 break; 739 case PT_SYSCALL: 740 p->p_stops |= S_PT_SCE | S_PT_SCX; 741 break; 742 } 743 744 if (addr != (void *)1) { 745 error = ptrace_set_pc(td2, (u_long)(uintfptr_t)addr); 746 if (error) 747 break; 748 } 749 750 if (req == PT_DETACH) { 751 /* reset process parent */ 752 if (p->p_oppid != p->p_pptr->p_pid) { 753 struct proc *pp; 754 755 PROC_LOCK(p->p_pptr); 756 sigqueue_take(p->p_ksi); 757 PROC_UNLOCK(p->p_pptr); 758 759 PROC_UNLOCK(p); 760 pp = pfind(p->p_oppid); 761 if (pp == NULL) 762 pp = initproc; 763 else 764 PROC_UNLOCK(pp); 765 PROC_LOCK(p); 766 proc_reparent(p, pp); 767 if (pp == initproc) 768 p->p_sigparent = SIGCHLD; 769 } 770 p->p_flag &= ~(P_TRACED | P_WAITED); 771 p->p_oppid = 0; 772 773 /* should we send SIGCHLD? */ 774 /* childproc_continued(p); */ 775 } 776 777 sendsig: 778 if (proctree_locked) { 779 sx_xunlock(&proctree_lock); 780 proctree_locked = 0; 781 } 782 p->p_xstat = data; 783 p->p_xthread = NULL; 784 if ((p->p_flag & (P_STOPPED_SIG | P_STOPPED_TRACE)) != 0) { 785 /* deliver or queue signal */ 786 thread_lock(td2); 787 td2->td_flags &= ~TDF_XSIG; 788 thread_unlock(td2); 789 td2->td_xsig = data; 790 791 PROC_SLOCK(p); 792 if (req == PT_DETACH) { 793 struct thread *td3; 794 FOREACH_THREAD_IN_PROC(p, td3) { 795 thread_lock(td3); 796 td3->td_flags &= ~TDF_DBSUSPEND; 797 thread_unlock(td3); 798 } 799 } 800 /* 801 * unsuspend all threads, to not let a thread run, 802 * you should use PT_SUSPEND to suspend it before 803 * continuing process. 804 */ 805 #ifdef KSE 806 PROC_SUNLOCK(p); 807 thread_continued(p); 808 PROC_SLOCK(p); 809 #endif 810 p->p_flag &= ~(P_STOPPED_TRACE|P_STOPPED_SIG|P_WAITED); 811 thread_unsuspend(p); 812 PROC_SUNLOCK(p); 813 } else { 814 if (data) 815 psignal(p, data); 816 } 817 break; 818 819 case PT_WRITE_I: 820 case PT_WRITE_D: 821 write = 1; 822 /* FALLTHROUGH */ 823 case PT_READ_I: 824 case PT_READ_D: 825 PROC_UNLOCK(p); 826 tmp = 0; 827 /* write = 0 set above */ 828 iov.iov_base = write ? (caddr_t)&data : (caddr_t)&tmp; 829 iov.iov_len = sizeof(int); 830 uio.uio_iov = &iov; 831 uio.uio_iovcnt = 1; 832 uio.uio_offset = (off_t)(uintptr_t)addr; 833 uio.uio_resid = sizeof(int); 834 uio.uio_segflg = UIO_SYSSPACE; /* i.e.: the uap */ 835 uio.uio_rw = write ? UIO_WRITE : UIO_READ; 836 uio.uio_td = td; 837 error = proc_rwmem(p, &uio); 838 if (uio.uio_resid != 0) { 839 /* 840 * XXX proc_rwmem() doesn't currently return ENOSPC, 841 * so I think write() can bogusly return 0. 842 * XXX what happens for short writes? We don't want 843 * to write partial data. 844 * XXX proc_rwmem() returns EPERM for other invalid 845 * addresses. Convert this to EINVAL. Does this 846 * clobber returns of EPERM for other reasons? 847 */ 848 if (error == 0 || error == ENOSPC || error == EPERM) 849 error = EINVAL; /* EOF */ 850 } 851 if (!write) 852 td->td_retval[0] = tmp; 853 PROC_LOCK(p); 854 break; 855 856 case PT_IO: 857 #ifdef COMPAT_IA32 858 if (wrap32) { 859 piod32 = addr; 860 iov.iov_base = (void *)(uintptr_t)piod32->piod_addr; 861 iov.iov_len = piod32->piod_len; 862 uio.uio_offset = (off_t)(uintptr_t)piod32->piod_offs; 863 uio.uio_resid = piod32->piod_len; 864 } else 865 #endif 866 { 867 piod = addr; 868 iov.iov_base = piod->piod_addr; 869 iov.iov_len = piod->piod_len; 870 uio.uio_offset = (off_t)(uintptr_t)piod->piod_offs; 871 uio.uio_resid = piod->piod_len; 872 } 873 uio.uio_iov = &iov; 874 uio.uio_iovcnt = 1; 875 uio.uio_segflg = UIO_USERSPACE; 876 uio.uio_td = td; 877 #ifdef COMPAT_IA32 878 tmp = wrap32 ? piod32->piod_op : piod->piod_op; 879 #else 880 tmp = piod->piod_op; 881 #endif 882 switch (tmp) { 883 case PIOD_READ_D: 884 case PIOD_READ_I: 885 uio.uio_rw = UIO_READ; 886 break; 887 case PIOD_WRITE_D: 888 case PIOD_WRITE_I: 889 uio.uio_rw = UIO_WRITE; 890 break; 891 default: 892 error = EINVAL; 893 goto out; 894 } 895 PROC_UNLOCK(p); 896 error = proc_rwmem(p, &uio); 897 #ifdef COMPAT_IA32 898 if (wrap32) 899 piod32->piod_len -= uio.uio_resid; 900 else 901 #endif 902 piod->piod_len -= uio.uio_resid; 903 PROC_LOCK(p); 904 break; 905 906 case PT_KILL: 907 data = SIGKILL; 908 goto sendsig; /* in PT_CONTINUE above */ 909 910 case PT_SETREGS: 911 error = PROC_WRITE(regs, td2, addr); 912 break; 913 914 case PT_GETREGS: 915 error = PROC_READ(regs, td2, addr); 916 break; 917 918 case PT_SETFPREGS: 919 error = PROC_WRITE(fpregs, td2, addr); 920 break; 921 922 case PT_GETFPREGS: 923 error = PROC_READ(fpregs, td2, addr); 924 break; 925 926 case PT_SETDBREGS: 927 error = PROC_WRITE(dbregs, td2, addr); 928 break; 929 930 case PT_GETDBREGS: 931 error = PROC_READ(dbregs, td2, addr); 932 break; 933 934 case PT_LWPINFO: 935 if (data <= 0 || data > sizeof(*pl)) { 936 error = EINVAL; 937 break; 938 } 939 pl = addr; 940 pl->pl_lwpid = td2->td_tid; 941 if (td2->td_flags & TDF_XSIG) 942 pl->pl_event = PL_EVENT_SIGNAL; 943 else 944 pl->pl_event = 0; 945 #ifdef KSE 946 if (td2->td_pflags & TDP_SA) { 947 pl->pl_flags = PL_FLAG_SA; 948 if (td2->td_upcall && !TD_CAN_UNBIND(td2)) 949 pl->pl_flags |= PL_FLAG_BOUND; 950 } else { 951 pl->pl_flags = 0; 952 } 953 #else 954 pl->pl_flags = 0; 955 #endif 956 pl->pl_sigmask = td2->td_sigmask; 957 pl->pl_siglist = td2->td_siglist; 958 break; 959 960 case PT_GETNUMLWPS: 961 td->td_retval[0] = p->p_numthreads; 962 break; 963 964 case PT_GETLWPLIST: 965 if (data <= 0) { 966 error = EINVAL; 967 break; 968 } 969 num = imin(p->p_numthreads, data); 970 PROC_UNLOCK(p); 971 buf = malloc(num * sizeof(lwpid_t), M_TEMP, M_WAITOK); 972 tmp = 0; 973 PROC_LOCK(p); 974 PROC_SLOCK(p); 975 FOREACH_THREAD_IN_PROC(p, td2) { 976 if (tmp >= num) 977 break; 978 buf[tmp++] = td2->td_tid; 979 } 980 PROC_SUNLOCK(p); 981 PROC_UNLOCK(p); 982 error = copyout(buf, addr, tmp * sizeof(lwpid_t)); 983 free(buf, M_TEMP); 984 if (!error) 985 td->td_retval[0] = tmp; 986 PROC_LOCK(p); 987 break; 988 989 default: 990 #ifdef __HAVE_PTRACE_MACHDEP 991 if (req >= PT_FIRSTMACH) { 992 PROC_UNLOCK(p); 993 error = cpu_ptrace(td2, req, addr, data); 994 PROC_LOCK(p); 995 } else 996 #endif 997 /* Unknown request. */ 998 error = EINVAL; 999 break; 1000 } 1001 1002 out: 1003 /* Drop our hold on this process now that the request has completed. */ 1004 _PRELE(p); 1005 fail: 1006 PROC_UNLOCK(p); 1007 if (proctree_locked) 1008 sx_xunlock(&proctree_lock); 1009 return (error); 1010 } 1011 #undef PROC_READ 1012 #undef PROC_WRITE 1013 1014 /* 1015 * Stop a process because of a debugging event; 1016 * stay stopped until p->p_step is cleared 1017 * (cleared by PIOCCONT in procfs). 1018 */ 1019 void 1020 stopevent(struct proc *p, unsigned int event, unsigned int val) 1021 { 1022 1023 PROC_LOCK_ASSERT(p, MA_OWNED); 1024 p->p_step = 1; 1025 do { 1026 p->p_xstat = val; 1027 p->p_xthread = NULL; 1028 p->p_stype = event; /* Which event caused the stop? */ 1029 wakeup(&p->p_stype); /* Wake up any PIOCWAIT'ing procs */ 1030 msleep(&p->p_step, &p->p_mtx, PWAIT, "stopevent", 0); 1031 } while (p->p_step); 1032 }
Cache object: b39073f660dea9246bcdc8538335a7f3
[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]