18#ifndef LLVM_ADT_SLOWDYNAMICAPINT_H
19#define LLVM_ADT_SLOWDYNAMICAPINT_H
43 LLVM_ABI explicit operator int64_t()
const;
84#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
99 const SlowDynamicAPInt &
RHS);
103 const SlowDynamicAPInt &
B);
107LLVM_ABI SlowDynamicAPInt
abs(
const SlowDynamicAPInt &
X);
109 const SlowDynamicAPInt &
RHS);
111 const SlowDynamicAPInt &
RHS);
113 const SlowDynamicAPInt &
B);
This file implements a class to represent arbitrary precision integral constant values and operations...
static GCRegistry::Add< OcamlGC > B("ocaml", "ocaml 3.10-compatible GC")
static GCRegistry::Add< ErlangGC > A("erlang", "erlang-compatible garbage collector")
#define LLVM_DUMP_METHOD
Mark debug helper function definitions like dump() that should not be stripped from debug builds.
static GCMetadataPrinterRegistry::Add< ErlangGCPrinter > X("erlang", "erlang-compatible garbage collector")
Class for arbitrary precision integers.
unsigned getBitWidth() const
Return the number of bits in the APInt.
A simple class providing dynamic arbitrary-precision arithmetic.
LLVM_ABI friend SlowDynamicAPInt gcd(const SlowDynamicAPInt &A, const SlowDynamicAPInt &B)
The operands must be non-negative for gcd.
LLVM_ABI void print(raw_ostream &OS) const
LLVM_ABI SlowDynamicAPInt()
LLVM_ABI SlowDynamicAPInt operator%(const SlowDynamicAPInt &O) const
This operation cannot overflow.
LLVM_ABI friend SlowDynamicAPInt ceilDiv(const SlowDynamicAPInt &LHS, const SlowDynamicAPInt &RHS)
LLVM_ABI SlowDynamicAPInt operator*(const SlowDynamicAPInt &O) const
LLVM_ABI SlowDynamicAPInt & operator+=(const SlowDynamicAPInt &O)
LLVM_ABI SlowDynamicAPInt & operator--()
LLVM_ABI bool operator<=(const SlowDynamicAPInt &O) const
LLVM_ABI SlowDynamicAPInt & operator-=(const SlowDynamicAPInt &O)
LLVM_ABI SlowDynamicAPInt & operator*=(const SlowDynamicAPInt &O)
LLVM_ABI SlowDynamicAPInt & operator=(int64_t Val)
LLVM_ABI SlowDynamicAPInt & operator++()
LLVM_ABI SlowDynamicAPInt operator-() const
LLVM_ABI bool operator!=(const SlowDynamicAPInt &O) const
LLVM_ABI bool operator>(const SlowDynamicAPInt &O) const
LLVM_ABI bool operator==(const SlowDynamicAPInt &O) const
LLVM_ABI SlowDynamicAPInt operator/(const SlowDynamicAPInt &O) const
unsigned getBitWidth() const
LLVM_DUMP_METHOD void dump() const
LLVM_ABI SlowDynamicAPInt & operator/=(const SlowDynamicAPInt &O)
LLVM_ABI SlowDynamicAPInt & operator%=(const SlowDynamicAPInt &O)
LLVM_ABI friend hash_code hash_value(const SlowDynamicAPInt &X)
Overload to compute a hash_code for a SlowDynamicAPInt value.
LLVM_ABI bool operator<(const SlowDynamicAPInt &O) const
LLVM_ABI friend SlowDynamicAPInt abs(const SlowDynamicAPInt &X)
Redeclarations of friend declarations above to make it discoverable by lookups.
LLVM_ABI friend SlowDynamicAPInt floorDiv(const SlowDynamicAPInt &LHS, const SlowDynamicAPInt &RHS)
LLVM_ABI bool operator>=(const SlowDynamicAPInt &O) const
LLVM_ABI SlowDynamicAPInt operator+(const SlowDynamicAPInt &O) const
An opaque object representing a hash code.
This class implements an extremely fast bulk output stream that can only output to a stream.
These are wrappers over isa* function that allow them to be used in generic algorithms such as llvm:a...
LLVM_ABI SlowDynamicAPInt abs(const SlowDynamicAPInt &X)
Redeclarations of friend declarations above to make it discoverable by lookups.
LLVM_ABI bool operator>=(const SlowDynamicAPInt &A, int64_t B)
LLVM_ABI SlowDynamicAPInt ceilDiv(const SlowDynamicAPInt &LHS, const SlowDynamicAPInt &RHS)
LLVM_ABI SlowDynamicAPInt operator/(const SlowDynamicAPInt &A, int64_t B)
LLVM_ABI SlowDynamicAPInt operator+(const SlowDynamicAPInt &A, int64_t B)
LLVM_ABI hash_code hash_value(const IEEEFloat &Arg)
LLVM_ABI SlowDynamicAPInt operator-(const SlowDynamicAPInt &A, int64_t B)
bool operator!=(const DenseSetImpl< ValueT, MapTy, ValueInfoT > &LHS, const DenseSetImpl< ValueT, MapTy, ValueInfoT > &RHS)
Inequality comparison for DenseSet.
LLVM_ABI SlowDynamicAPInt gcd(const SlowDynamicAPInt &A, const SlowDynamicAPInt &B)
LLVM_ABI SlowDynamicAPInt floorDiv(const SlowDynamicAPInt &LHS, const SlowDynamicAPInt &RHS)
LLVM_ABI bool operator>(const SlowDynamicAPInt &A, int64_t B)
raw_ostream & operator<<(raw_ostream &OS, const SlowDynamicAPInt &X)
LLVM_ABI SlowDynamicAPInt & operator+=(SlowDynamicAPInt &A, int64_t B)
LLVM_ABI SlowDynamicAPInt operator%(const SlowDynamicAPInt &A, int64_t B)
LLVM_ABI SlowDynamicAPInt operator*(const SlowDynamicAPInt &A, int64_t B)
LLVM_ABI bool operator<=(const SlowDynamicAPInt &A, int64_t B)
LLVM_ABI SlowDynamicAPInt & operator/=(SlowDynamicAPInt &A, int64_t B)
LLVM_ABI SlowDynamicAPInt lcm(const SlowDynamicAPInt &A, const SlowDynamicAPInt &B)
Returns the least common multiple of A and B.
LLVM_ABI SlowDynamicAPInt mod(const SlowDynamicAPInt &LHS, const SlowDynamicAPInt &RHS)
Returns the remainder of dividing LHS by RHS.
LLVM_ABI SlowDynamicAPInt & operator*=(SlowDynamicAPInt &A, int64_t B)
LLVM_ABI bool operator<(const SlowDynamicAPInt &A, int64_t B)
LLVM_ABI SlowDynamicAPInt & operator-=(SlowDynamicAPInt &A, int64_t B)
LLVM_ABI SlowDynamicAPInt & operator%=(SlowDynamicAPInt &A, int64_t B)
This is an optimization pass for GlobalISel generic memory operations.
bool operator==(const AddressRangeValuePair &LHS, const AddressRangeValuePair &RHS)