Lines Matching defs:topology
1607 lock_descriptor_t *topology[3];
1619 topology[0] = topology[1] = topology[2] = NULL;
1635 topology[0] = request;
1647 topology[0] = request;
1661 topology[0] = request;
1672 topology[0] = lock1;
1673 topology[1] = lock2;
1674 topology[2] = request;
1680 topology[0] = request;
1686 topology[0] = lock1;
1687 topology[1] = request;
1694 topology[0] = request;
1700 topology[0] = lock1;
1701 topology[1] = request;
1709 topology[0] = request;
1715 topology[0] = lock1;
1716 topology[1] = request;
1720 topology[0] = request;
1723 topology[0] = request;
1730 topology[0] = request;
1736 topology[0] = lock1;
1737 topology[1] = request;
1741 topology[0] = request;
1745 topology[0] = request;
1766 topology[nvertex-1] = NULL;
1770 topology[i]->l_state |= RECOMPUTE_LOCK;
1771 topology[i]->l_color = NO_COLOR;
1791 flk_recompute_dependencies(lock, topology, nvertex, 1);
1794 topology[i]->l_state &= ~RECOMPUTE_LOCK;
1795 topology[i]->l_color = NO_COLOR;
1803 flk_insert_active_lock(topology[i]);
1940 lock_descriptor_t **topology = NULL;
1974 topology = kmem_zalloc(nvertex * sizeof (lock_descriptor_t *),
1982 * so that topology array will be in a topological
1993 topology[nvertex++] = lock;
2006 topology[nvertex++] = lock;
2028 flk_recompute_dependencies(request, topology, nvertex, 1);
2046 topology[i]->l_state &= ~RECOMPUTE_LOCK;
2050 * free the topology
2053 kmem_free((void *)topology,
2134 * locks in topology (called topology because the array is and should be in
2138 * right i.e., topology[i] can have an edge to topology[j], iff i<j)
2140 * on lock l2 in topology but does not have a path to it, we add an edge
2150 * to vertices in topology, and thus barrier vertices can have an edge
2151 * to a vertex in topology as well a path to it.
2156 lock_descriptor_t **topology,
2205 lock = topology[i];
2242 * Color all reachable vertices from vertex that belongs to topology (here