| /src/external/gpl3/gcc/dist/contrib/unicode/ |
| gen_libstdcxx_unicode_data.py | 75 edges = []
79 edges.append((i,v))
81 return edges
125 edges = find_edges(all_code_points, 1) variable
132 for i, e in enumerate(edges):
154 edges = find_edges(all_code_points) variable
156 for c, p in edges:
175 for i, e in enumerate(edges):
207 edges = find_edges(all_code_points) variable
216 for i, e in enumerate(edges)
238 edges = find_edges(all_code_points, False) variable
[all...] |
| /src/games/dab/ |
| box.cc | 44 const POINT BOX::edges[BOX::last] = member in class:BOX
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;
|
| /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
76 struct SIZED(edge) *edges;
|
| /src/external/gpl3/gcc/dist/contrib/header-tools/ |
| graph-include-web | 14 edges = 0
20 global edges
34 edges = edges + 1
40 edges = edges + 1
110 print " -nnum : Specifies the # of edges beyond which sfdp is invoked. def=0."
117 if edges > edge_thresh:
|
| /src/external/gpl3/gcc.old/dist/contrib/header-tools/ |
| graph-include-web | 14 edges = 0
20 global edges
34 edges = edges + 1
40 edges = edges + 1
110 print " -nnum : Specifies the # of edges beyond which sfdp is invoked. def=0."
117 if edges > edge_thresh:
|
| /src/external/gpl3/gcc/dist/contrib/ |
| analyze_brprob.py | 149 self.edges= []
152 return len(self.edges)
155 return sum([x.hits for x in self.edges])
158 return sum([x.fits for x in self.edges])
161 return sum([x.count for x in self.edges])
164 return len([x for x in self.edges if 2 * x.hits >= x.count])
181 return sum([x.count for x in self.edges])
184 # filter out most hot edges (if requested)
185 self.edges = sorted(self.edges, reverse = True, key = lambda x: x.count
[all...] |
| /src/external/gpl3/gcc.old/dist/contrib/ |
| analyze_brprob.py | 147 self.edges= []
150 return len(self.edges)
153 return sum([x.hits for x in self.edges])
156 return sum([x.fits for x in self.edges])
159 return sum([x.count for x in self.edges])
162 return len([x for x in self.edges if 2 * x.hits >= x.count])
179 return sum([x.count for x in self.edges])
182 # filter out most hot edges (if requested)
183 self.edges = sorted(self.edges, reverse = True, key = lambda x: x.count
[all...] |
| /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
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| profile.h | 25 /* Additional information about edges. */
40 /* Helpers annotating edges/basic blocks to GCOV counts. */
69 extern gcov_type sum_edge_counts (vec<edge, va_gc> *edges);
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| profile.h | 25 /* Additional information about edges. */
40 /* Helpers annotating edges/basic blocks to GCOV counts. */
69 extern gcov_type sum_edge_counts (vec<edge, va_gc> *edges);
|
| /src/external/gpl3/gdb/dist/sim/common/ |
| hw-ports.c | 43 struct hw_port_edge *edges; member in struct:hw_port_data
166 for (edge = me->ports_of_hw->edges;
193 &me->ports_of_hw->edges,
208 &me->ports_of_hw->edges,
221 for (port_edge = me->ports_of_hw->edges;
|
| /src/external/gpl3/gdb.old/dist/sim/common/ |
| hw-ports.c | 43 struct hw_port_edge *edges; member in struct:hw_port_data
166 for (edge = me->ports_of_hw->edges;
193 &me->ports_of_hw->edges,
208 &me->ports_of_hw->edges,
221 for (port_edge = me->ports_of_hw->edges;
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-jitlink/ |
| llvm-jitlink-elf.cpp | 28 auto EItr = std::find_if(B.edges().begin(), B.edges().end(),
30 if (EItr == B.edges().end())
|
| llvm-jitlink-macho.cpp | 30 auto EItr = std::find_if(B.edges().begin(), B.edges().end(),
32 if (EItr == B.edges().end())
|
| /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/rt/ |
| minfo.d | 61 private size_t[] genCyclePath(size_t srcidx, size_t targetidx, int[][] edges)
93 foreach (n; edges[i])
116 // follow the edges in reverse to get back to the original. We
133 foreach (e; edges[m])
239 // build the edges between each module. We may need this for printing,
241 int[][] edges = (cast(int[]*)malloc((int[]).sizeof * _modules.length))[0 .. _modules.length];
270 edges[i] = (cast(int*)realloc(edge, int.sizeof * nEdges))[0 .. nEdges];
274 // free all the edges after we are done
277 foreach (e; edges)
280 .free(edges.ptr)
[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
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/crypto/external/apache2/openssl/dist/providers/implementations/ciphers/ |
| cipher_aes_cbc_hmac_sha1_hw.c | 128 HASH_DESC hash_d[8], edges[8]; local
213 edges[i].ptr = blocks[i].c;
214 edges[i].blocks = 1;
218 sha1_multi_block(mctx, edges, n4x);
231 edges[i].ptr = hash_d[i].ptr;
232 edges[i].blocks = MAXCHUNKSIZE / 64;
236 sha1_multi_block(mctx, edges, n4x);
240 edges[i].ptr = hash_d[i].ptr += MAXCHUNKSIZE;
242 edges[i].blocks = MAXCHUNKSIZE / 64;
273 edges[i].blocks = 1
[all...] |
| cipher_aes_cbc_hmac_sha256_hw.c | 132 HASH_DESC hash_d[8], edges[8]; local
221 edges[i].ptr = blocks[i].c;
222 edges[i].blocks = 1;
226 sha256_multi_block(mctx, edges, n4x);
239 edges[i].ptr = hash_d[i].ptr;
240 edges[i].blocks = MAXCHUNKSIZE / 64;
244 sha256_multi_block(mctx, edges, n4x);
248 edges[i].ptr = hash_d[i].ptr += MAXCHUNKSIZE;
250 edges[i].blocks = MAXCHUNKSIZE / 64;
281 edges[i].blocks = 1
[all...] |
| /src/crypto/external/bsd/openssl/dist/providers/implementations/ciphers/ |
| cipher_aes_cbc_hmac_sha1_hw.c | 128 HASH_DESC hash_d[8], edges[8]; local
213 edges[i].ptr = blocks[i].c;
214 edges[i].blocks = 1;
218 sha1_multi_block(mctx, edges, n4x);
231 edges[i].ptr = hash_d[i].ptr;
232 edges[i].blocks = MAXCHUNKSIZE / 64;
236 sha1_multi_block(mctx, edges, n4x);
240 edges[i].ptr = hash_d[i].ptr += MAXCHUNKSIZE;
242 edges[i].blocks = MAXCHUNKSIZE / 64;
273 edges[i].blocks = 1
[all...] |
| cipher_aes_cbc_hmac_sha256_hw.c | 132 HASH_DESC hash_d[8], edges[8]; local
221 edges[i].ptr = blocks[i].c;
222 edges[i].blocks = 1;
226 sha256_multi_block(mctx, edges, n4x);
239 edges[i].ptr = hash_d[i].ptr;
240 edges[i].blocks = MAXCHUNKSIZE / 64;
244 sha256_multi_block(mctx, edges, n4x);
248 edges[i].ptr = hash_d[i].ptr += MAXCHUNKSIZE;
250 edges[i].blocks = MAXCHUNKSIZE / 64;
281 edges[i].blocks = 1
[all...] |
| /src/crypto/external/apache2/openssl/dist/crypto/evp/ |
| e_aes_cbc_hmac_sha1.c | 164 HASH_DESC hash_d[8], edges[8]; local
248 edges[i].ptr = blocks[i].c;
249 edges[i].blocks = 1;
253 sha1_multi_block(ctx, edges, n4x);
266 edges[i].ptr = hash_d[i].ptr;
267 edges[i].blocks = MAXCHUNKSIZE / 64;
271 sha1_multi_block(ctx, edges, n4x);
275 edges[i].ptr = hash_d[i].ptr += MAXCHUNKSIZE;
277 edges[i].blocks = MAXCHUNKSIZE / 64;
308 edges[i].blocks = 1
[all...] |
