| /src/games/dab/ |
| box.cc | 44 const POINT BOX::edges[BOX::last] =
99 _b.getScrn()->moveto(_centery + edges[e].y, _centerx + edges[e].x);
114 _b.data(_centery + edges[e].y, _centerx + edges[e].x) = syms[e];
120 _b.data(_centery + edges[e].y, _centerx + edges[e].x) = ' ';
126 return _b.data(_centery + edges[e].y, _centerx + edges[e].x) != ' ';
132 return _b.data(_centery + edges[e].y, _centerx + edges[e].x)
[all...] |
| box.h | 33 * Single box utilities; A box is an entity with four edges, four corners, and
75 int count(void) const; // Count the number of edges in use
78 // Relative coordinates of the edges from the center of the box.
79 static const POINT edges[BOX::last]; member in class:BOX
82 // Character symbols of the four edges
|
| board.cc | 132 x += BOX::edges[dir].x;
133 y += BOX::edges[dir].y;
|
| algor.cc | 47 // Single Edges = (x + y) * 2
49 // Shared Edges = (x * (y - 1)) + ((x - 1) * y)
51 // Maximum Edges filled before closure = x * y * 2
56 // Find the first closure, i.e. a box that has 3 edges
82 // Find the number of single edges in use
169 size_t by = y + BOX::edges[dir].y;
170 size_t bx = x + BOX::edges[dir].x;
201 // On a box with 2 edges, return the first or the last free edge, depending
219 // Find a box that has 2 edges and return the first free edge of that
|
| /src/usr.bin/nbperf/ |
| graph2.c | 57 graph->edges = calloc(sizeof(*graph->edges), e);
60 if (graph->verts == NULL || graph->edges == NULL ||
69 free(graph->edges);
73 graph->edges = NULL;
85 const struct SIZED(edge) *ea = &sorting_graph->edges[*a],
86 *eb = &sorting_graph->edges[*b];
137 struct SIZED(edge) *e = graph->edges + edge;
143 v->edges ^= edge;
151 struct SIZED(edge) *e = graph->edges + edge
[all...] |
| graph2.h | 36 * - build a 2/3-graph with hash-pairs as edges
41 * incident edges and the number of such edges as that's all the peeling
67 uint32_t degree, edges; local in function:SIZED
76 struct SIZED(edge) *edges;
|
| nbperf-chm.c | 71 * The assignment step now sets g[i] := 0 and processes the edges
92 e = &state->graph.edges[e_idx];
128 e = &state->graph.edges[e_idx];
|
| nbperf-bdz.c | 93 e = &state->graph.edges[j];
|
| /src/sys/kern/ |
| sys_epoll.c | 553 * If edges is NULL, the number of edges is still counted but no graph
557 epoll_recover_watch_tree(struct epoll_edge *edges, size_t nedges, size_t nfds) {
562 for (i = 0; i < nfds && (edges == NULL || nedges_so_far < nedges); i++)
576 if (edges != NULL) {
577 edges[nedges_so_far].epfd =
579 edges[nedges_so_far].fd =
596 * Run dfs on the graph described by edges, checking for loops and a
600 epoll_dfs(struct epoll_edge *edges, size_t nedges, struct epoll_seen *seen,
606 KASSERT(edges != NULL)
643 struct epoll_edge *edges; local in function:epoll_check_loop_and_depth
[all...] |
| /src/lib/libc/cdb/ |
| cdbw.c | 352 * incident edges and remember the number of such edges as that's all
367 uint32_t edges; member in struct:vertex
385 struct edge *edges; member in struct:state
399 struct edge *e_ = &state->edges[e];
403 v->edges ^= e;
415 e = v_->edges;
435 e = state->edges;
477 e = state->edges + state->output_order[i];
498 e = state->edges + state->output_order[i]
[all...] |
| /src/usr.sbin/sunlabel/ |
| sunlabel.c | 1020 uint32_t edges[2 * NPART]; local in function:print_part
1043 edges[j++] = p[i].startcyl;
1044 edges[j++] = p[i].endcyl;
1051 if (edges[i] < edges[i - 1]) {
1053 t = edges[i];
1054 edges[i] = edges[i - 1];
1055 edges[i - 1] = t;
1062 if (edges[i] != edges[n])
[all...] |
| /src/sys/dev/i2c/ |
| emcfan.c | 654 int edges; local in function:emcfan_refresh_210_346_230x_tach
822 /* Extract the number of configured edges */
823 edges = fan_config & 0b00011000;
824 edges = edges >> 3;
826 DPRINTF(sc, 2, ("%s: fan_config=%d 0x%02X, raw edges=%d 0x%02X\n",
827 __func__, fan_config, fan_config, edges, edges));
829 edges = ((edges + 1) * 2) + 1
[all...] |
| /src/usr.bin/make/unit-tests/ |
| varmod-undefined.mk | 54 # Whitespace at the edges is preserved, on both sides of the comparison.
|
| /src/sys/external/gpl2/dts/dist/arch/arm/boot/dts/ |
| qcom-apq8060-dragonboard.dts | 75 /* Trig on both edges - getting close or far away */
|
