Loading...
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 | /* * Copyright (c) 2005-2021 Apple Computer, Inc. All rights reserved. * * @APPLE_OSREFERENCE_LICENSE_HEADER_START@ * * This file contains Original Code and/or Modifications of Original Code * as defined in and that are subject to the Apple Public Source License * Version 2.0 (the 'License'). You may not use this file except in * compliance with the License. The rights granted to you under the License * may not be used to create, or enable the creation or redistribution of, * unlawful or unlicensed copies of an Apple operating system, or to * circumvent, violate, or enable the circumvention or violation of, any * terms of an Apple operating system software license agreement. * * Please obtain a copy of the License at * http://www.opensource.apple.com/apsl/ and read it before using this file. * * The Original Code and all software distributed under the License are * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. * Please see the License for the specific language governing rights and * limitations under the License. * * @APPLE_OSREFERENCE_LICENSE_HEADER_END@ */ #include <kern/thread.h> #include <sys/time.h> #include <sys/proc.h> #include <sys/kauth.h> #include <sys/user.h> #include <sys/systm.h> #include <sys/dtrace.h> #include <sys/dtrace_impl.h> #include <machine/atomic.h> #include <libkern/OSKextLibPrivate.h> #include <kern/kern_types.h> #include <kern/timer_call.h> #include <kern/thread_call.h> #include <kern/task.h> #include <kern/sched_prim.h> #include <miscfs/devfs/devfs.h> #include <kern/kalloc.h> #include <mach/vm_param.h> #include <mach/mach_vm.h> #include <mach/task.h> #include <vm/vm_map_xnu.h> /* All the bits we care about are guarded by MACH_KERNEL_PRIVATE :-( */ /* * pid/proc */ /* Solaris proc_t is the struct. Darwin's proc_t is a pointer to it. */ #define proc_t struct proc /* Steer clear of the Darwin typedef for proc_t */ KALLOC_HEAP_DEFINE(KHEAP_DTRACE, "dtrace", KHEAP_ID_KT_VAR); void dtrace_sprlock(proc_t *p) { lck_mtx_lock(&p->p_dtrace_sprlock); } void dtrace_sprunlock(proc_t *p) { lck_mtx_unlock(&p->p_dtrace_sprlock); } /* Not called from probe context */ proc_t * sprlock(pid_t pid) { proc_t* p; if ((p = proc_find(pid)) == PROC_NULL) { return PROC_NULL; } task_suspend_internal(proc_task(p)); dtrace_sprlock(p); return p; } /* Not called from probe context */ void sprunlock(proc_t *p) { if (p != PROC_NULL) { dtrace_sprunlock(p); task_resume_internal(proc_task(p)); proc_rele(p); } } /* * uread/uwrite */ /* Not called from probe context */ int uread(proc_t *p, void *buf, user_size_t len, user_addr_t a) { kern_return_t ret; ASSERT(p != PROC_NULL); ASSERT(proc_task(p) != NULL); task_t task = proc_task(p); /* * Grab a reference to the task vm_map_t to make sure * the map isn't pulled out from under us. * * Because the proc_lock is not held at all times on all code * paths leading here, it is possible for the proc to have * exited. If the map is null, fail. */ vm_map_t map = get_task_map_reference(task); if (map) { ret = vm_map_read_user( map, (vm_map_address_t)a, buf, (vm_size_t)len); vm_map_deallocate(map); } else { ret = KERN_TERMINATED; } return (int)ret; } /* Not called from probe context */ int uwrite(proc_t *p, void *buf, user_size_t len, user_addr_t a) { kern_return_t ret; ASSERT(p != NULL); ASSERT(proc_task(p) != NULL); task_t task = proc_task(p); /* * Grab a reference to the task vm_map_t to make sure * the map isn't pulled out from under us. * * Because the proc_lock is not held at all times on all code * paths leading here, it is possible for the proc to have * exited. If the map is null, fail. */ vm_map_t map = get_task_map_reference(task); if (map) { /* Find the memory permissions. */ uint32_t nestingDepth = 999999; vm_region_submap_short_info_data_64_t info; mach_msg_type_number_t count = VM_REGION_SUBMAP_SHORT_INFO_COUNT_64; mach_vm_address_t address = (mach_vm_address_t)a; mach_vm_size_t sizeOfRegion = (mach_vm_size_t)len; ret = mach_vm_region_recurse(map, &address, &sizeOfRegion, &nestingDepth, (vm_region_recurse_info_t)&info, &count); if (ret != KERN_SUCCESS) { goto done; } vm_prot_t reprotect; if (!(info.protection & VM_PROT_WRITE)) { /* Save the original protection values for restoration later */ reprotect = info.protection; if (info.max_protection & VM_PROT_WRITE) { /* The memory is not currently writable, but can be made writable. */ ret = mach_vm_protect(map, (mach_vm_offset_t)a, (mach_vm_size_t)len, 0, (reprotect & ~VM_PROT_EXECUTE) | VM_PROT_WRITE); } else { /* * The memory is not currently writable, and cannot be made writable. We need to COW this memory. * * Strange, we can't just say "reprotect | VM_PROT_COPY", that fails. */ ret = mach_vm_protect(map, (mach_vm_offset_t)a, (mach_vm_size_t)len, 0, VM_PROT_COPY | VM_PROT_READ | VM_PROT_WRITE); } if (ret != KERN_SUCCESS) { goto done; } } else { /* The memory was already writable. */ reprotect = VM_PROT_NONE; } ret = vm_map_write_user( map, buf, (vm_map_address_t)a, (vm_size_t)len); dtrace_flush_caches(); if (ret != KERN_SUCCESS) { goto done; } if (reprotect != VM_PROT_NONE) { ASSERT(reprotect & VM_PROT_EXECUTE); ret = mach_vm_protect(map, (mach_vm_offset_t)a, (mach_vm_size_t)len, 0, reprotect); } done: vm_map_deallocate(map); } else { ret = KERN_TERMINATED; } return (int)ret; } /* * cpuvar */ LCK_MTX_DECLARE_ATTR(cpu_lock, &dtrace_lck_grp, &dtrace_lck_attr); LCK_MTX_DECLARE_ATTR(cyc_lock, &dtrace_lck_grp, &dtrace_lck_attr); LCK_MTX_DECLARE_ATTR(mod_lock, &dtrace_lck_grp, &dtrace_lck_attr); dtrace_cpu_t *cpu_list; cpu_core_t *cpu_core; /* XXX TLB lockdown? */ /* * cred_t */ /* * dtrace_CRED() can be called from probe context. We cannot simply call kauth_cred_get() since * that function may try to resolve a lazy credential binding, which entails taking the proc_lock. */ cred_t * dtrace_CRED(void) { return current_thread_ro_unchecked()->tro_cred; } int PRIV_POLICY_CHOICE(void* cred, int priv, int all) { #pragma unused(priv, all) return kauth_cred_issuser(cred); /* XXX TODO: How is this different from PRIV_POLICY_ONLY? */ } int PRIV_POLICY_ONLY(void *cr, int priv, int boolean) { #pragma unused(priv, boolean) return kauth_cred_issuser(cr); /* XXX TODO: HAS_PRIVILEGE(cr, priv); */ } uid_t crgetuid(const cred_t *cr) { cred_t copy_cr = *cr; return kauth_cred_getuid(©_cr); } /* * "cyclic" */ typedef struct wrap_timer_call { /* node attributes */ cyc_handler_t hdlr; cyc_time_t when; uint64_t deadline; int cpuid; boolean_t suspended; struct timer_call call; /* next item in the linked list */ LIST_ENTRY(wrap_timer_call) entries; } wrap_timer_call_t; #define WAKEUP_REAPER 0x7FFFFFFFFFFFFFFFLL #define NEARLY_FOREVER 0x7FFFFFFFFFFFFFFELL typedef struct cyc_list { cyc_omni_handler_t cyl_omni; wrap_timer_call_t cyl_wrap_by_cpus[]; } cyc_list_t; /* CPU going online/offline notifications */ void (*dtrace_cpu_state_changed_hook)(int, boolean_t) = NULL; void dtrace_cpu_state_changed(int, boolean_t); void dtrace_install_cpu_hooks(void) { dtrace_cpu_state_changed_hook = dtrace_cpu_state_changed; } void dtrace_cpu_state_changed(int cpuid, boolean_t is_running) { wrap_timer_call_t *wrapTC = NULL; boolean_t suspend = (is_running ? FALSE : TRUE); dtrace_icookie_t s; /* Ensure that we're not going to leave the CPU */ s = dtrace_interrupt_disable(); LIST_FOREACH(wrapTC, &(cpu_list[cpuid].cpu_cyc_list), entries) { assert3u(wrapTC->cpuid, ==, cpuid); if (suspend) { assert(!wrapTC->suspended); /* If this fails, we'll panic anyway, so let's do this now. */ if (!timer_call_cancel(&wrapTC->call)) { panic("timer_call_cancel() failed to cancel a timer call: %p", &wrapTC->call); } wrapTC->suspended = TRUE; } else { /* Rearm the timer, but ensure it was suspended first. */ assert(wrapTC->suspended); clock_deadline_for_periodic_event(wrapTC->when.cyt_interval, mach_absolute_time(), &wrapTC->deadline); timer_call_enter1(&wrapTC->call, (void*) wrapTC, wrapTC->deadline, TIMER_CALL_SYS_CRITICAL | TIMER_CALL_LOCAL); wrapTC->suspended = FALSE; } } /* Restore the previous interrupt state. */ dtrace_interrupt_enable(s); } static void _timer_call_apply_cyclic( void *ignore, void *vTChdl ) { #pragma unused(ignore) wrap_timer_call_t *wrapTC = (wrap_timer_call_t *)vTChdl; (*(wrapTC->hdlr.cyh_func))( wrapTC->hdlr.cyh_arg ); clock_deadline_for_periodic_event( wrapTC->when.cyt_interval, mach_absolute_time(), &(wrapTC->deadline)); timer_call_enter1( &(wrapTC->call), (void *)wrapTC, wrapTC->deadline, TIMER_CALL_SYS_CRITICAL | TIMER_CALL_LOCAL ); } static cyclic_id_t timer_call_add_cyclic(wrap_timer_call_t *wrapTC, cyc_handler_t *handler, cyc_time_t *when) { uint64_t now; dtrace_icookie_t s; timer_call_setup( &(wrapTC->call), _timer_call_apply_cyclic, NULL ); wrapTC->hdlr = *handler; wrapTC->when = *when; nanoseconds_to_absolutetime( wrapTC->when.cyt_interval, (uint64_t *)&wrapTC->when.cyt_interval ); now = mach_absolute_time(); wrapTC->deadline = now; clock_deadline_for_periodic_event( wrapTC->when.cyt_interval, now, &(wrapTC->deadline)); /* Insert the timer to the list of the running timers on this CPU, and start it. */ s = dtrace_interrupt_disable(); wrapTC->cpuid = cpu_number(); LIST_INSERT_HEAD(&cpu_list[wrapTC->cpuid].cpu_cyc_list, wrapTC, entries); timer_call_enter1(&wrapTC->call, (void*) wrapTC, wrapTC->deadline, TIMER_CALL_SYS_CRITICAL | TIMER_CALL_LOCAL); wrapTC->suspended = FALSE; dtrace_interrupt_enable(s); return (cyclic_id_t)wrapTC; } /* * Executed on the CPU the timer is running on. */ static void timer_call_remove_cyclic(wrap_timer_call_t *wrapTC) { assert(wrapTC); assert(cpu_number() == wrapTC->cpuid); if (!timer_call_cancel(&wrapTC->call)) { panic("timer_call_remove_cyclic() failed to cancel a timer call"); } LIST_REMOVE(wrapTC, entries); } static void * timer_call_get_cyclic_arg(wrap_timer_call_t *wrapTC) { return wrapTC ? wrapTC->hdlr.cyh_arg : NULL; } cyclic_id_t cyclic_timer_add(cyc_handler_t *handler, cyc_time_t *when) { wrap_timer_call_t *wrapTC = kalloc_type(wrap_timer_call_t, Z_ZERO | Z_WAITOK); if (NULL == wrapTC) { return CYCLIC_NONE; } else { return timer_call_add_cyclic( wrapTC, handler, when ); } } void cyclic_timer_remove(cyclic_id_t cyclic) { ASSERT( cyclic != CYCLIC_NONE ); /* Removing a timer call must be done on the CPU the timer is running on. */ wrap_timer_call_t *wrapTC = (wrap_timer_call_t *) cyclic; dtrace_xcall(wrapTC->cpuid, (dtrace_xcall_t) timer_call_remove_cyclic, (void*) cyclic); kfree_type(wrap_timer_call_t, wrapTC); } static void _cyclic_add_omni(cyc_list_t *cyc_list) { cyc_time_t cT; cyc_handler_t cH; cyc_omni_handler_t *omni = &cyc_list->cyl_omni; (omni->cyo_online)(omni->cyo_arg, CPU, &cH, &cT); wrap_timer_call_t *wrapTC = &cyc_list->cyl_wrap_by_cpus[cpu_number()]; timer_call_add_cyclic(wrapTC, &cH, &cT); } cyclic_id_list_t cyclic_add_omni(cyc_omni_handler_t *omni) { cyc_list_t *cyc_list = kalloc_type(cyc_list_t, wrap_timer_call_t, NCPU, Z_WAITOK | Z_ZERO); if (NULL == cyc_list) { return NULL; } cyc_list->cyl_omni = *omni; dtrace_xcall(DTRACE_CPUALL, (dtrace_xcall_t)_cyclic_add_omni, (void *)cyc_list); return (cyclic_id_list_t)cyc_list; } static void _cyclic_remove_omni(cyc_list_t *cyc_list) { cyc_omni_handler_t *omni = &cyc_list->cyl_omni; void *oarg; wrap_timer_call_t *wrapTC; /* * If the processor was offline when dtrace started, we did not allocate * a cyclic timer for this CPU. */ if ((wrapTC = &cyc_list->cyl_wrap_by_cpus[cpu_number()]) != NULL) { oarg = timer_call_get_cyclic_arg(wrapTC); timer_call_remove_cyclic(wrapTC); (omni->cyo_offline)(omni->cyo_arg, CPU, oarg); } } void cyclic_remove_omni(cyclic_id_list_t cyc_list) { ASSERT(cyc_list != NULL); dtrace_xcall(DTRACE_CPUALL, (dtrace_xcall_t)_cyclic_remove_omni, (void *)cyc_list); void *cyc_list_p = (void *)cyc_list; kfree_type(cyc_list_t, wrap_timer_call_t, NCPU, cyc_list_p); } typedef struct wrap_thread_call { thread_call_t TChdl; cyc_handler_t hdlr; cyc_time_t when; uint64_t deadline; } wrap_thread_call_t; /* * _cyclic_apply will run on some thread under kernel_task. That's OK for the * cleaner and the deadman, but too distant in time and place for the profile provider. */ static void _cyclic_apply( void *ignore, void *vTChdl ) { #pragma unused(ignore) wrap_thread_call_t *wrapTC = (wrap_thread_call_t *)vTChdl; (*(wrapTC->hdlr.cyh_func))( wrapTC->hdlr.cyh_arg ); clock_deadline_for_periodic_event( wrapTC->when.cyt_interval, mach_absolute_time(), &(wrapTC->deadline)); (void)thread_call_enter1_delayed( wrapTC->TChdl, (void *)wrapTC, wrapTC->deadline ); /* Did cyclic_remove request a wakeup call when this thread call was re-armed? */ if (wrapTC->when.cyt_interval == WAKEUP_REAPER) { thread_wakeup((event_t)wrapTC); } } cyclic_id_t cyclic_add(cyc_handler_t *handler, cyc_time_t *when) { uint64_t now; wrap_thread_call_t *wrapTC = kalloc_type(wrap_thread_call_t, Z_ZERO | Z_WAITOK); if (NULL == wrapTC) { return CYCLIC_NONE; } wrapTC->TChdl = thread_call_allocate( _cyclic_apply, NULL ); wrapTC->hdlr = *handler; wrapTC->when = *when; ASSERT(when->cyt_when == 0); ASSERT(when->cyt_interval < WAKEUP_REAPER); nanoseconds_to_absolutetime(wrapTC->when.cyt_interval, (uint64_t *)&wrapTC->when.cyt_interval); now = mach_absolute_time(); wrapTC->deadline = now; clock_deadline_for_periodic_event( wrapTC->when.cyt_interval, now, &(wrapTC->deadline)); (void)thread_call_enter1_delayed( wrapTC->TChdl, (void *)wrapTC, wrapTC->deadline ); return (cyclic_id_t)wrapTC; } static void noop_cyh_func(void * ignore) { #pragma unused(ignore) } void cyclic_remove(cyclic_id_t cyclic) { wrap_thread_call_t *wrapTC = (wrap_thread_call_t *)cyclic; ASSERT(cyclic != CYCLIC_NONE); while (!thread_call_cancel(wrapTC->TChdl)) { int ret = assert_wait(wrapTC, THREAD_UNINT); ASSERT(ret == THREAD_WAITING); wrapTC->when.cyt_interval = WAKEUP_REAPER; ret = thread_block(THREAD_CONTINUE_NULL); ASSERT(ret == THREAD_AWAKENED); } if (thread_call_free(wrapTC->TChdl)) { kfree_type(wrap_thread_call_t, wrapTC); } else { /* Gut this cyclic and move on ... */ wrapTC->hdlr.cyh_func = noop_cyh_func; wrapTC->when.cyt_interval = NEARLY_FOREVER; } } int ddi_driver_major(dev_info_t *devi) { return (int)major(CAST_DOWN_EXPLICIT(int, devi)); } int ddi_create_minor_node(dev_info_t *dip, const char *name, int spec_type, minor_t minor_num, const char *node_type, int flag) { #pragma unused(spec_type,node_type,flag) dev_t dev = makedev( ddi_driver_major(dip), minor_num ); if (NULL == devfs_make_node( dev, DEVFS_CHAR, UID_ROOT, GID_WHEEL, 0666, "%s", name )) { return DDI_FAILURE; } else { return DDI_SUCCESS; } } void ddi_remove_minor_node(dev_info_t *dip, char *name) { #pragma unused(dip,name) /* XXX called from dtrace_detach, so NOTREACHED for now. */ } major_t getemajor( dev_t d ) { return (major_t) major(d); } minor_t getminor( dev_t d ) { return (minor_t) minor(d); } extern void Debugger(const char*); void debug_enter(char *c) { Debugger(c); } /* * kmem */ // rdar://88962505 __typed_allocators_ignore_push void * dt_kmem_alloc_tag(size_t size, int kmflag, vm_tag_t tag) { #pragma unused(kmflag) /* * We ignore the M_NOWAIT bit in kmflag (all of kmflag, in fact). * Requests larger than 8K with M_NOWAIT fail in kalloc_ext. */ return kheap_alloc_tag(KHEAP_DTRACE, size, Z_WAITOK, tag); } void * dt_kmem_zalloc_tag(size_t size, int kmflag, vm_tag_t tag) { #pragma unused(kmflag) /* * We ignore the M_NOWAIT bit in kmflag (all of kmflag, in fact). * Requests larger than 8K with M_NOWAIT fail in kalloc_ext. */ return kheap_alloc_tag(KHEAP_DTRACE, size, Z_WAITOK | Z_ZERO, tag); } void dt_kmem_free(void *buf, size_t size) { kheap_free(KHEAP_DTRACE, buf, size); } __typed_allocators_ignore_pop /* * aligned dt_kmem allocator * align should be a power of two */ void* dt_kmem_alloc_aligned_tag(size_t size, size_t align, int kmflag, vm_tag_t tag) { void *mem, **addr_to_free; intptr_t mem_aligned; size_t *size_to_free, hdr_size; /* Must be a power of two. */ assert(align != 0); assert((align & (align - 1)) == 0); /* * We are going to add a header to the allocation. It contains * the address to free and the total size of the buffer. */ hdr_size = sizeof(size_t) + sizeof(void*); mem = dt_kmem_alloc_tag(size + align + hdr_size, kmflag, tag); if (mem == NULL) { return NULL; } mem_aligned = (intptr_t) (((intptr_t) mem + align + hdr_size) & ~(align - 1)); /* Write the address to free in the header. */ addr_to_free = (void**) (mem_aligned - sizeof(void*)); *addr_to_free = mem; /* Write the size to free in the header. */ size_to_free = (size_t*) (mem_aligned - hdr_size); *size_to_free = size + align + hdr_size; return (void*) mem_aligned; } void* dt_kmem_zalloc_aligned_tag(size_t size, size_t align, int kmflag, vm_tag_t tag) { void* buf; buf = dt_kmem_alloc_aligned_tag(size, align, kmflag, tag); if (!buf) { return NULL; } bzero(buf, size); return buf; } void dt_kmem_free_aligned(void* buf, size_t size) { #pragma unused(size) intptr_t ptr = (intptr_t) buf; void **addr_to_free = (void**) (ptr - sizeof(void*)); size_t *size_to_free = (size_t*) (ptr - (sizeof(size_t) + sizeof(void*))); if (buf == NULL) { return; } dt_kmem_free(*addr_to_free, *size_to_free); } /* * vmem (Solaris "slab" allocator) used by DTrace solely to hand out resource ids */ typedef unsigned int u_daddr_t; #include "blist.h" /* By passing around blist *handles*, the underlying blist can be resized as needed. */ struct blist_hdl { blist_t blist; }; vmem_t * vmem_create(const char *name, void *base, size_t size, size_t quantum, void *ignore5, void *ignore6, vmem_t *source, size_t qcache_max, int vmflag) { #pragma unused(name,quantum,ignore5,ignore6,source,qcache_max,vmflag) blist_t bl; struct blist_hdl *p = kalloc_type(struct blist_hdl, Z_WAITOK); ASSERT(quantum == 1); ASSERT(NULL == ignore5); ASSERT(NULL == ignore6); ASSERT(NULL == source); ASSERT(0 == qcache_max); ASSERT(size <= INT32_MAX); ASSERT(vmflag & VMC_IDENTIFIER); size = MIN(128, size); /* Clamp to 128 initially, since the underlying data structure is pre-allocated */ p->blist = bl = blist_create((daddr_t)size); blist_free(bl, 0, (daddr_t)size); if (base) { blist_alloc( bl, (daddr_t)(uintptr_t)base ); /* Chomp off initial ID(s) */ } return (vmem_t *)p; } void * vmem_alloc(vmem_t *vmp, size_t size, int vmflag) { #pragma unused(vmflag) struct blist_hdl *q = (struct blist_hdl *)vmp; blist_t bl = q->blist; daddr_t p; p = blist_alloc(bl, (daddr_t)size); if (p == SWAPBLK_NONE) { blist_resize(&bl, (bl->bl_blocks) << 1, 1); q->blist = bl; p = blist_alloc(bl, (daddr_t)size); if (p == SWAPBLK_NONE) { panic("vmem_alloc: failure after blist_resize!"); } } return (void *)(uintptr_t)p; } void vmem_free(vmem_t *vmp, void *vaddr, size_t size) { struct blist_hdl *p = (struct blist_hdl *)vmp; blist_free( p->blist, (daddr_t)(uintptr_t)vaddr, (daddr_t)size ); } void vmem_destroy(vmem_t *vmp) { struct blist_hdl *p = (struct blist_hdl *)vmp; blist_destroy( p->blist ); kfree_type(struct blist_hdl, p); } /* * Timing */ /* * dtrace_gethrestime() provides the "walltimestamp", a value that is anchored at * January 1, 1970. Because it can be called from probe context, it must take no locks. */ hrtime_t dtrace_gethrestime(void) { clock_sec_t secs; clock_nsec_t nanosecs; uint64_t secs64, ns64; clock_get_calendar_nanotime_nowait(&secs, &nanosecs); secs64 = (uint64_t)secs; ns64 = (uint64_t)nanosecs; ns64 = ns64 + (secs64 * 1000000000LL); return ns64; } /* * dtrace_gethrtime() provides high-resolution timestamps with machine-dependent origin. * Hence its primary use is to specify intervals. */ hrtime_t dtrace_abs_to_nano(uint64_t elapsed) { static mach_timebase_info_data_t sTimebaseInfo = { 0, 0 }; /* * If this is the first time we've run, get the timebase. * We can use denom == 0 to indicate that sTimebaseInfo is * uninitialised because it makes no sense to have a zero * denominator in a fraction. */ if (sTimebaseInfo.denom == 0) { (void) clock_timebase_info(&sTimebaseInfo); } /* * Convert to nanoseconds. * return (elapsed * (uint64_t)sTimebaseInfo.numer)/(uint64_t)sTimebaseInfo.denom; * * Provided the final result is representable in 64 bits the following maneuver will * deliver that result without intermediate overflow. */ if (sTimebaseInfo.denom == sTimebaseInfo.numer) { return elapsed; } else if (sTimebaseInfo.denom == 1) { return elapsed * (uint64_t)sTimebaseInfo.numer; } else { /* Decompose elapsed = eta32 * 2^32 + eps32: */ uint64_t eta32 = elapsed >> 32; uint64_t eps32 = elapsed & 0x00000000ffffffffLL; uint32_t numer = sTimebaseInfo.numer, denom = sTimebaseInfo.denom; /* Form product of elapsed64 (decomposed) and numer: */ uint64_t mu64 = numer * eta32; uint64_t lambda64 = numer * eps32; /* Divide the constituents by denom: */ uint64_t q32 = mu64 / denom; uint64_t r32 = mu64 - (q32 * denom); /* mu64 % denom */ return (q32 << 32) + ((r32 << 32) + lambda64) / denom; } } hrtime_t dtrace_gethrtime(void) { static uint64_t start = 0; if (start == 0) { start = mach_absolute_time(); } return dtrace_abs_to_nano(mach_absolute_time() - start); } /* * Atomicity and synchronization */ uint32_t dtrace_cas32(uint32_t *target, uint32_t cmp, uint32_t new) { if (OSCompareAndSwap((UInt32)cmp, (UInt32)new, (volatile UInt32 *)target )) { return cmp; } else { return ~cmp; /* Must return something *other* than cmp */ } } void * dtrace_casptr(void *target, void *cmp, void *new) { if (OSCompareAndSwapPtr( cmp, new, (void**)target )) { return cmp; } else { return (void *)(~(uintptr_t)cmp); /* Must return something *other* than cmp */ } } /* * Interrupt manipulation */ dtrace_icookie_t dtrace_interrupt_disable(void) { return (dtrace_icookie_t)ml_set_interrupts_enabled(FALSE); } void dtrace_interrupt_enable(dtrace_icookie_t reenable) { (void)ml_set_interrupts_enabled((boolean_t)reenable); } /* * MP coordination */ static void dtrace_sync_func(void) { } /* * dtrace_sync() is not called from probe context. */ void dtrace_sync(void) { dtrace_xcall(DTRACE_CPUALL, (dtrace_xcall_t)dtrace_sync_func, NULL); } /* * The dtrace_copyin/out/instr and dtrace_fuword* routines can be called from probe context. */ extern kern_return_t dtrace_copyio_preflight(addr64_t); extern kern_return_t dtrace_copyio_postflight(addr64_t); static int dtrace_copycheck(user_addr_t uaddr, uintptr_t kaddr, size_t size) { #pragma unused(kaddr) ASSERT(kaddr + size >= kaddr); if (uaddr + size < uaddr || /* Avoid address wrap. */ KERN_FAILURE == dtrace_copyio_preflight(uaddr)) { /* Machine specific setup/constraints. */ DTRACE_CPUFLAG_SET(CPU_DTRACE_BADADDR); cpu_core[CPU->cpu_id].cpuc_dtrace_illval = uaddr; return 0; } return 1; } void dtrace_copyin(user_addr_t src, uintptr_t dst, size_t len, volatile uint16_t *flags) { #pragma unused(flags) if (dtrace_copycheck( src, dst, len )) { if (copyin((const user_addr_t)src, (char *)dst, (vm_size_t)len)) { DTRACE_CPUFLAG_SET(CPU_DTRACE_BADADDR); cpu_core[CPU->cpu_id].cpuc_dtrace_illval = src; } dtrace_copyio_postflight(src); } } void dtrace_copyinstr(user_addr_t src, uintptr_t dst, size_t len, volatile uint16_t *flags) { #pragma unused(flags) size_t actual; if (dtrace_copycheck( src, dst, len )) { /* copyin as many as 'len' bytes. */ int error = copyinstr((const user_addr_t)src, (char *)dst, (vm_size_t)len, &actual); /* * ENAMETOOLONG is returned when 'len' bytes have been copied in but the NUL terminator was * not encountered. That does not require raising CPU_DTRACE_BADADDR, and we press on. * Note that we do *not* stuff a NUL terminator when returning ENAMETOOLONG, that's left * to the caller. */ if (error && error != ENAMETOOLONG) { DTRACE_CPUFLAG_SET(CPU_DTRACE_BADADDR); cpu_core[CPU->cpu_id].cpuc_dtrace_illval = src; } dtrace_copyio_postflight(src); } } void dtrace_copyout(uintptr_t src, user_addr_t dst, size_t len, volatile uint16_t *flags) { #pragma unused(flags) if (dtrace_copycheck( dst, src, len )) { if (copyout((const void *)src, dst, (vm_size_t)len)) { DTRACE_CPUFLAG_SET(CPU_DTRACE_BADADDR); cpu_core[CPU->cpu_id].cpuc_dtrace_illval = dst; } dtrace_copyio_postflight(dst); } } void dtrace_copyoutstr(uintptr_t src, user_addr_t dst, size_t len, volatile uint16_t *flags) { #pragma unused(flags) size_t actual; if (dtrace_copycheck( dst, src, len )) { /* * ENAMETOOLONG is returned when 'len' bytes have been copied out but the NUL terminator was * not encountered. We raise CPU_DTRACE_BADADDR in that case. * Note that we do *not* stuff a NUL terminator when returning ENAMETOOLONG, that's left * to the caller. */ if (copyoutstr((const void *)src, dst, (size_t)len, &actual)) { DTRACE_CPUFLAG_SET(CPU_DTRACE_BADADDR); cpu_core[CPU->cpu_id].cpuc_dtrace_illval = dst; } dtrace_copyio_postflight(dst); } } extern const int copysize_limit_panic; int dtrace_copy_maxsize(void) { return copysize_limit_panic; } int dtrace_buffer_copyout(const void *kaddr, user_addr_t uaddr, vm_size_t nbytes) { int maxsize = dtrace_copy_maxsize(); /* * Partition the copyout in copysize_limit_panic-sized chunks */ while (nbytes >= (vm_size_t)maxsize) { if (copyout(kaddr, uaddr, maxsize) != 0) { return EFAULT; } nbytes -= maxsize; uaddr += maxsize; kaddr = (const void *)((uintptr_t)kaddr + maxsize); } if (nbytes > 0) { if (copyout(kaddr, uaddr, nbytes) != 0) { return EFAULT; } } return 0; } uint8_t dtrace_fuword8(user_addr_t uaddr) { uint8_t ret = 0; DTRACE_CPUFLAG_SET(CPU_DTRACE_NOFAULT); if (dtrace_copycheck( uaddr, (uintptr_t)&ret, sizeof(ret))) { if (copyin((const user_addr_t)uaddr, (char *)&ret, sizeof(ret))) { DTRACE_CPUFLAG_SET(CPU_DTRACE_BADADDR); cpu_core[CPU->cpu_id].cpuc_dtrace_illval = uaddr; } dtrace_copyio_postflight(uaddr); } DTRACE_CPUFLAG_CLEAR(CPU_DTRACE_NOFAULT); return ret; } uint16_t dtrace_fuword16(user_addr_t uaddr) { uint16_t ret = 0; DTRACE_CPUFLAG_SET(CPU_DTRACE_NOFAULT); if (dtrace_copycheck( uaddr, (uintptr_t)&ret, sizeof(ret))) { if (copyin((const user_addr_t)uaddr, (char *)&ret, sizeof(ret))) { DTRACE_CPUFLAG_SET(CPU_DTRACE_BADADDR); cpu_core[CPU->cpu_id].cpuc_dtrace_illval = uaddr; } dtrace_copyio_postflight(uaddr); } DTRACE_CPUFLAG_CLEAR(CPU_DTRACE_NOFAULT); return ret; } uint32_t dtrace_fuword32(user_addr_t uaddr) { uint32_t ret = 0; DTRACE_CPUFLAG_SET(CPU_DTRACE_NOFAULT); if (dtrace_copycheck( uaddr, (uintptr_t)&ret, sizeof(ret))) { if (copyin((const user_addr_t)uaddr, (char *)&ret, sizeof(ret))) { DTRACE_CPUFLAG_SET(CPU_DTRACE_BADADDR); cpu_core[CPU->cpu_id].cpuc_dtrace_illval = uaddr; } dtrace_copyio_postflight(uaddr); } DTRACE_CPUFLAG_CLEAR(CPU_DTRACE_NOFAULT); return ret; } uint64_t dtrace_fuword64(user_addr_t uaddr) { uint64_t ret = 0; DTRACE_CPUFLAG_SET(CPU_DTRACE_NOFAULT); if (dtrace_copycheck( uaddr, (uintptr_t)&ret, sizeof(ret))) { if (copyin((const user_addr_t)uaddr, (char *)&ret, sizeof(ret))) { DTRACE_CPUFLAG_SET(CPU_DTRACE_BADADDR); cpu_core[CPU->cpu_id].cpuc_dtrace_illval = uaddr; } dtrace_copyio_postflight(uaddr); } DTRACE_CPUFLAG_CLEAR(CPU_DTRACE_NOFAULT); return ret; } /* * Emulation of Solaris fuword / suword * Called from the fasttrap provider, so the use of copyin/out requires fewer safegaurds. */ int fuword8(user_addr_t uaddr, uint8_t *value) { if (copyin((const user_addr_t)uaddr, (char *)value, sizeof(uint8_t)) != 0) { return -1; } return 0; } int fuword16(user_addr_t uaddr, uint16_t *value) { if (copyin((const user_addr_t)uaddr, (char *)value, sizeof(uint16_t)) != 0) { return -1; } return 0; } int fuword32(user_addr_t uaddr, uint32_t *value) { if (copyin((const user_addr_t)uaddr, (char *)value, sizeof(uint32_t)) != 0) { return -1; } return 0; } int fuword64(user_addr_t uaddr, uint64_t *value) { if (copyin((const user_addr_t)uaddr, (char *)value, sizeof(uint64_t)) != 0) { return -1; } return 0; } void fuword32_noerr(user_addr_t uaddr, uint32_t *value) { if (copyin((const user_addr_t)uaddr, (char *)value, sizeof(uint32_t))) { *value = 0; } } void fuword64_noerr(user_addr_t uaddr, uint64_t *value) { if (copyin((const user_addr_t)uaddr, (char *)value, sizeof(uint64_t))) { *value = 0; } } int suword64(user_addr_t addr, uint64_t value) { if (copyout((const void *)&value, addr, sizeof(value)) != 0) { return -1; } return 0; } int suword32(user_addr_t addr, uint32_t value) { if (copyout((const void *)&value, addr, sizeof(value)) != 0) { return -1; } return 0; } /* * Miscellaneous */ extern boolean_t dtrace_tally_fault(user_addr_t); boolean_t dtrace_tally_fault(user_addr_t uaddr) { DTRACE_CPUFLAG_SET(CPU_DTRACE_BADADDR); cpu_core[CPU->cpu_id].cpuc_dtrace_illval = uaddr; return DTRACE_CPUFLAG_ISSET(CPU_DTRACE_NOFAULT) ? TRUE : FALSE; } #define TOTTY 0x02 extern int prf(const char *, va_list, int, struct tty *); /* bsd/kern/subr_prf.h */ int vuprintf(const char *format, va_list ap) { return prf(format, ap, TOTTY, NULL); } /* Not called from probe context */ void cmn_err( int level, const char *format, ... ) { #pragma unused(level) va_list alist; va_start(alist, format); vuprintf(format, alist); va_end(alist); uprintf("\n"); } const void* bsearch(const void *key, const void *base0, size_t nmemb, size_t size, int (*compar)(const void *, const void *)) { const char *base = base0; size_t lim; int cmp; const void *p; for (lim = nmemb; lim != 0; lim >>= 1) { p = base + (lim >> 1) * size; cmp = (*compar)(key, p); if (cmp == 0) { return p; } if (cmp > 0) { /* key > p: move right */ base = (const char *)p + size; lim--; } /* else move left */ } return NULL; } /* * Runtime and ABI */ uintptr_t dtrace_caller(int ignore) { #pragma unused(ignore) return -1; /* Just as in Solaris dtrace_asm.s */ } int dtrace_getstackdepth(int aframes) { struct frame *fp = (struct frame *)__builtin_frame_address(0); struct frame *nextfp, *minfp, *stacktop; int depth = 0; int on_intr; if ((on_intr = CPU_ON_INTR(CPU)) != 0) { stacktop = (struct frame *)dtrace_get_cpu_int_stack_top(); } else { stacktop = (struct frame *)(dtrace_get_kernel_stack(current_thread()) + kernel_stack_size); } minfp = fp; aframes++; for (;;) { depth++; nextfp = *(struct frame **)fp; if (nextfp <= minfp || nextfp >= stacktop) { if (on_intr) { /* * Hop from interrupt stack to thread stack. */ vm_offset_t kstack_base = dtrace_get_kernel_stack(current_thread()); minfp = (struct frame *)kstack_base; stacktop = (struct frame *)(kstack_base + kernel_stack_size); on_intr = 0; continue; } break; } fp = nextfp; minfp = fp; } if (depth <= aframes) { return 0; } return depth - aframes; } int dtrace_addr_in_module(const void* addr, const struct modctl *ctl) { return OSKextKextForAddress(addr) == (void*)ctl->mod_address; } /* * Unconsidered */ void dtrace_vtime_enable(void) { } void dtrace_vtime_disable(void) { } |