Lines Matching defs:lock1
1305 lock_descriptor_t *lock, *lock1;
1332 lock1 = lock->l_next;
1336 lock = lock1;
1616 lock_descriptor_t *lock1, *lock2;
1674 lock1 = flk_get_lock();
1676 COPY(lock1, lock);
1678 lock1->l_start = lock->l_start;
1679 lock1->l_end = request->l_start - 1;
1682 topology[0] = lock1;
1693 lock1 = flk_get_lock();
1694 COPY(lock1, lock);
1695 lock1->l_start = request->l_end + 1;
1696 topology[0] = lock1;
1707 lock1 = flk_get_lock();
1708 COPY(lock1, lock);
1709 lock1->l_start = request->l_end + 1;
1710 topology[0] = lock1;
1722 lock1 = flk_get_lock();
1723 COPY(lock1, lock);
1724 lock1->l_end = request->l_start - 1;
1725 topology[0] = lock1;
1743 lock1 = flk_get_lock();
1744 COPY(lock1, lock);
1745 lock1->l_end = request->l_start - 1;
1746 topology[0] = lock1;
4354 lock_descriptor_t *lock, *lock1;
4371 for (lock1 = lock->l_next; lock1 != ACTIVE_HEAD(gp);
4372 lock1 = lock1->l_next) {
4373 if (lock1->l_vnode == lock->l_vnode) {
4374 if (BLOCKS(lock1, lock)) {
4377 (void *)lock1, (void *)lock);
4378 } else if (BLOCKS(lock, lock1)) {
4381 (void *)lock, (void *)lock1);
4464 lock_descriptor_t *lock1, *lock2;
4466 for (lock1 = SLEEPING_HEAD(gp)->l_next; lock1 != SLEEPING_HEAD(gp);
4467 lock1 = lock1->l_next) {
4468 ASSERT(!IS_BARRIER(lock1));
4469 for (lock2 = lock1->l_next; lock2 != SLEEPING_HEAD(gp);
4471 if (lock1->l_vnode == lock2->l_vnode) {
4472 if (BLOCKS(lock2, lock1)) {
4473 ASSERT(!IS_GRANTED(lock1));
4474 ASSERT(!NOT_BLOCKED(lock1));
4475 path(lock1, lock2);
4482 ASSERT(!IS_BARRIER(lock1));
4483 if (lock1->l_vnode == lock2->l_vnode) {
4484 if (BLOCKS(lock2, lock1)) {
4485 ASSERT(!IS_GRANTED(lock1));
4486 ASSERT(!NOT_BLOCKED(lock1));
4487 path(lock1, lock2);
4491 ep = FIRST_ADJ(lock1);
4492 while (ep != HEAD(lock1)) {
4493 ASSERT(BLOCKS(ep->to_vertex, lock1));
4500 level_two_path(lock_descriptor_t *lock1, lock_descriptor_t *lock2, int no_path)
4508 flk_graph_uncolor(lock1->l_graph);
4509 ep = FIRST_ADJ(lock1);
4510 ASSERT(ep != HEAD(lock1));
4511 while (ep != HEAD(lock1)) {
4571 level_one_path(lock_descriptor_t *lock1, lock_descriptor_t *lock2)
4573 edge_t *ep = FIRST_ADJ(lock1);
4575 while (ep != HEAD(lock1)) {
4585 no_path(lock_descriptor_t *lock1, lock_descriptor_t *lock2)
4587 return (!level_two_path(lock1, lock2, 1));
4591 path(lock_descriptor_t *lock1, lock_descriptor_t *lock2)
4593 if (level_one_path(lock1, lock2)) {
4594 if (level_two_path(lock1, lock2, 0) != 0) {
4596 "one edge one path from lock1 %p lock2 %p",
4597 (void *)lock1, (void *)lock2);
4599 } else if (no_path(lock1, lock2)) {
4601 "No path from lock1 %p to lock2 %p",
4602 (void *)lock1, (void *)lock2);