edge
tg_edge_t *edge;
edge = mdb_zalloc(sizeof (tg_edge_t), UM_SLEEP);
edge->tge_src = src;
edge->tge_dest = node;
edge->tge_nextout = src->tgn_outgoing;
src->tgn_outgoing = edge;
edge->tge_srcoffs += ndx * sizeof (uintptr_t);
edge->tge_destoffs = ptr - node->tgn_base;
edge->tge_nextin = node->tgn_incoming;
node->tgn_incoming = edge;
typegraph_node_addtype(tg_node_t *node, tg_edge_t *edge, mdb_ctf_id_t rtype,
if (edge->tge_destoffs == 0) {
tp->tgt_redge = edge;
tg_edge_t *e, *edge = node->tgn_outgoing;
for (e = edge; e != NULL; e = e->tge_nextout) {
edge = dest->tgn_outgoing;
edge = state->tgps_edge;
dest = edge->tge_dest;
edge = edge->tge_nextout;
graph_edge_t *edge;
for (edge = uu_list_first(groupv->gv_dependencies);
edge != NULL;
edge = uu_list_next(groupv->gv_dependencies, edge)) {
i = dependency_satisfied(edge->ge_vertex, satbility);
edge->ge_vertex->gv_name, i == 0 ? "ed" : "able");
graph_edge_t *edge;
for (edge = uu_list_first(groupv->gv_dependencies);
edge != NULL;
edge = uu_list_next(groupv->gv_dependencies, edge)) {
s = dependency_satisfied(edge->ge_vertex, satbility);
groupv->gv_name, edge->ge_vertex->gv_name,
graph_edge_t *edge;
for (edge = uu_list_first(groupv->gv_dependencies);
edge != NULL;
edge = uu_list_next(groupv->gv_dependencies, edge)) {
v = edge->ge_vertex;
graph_edge_t *edge, *e2;
for (edge = uu_list_first(groupv->gv_dependencies);
edge != NULL;
edge = uu_list_next(groupv->gv_dependencies, edge)) {
v = edge->ge_vertex;
if (edge())
forbid(margin() || opf == vmove && edge());
topo_edge_t *edge;
edge = topo_list_next(&vtx->tvt_incoming);
while (edge != NULL) {
topo_edge_t *tmp = edge;
edge = topo_list_next(edge);
edge = topo_list_next(&vtx->tvt_outgoing);
while (edge != NULL) {
topo_edge_t *tmp = edge;
edge = topo_list_next(edge);
for (topo_edge_t *edge = topo_list_next(&vtx->tvt_outgoing);
edge != NULL; edge = topo_list_next(edge), n++) {
ret = func(thp, edge, last_edge, arg);
for (topo_edge_t *edge = topo_list_next(&vtx->tvt_outgoing);
edge != NULL; edge = topo_list_next(edge)) {
if (visit_vertex(thp, edge->tve_vertex, to, all_paths, pathstr,
for (topo_edge_t *edge = topo_list_next(&from->tvt_outgoing);
edge != NULL; edge = topo_list_next(edge)) {
ret = visit_vertex(thp, edge->tve_vertex, to, &all_paths,
serialize_edge(topo_hdl_t *thp, topo_edge_t *edge, boolean_t last_edge,
tn = topo_vertex_node(edge->tve_vertex);
int usr, sys, edge, inv, irupt, pc;
xpes->edge = (pes >> CPC_P6_PES_E) & 1u;
xpes[0].edge, xpes[1].edge, 1, tokens[D_noedge]);
if (xpes[i].edge == 0)
if (xpes[i].edge == 0) {
this->edge->ignoreHop2State = 0; /* DISABLED; */
this->edge->debug = 1;
STP_STATE_MACH_IN_LIST(edge);
STATE_MACH_T* edge; /* */
if (port->edge->debug) {
if (port->edge->debug && port->operEdge) {
if (port->edge->debug) {
if (e == edge)
char *edge;
edge = p + msglen;
if (e == edge)
if (e == edge)
edge_t *edge;
edge = flk_get_edge();
edge->from_vertex = from_lock;
edge->to_vertex = to_lock;
from_lock->l_edge.edge_adj_next->edge_adj_prev = edge;
edge->edge_adj_next = from_lock->l_edge.edge_adj_next;
edge->edge_adj_prev = &from_lock->l_edge;
from_lock->l_edge.edge_adj_next = edge;
to_lock->l_edge.edge_in_next->edge_in_prev = edge;
edge->edge_in_next = to_lock->l_edge.edge_in_next;
to_lock->l_edge.edge_in_next = edge;
edge->edge_in_prev = &to_lock->l_edge;
flk_update_proc_graph(edge, 0);
for (pep = start_vertex->edge; pep != NULL; pep = pep->next) {
pep->next = start_vertex->edge;
start_vertex->edge = pep;
for (pep = in_proc->edge; pep != NULL; pep = pep->next) {
pep->next = in_proc->edge;
in_proc->edge = pep;
start_vertex->p_sedge = start_vertex->edge;
dvertex->p_sedge = dvertex->edge;
ppep = start_vertex->edge;
for (pep = start_vertex->edge; pep != NULL; ppep = pep,
start_vertex->edge = pep->next;
ppep = in_proc->edge;
for (pep = in_proc->edge; pep != NULL; ppep = pep,
in_proc->edge = pep->next;
if (proc->edge == NULL && proc->incount == 0) {
pep = prevpep = fromproc->edge;
fromproc->edge = pep->next;
pep = fromproc->edge;
pep->next = fromproc->edge;
fromproc->edge = pep;
sizeof (struct edge), 0, NULL, NULL, NULL, NULL, NULL, 0);
struct proc_edge *edge; /* adajcent edges of this process */
struct edge *edge_adj_next; /* adjacency list next */
struct edge *edge_adj_prev; /* adjacency list prev */
struct edge *edge_in_next; /* incoming edges list next */
struct edge *edge_in_prev; /* incoming edges list prev */
typedef struct edge edge_t;
struct edge l_edge; /* edge for adj and in lists */
struct edge *l_sedge; /* start edge for graph alg. */
int edge = 0;
edge = 1;
if (edge)