/freebsd-13-stable/contrib/llvm-project/lld/MachO/ |
H A D | ExportTrie.cpp | 12 // representation. The prefixes are stored on the edges of the trie, and one 68 std::vector<Edge> edges; member in struct:macho::TrieNode 81 // Size of the whole node (including the terminalSize and the outgoing edges.) 95 // Compute size of all child edges. 97 for (Edge &edge : edges) { 124 assert(edges.size() < 256); 125 *buf++ = edges.size(); 127 for (const Edge &edge : edges) { 186 node->edges.emplace_back(pivotSymbol->getName().slice(lastPos, pos),
|
/freebsd-13-stable/crypto/openssl/crypto/evp/ |
H A D | 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[ [all...] |
H A D | 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[ [all...] |
/freebsd-13-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/ |
H A D | JITLink.cpp | 181 // Copy edges to NewBlock (recording their iterators so that we can remove 184 for (auto I = B.edges().begin(); I != B.edges().end();) { 238 for (auto &E : Sym->getBlock().edges()) {
|
H A D | BasicGOTAndStubsBuilder.h | 35 for (auto &E : B->edges())
|
H A D | JITLinkGeneric.h | 155 for (auto &E : B->edges()) { 157 // Skip non-relocation edges.
|
H A D | MachO_x86_64.cpp | 455 for (auto &E : B->edges()) 470 auto &GOTTarget = GOTBlock.edges().begin()->getTarget(); 508 auto &GOTBlock = StubBlock.edges().begin()->getTarget().getBlock(); 514 auto &GOTTarget = GOTBlock.edges().begin()->getTarget();
|
H A D | JITLinkGeneric.cpp | 447 for (auto &E : Sym->getBlock().edges()) {
|
H A D | EHFrameSupport.cpp | 185 // Find the offsets of any existing edges from this block. 187 for (auto &E : B.edges())
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/X86/ |
H A D | X86LoadValueInjectionLoadHardening.cpp | 108 unsigned int *edges, int *edge_values, 541 // Returns the number of remaining gadget edges that could not be eliminated 546 // Eliminate fences and CFG edges that ingress and egress the fence, as 548 for (const auto &E : G.edges()) { 553 for (const auto &DE : Dest->edges()) 559 // Find and eliminate gadget edges that have been mitigated. 563 if (llvm::none_of(RootN.edges(), MachineGadgetGraph::isGadgetEdge)) 573 for (const auto &E : N->edges()) { 583 for (const auto &E : RootN.edges()) { 626 LLVM_DEBUG(dbgs() << "Cutting edges [all...] |
H A D | 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 70 // The end of this Node's edges is the beginning of the next node's 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 95 const Edge *edges_begin() const { return edges().begin(); } 96 const Edge *edges_end() const { return edges().end(); } 380 for (const Edge &E : N.edges()) { [all...] |
H A D | X86DomainReassignment.cpp | 289 /// A closure is a set of virtual register representing all of the edges in 290 /// the closure, as well as all of the instructions connected by those edges. 340 iterator_range<const_edge_iterator> edges() const { function in class:__anon4424::Closure 380 /// All edges that are included in some closure 510 for (unsigned Reg : C.edges()) {
|
/freebsd-13-stable/contrib/llvm-project/llvm/utils/TableGen/GlobalISel/ |
H A D | GIMatchDag.h | 105 iterator_range<edge_iterator> edges() { function in class:llvm::GIMatchDag 108 iterator_range<const_edge_iterator> edges() const { function in class:llvm::GIMatchDag
|
H A D | GIMatchTree.cpp | 130 // When we declare an instruction, we don't expose any traversable edges just 159 // Record the edges that can now be followed as a result of this 161 for (auto &E : enumerate(MatchDag.edges())) { 577 for (auto &E : enumerate(Leaf.getMatchDag().edges())) { 714 // Consume any edges we handled.
|
/freebsd-13-stable/contrib/llvm-project/llvm/tools/llvm-xray/ |
H A D | xray-graph.cpp | 60 cl::desc("Output graphs with edges labeled with this field"), 107 "color-edges", 128 cl::desc("Alias for -color-edges")); 300 assert(!G.edges().empty()); 301 for (auto &E : G.edges()) { 336 for (auto &E : G.edges()) { 397 // through all edges then vertices and then outputting them and their 408 for (const auto &E : G.edges()) {
|
H A D | xray-graph-diff.cpp | 106 "edge-label", cl::desc("Output graphs with edges labeled with this field"), 129 "edge-color", cl::desc("Output graphs with edges colored by this field"), 222 for (const auto &E : G.edges()) { 380 for (const auto &E : G.edges()) {
|
/freebsd-13-stable/contrib/llvm-project/lldb/source/Symbol/ |
H A D | Function.cpp | 313 // Sort the call edges to speed up return_pc lookups. 323 // Tail calling edges are sorted at the end of the list. Find them by dropping 331 auto edges = GetCallEdges(); 333 llvm::partition_point(edges, [&](const std::unique_ptr<CallEdge> &edge) { 338 if (edge_it == edges.end() ||
|
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/XRay/ |
H A D | 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, 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 171 /// A const iterator type for iterating through the set of edges entering a 177 /// An iterator type for iterating through the set of edges leaving a vertex. 182 /// A const iterator type for iterating through the set of edges enterin 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...] |
/freebsd-13-stable/contrib/libpcap/ |
H A D | optimize.c | 250 struct edge **edges; member in struct:__anon1233 1574 target = fold_edge(ep->succ, opt_state->edges[k]); 2034 free((void *)opt_state->edges); 2161 opt_state->edges = (struct edge **)calloc(opt_state->n_edges, sizeof(*opt_state->edges)); 2162 if (opt_state->edges == NULL) { 2203 opt_state->edges[i] = &b->et; 2205 opt_state->edges[opt_state->n_blocks + i] = &b->ef;
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/ |
H A D | ObjectLinkingLayer.cpp | 285 for (auto &E : Sym->getBlock().edges()) { 361 for (auto &E : Sym->getBlock().edges()) {
|
H A D | MachOPlatform.cpp | 460 for (auto &E : B->edges())
|
/freebsd-13-stable/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | GICombinerEmitter.cpp | 145 /// following any edges of the DAG described by the pattern as we work our way 226 /// traversing the edges to cover the whole DAG. This function reverses DAG 227 /// edges such that everything is reachable from a root. This is part of the 238 for (auto &I : MatchDag.edges()) 425 // Record the endpoints of any named edges. We'll add the cartesian 426 // product of edges later. 508 // one and add the equivalent GIMatchDag nodes, predicates, and edges. 536 // Add the cartesian product of use -> def edges. 681 for (const auto &E : Rule->getMatchDag().edges()) {
|
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/JITLink/ |
H A D | JITLink.h | 137 /// An Addressable with content and edges. 231 /// moving edges between blocks. 234 /// Return the list of edges attached to this content. 235 iterator_range<edge_iterator> edges() { 239 /// Returns the list of edges attached to this content. 240 iterator_range<const_edge_iterator> edges() const { 244 /// Return the size of the edges list. 247 /// Returns true if the list of edges is empty.
|