| /src/usr.bin/nbperf/ |
| 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;
|
| /src/games/dab/ |
| 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
|
| /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/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.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...] |
