Lines Matching defs:topology
1617 lock_descriptor_t *topology[3];
1629 topology[0] = topology[1] = topology[2] = NULL;
1645 topology[0] = request;
1657 topology[0] = request;
1671 topology[0] = request;
1682 topology[0] = lock1;
1683 topology[1] = lock2;
1684 topology[2] = request;
1690 topology[0] = request;
1696 topology[0] = lock1;
1697 topology[1] = request;
1704 topology[0] = request;
1710 topology[0] = lock1;
1711 topology[1] = request;
1719 topology[0] = request;
1725 topology[0] = lock1;
1726 topology[1] = request;
1730 topology[0] = request;
1733 topology[0] = request;
1740 topology[0] = request;
1746 topology[0] = lock1;
1747 topology[1] = request;
1751 topology[0] = request;
1755 topology[0] = request;
1776 topology[nvertex-1] = NULL;
1780 topology[i]->l_state |= RECOMPUTE_LOCK;
1781 topology[i]->l_color = NO_COLOR;
1801 flk_recompute_dependencies(lock, topology, nvertex, 1);
1804 topology[i]->l_state &= ~RECOMPUTE_LOCK;
1805 topology[i]->l_color = NO_COLOR;
1813 flk_insert_active_lock(topology[i]);
1950 lock_descriptor_t **topology = NULL;
1984 topology = kmem_zalloc(nvertex * sizeof (lock_descriptor_t *),
1992 * so that topology array will be in a topological
2003 topology[nvertex++] = lock;
2016 topology[nvertex++] = lock;
2038 flk_recompute_dependencies(request, topology, nvertex, 1);
2056 topology[i]->l_state &= ~RECOMPUTE_LOCK;
2060 * free the topology
2063 kmem_free((void *)topology,
2144 * locks in topology (called topology because the array is and should be in
2148 * right i.e., topology[i] can have an edge to topology[j], iff i<j)
2150 * on lock l2 in topology but does not have a path to it, we add an edge
2160 * to vertices in topology, and thus barrier vertices can have an edge
2161 * to a vertex in topology as well a path to it.
2166 lock_descriptor_t **topology, int nvertex, int update_graph)
2214 lock = topology[i];
2251 * Color all reachable vertices from vertex that belongs to topology (here