| /netbsd-src/external/gpl3/gcc/dist/contrib/ |
| H A D | 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])
183 self.edges = sorted(self.edges, reverse = True, key = lambda x: x.count)
186 edges = [x for x in self.edges if x.count < threshold]
187 if len(edges) != 0:
[all …]
|
| /netbsd-src/external/gpl3/gcc.old/dist/contrib/ |
| H A D | analyze_brprob.py | 144 self.edges= []
147 return len(self.edges)
150 return sum([x.hits for x in self.edges])
153 return sum([x.fits for x in self.edges])
156 return sum([x.count for x in self.edges])
159 return len([x for x in self.edges if 2 * x.hits >= x.count])
176 return sum([x.count for x in self.edges])
180 self.edges = sorted(self.edges, reverse = True, key = lambda x: x.count)
183 edges = [x for x in self.edges if x.count < threshold]
184 if len(edges) != 0:
[all …]
|
| /netbsd-src/games/dab/ |
| H A D | box.cc | 44 const POINT BOX::edges[BOX::last] =
99 _b.getScrn()->moveto(_centery + edges[e].y, _centerx + edges[e].x); in paint()
114 _b.data(_centery + edges[e].y, _centerx + edges[e].x) = syms[e]; in set()
120 _b.data(_centery + edges[e].y, _centerx + edges[e].x) = ' '; in clr()
126 return _b.data(_centery + edges[e].y, _centerx + edges[e].x) != ' '; in isset()
132 return _b.data(_centery + edges[e].y, _centerx + edges[e].x); in edge()
|
| /netbsd-src/usr.bin/nbperf/ |
| H A D | graph2.c | 57 graph->edges = calloc(sizeof(*graph->edges), e); in SIZED2()
60 if (graph->verts == NULL || graph->edges == NULL || in SIZED2()
69 free(graph->edges); in SIZED2()
73 graph->edges = NULL; in SIZED2()
85 const struct SIZED(edge) *ea = &sorting_graph->edges[*a], in sorting_cmp()
86 *eb = &sorting_graph->edges[*b]; in sorting_cmp()
137 struct SIZED(edge) *e = graph->edges + edge; in SIZED2()
143 v->edges ^= edge; in SIZED2()
151 struct SIZED(edge) *e = graph->edges + edge; in SIZED2()
157 v->edges ^= edge; in SIZED2()
[all …]
|
| /netbsd-src/sys/kern/ |
| H A D | sys_epoll.c | 557 epoll_recover_watch_tree(struct epoll_edge *edges, size_t nedges, size_t nfds) { in epoll_recover_watch_tree() argument
562 for (i = 0; i < nfds && (edges == NULL || nedges_so_far < nedges); i++) in epoll_recover_watch_tree()
576 if (edges != NULL) { in epoll_recover_watch_tree()
577 edges[nedges_so_far].epfd = in epoll_recover_watch_tree()
579 edges[nedges_so_far].fd = in epoll_recover_watch_tree()
600 epoll_dfs(struct epoll_edge *edges, size_t nedges, struct epoll_seen *seen, in epoll_dfs() argument
606 KASSERT(edges != NULL); in epoll_dfs()
622 if (edges[i].epfd != currfd) in epoll_dfs()
625 error = epoll_dfs(edges, nedges, seen, nseen, in epoll_dfs()
626 edges[i].fd, depth); in epoll_dfs()
[all …]
|
| /netbsd-src/external/gpl3/gcc/dist/contrib/header-tools/ |
| H A D | graph-include-web | 14 edges = 0 variable
20 global edges
34 edges = edges + 1
40 edges = edges + 1
117 if edges > edge_thresh:
|
| /netbsd-src/external/gpl3/gcc.old/dist/contrib/header-tools/ |
| H A D | graph-include-web | 14 edges = 0 variable
20 global edges
34 edges = edges + 1
40 edges = edges + 1
117 if edges > edge_thresh:
|
| /netbsd-src/usr.sbin/sunlabel/ |
| H A D | sunlabel.c | 1020 uint32_t edges[2 * NPART]; in print_part() local
1043 edges[j++] = p[i].startcyl; in print_part()
1044 edges[j++] = p[i].endcyl; in print_part()
1051 if (edges[i] < edges[i - 1]) { in print_part()
1053 t = edges[i]; in print_part()
1054 edges[i] = edges[i - 1]; in print_part()
1055 edges[i - 1] = t; in print_part()
1062 if (edges[i] != edges[n]) { in print_part()
1065 edges[n] = edges[i]; in print_part()
1073 if ((p[i].startcyl <= edges[j]) && in print_part()
[all …]
|
| /netbsd-src/lib/libc/cdb/ |
| H A D | cdbw.c | 367 uint32_t edges; member
385 struct edge *edges; member
399 struct edge *e_ = &state->edges[e]; in change_edge()
403 v->edges ^= e; in change_edge()
415 e = v_->edges; in remove_vertex()
435 e = state->edges; in build_graph()
477 e = state->edges + state->output_order[i]; in build_graph()
498 e = state->edges + state->output_order[i]; in assign_nodes()
638 NALLOC(state.edges, state.keys); in cdbw_output()
642 if (state.g == NULL || state.visited == NULL || state.edges == NULL || in cdbw_output()
[all …]
|
| /netbsd-src/external/gpl3/gcc/dist/libphobos/libdruntime/rt/ |
| H A D | minfo.d | 61 private size_t[] genCyclePath(size_t srcidx, size_t targetidx, int[][] edges) in genCyclePath() argument
93 foreach (n; edges[i]) in genCyclePath()
133 foreach (e; edges[m]) in genCyclePath()
241 … int[][] edges = (cast(int[]*)malloc((int[]).sizeof * _modules.length))[0 .. _modules.length]; in sortCtors()
270 edges[i] = (cast(int*)realloc(edge, int.sizeof * nEdges))[0 .. nEdges]; in sortCtors()
277 foreach (e; edges) in sortCtors()
280 .free(edges.ptr); in sortCtors()
295 auto cyclePath = genCyclePath(sourceIdx, cycleIdx, edges); in sortCtors()
339 if (sp.curDep >= edges[sp.curMod].length) in sortCtors()
348 auto midx = edges[sp.curMod][sp.curDep]; in sortCtors()
[all …]
|
| /netbsd-src/external/gpl3/gcc.old/dist/libphobos/libdruntime/rt/ |
| H A D | minfo.d | 61 private size_t[] genCyclePath(size_t srcidx, size_t targetidx, int[][] edges) in genCyclePath() argument
93 foreach (n; edges[i]) in genCyclePath()
133 foreach (e; edges[m]) in genCyclePath()
241 … int[][] edges = (cast(int[]*)malloc((int[]).sizeof * _modules.length))[0 .. _modules.length]; in sortCtors()
270 edges[i] = (cast(int*)realloc(edge, int.sizeof * nEdges))[0 .. nEdges]; in sortCtors()
277 foreach (e; edges) in sortCtors()
280 .free(edges.ptr); in sortCtors()
295 auto cyclePath = genCyclePath(sourceIdx, cycleIdx, edges); in sortCtors()
339 if (sp.curDep >= edges[sp.curMod].length) in sortCtors()
348 auto midx = edges[sp.curMod][sp.curDep]; in sortCtors()
[all …]
|
| /netbsd-src/crypto/external/bsd/openssl/dist/providers/implementations/ciphers/ |
| H A D | cipher_aes_cbc_hmac_sha1_hw.c | 128 HASH_DESC hash_d[8], edges[8]; in tls1_multi_block_encrypt() local
213 edges[i].ptr = blocks[i].c; in tls1_multi_block_encrypt()
214 edges[i].blocks = 1; in tls1_multi_block_encrypt()
218 sha1_multi_block(mctx, edges, n4x); in tls1_multi_block_encrypt()
231 edges[i].ptr = hash_d[i].ptr; in tls1_multi_block_encrypt()
232 edges[i].blocks = MAXCHUNKSIZE / 64; in tls1_multi_block_encrypt()
236 sha1_multi_block(mctx, edges, n4x); in tls1_multi_block_encrypt()
240 edges[i].ptr = hash_d[i].ptr += MAXCHUNKSIZE; in tls1_multi_block_encrypt()
242 edges[i].blocks = MAXCHUNKSIZE / 64; in tls1_multi_block_encrypt()
273 edges[i].blocks = 1; in tls1_multi_block_encrypt()
[all …]
|
| H A D | cipher_aes_cbc_hmac_sha256_hw.c | 132 HASH_DESC hash_d[8], edges[8]; in tls1_multi_block_encrypt() local
221 edges[i].ptr = blocks[i].c; in tls1_multi_block_encrypt()
222 edges[i].blocks = 1; in tls1_multi_block_encrypt()
226 sha256_multi_block(mctx, edges, n4x); in tls1_multi_block_encrypt()
239 edges[i].ptr = hash_d[i].ptr; in tls1_multi_block_encrypt()
240 edges[i].blocks = MAXCHUNKSIZE / 64; in tls1_multi_block_encrypt()
244 sha256_multi_block(mctx, edges, n4x); in tls1_multi_block_encrypt()
248 edges[i].ptr = hash_d[i].ptr += MAXCHUNKSIZE; in tls1_multi_block_encrypt()
250 edges[i].blocks = MAXCHUNKSIZE / 64; in tls1_multi_block_encrypt()
281 edges[i].blocks = 1; in tls1_multi_block_encrypt()
[all …]
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/ |
| H A D | cfg-flags.def | 1 /* Flags on basic blocks and edges.
21 edges. Source files define DEF_BASIC_BLOCK_FLAG or DEF_EDGE_FLAG
109 edges are fallthru edges. In cfgrtl mode, this flag really means
119 ABNORMAL_CALL edges also have ABNORMAL set.
123 /* Exception edge. Exception handling edges represent possible control
125 EH edges also have ABNORMAL set for the RTL CFG. */
129 to prevent merging away edges to the post-landing-pad basic block.
138 /* A back edge, marked in a depth-first search of the CFG. Back edges
162 SIBCALL edges also have ABNORMAL set.
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/ |
| H A D | cfg-flags.def | 1 /* Flags on basic blocks and edges.
21 edges. Source files define DEF_BASIC_BLOCK_FLAG or DEF_EDGE_FLAG
109 edges are fallthru edges. In cfgrtl mode, this flag really means
119 ABNORMAL_CALL edges also have ABNORMAL set.
123 /* Exception edge. Exception handling edges represent possible control
125 EH edges also have ABNORMAL set for the RTL CFG. */
129 to prevent merging away edges to the post-landing-pad basic block.
138 /* A back edge, marked in a depth-first search of the CFG. Back edges
162 SIBCALL edges also have ABNORMAL set.
|
| /netbsd-src/crypto/external/bsd/openssl/dist/crypto/evp/ |
| H A D | e_aes_cbc_hmac_sha1.c | 165 HASH_DESC hash_d[8], edges[8]; in tls1_1_multi_block_encrypt() local
250 edges[i].ptr = blocks[i].c; in tls1_1_multi_block_encrypt()
251 edges[i].blocks = 1; in tls1_1_multi_block_encrypt()
255 sha1_multi_block(ctx, edges, n4x); in tls1_1_multi_block_encrypt()
268 edges[i].ptr = hash_d[i].ptr; in tls1_1_multi_block_encrypt()
269 edges[i].blocks = MAXCHUNKSIZE / 64; in tls1_1_multi_block_encrypt()
273 sha1_multi_block(ctx, edges, n4x); in tls1_1_multi_block_encrypt()
277 edges[i].ptr = hash_d[i].ptr += MAXCHUNKSIZE; in tls1_1_multi_block_encrypt()
279 edges[i].blocks = MAXCHUNKSIZE / 64; in tls1_1_multi_block_encrypt()
310 edges[i].blocks = 1; in tls1_1_multi_block_encrypt()
[all …]
|
| H A D | e_aes_cbc_hmac_sha256.c | 160 HASH_DESC hash_d[8], edges[8]; in tls1_1_multi_block_encrypt() local
249 edges[i].ptr = blocks[i].c; in tls1_1_multi_block_encrypt()
250 edges[i].blocks = 1; in tls1_1_multi_block_encrypt()
254 sha256_multi_block(ctx, edges, n4x); in tls1_1_multi_block_encrypt()
267 edges[i].ptr = hash_d[i].ptr; in tls1_1_multi_block_encrypt()
268 edges[i].blocks = MAXCHUNKSIZE / 64; in tls1_1_multi_block_encrypt()
272 sha256_multi_block(ctx, edges, n4x); in tls1_1_multi_block_encrypt()
276 edges[i].ptr = hash_d[i].ptr += MAXCHUNKSIZE; in tls1_1_multi_block_encrypt()
278 edges[i].blocks = MAXCHUNKSIZE / 64; in tls1_1_multi_block_encrypt()
309 edges[i].blocks = 1; in tls1_1_multi_block_encrypt()
[all …]
|
| /netbsd-src/crypto/external/bsd/openssl.old/dist/crypto/evp/ |
| H A D | e_aes_cbc_hmac_sha1.c | 159 HASH_DESC hash_d[8], edges[8]; in tls1_1_multi_block_encrypt() local
244 edges[i].ptr = blocks[i].c; in tls1_1_multi_block_encrypt()
245 edges[i].blocks = 1; in tls1_1_multi_block_encrypt()
249 sha1_multi_block(ctx, edges, n4x); in tls1_1_multi_block_encrypt()
262 edges[i].ptr = hash_d[i].ptr; in tls1_1_multi_block_encrypt()
263 edges[i].blocks = MAXCHUNKSIZE / 64; in tls1_1_multi_block_encrypt()
267 sha1_multi_block(ctx, edges, n4x); in tls1_1_multi_block_encrypt()
271 edges[i].ptr = hash_d[i].ptr += MAXCHUNKSIZE; in tls1_1_multi_block_encrypt()
273 edges[i].blocks = MAXCHUNKSIZE / 64; in tls1_1_multi_block_encrypt()
304 edges[i].blocks = 1; in tls1_1_multi_block_encrypt()
[all …]
|
| H A D | e_aes_cbc_hmac_sha256.c | 155 HASH_DESC hash_d[8], edges[8]; in tls1_1_multi_block_encrypt() local
244 edges[i].ptr = blocks[i].c; in tls1_1_multi_block_encrypt()
245 edges[i].blocks = 1; in tls1_1_multi_block_encrypt()
249 sha256_multi_block(ctx, edges, n4x); in tls1_1_multi_block_encrypt()
262 edges[i].ptr = hash_d[i].ptr; in tls1_1_multi_block_encrypt()
263 edges[i].blocks = MAXCHUNKSIZE / 64; in tls1_1_multi_block_encrypt()
267 sha256_multi_block(ctx, edges, n4x); in tls1_1_multi_block_encrypt()
271 edges[i].ptr = hash_d[i].ptr += MAXCHUNKSIZE; in tls1_1_multi_block_encrypt()
273 edges[i].blocks = MAXCHUNKSIZE / 64; in tls1_1_multi_block_encrypt()
304 edges[i].blocks = 1; in tls1_1_multi_block_encrypt()
[all …]
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/doc/ |
| H A D | cfg.texi | 19 represent basic blocks and edges represent possible transfer of
40 * Edges:: Types of edges and their representation.
190 type point to type-safe vectors of edges to the predecessors and
194 When walking the edges in an edge vector, @dfn{edge iterators} should
202 first edge in a vector of edges.
206 last edge in a vector of edges.
238 the edges in a sequence of predecessor or successor edges. It must
260 several other reasons why edges may be created. The @code{flags}
267 No type flags are set for edges corresponding to jump instructions.
268 These edges are used for unconditional or conditional jumps and in
[all …]
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/doc/ |
| H A D | cfg.texi | 19 represent basic blocks and edges represent possible transfer of
40 * Edges:: Types of edges and their representation.
190 type point to type-safe vectors of edges to the predecessors and
194 When walking the edges in an edge vector, @dfn{edge iterators} should
202 first edge in a vector of edges.
206 last edge in a vector of edges.
238 the edges in a sequence of predecessor or successor edges. It must
260 several other reasons why edges may be created. The @code{flags}
267 No type flags are set for edges corresponding to jump instructions.
268 These edges are used for unconditional or conditional jumps and in
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/X86/ |
| H A D | X86LoadValueInjectionLoadHardening.cpp | 548 for (const Edge &E : G.edges()) { in elimMitigatedEdgesAndNodes()
553 for (const Edge &DE : Dest->edges()) in elimMitigatedEdgesAndNodes()
563 if (llvm::none_of(RootN.edges(), MachineGadgetGraph::isGadgetEdge)) in elimMitigatedEdgesAndNodes()
572 for (const Edge &E : N->edges()) { in elimMitigatedEdgesAndNodes()
582 for (const Edge &E : RootN.edges()) { in elimMitigatedEdgesAndNodes()
636 for (const Edge &E : Graph->edges()) { in hardenLoadsWithPlugin()
677 for (const Edge &E : Graph->edges()) in hardenLoadsWithHeuristic()
690 for (const Edge &E : N.edges()) { in hardenLoadsWithHeuristic()
696 for (const Edge &EgressEdge : N.edges()) in hardenLoadsWithHeuristic()
730 for (const Edge &E : N.edges()) { in insertFences()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/docs/HistoricalNotes/ |
| H A D | 2003-06-25-Reoptimizer1.txt | 7 back-edges and insert llvm_first_trigger() function call which takes
30 How do we keep track of which edges to instrument, and which edges are
34 region and mark reachable edges.
37 region IGNORING back edges, and mark the edges which are reachable in
41 3) Mark BBs which end in edges that exit the hot region; we need to
|
| /netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-jitlink/ |
| H A D | llvm-jitlink-elf.cpp | 28 auto EItr = std::find_if(B.edges().begin(), B.edges().end(), in getFirstRelocationEdge()
30 if (EItr == B.edges().end()) in getFirstRelocationEdge()
|
| H A D | llvm-jitlink-macho.cpp | 30 auto EItr = std::find_if(B.edges().begin(), B.edges().end(), in getFirstRelocationEdge()
32 if (EItr == B.edges().end()) in getFirstRelocationEdge()
|