| /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
|
| /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
76 struct SIZED(edge) *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/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/apache2/llvm/dist/llvm/include/llvm/XRay/ |
| Graph.h | 48 /// Usage Example Graph with weighted edges and vertices:
58 /// for(const auto &e : G.edges()){
59 /// // Do something with the edges in the graph;
76 /// These objects are used to name edges and vertices in the graph.
85 /// This type is the value_type of all iterators which range over edges,
86 /// Determined by the Edges DenseMap.
99 /// The type used for storing the edges entering a vertex. Indexed by
101 /// where the incoming edges are, the EdgeIdentifiers are stored in an
112 EdgeMapT Edges;
171 /// A const iterator type for iterating through the set of edges entering
355 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
357 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /src/external/apache2/llvm/dist/llvm/utils/TableGen/GlobalISel/ |
| GIMatchDag.h | 79 EdgesVec Edges;
88 : Ctx(Ctx), InstrNodes(), PredicateNodes(), Edges(),
94 return raw_pointer_iterator<EdgesVec::iterator>(Edges.begin());
97 return raw_pointer_iterator<EdgesVec::iterator>(Edges.end());
100 return raw_pointer_iterator<EdgesVec::const_iterator>(Edges.begin());
103 return raw_pointer_iterator<EdgesVec::const_iterator>(Edges.end());
105 iterator_range<edge_iterator> edges() { function in class:llvm::GIMatchDag
108 iterator_range<const_edge_iterator> edges() const { function in class:llvm::GIMatchDag
202 Edges.push_back(std::move(Obj));
222 size_t getNumEdges() const { return Edges.size();
[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/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/external/apache2/llvm/dist/llvm/lib/Target/X86/ |
| ImmutableGraph.h | 11 /// implemented as two arrays: one containing nodes, and one containing edges.
14 /// 2. Operations on sets of nodes/edges are efficient, and representations of
15 /// those sets in memory are compact. For instance, a set of edges is
62 const Edge *Edges;
68 const Edge *edges_begin() const { return Edges; }
69 // Nodes are allocated sequentially. Edges for a node are stored together.
70 // The end of this Node's edges is the beginning of the next node's edges.
73 const Edge *edges_end() const { return (this + 1)->Edges; }
74 ArrayRef<Edge> edges() const function in class:llvm::ImmutableGraph::Node
94 ArrayRef<Edge> edges() const { return makeArrayRef(Edges.get(), EdgesSize); } function in class:llvm::ImmutableGraph
[all...] |
| X86DomainReassignment.cpp | 287 /// A closure is a set of virtual register representing all of the edges in
288 /// the closure, as well as all of the instructions connected by those edges.
301 DenseSet<Register> Edges;
331 bool empty() const { return Edges.empty(); }
333 bool insertEdge(Register Reg) { return Edges.insert(Reg).second; }
336 iterator_range<const_edge_iterator> edges() const { function in class:__anon5194::Closure
337 return iterator_range<const_edge_iterator>(Edges.begin(), Edges.end());
351 for (Register Reg : Edges) {
376 /// All edges that are included in some closur
[all...] |
| /src/sys/dev/i2c/ |
| emcfan.c | 654 int edges; local
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/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...] |
| e_aes_cbc_hmac_sha256.c | 158 HASH_DESC hash_d[8], edges[8]; local
246 edges[i].ptr = blocks[i].c;
247 edges[i].blocks = 1;
251 sha256_multi_block(ctx, edges, n4x);
264 edges[i].ptr = hash_d[i].ptr;
265 edges[i].blocks = MAXCHUNKSIZE / 64;
269 sha256_multi_block(ctx, edges, n4x);
273 edges[i].ptr = hash_d[i].ptr += MAXCHUNKSIZE;
275 edges[i].blocks = MAXCHUNKSIZE / 64;
306 edges[i].blocks = 1
[all...] |
| /src/crypto/external/bsd/openssl/dist/crypto/evp/ |
| e_aes_cbc_hmac_sha1.c | 165 HASH_DESC hash_d[8], edges[8]; local
250 edges[i].ptr = blocks[i].c;
251 edges[i].blocks = 1;
255 sha1_multi_block(ctx, edges, n4x);
268 edges[i].ptr = hash_d[i].ptr;
269 edges[i].blocks = MAXCHUNKSIZE / 64;
273 sha1_multi_block(ctx, edges, n4x);
277 edges[i].ptr = hash_d[i].ptr += MAXCHUNKSIZE;
279 edges[i].blocks = MAXCHUNKSIZE / 64;
310 edges[i].blocks = 1
[all...] |
| e_aes_cbc_hmac_sha256.c | 160 HASH_DESC hash_d[8], edges[8]; local
249 edges[i].ptr = blocks[i].c;
250 edges[i].blocks = 1;
254 sha256_multi_block(ctx, edges, n4x);
267 edges[i].ptr = hash_d[i].ptr;
268 edges[i].blocks = MAXCHUNKSIZE / 64;
272 sha256_multi_block(ctx, edges, n4x);
276 edges[i].ptr = hash_d[i].ptr += MAXCHUNKSIZE;
278 edges[i].blocks = MAXCHUNKSIZE / 64;
309 edges[i].blocks = 1
[all...] |
| /src/crypto/external/bsd/openssl.old/dist/crypto/evp/ |
| e_aes_cbc_hmac_sha1.c | 159 HASH_DESC hash_d[8], edges[8]; local
244 edges[i].ptr = blocks[i].c;
245 edges[i].blocks = 1;
249 sha1_multi_block(ctx, edges, n4x);
262 edges[i].ptr = hash_d[i].ptr;
263 edges[i].blocks = MAXCHUNKSIZE / 64;
267 sha1_multi_block(ctx, edges, n4x);
271 edges[i].ptr = hash_d[i].ptr += MAXCHUNKSIZE;
273 edges[i].blocks = MAXCHUNKSIZE / 64;
304 edges[i].blocks = 1
[all...] |
| e_aes_cbc_hmac_sha256.c | 155 HASH_DESC hash_d[8], edges[8]; local
244 edges[i].ptr = blocks[i].c;
245 edges[i].blocks = 1;
249 sha256_multi_block(ctx, edges, n4x);
262 edges[i].ptr = hash_d[i].ptr;
263 edges[i].blocks = MAXCHUNKSIZE / 64;
267 sha256_multi_block(ctx, edges, n4x);
271 edges[i].ptr = hash_d[i].ptr += MAXCHUNKSIZE;
273 edges[i].blocks = MAXCHUNKSIZE / 64;
304 edges[i].blocks = 1
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| tree-call-cdce.cc | 928 possible EH edges (only if [join] is old)
994 auto_vec<edge_pair, 8> edges;
1004 edges.reserve (nconds);
1005 edges.quick_push (edge_pair (bi_call_in_edge0, join_tgt_in_edge_fall_thru));
1031 edges.quick_push (edge_pair (bi_call_in_edge, guard_bb_in_edge));
1080 that probability among its incoming edges. On the other hand we
1091 while (!edges.is_empty ())
1093 edge_pair e = edges.pop ();
991 auto_vec<edge_pair, 8> edges; local
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-call-cdce.cc | 829 possible EH edges (only if [join] is old)
895 auto_vec<edge_pair, 8> edges;
905 edges.reserve (nconds);
906 edges.quick_push (edge_pair (bi_call_in_edge0, join_tgt_in_edge_fall_thru));
932 edges.quick_push (edge_pair (bi_call_in_edge, guard_bb_in_edge));
981 that probability among its incoming edges. On the other hand we
992 while (!edges.is_empty ())
994 edge_pair e = edges.pop ();
892 auto_vec<edge_pair, 8> edges; local
|
