Lines Matching refs:lock1
1305 lock_descriptor_t *lock, *lock1; in flk_execute_request() local
1332 lock1 = lock->l_next; in flk_execute_request()
1336 lock = lock1; in flk_execute_request()
1618 lock_descriptor_t *lock1, *lock2; in flk_relation() local
1676 lock1 = flk_get_lock(); in flk_relation()
1678 COPY(lock1, lock); in flk_relation()
1680 lock1->l_start = lock->l_start; in flk_relation()
1681 lock1->l_end = request->l_start - 1; in flk_relation()
1684 topology[0] = lock1; in flk_relation()
1695 lock1 = flk_get_lock(); in flk_relation()
1696 COPY(lock1, lock); in flk_relation()
1697 lock1->l_start = request->l_end + 1; in flk_relation()
1698 topology[0] = lock1; in flk_relation()
1709 lock1 = flk_get_lock(); in flk_relation()
1710 COPY(lock1, lock); in flk_relation()
1711 lock1->l_start = request->l_end + 1; in flk_relation()
1712 topology[0] = lock1; in flk_relation()
1724 lock1 = flk_get_lock(); in flk_relation()
1725 COPY(lock1, lock); in flk_relation()
1726 lock1->l_end = request->l_start - 1; in flk_relation()
1727 topology[0] = lock1; in flk_relation()
1745 lock1 = flk_get_lock(); in flk_relation()
1746 COPY(lock1, lock); in flk_relation()
1747 lock1->l_end = request->l_start - 1; in flk_relation()
1748 topology[0] = lock1; in flk_relation()
4358 lock_descriptor_t *lock, *lock1; in check_active_locks() local
4375 for (lock1 = lock->l_next; lock1 != ACTIVE_HEAD(gp); in check_active_locks()
4376 lock1 = lock1->l_next) { in check_active_locks()
4377 if (lock1->l_vnode == lock->l_vnode) { in check_active_locks()
4378 if (BLOCKS(lock1, lock)) { in check_active_locks()
4381 (void *)lock1, (void *)lock); in check_active_locks()
4382 } else if (BLOCKS(lock, lock1)) { in check_active_locks()
4385 (void *)lock, (void *)lock1); in check_active_locks()
4468 lock_descriptor_t *lock1, *lock2; in check_sleeping_locks() local
4470 for (lock1 = SLEEPING_HEAD(gp)->l_next; lock1 != SLEEPING_HEAD(gp); in check_sleeping_locks()
4471 lock1 = lock1->l_next) { in check_sleeping_locks()
4472 ASSERT(!IS_BARRIER(lock1)); in check_sleeping_locks()
4473 for (lock2 = lock1->l_next; lock2 != SLEEPING_HEAD(gp); in check_sleeping_locks()
4475 if (lock1->l_vnode == lock2->l_vnode) { in check_sleeping_locks()
4476 if (BLOCKS(lock2, lock1)) { in check_sleeping_locks()
4477 ASSERT(!IS_GRANTED(lock1)); in check_sleeping_locks()
4478 ASSERT(!NOT_BLOCKED(lock1)); in check_sleeping_locks()
4479 path(lock1, lock2); in check_sleeping_locks()
4486 ASSERT(!IS_BARRIER(lock1)); in check_sleeping_locks()
4487 if (lock1->l_vnode == lock2->l_vnode) { in check_sleeping_locks()
4488 if (BLOCKS(lock2, lock1)) { in check_sleeping_locks()
4489 ASSERT(!IS_GRANTED(lock1)); in check_sleeping_locks()
4490 ASSERT(!NOT_BLOCKED(lock1)); in check_sleeping_locks()
4491 path(lock1, lock2); in check_sleeping_locks()
4495 ep = FIRST_ADJ(lock1); in check_sleeping_locks()
4496 while (ep != HEAD(lock1)) { in check_sleeping_locks()
4497 ASSERT(BLOCKS(ep->to_vertex, lock1)); in check_sleeping_locks()
4504 level_two_path(lock_descriptor_t *lock1, lock_descriptor_t *lock2, int no_path) in level_two_path() argument
4512 flk_graph_uncolor(lock1->l_graph); in level_two_path()
4513 ep = FIRST_ADJ(lock1); in level_two_path()
4514 ASSERT(ep != HEAD(lock1)); in level_two_path()
4515 while (ep != HEAD(lock1)) { in level_two_path()
4575 level_one_path(lock_descriptor_t *lock1, lock_descriptor_t *lock2) in level_one_path() argument
4577 edge_t *ep = FIRST_ADJ(lock1); in level_one_path()
4579 while (ep != HEAD(lock1)) { in level_one_path()
4589 no_path(lock_descriptor_t *lock1, lock_descriptor_t *lock2) in no_path() argument
4591 return (!level_two_path(lock1, lock2, 1)); in no_path()
4595 path(lock_descriptor_t *lock1, lock_descriptor_t *lock2) in path() argument
4597 if (level_one_path(lock1, lock2)) { in path()
4598 if (level_two_path(lock1, lock2, 0) != 0) { in path()
4601 (void *)lock1, (void *)lock2); in path()
4603 } else if (no_path(lock1, lock2)) { in path()
4606 (void *)lock1, (void *)lock2); in path()