edge
_b.getScrn()->addedge(edge(static_cast<EDGE>(e)));
int& edge(int e);
struct edge *edges;
struct edge *e_ = &state->edges[e];
struct edge *e;
struct edge *e;
edge = 0;
edge = 1;
edge = 1;
if ((!cycle) && (edge == 1))
edge = 0;
edge = 1;
edge = 1;
edge = 1;
edge = 1;
if ((!cycle) && (edge == 1))
edge = 0;
edge = 1;
edge = 1;
if ((!cycle) && (edge == 1))
edge = 0;
edge = 1;
edge = 1;
edge = 1;
edge = 1;
if ((!cycle) && (edge == 1))
int neighbour, cycle, row_major, edge;
if (irq_mask & mvsocgpp_pic->edge) {
mask |= (irq_mask & mvsocgpp_pic->edge);
mvsocgpp_pic->edge |= mask;
mvsocgpp_pic->edge &= ~mask;
uint32_t edge;
u_int16_t mask, rpat, edge;
if ((edge = (rpat ^ scc->scc_buf[i]))) {
if (mask & edge) {
long iosel, inten, useupdn, termupdn, edge, hold, level;
edge = vrgiu_regread_4(sc, GIUINTTYP_REG);
((edge&m) ? 4 : 0) +
unsigned int edge, mask;
edge = data ^ pc->pc_column[column];
if (edge == 0)
if (mask & edge) {
int dx, dy, dz, sdx, sdy, sdz, edge;
edge = synaptics_check_edge(sp->sp_x, sp->sp_y);
if (edge & SYN_EDGE_LEFT)
if (edge & SYN_EDGE_RIGHT)
if (edge & SYN_EDGE_BOTTOM)
if (edge & SYN_EDGE_TOP)
edge = synaptics_check_edge(sp->sp_sx, sp->sp_sy);
if (edge & SYN_EDGE_LEFT)
if (edge & SYN_EDGE_RIGHT)
if (edge & SYN_EDGE_BOTTOM)
if (edge & SYN_EDGE_TOP)
time_pps_kcbind(pps_handle_t handle, const int kernel_consumer, const int edge,
return (ioctl(handle, PPS_IOC_KCBIND, __UNCONST(&edge)));
SIZED2(_add_edge)(struct SIZED(graph) *graph, uint32_t edge)
struct SIZED(edge) *e = graph->edges + edge;
v->edges ^= edge;
SIZED2(_remove_edge)(struct SIZED(graph) *graph, uint32_t edge)
struct SIZED(edge) *e = graph->edges + edge;
v->edges ^= edge;
struct SIZED(edge) *e;
struct SIZED(edge) *e2;
const struct SIZED(edge) *ea = &sorting_graph->edges[*a],
struct SIZED(edge) {
struct SIZED(edge) *edges;
struct SIZED(edge) *e;
struct SIZED(edge) *e;
struct SIZED(edge) *e;