| /src/games/dab/ |
| box.cc | 100 _b.getScrn()->addedge(edge(static_cast<EDGE>(e)));
111 // Set an edge
117 // Clear an edge
123 // Test an edge
129 // Return the edge
130 int& BOX::edge(int e) function in class:BOX
141 cnt += isset(static_cast<EDGE>(e));
149 clr(static_cast<EDGE>(e));
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/auxiliary/util/ |
| u_split_prim.h | 14 void (*edge)(void *priv, boolean enabled); member in struct:util_split_prim
53 s->edge(s->priv, TRUE);
75 s->edge(s->priv, FALSE);
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/auxiliary/util/ |
| u_split_prim.h | 14 void (*edge)(void *priv, boolean enabled); member in struct:util_split_prim
53 s->edge(s->priv, TRUE);
75 s->edge(s->priv, FALSE);
|
| /xsrc/external/mit/MesaLib.old/dist/src/util/ |
| dag.c | 28 * Adds a directed edge from the parent node to the child.
30 * Both nodes should have been initialized with dag_init_node(). The edge
36 util_dynarray_foreach(&parent->edges, struct dag_edge, edge) {
37 if (edge->child == child && edge->data == data)
43 struct dag_edge edge = { local
48 util_dynarray_append(&parent->edges, struct dag_edge, edge);
52 /* Removes a single edge from the graph, promoting the child to a DAG head.
59 dag_remove_edge(struct dag *dag, struct dag_edge *edge)
61 if (!edge->child
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/util/ |
| dag.c | 28 * Adds a directed edge from the parent node to the child.
30 * Both nodes should have been initialized with dag_init_node(). The edge
36 util_dynarray_foreach(&parent->edges, struct dag_edge, edge) {
37 if (edge->child == child && edge->data == data)
43 struct dag_edge edge = { local
48 util_dynarray_append(&parent->edges, struct dag_edge, edge);
52 /* Removes a single edge from the graph, promoting the child to a DAG head.
59 dag_remove_edge(struct dag *dag, struct dag_edge *edge)
61 if (!edge->child
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/ |
| AArch64PBQPRegAlloc.cpp | 181 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); local
183 // The edge does not exist. Create one with the appropriate interference
185 if (edge == G.invalidEdgeId()) {
206 if (G.getEdgeNode1Id(edge) == node2) {
212 PBQPRAGraph::RawMatrix costs(G.getEdgeCosts(edge));
237 G.updateEdgeCosts(edge, std::move(costs));
277 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); local
278 assert(edge != G.invalidEdgeId() &&
279 "PBQP error ! The edge should exist !");
283 if (G.getEdgeNode1Id(edge) == node2)
[all...] |
| /src/external/bsd/unbound/dist/testcode/ |
| unitecs.c | 67 struct addredge* edge;
76 if (node->edge[i]) {
78 printkey(node->edge[i]->str, node->edge[i]->len);
79 printf("(len %d bits, %d bytes) ", node->edge[i]->len,
80 node->edge[i]->len/8 + ((node->edge[i]->len%8)>0));
81 print_tree(node->edge[i]->node, indent+1, maxdepth);
92 * edge must be longer than parent edge
97 struct addredge* edge; local
121 struct addredge* edge; local
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| ipa-comdats.cc | 123 for (struct cgraph_edge * edge = cnode->callers;
124 edge && newgroup != error_mark_node; edge = edge->next_caller)
126 struct symtab_node *symbol2 = edge->caller;
183 struct cgraph_edge *edge; local
185 for (edge = cnode->callees; edge; edge = edge->next_callee
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| ipa-comdats.cc | 123 for (struct cgraph_edge * edge = cnode->callers;
124 edge && newgroup != error_mark_node; edge = edge->next_caller)
126 struct symtab_node *symbol2 = edge->caller;
183 struct cgraph_edge *edge; local
185 for (edge = cnode->callees; edge; edge = edge->next_callee
[all...] |
| /xsrc/external/mit/xf86-video-intel/dist/test/ |
| render-triangle.c | 7 enum edge { enum
12 static void set_edge(Display *dpy, Picture p, enum edge edge)
16 a.poly_edge = edge;
40 static const char *edge_name(enum edge edge)
42 switch (edge) {
88 enum edge edge,
98 set_edge(t->out.dpy, out.picture, edge);
169 enum edge edge; local
[all...] |
| render-trapezoid.c | 406 enum edge { enum
411 static const char *edge_name(enum edge edge)
413 switch (edge) {
420 static void set_edge(Display *dpy, Picture p, enum edge edge)
424 a.poly_edge = edge;
430 enum edge edge,
440 set_edge(t->out.dpy, out.picture, edge);
530 enum edge edge; local
[all...] |
| /src/lib/libmenu/ |
| internals.c | 91 int neighbour, cycle, row_major, edge; local
119 edge = 0;
127 edge = 1;
136 edge = 1;
143 if ((!cycle) && (edge == 1))
157 edge = 0;
161 edge = 1;
166 edge = 1;
172 edge = 1;
178 edge = 1
[all...] |
| /src/sys/arch/hpcmips/dev/ |
| tc5165buf.c | 223 u_int16_t mask, rpat, edge; local
238 if ((edge = (rpat ^ scc->scc_buf[i]))) {
242 if (mask & edge) {
|
| /src/external/bsd/unbound/dist/edns-subnet/ |
| addrtree.c | 46 * Create a new edge
47 * @param node: Child node this edge will connect to.
48 * @param addr: full key to this edge.
59 struct addredge *edge = (struct addredge *)malloc( sizeof (*edge) ); local
60 if (!edge)
62 edge->node = node;
63 edge->len = addrlen;
64 edge->parent_index = parent_index;
65 edge->parent_node = parent_node
366 struct addredge *edge; local
482 struct addredge *edge = NULL; local
[all...] |
| addrtree.h | 103 struct addredge *edge[2]; member in struct:addrnode
104 /** edge between this node and parent */
117 /** child node this edge is connected to */
119 /** Parent node this edge is connected to */
121 /** Index of this edge in parent_node */
|
| /src/external/gpl3/gdb.old/dist/sim/bfin/ |
| dv-bfin_pint.c | 33 bu32 mask, edge, invert; member in struct:bfin_pint
96 dv_w1c_4 (&pint->edge, value, -1);
99 pint->edge |= value;
164 dv_store_4 (dest, pint->edge);
|
| /src/external/gpl3/gdb.old/dist/sim/common/ |
| hw-ports.c | 124 hw_abort (me, "attempt to delete permanent port edge");
164 struct hw_port_edge *edge; local
166 for (edge = me->ports_of_hw->edges;
167 edge != NULL;
168 edge = edge->next)
170 if (edge->my_port == my_port)
172 edge->dest->ports_of_hw->to_port_event (edge->dest,
173 edge->dest_port
[all...] |
| /src/external/gpl3/gdb/dist/sim/bfin/ |
| dv-bfin_pint.c | 33 bu32 mask, edge, invert; member in struct:bfin_pint
96 dv_w1c_4 (&pint->edge, value, -1);
99 pint->edge |= value;
164 dv_store_4 (dest, pint->edge);
|
| /src/external/gpl3/gdb/dist/sim/common/ |
| hw-ports.c | 124 hw_abort (me, "attempt to delete permanent port edge");
164 struct hw_port_edge *edge; local
166 for (edge = me->ports_of_hw->edges;
167 edge != NULL;
168 edge = edge->next)
170 if (edge->my_port == my_port)
172 edge->dest->ports_of_hw->to_port_event (edge->dest,
173 edge->dest_port
[all...] |
| /src/sys/arch/arm/marvell/ |
| mvsocgpp.c | 75 uint32_t edge; member in struct:mvsocgpp_softc::mvsocgpp_pic
252 if (irq_mask & mvsocgpp_pic->edge) {
254 mask |= (irq_mask & mvsocgpp_pic->edge);
333 mvsocgpp_pic->edge |= mask;
341 mvsocgpp_pic->edge &= ~mask;
|
| /src/sys/arch/hpcsh/dev/ |
| pfckbd.c | 221 unsigned int edge, mask; local
223 edge = data ^ pc->pc_column[column];
224 if (edge == 0)
230 if (mask & edge) {
|
| /src/external/mit/isl/dist/ |
| isl_scheduler.h | 101 /* An edge in the dependence graph. An edge may be used to
115 * types is a bit vector containing the types of this edge.
116 * validity is set if the edge is used to ensure correctness
118 * proximity is set if the edge is used to minimize dependence distances
119 * condition is set if the edge represents a condition
122 * the dependence distance over the edge should be zero
123 * conditional_validity is set if the edge is used to conditionally
128 * corresponding to this edge.
130 * During clustering, an edge may be marked "no_merge" if it shoul
239 struct isl_sched_edge *edge; member in struct:isl_sched_graph
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_graph.cpp | 53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
95 void Graph::Node::attach(Node *node, Edge::Type kind)
97 Edge *edge = new Edge(this, node, kind); local
101 edge->next[0] = this->out;
102 edge->prev[0] = this->out->prev[0];
103 edge->prev[0]->next[0] = edge;
365 Graph::Edge *edge; local
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_graph.cpp | 53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
95 void Graph::Node::attach(Node *node, Edge::Type kind)
97 Edge *edge = new Edge(this, node, kind); local
101 edge->next[0] = this->out;
102 edge->prev[0] = this->out->prev[0];
103 edge->prev[0]->next[0] = edge;
366 Graph::Edge *edge; local
[all...] |
| /xsrc/external/mit/libXrender/dist/src/ |
| Poly.c | 29 typedef struct _Edge Edge;
32 XLineFixed edge; member in struct:_Edge
35 Edge *next, *prev;
41 const Edge *e1 = o1, *e2 = o2;
43 return e1->edge.p1.y - e2->edge.p1.y;
90 XRenderComputeTrapezoids (Edge *edges,
98 Edge *active;
99 Edge *e, *en, *next;
102 qsort (edges, (size_t) nedges, sizeof (Edge), CompareEdge)
[all...] |
