/illumos-gate/usr/src/lib/libsip/common/ |
H A D | sip_reass.c | 84 char *edge; local 87 edge = p + msglen; 97 if (e == edge) 101 if (e == edge) 112 if (e == edge)
|
/illumos-gate/usr/src/cmd/vi/port/ |
H A D | ex_voper.c | 554 forbid(margin() || opf == vmove && edge()); 1012 if (edge()) 1182 edge(void) function
|
/illumos-gate/usr/src/lib/librstp/common/ |
H A D | port.h | 67 STATE_MACH_T* edge; /* */ member in struct:port_t
|
/illumos-gate/usr/src/lib/libcpc/i386/ |
H A D | event_pentium.c | 232 "noedge", /* disable edge detect */ 538 int usr, sys, edge, inv, irupt, pc; member in struct:xpes 549 xpes->edge = (pes >> CPC_P6_PES_E) & 1u; 621 xpes[0].edge, xpes[1].edge, 1, tokens[D_noedge]); 742 if (xpes[i].edge == 0) 784 if (xpes[i].edge == 0) {
|
/illumos-gate/usr/src/uts/common/sys/ |
H A D | flock_impl.h | 51 struct edge { struct 52 struct edge *edge_adj_next; /* adjacency list next */ 53 struct edge *edge_adj_prev; /* adjacency list prev */ 54 struct edge *edge_in_next; /* incoming edges list next */ 55 struct edge *edge_in_prev; /* incoming edges list prev */ 56 struct lock_descriptor *from_vertex; /* edge emanating from lock */ 57 struct lock_descriptor *to_vertex; /* edge pointing to lock */ 60 typedef struct edge edge_t; 65 struct edge l_edge; /* edge fo 446 struct proc_edge *edge; /* adajcent edges of this process */ member in struct:proc_vertex [all...] |
/illumos-gate/usr/src/uts/intel/pcbe/ |
H A D | p4_pcbe.c | 544 #define P4_ATTRS "emask,tag,compare,complement,threshold,edge" 666 * Set the CCCR parameters (overflow, cascade, edge, etc). 686 int edge = 0; local 780 } else if (strcmp("edge", attrs[i].ka_name) == 0) { 782 edge = 1; 882 if (edge)
|
/illumos-gate/usr/src/uts/common/os/ |
H A D | flock.c | 912 sizeof (struct edge), 0, NULL, NULL, NULL, NULL, NULL, 0); 973 * Get a lock_descriptor structure with initialization of edge lists. 1060 * flk_add_edge() function adds an edge between l1 and l2 iff there 1195 * edge to this write lock we have paths to all locks in the 1461 * This routine adds an edge between from and to because from depends 1475 edge_t *edge; local 1484 * don't add an edge as it is reachable from from vertex 1491 edge = flk_get_edge(); 1497 edge->from_vertex = from_lock; 1498 edge [all...] |
/illumos-gate/usr/src/cmd/mdb/common/modules/genunix/ |
H A D | typegraph.c | 50 * outgoing edge. Determining the pointer type allows us to determine the 51 * type of the edge's destination node, and therefore to iteratively continue 198 struct tg_edge *tge_nextin; /* next incoming edge */ 199 struct tg_edge *tge_nextout; /* next outgoing edge */ 209 tg_edge_t *tgt_redge; /* referring edge */ 249 tg_edge_t *tgto_edge; /* outbound edge */ 263 tg_edge_t *tgps_edge; /* current edge */ 676 * offset. It additionally takes an optional edge to help bust unions, and 806 * We've been given no outbound edge -- we have no way 1205 tg_edge_t *edge; local 1423 typegraph_node_addtype(tg_node_t *node, tg_edge_t *edge, mdb_ctf_id_t rtype, const char *rmember, size_t roffs, mdb_ctf_id_t utype, mdb_ctf_id_t type) argument 2113 tg_edge_t *e, *edge = node->tgn_outgoing; local [all...] |
/illumos-gate/usr/src/cmd/svc/startd/ |
H A D | graph.c | 55 * - an edge from the GVT_SVC vertex for the instance's service 57 * - an edge to the GVT_INST vertex of the instance's resarter, if its 63 * snapshot, an edge to a GVT_GROUP vertex named by the FMRI of the 67 * group, an edge from the corresponding GVT_GROUP vertex to a 663 * Fake up an edge for the first iteration 1236 graph_edge_t *edge; local 1245 for (edge = uu_list_first(groupv->gv_dependencies); 1246 edge != NULL; 1247 edge = uu_list_next(groupv->gv_dependencies, edge)) { 1275 graph_edge_t *edge; local 1316 graph_edge_t *edge; local 1480 graph_edge_t *edge, *e2; local [all...] |