LLVM  14.0.0git
StructuralHash.h
Go to the documentation of this file.
1 //===- llvm/IR/StructuralHash.h - IR Hash for expensive checks --*- C++ -*-===//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
8 //
9 // This file provides hashing of the LLVM IR structure to be used to check
10 // Passes modification status.
11 //
12 //===----------------------------------------------------------------------===//
13 
14 #ifndef LLVM_IR_STRUCTURALHASH_H
15 #define LLVM_IR_STRUCTURALHASH_H
16 
17 #ifdef EXPENSIVE_CHECKS
18 
19 #include <cstdint>
20 
21 // This header is only meant to be used when -DEXPENSIVE_CHECKS is set
22 namespace llvm {
23 
24 class Function;
25 class Module;
26 
27 uint64_t StructuralHash(const Function &F);
28 uint64_t StructuralHash(const Module &M);
29 
30 } // end namespace llvm
31 
32 #endif
33 
34 #endif // LLVM_IR_STRUCTURALHASH_H
llvm
This is an optimization pass for GlobalISel generic memory operations.
Definition: AllocatorList.h:23
M
We currently emits eax Perhaps this is what we really should generate is Is imull three or four cycles eax eax The current instruction priority is based on pattern complexity The former is more complex because it folds a load so the latter will not be emitted Perhaps we should use AddedComplexity to give LEA32r a higher priority We should always try to match LEA first since the LEA matching code does some estimate to determine whether the match is profitable if we care more about code then imull is better It s two bytes shorter than movl leal On a Pentium M
Definition: README.txt:252
F
#define F(x, y, z)
Definition: MD5.cpp:56
uint64_t
Module
Machine Check Debug Module
Definition: MachineCheckDebugify.cpp:122
llvm::codeview::PublicSymFlags::Function
@ Function