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 | /* * Copyright (c) 2000 Apple Computer, Inc. All rights reserved. * * @APPLE_LICENSE_HEADER_START@ * * Copyright (c) 1999-2003 Apple Computer, Inc. All Rights Reserved. * * 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. 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_LICENSE_HEADER_END@ */ /* * @OSF_COPYRIGHT@ * */ /* * File: kern/sync_lock.c * Author: Joseph CaraDonna * * Contains RT distributed lock synchronization services. */ #include <kern/etap_macros.h> #include <kern/misc_protos.h> #include <kern/sync_lock.h> #include <kern/sched_prim.h> #include <kern/ipc_kobject.h> #include <kern/ipc_sync.h> #include <kern/etap_macros.h> #include <kern/thread.h> #include <kern/task.h> #include <ipc/ipc_port.h> #include <ipc/ipc_space.h> /* * Ulock ownership MACROS * * Assumes: ulock internal lock is held */ #define ulock_ownership_set(ul, th) \ MACRO_BEGIN \ thread_act_t _th_act; \ _th_act = (th)->top_act; \ act_lock(_th_act); \ enqueue (&_th_act->held_ulocks, (queue_entry_t) (ul)); \ act_unlock(_th_act); \ (ul)->holder = _th_act; \ MACRO_END #define ulock_ownership_clear(ul) \ MACRO_BEGIN \ thread_act_t _th_act; \ _th_act = (ul)->holder; \ if (_th_act->active) { \ act_lock(_th_act); \ remqueue(&_th_act->held_ulocks, \ (queue_entry_t) (ul)); \ act_unlock(_th_act); \ } else { \ remqueue(&_th_act->held_ulocks, \ (queue_entry_t) (ul)); \ } \ (ul)->holder = THR_ACT_NULL; \ MACRO_END /* * Lock set ownership MACROS */ #define lock_set_ownership_set(ls, t) \ MACRO_BEGIN \ task_lock((t)); \ enqueue_head(&(t)->lock_set_list, (queue_entry_t) (ls));\ (t)->lock_sets_owned++; \ task_unlock((t)); \ (ls)->owner = (t); \ MACRO_END #define lock_set_ownership_clear(ls, t) \ MACRO_BEGIN \ task_lock((t)); \ remqueue(&(t)->lock_set_list, (queue_entry_t) (ls)); \ (t)->lock_sets_owned--; \ task_unlock((t)); \ MACRO_END unsigned int lock_set_event; #define LOCK_SET_EVENT ((event64_t)&lock_set_event) unsigned int lock_set_handoff; #define LOCK_SET_HANDOFF ((event64_t)&lock_set_handoff) /* * ROUTINE: lock_set_init [private] * * Initialize the lock_set subsystem. * * For now, we don't have anything to do here. */ void lock_set_init(void) { return; } /* * ROUTINE: lock_set_create [exported] * * Creates a lock set. * The port representing the lock set is returned as a parameter. */ kern_return_t lock_set_create ( task_t task, lock_set_t *new_lock_set, int n_ulocks, int policy) { lock_set_t lock_set = LOCK_SET_NULL; ulock_t ulock; int size; int x; *new_lock_set = LOCK_SET_NULL; if (task == TASK_NULL || n_ulocks <= 0 || policy > SYNC_POLICY_MAX) return KERN_INVALID_ARGUMENT; size = sizeof(struct lock_set) + (sizeof(struct ulock) * (n_ulocks-1)); lock_set = (lock_set_t) kalloc (size); if (lock_set == LOCK_SET_NULL) return KERN_RESOURCE_SHORTAGE; lock_set_lock_init(lock_set); lock_set->n_ulocks = n_ulocks; lock_set->ref_count = 1; /* * Create and initialize the lock set port */ lock_set->port = ipc_port_alloc_kernel(); if (lock_set->port == IP_NULL) { /* This will deallocate the lock set */ lock_set_dereference(lock_set); return KERN_RESOURCE_SHORTAGE; } ipc_kobject_set (lock_set->port, (ipc_kobject_t) lock_set, IKOT_LOCK_SET); /* * Initialize each ulock in the lock set */ for (x=0; x < n_ulocks; x++) { ulock = (ulock_t) &lock_set->ulock_list[x]; ulock_lock_init(ulock); ulock->lock_set = lock_set; ulock->holder = THR_ACT_NULL; ulock->blocked = FALSE; ulock->unstable = FALSE; ulock->ho_wait = FALSE; wait_queue_init(&ulock->wait_queue, policy); } lock_set_ownership_set(lock_set, task); lock_set->active = TRUE; *new_lock_set = lock_set; return KERN_SUCCESS; } /* * ROUTINE: lock_set_destroy [exported] * * Destroys a lock set. This call will only succeed if the * specified task is the SAME task name specified at the lock set's * creation. * * NOTES: * - All threads currently blocked on the lock set's ulocks are awoken. * - These threads will return with the KERN_LOCK_SET_DESTROYED error. */ kern_return_t lock_set_destroy (task_t task, lock_set_t lock_set) { thread_t thread; ulock_t ulock; int i; if (task == TASK_NULL || lock_set == LOCK_SET_NULL) return KERN_INVALID_ARGUMENT; if (lock_set->owner != task) return KERN_INVALID_RIGHT; lock_set_lock(lock_set); if (!lock_set->active) { lock_set_unlock(lock_set); return KERN_LOCK_SET_DESTROYED; } /* * Deactivate lock set */ lock_set->active = FALSE; /* * If a ulock is currently held in the target lock set: * * 1) Wakeup all threads blocked on the ulock (if any). Threads * may be blocked waiting normally, or waiting for a handoff. * Blocked threads will return with KERN_LOCK_SET_DESTROYED. * * 2) ulock ownership is cleared. * The thread currently holding the ulock is revoked of its * ownership. */ for (i = 0; i < lock_set->n_ulocks; i++) { ulock = &lock_set->ulock_list[i]; ulock_lock(ulock); if (ulock->accept_wait) { ulock->accept_wait = FALSE; wait_queue_wakeup64_one(&ulock->wait_queue, LOCK_SET_HANDOFF, THREAD_RESTART); } if (ulock->holder) { if (ulock->blocked) { ulock->blocked = FALSE; wait_queue_wakeup64_all(&ulock->wait_queue, LOCK_SET_EVENT, THREAD_RESTART); } if (ulock->ho_wait) { ulock->ho_wait = FALSE; wait_queue_wakeup64_one(&ulock->wait_queue, LOCK_SET_HANDOFF, THREAD_RESTART); } ulock_ownership_clear(ulock); } ulock_unlock(ulock); } lock_set_unlock(lock_set); lock_set_ownership_clear(lock_set, task); /* * Deallocate * * Drop the lock set reference, which inturn destroys the * lock set structure if the reference count goes to zero. */ ipc_port_dealloc_kernel(lock_set->port); lock_set_dereference(lock_set); return KERN_SUCCESS; } kern_return_t lock_acquire (lock_set_t lock_set, int lock_id) { ulock_t ulock; if (lock_set == LOCK_SET_NULL) return KERN_INVALID_ARGUMENT; if (lock_id < 0 || lock_id >= lock_set->n_ulocks) return KERN_INVALID_ARGUMENT; retry: lock_set_lock(lock_set); if (!lock_set->active) { lock_set_unlock(lock_set); return KERN_LOCK_SET_DESTROYED; } ulock = (ulock_t) &lock_set->ulock_list[lock_id]; ulock_lock(ulock); lock_set_unlock(lock_set); /* * Block the current thread if the lock is already held. */ if (ulock->holder != THR_ACT_NULL) { int wait_result; if (ulock->holder == current_act()) { ulock_unlock(ulock); return KERN_LOCK_OWNED_SELF; } ulock->blocked = TRUE; wait_result = wait_queue_assert_wait64(&ulock->wait_queue, LOCK_SET_EVENT, THREAD_ABORTSAFE); ulock_unlock(ulock); /* * Block - Wait for lock to become available. */ if (wait_result == THREAD_WAITING) wait_result = thread_block(THREAD_CONTINUE_NULL); /* * Check the result status: * * Check to see why thread was woken up. In all cases, we * already have been removed from the queue. */ switch (wait_result) { case THREAD_AWAKENED: /* lock transitioned from old locker to us */ /* he already made us owner */ return (ulock->unstable) ? KERN_LOCK_UNSTABLE : KERN_SUCCESS; case THREAD_INTERRUPTED: return KERN_ABORTED; case THREAD_RESTART: goto retry; /* probably a dead lock_set */ default: panic("lock_acquire\n"); } } /* * Assign lock ownership */ ulock_ownership_set(ulock, current_thread()); ulock_unlock(ulock); return (ulock->unstable) ? KERN_LOCK_UNSTABLE : KERN_SUCCESS; } kern_return_t lock_release (lock_set_t lock_set, int lock_id) { ulock_t ulock; if (lock_set == LOCK_SET_NULL) return KERN_INVALID_ARGUMENT; if (lock_id < 0 || lock_id >= lock_set->n_ulocks) return KERN_INVALID_ARGUMENT; ulock = (ulock_t) &lock_set->ulock_list[lock_id]; return (lock_release_internal(ulock, current_act())); } kern_return_t lock_try (lock_set_t lock_set, int lock_id) { ulock_t ulock; if (lock_set == LOCK_SET_NULL) return KERN_INVALID_ARGUMENT; if (lock_id < 0 || lock_id >= lock_set->n_ulocks) return KERN_INVALID_ARGUMENT; lock_set_lock(lock_set); if (!lock_set->active) { lock_set_unlock(lock_set); return KERN_LOCK_SET_DESTROYED; } ulock = (ulock_t) &lock_set->ulock_list[lock_id]; ulock_lock(ulock); lock_set_unlock(lock_set); /* * If the lock is already owned, we return without blocking. * * An ownership status is returned to inform the caller as to * whether it already holds the lock or another thread does. */ if (ulock->holder != THR_ACT_NULL) { lock_set_unlock(lock_set); if (ulock->holder == current_act()) { ulock_unlock(ulock); return KERN_LOCK_OWNED_SELF; } ulock_unlock(ulock); return KERN_LOCK_OWNED; } /* * Add the ulock to the lock set's held_ulocks list. */ ulock_ownership_set(ulock, current_thread()); ulock_unlock(ulock); return (ulock->unstable) ? KERN_LOCK_UNSTABLE : KERN_SUCCESS; } kern_return_t lock_make_stable (lock_set_t lock_set, int lock_id) { ulock_t ulock; if (lock_set == LOCK_SET_NULL) return KERN_INVALID_ARGUMENT; if (lock_id < 0 || lock_id >= lock_set->n_ulocks) return KERN_INVALID_ARGUMENT; lock_set_lock(lock_set); if (!lock_set->active) { lock_set_unlock(lock_set); return KERN_LOCK_SET_DESTROYED; } ulock = (ulock_t) &lock_set->ulock_list[lock_id]; ulock_lock(ulock); lock_set_unlock(lock_set); if (ulock->holder != current_act()) { ulock_unlock(ulock); return KERN_INVALID_RIGHT; } ulock->unstable = FALSE; ulock_unlock(ulock); return KERN_SUCCESS; } /* * ROUTINE: lock_make_unstable [internal] * * Marks the lock as unstable. * * NOTES: * - All future acquisitions of the lock will return with a * KERN_LOCK_UNSTABLE status, until the lock is made stable again. */ kern_return_t lock_make_unstable (ulock_t ulock, thread_act_t thr_act) { lock_set_t lock_set; lock_set = ulock->lock_set; lock_set_lock(lock_set); if (!lock_set->active) { lock_set_unlock(lock_set); return KERN_LOCK_SET_DESTROYED; } ulock_lock(ulock); lock_set_unlock(lock_set); if (ulock->holder != thr_act) { ulock_unlock(ulock); return KERN_INVALID_RIGHT; } ulock->unstable = TRUE; ulock_unlock(ulock); return KERN_SUCCESS; } /* * ROUTINE: lock_release_internal [internal] * * Releases the ulock. * If any threads are blocked waiting for the ulock, one is woken-up. * */ kern_return_t lock_release_internal (ulock_t ulock, thread_act_t thr_act) { lock_set_t lock_set; int result; if ((lock_set = ulock->lock_set) == LOCK_SET_NULL) return KERN_INVALID_ARGUMENT; lock_set_lock(lock_set); if (!lock_set->active) { lock_set_unlock(lock_set); return KERN_LOCK_SET_DESTROYED; } ulock_lock(ulock); lock_set_unlock(lock_set); if (ulock->holder != thr_act) { ulock_unlock(ulock); return KERN_INVALID_RIGHT; } /* * If we have a hint that threads might be waiting, * try to transfer the lock ownership to a waiting thread * and wake it up. */ if (ulock->blocked) { wait_queue_t wq = &ulock->wait_queue; thread_t thread; spl_t s; s = splsched(); wait_queue_lock(wq); thread = wait_queue_wakeup64_identity_locked(wq, LOCK_SET_EVENT, THREAD_AWAKENED, TRUE); /* wait_queue now unlocked, thread locked */ if (thread != THREAD_NULL) { /* * JMM - These ownership transfer macros have a * locking/race problem. To keep the thread from * changing states on us (nullifying the ownership * assignment) we need to keep the thread locked * during the assignment. But we can't because the * macros take an activation lock, which is a mutex. * Since this code was already broken before I got * here, I will leave it for now. */ thread_unlock(thread); splx(s); /* * Transfer ulock ownership * from the current thread to the acquisition thread. */ ulock_ownership_clear(ulock); ulock_ownership_set(ulock, thread); ulock_unlock(ulock); return KERN_SUCCESS; } else { ulock->blocked = FALSE; splx(s); } } /* * Disown ulock */ ulock_ownership_clear(ulock); ulock_unlock(ulock); return KERN_SUCCESS; } kern_return_t lock_handoff (lock_set_t lock_set, int lock_id) { ulock_t ulock; int wait_result; if (lock_set == LOCK_SET_NULL) return KERN_INVALID_ARGUMENT; if (lock_id < 0 || lock_id >= lock_set->n_ulocks) return KERN_INVALID_ARGUMENT; retry: lock_set_lock(lock_set); if (!lock_set->active) { lock_set_unlock(lock_set); return KERN_LOCK_SET_DESTROYED; } ulock = (ulock_t) &lock_set->ulock_list[lock_id]; ulock_lock(ulock); lock_set_unlock(lock_set); if (ulock->holder != current_act()) { ulock_unlock(ulock); return KERN_INVALID_RIGHT; } /* * If the accepting thread (the receiver) is already waiting * to accept the lock from the handoff thread (the sender), * then perform the hand-off now. */ if (ulock->accept_wait) { wait_queue_t wq = &ulock->wait_queue; thread_t thread; spl_t s; /* * See who the lucky devil is, if he is still there waiting. */ s = splsched(); wait_queue_lock(wq); thread = wait_queue_wakeup64_identity_locked( wq, LOCK_SET_HANDOFF, THREAD_AWAKENED, TRUE); /* wait queue unlocked, thread locked */ /* * Transfer lock ownership */ if (thread != THREAD_NULL) { /* * JMM - These ownership transfer macros have a * locking/race problem. To keep the thread from * changing states on us (nullifying the ownership * assignment) we need to keep the thread locked * during the assignment. But we can't because the * macros take an activation lock, which is a mutex. * Since this code was already broken before I got * here, I will leave it for now. */ thread_unlock(thread); splx(s); ulock_ownership_clear(ulock); ulock_ownership_set(ulock, thread); ulock->accept_wait = FALSE; ulock_unlock(ulock); return KERN_SUCCESS; } else { /* * OOPS. The accepting thread must have been aborted. * and is racing back to clear the flag that says is * waiting for an accept. He will clear it when we * release the lock, so just fall thru and wait for * the next accept thread (that's the way it is * specified). */ splx(s); } } /* * Indicate that there is a hand-off thread waiting, and then wait * for an accepting thread. */ ulock->ho_wait = TRUE; wait_result = wait_queue_assert_wait64(&ulock->wait_queue, LOCK_SET_HANDOFF, THREAD_ABORTSAFE); ulock_unlock(ulock); if (wait_result == THREAD_WAITING) wait_result = thread_block(THREAD_CONTINUE_NULL); /* * If the thread was woken-up via some action other than * lock_handoff_accept or lock_set_destroy (i.e. thread_terminate), * then we need to clear the ulock's handoff state. */ switch (wait_result) { case THREAD_AWAKENED: return KERN_SUCCESS; case THREAD_INTERRUPTED: ulock_lock(ulock); assert(ulock->holder == current_act()); ulock->ho_wait = FALSE; ulock_unlock(ulock); return KERN_ABORTED; case THREAD_RESTART: goto retry; default: panic("lock_handoff"); } } kern_return_t lock_handoff_accept (lock_set_t lock_set, int lock_id) { ulock_t ulock; int wait_result; if (lock_set == LOCK_SET_NULL) return KERN_INVALID_ARGUMENT; if (lock_id < 0 || lock_id >= lock_set->n_ulocks) return KERN_INVALID_ARGUMENT; retry: lock_set_lock(lock_set); if (!lock_set->active) { lock_set_unlock(lock_set); return KERN_LOCK_SET_DESTROYED; } ulock = (ulock_t) &lock_set->ulock_list[lock_id]; ulock_lock(ulock); lock_set_unlock(lock_set); /* * If there is another accepting thread that beat us, just * return with an error. */ if (ulock->accept_wait) { ulock_unlock(ulock); return KERN_ALREADY_WAITING; } if (ulock->holder == current_act()) { ulock_unlock(ulock); return KERN_LOCK_OWNED_SELF; } /* * If the handoff thread (the sender) is already waiting to * hand-off the lock to the accepting thread (the receiver), * then perform the hand-off now. */ if (ulock->ho_wait) { wait_queue_t wq = &ulock->wait_queue; thread_t thread; /* * See who the lucky devil is, if he is still there waiting. */ assert(ulock->holder != THR_ACT_NULL); thread = ulock->holder->thread; if (wait_queue_wakeup64_thread(wq, LOCK_SET_HANDOFF, thread, THREAD_AWAKENED) == KERN_SUCCESS) { /* * Holder thread was still waiting to give it * away. Take over ownership. */ ulock_ownership_clear(ulock); ulock_ownership_set(ulock, current_thread()); ulock->ho_wait = FALSE; ulock_unlock(ulock); return (ulock->unstable) ? KERN_LOCK_UNSTABLE : KERN_SUCCESS; } /* * OOPS. The owner was aborted out of the handoff. * He will clear his own flag when he gets back. * in the meantime, we will wait as if we didn't * even see his flag (by falling thru). */ } ulock->accept_wait = TRUE; wait_result = wait_queue_assert_wait64(&ulock->wait_queue, LOCK_SET_HANDOFF, THREAD_ABORTSAFE); ulock_unlock(ulock); if (wait_result == THREAD_WAITING) wait_result = thread_block(THREAD_CONTINUE_NULL); /* * If the thread was woken-up via some action other than * lock_handoff_accept or lock_set_destroy (i.e. thread_terminate), * then we need to clear the ulock's handoff state. */ switch (wait_result) { case THREAD_AWAKENED: return KERN_SUCCESS; case THREAD_INTERRUPTED: ulock_lock(ulock); ulock->accept_wait = FALSE; ulock_unlock(ulock); return KERN_ABORTED; case THREAD_RESTART: goto retry; default: panic("lock_handoff_accept"); } } /* * Routine: lock_set_reference * * Take out a reference on a lock set. This keeps the data structure * in existence (but the lock set may be deactivated). */ void lock_set_reference(lock_set_t lock_set) { lock_set_lock(lock_set); lock_set->ref_count++; lock_set_unlock(lock_set); } /* * Routine: lock_set_dereference * * Release a reference on a lock set. If this is the last reference, * the lock set data structure is deallocated. */ void lock_set_dereference(lock_set_t lock_set) { int ref_count; int size; lock_set_lock(lock_set); ref_count = --(lock_set->ref_count); lock_set_unlock(lock_set); if (ref_count == 0) { size = sizeof(struct lock_set) + (sizeof(struct ulock) * (lock_set->n_ulocks - 1)); kfree((vm_offset_t) lock_set, size); } } |