| /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));
|
| /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...] |
| cgraphclones.cc | 39 It is also possible to redirect any edge of the callgraph from a
94 /* Create clone of edge in the node N represented by CALL_EXPR
446 version. The only exception is when the edge was proved to
775 speculative edge gets updated. Otherwise we update only direct
793 cgraph_edge *edge = node->get_edge (old_stmt); local
794 if (edge)
796 edge = cgraph_edge::set_call_stmt (edge, new_stmt,
801 if (edge->speculative && !update_speculative)
803 cgraph_edge *indirect = edge->speculative_call_indirect_edge ()
848 cgraph_edge *edge = create_edge (callee, stmt, count); local
858 cgraph_edge *edge = node->get_edge (old_stmt); local
[all...] |
| ipa-profile.cc | 202 /* Duplicate info when an edge is cloned. */
233 /* Duplicate info when an edge is cloned. */
437 fprintf (f, " Summary for %s of indirect edge %d:\n",
446 /* Read speculative targets information about edge for LTO WPA. */
449 ipa_profile_read_edge_summary (class lto_input_block *ib, cgraph_edge *edge)
455 speculative_call_summary *csum = call_sums->get_create (edge);
558 struct cgraph_edge *edge; local
561 for (edge = node->callers;
562 edge && (d->maybe_unlikely_executed || d->maybe_executed_once
564 edge = edge->next_caller
[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...] |
| cgraphclones.cc | 39 It is also possible to redirect any edge of the callgraph from a
91 /* Create clone of edge in the node N represented by CALL_EXPR
434 version. The only exception is when the edge was proved to
762 speculative edge gets updated. Otherwise we update only direct
780 cgraph_edge *edge = node->get_edge (old_stmt); local
781 if (edge)
783 edge = cgraph_edge::set_call_stmt (edge, new_stmt,
788 if (edge->speculative && !update_speculative)
790 cgraph_edge *indirect = edge->speculative_call_indirect_edge ()
835 cgraph_edge *edge = create_edge (callee, stmt, count); local
845 cgraph_edge *edge = node->get_edge (old_stmt); local
[all...] |
| ipa-utils.cc | 83 struct cgraph_edge *edge; local
96 for (edge = v->callees; edge; edge = edge->next_callee)
100 struct cgraph_node *w = edge->callee->ultimate_alias_target (&avail);
102 if (!w || (ignore_edge && ignore_edge (edge)))
248 /* Return true iff the CS is an edge within a strongly connected component as
267 struct cgraph_edge *edge; member in struct:postorder_stack
281 struct cgraph_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/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/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/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...] |
| /src/lib/libc/cdb/ |
| cdbw.c | 359 * the edge list at hand all the time. As such, no ordering is necessary
360 * and the vertices of the edge don't have to be copied.
363 * the incident edge can be obtained directly.
370 struct edge { struct
385 struct edge *edges;
391 * Add (delta == 1) or remove (delta == -1) the edge e
399 struct edge *e_ = &state->edges[e];
426 struct edge *e;
463 * Do the edge processing separately as there is a good chance
464 * the degraded edge case above will happen; this avoi
[all...] |
| /src/external/bsd/byacc/dist/ |
| lalr.c | 284 Value_t *edge; local
296 edge = NEW2(ngotos + 1, Value_t);
322 edge[nedges++] = map_goto(stateno, symbol);
330 rp[j] = edge[j];
350 FREE(edge);
367 Value_t *edge; local
372 edge = NEW2(ngotos + 1, Value_t);
414 edge[nedges++] = map_goto(stateno, *rp);
425 shortp[j] = edge[j];
440 FREE(edge);
[all...] |
| /src/sys/arch/hpcmips/vr/ |
| vrgiu.c | 308 long iosel, inten, useupdn, termupdn, edge, hold, level; local
315 edge = vrgiu_regread_4(sc, GIUINTTYP_REG);
332 ((edge&m) ? 4 : 0) +
558 DPRINTF(DEBUG_INTR, ("[%s->",reg & mask ? "edge" : "level"));
560 DPRINTF(DEBUG_INTR, ("edge]"));
561 reg |= mask; /* edge */
|
| /src/external/bsd/openldap/dist/servers/slapd/back-ldap/ |
| monitor.c | 548 TAvlnode *edge; local
573 edge = ldap_tavl_end( li->li_conninfo.lai_tree, TAVL_DIR_LEFT );
574 while ( edge ) {
575 TAvlnode *next = ldap_tavl_next( edge, TAVL_DIR_RIGHT );
576 ldapconn_t *lc = (ldapconn_t *)edge->avl_data;
578 edge = next;
|
| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| supergraph.cc | 62 /* Get the function of the ultimate alias target being called at EDGE,
66 get_ultimate_function_for_cgraph_edge (cgraph_edge *edge)
68 cgraph_node *ultimate_node = edge->callee->ultimate_alias_target ();
82 cgraph_edge *edge
84 if (!edge)
86 if (!edge->callee)
88 if (!get_ultimate_function_for_cgraph_edge (edge))
90 return edge;
157 /* Ensure that EDGE_DFS_BACK is correct for every CFG edge in
192 if (cgraph_edge *edge = supergraph_call_edge (fun, stmt)
204 cgraph_edge *edge local
268 cgraph_edge *edge = (*iter).first; local
291 cgraph_edge *edge = (*iter).first; local
314 cgraph_edge *edge = (*iter).first; local
[all...] |
