OpenGrok
Home
Sort by:
relevance
|
last modified time
|
path
Full Search
in project(s):
src
xsrc
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:Upper
(Results
1 - 20
of
20
) sorted by relevancy
/src/external/apache2/llvm/dist/llvm/include/llvm/Support/
NativeFormatting.h
22
enum class HexPrintStyle {
Upper
, Lower, PrefixUpper, PrefixLower };
UnicodeCharRanges.h
22
/// Represents a closed range of Unicode code points [Lower,
Upper
].
25
uint32_t
Upper
;
32
return Range.
Upper
< Value;
76
LLVM_DEBUG(dbgs() << "
Upper
bound 0x");
82
if (I->
Upper
< I->Lower) {
83
LLVM_DEBUG(dbgs() << "
Upper
bound 0x");
86
LLVM_DEBUG(dbgs().write_hex(I->
Upper
) << "\n");
89
Prev = I->
Upper
;
Format.h
169
bool
Upper
;
176
: HexValue(HV), DecValue(DV), Width(W), Hex(H),
Upper
(U),
187
bool
Upper
= false) {
189
return FormattedNumber(N, 0, Width, true,
Upper
, true);
200
bool
Upper
= false) {
202
return FormattedNumber(N, 0, Width, true,
Upper
, false);
223
bool
Upper
; // Show offset and hex bytes as
upper
case.
231
ByteGroupSize(BGS),
Upper
(U), ASCII(A) {
241
uint32_t IndentLevel = 0, bool
Upper
= false)
[
all
...]
/src/sys/arch/amiga/stand/bootblock/boot/
amigatypes.h
60
u_int32_t First, Lower,
Upper
, Free;
/src/external/apache2/llvm/dist/llvm/include/llvm/IR/
ConstantRange.h
10
// for an integral value. This keeps track of a lower and
upper
bound for the
12
// keeps track of a [lower,
upper
) bound, which specifies an interval just like
48
APInt Lower,
Upper
;
68
/// Lower==
Upper
and Lower != Min or Max value for its type. It will also
70
ConstantRange(APInt Lower, APInt
Upper
);
83
///
Upper
are the same, a full range is returned.
84
static ConstantRange getNonEmpty(APInt Lower, APInt
Upper
) {
85
if (Lower ==
Upper
)
87
return ConstantRange(std::move(Lower), std::move(
Upper
));
173
/// Return the
upper
value for this range
[
all
...]
/src/external/apache2/llvm/dist/llvm/lib/Support/
ScaledNumber.cpp
33
uint64_t
Upper
= P1, Lower = P4;
36
Upper
+= getU(N) + (NewLower < Lower);
42
// Check whether the
upper
digit is empty.
43
if (!
Upper
)
47
unsigned LeadingZeros = countLeadingZeros(
Upper
);
50
Upper
=
Upper
<< LeadingZeros | Lower >> Shift;
51
return getRounded(
Upper
, Shift,
NativeFormatting.cpp
141
bool
Upper
=
142
(Style == HexPrintStyle::
Upper
|| Style == HexPrintStyle::PrefixUpper);
155
*--CurPtr = hexdigit(x, !
Upper
);
/src/sys/external/bsd/acpica/dist/utilities/
utprint.c
88
BOOLEAN
Upper
);
161
*
Upper
- Whether or not using
upper
cased digits
175
BOOLEAN
Upper
)
183
Digits =
Upper
? AcpiGbl_UpperHexDigits : AcpiGbl_LowerHexDigits;
303
BOOLEAN
Upper
;
321
Upper
= (Type & ACPI_FORMAT_UPPER) ? TRUE : FALSE;
357
Pos = AcpiUtPutNumber (ReversedString, Number, Base,
Upper
);
388
String, End,
Upper
? 'X' : 'x');
/src/external/apache2/llvm/dist/clang/include/clang/AST/
ExprOpenMP.h
238
/// Normalized
upper
bound. Normalized loop iterates from 0 to
Upper
with
240
Expr *
Upper
= nullptr;
/src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
DependenceAnalysis.h
363
const SCEV *
Upper
[8];
579
/// If no
upper
bound is available, return NULL.
804
/// computes the
upper
bound given the current direction settings
827
/// findBoundsALL - Computes the
upper
and lower bounds for level K
834
/// findBoundsLT - Computes the
upper
and lower bounds for level K
841
/// findBoundsGT - Computes the
upper
and lower bounds for level K
848
/// findBoundsEQ - Computes the
upper
and lower bounds for level K
/src/external/apache2/llvm/dist/llvm/lib/Analysis/
StratifiedSets.h
514
auto *
Upper
= &linksAt(UpperIndex);
515
if (Lower ==
Upper
)
521
while (Current->hasAbove() && Current !=
Upper
) {
527
if (Current !=
Upper
)
530
Upper
->setAttrs(Attrs);
534
Upper
->setBelow(NewBelowIndex);
538
Upper
->clearBelow();
542
Ptr->remapTo(
Upper
->Number);
ValueTracking.cpp
464
ConstantInt *
Upper
=
466
ConstantRange Range(Lower->getValue(),
Upper
->getValue());
969
// BitWidth > 64 and any
upper
bits are known, we'll end up returning the
1537
// If we have a known 1, its position is our
upper
bound.
1548
// If we have a known 1, its position is our
upper
bound.
2193
ConstantInt *
Upper
=
2195
ConstantRange Range(Lower->getValue(),
Upper
->getValue());
2773
// Returns the input and lower/
upper
bounds.
6059
//
upper
bits after truncation. It can't be abs pattern, because it would
6622
APInt &
Upper
, const InstrInfoQuery &IIQ)
[
all
...]
/src/external/apache2/llvm/dist/llvm/tools/llvm-dwarfdump/
Statistics.cpp
216
uint64_t
Upper
= std::min(A.HighPC, B.HighPC);
217
if (Lower >=
Upper
)
219
return
Upper
- Lower;
/src/external/apache2/llvm/dist/llvm/lib/Target/SystemZ/
SystemZISelDAGToDAG.cpp
117
// narrower (in which case the
upper
bits are don't care), or wider (in which
1120
SDValue
Upper
= CurDAG->getConstant(UpperVal, DL, VT);
1122
Upper
= CurDAG->getNode(Opcode, DL, VT, Op0,
Upper
);
1125
// When we haven't passed in Op0,
Upper
will be a constant. In order to
1128
// we need to use a handle to keep track of
Upper
in case it gets CSE'd by
1132
// SelectCode(
Upper
) later, along with the SelectCode(Or), and avoid needing
1137
HandleSDNode Handle(
Upper
);
1138
SelectCode(
Upper
.getNode());
1139
Upper
= Handle.getValue()
[
all
...]
SystemZISelLowering.cpp
778
uint64_t
Upper
=
780
if (tryValue(SplatBitsZ |
Upper
| Lower))
786
uint64_t Middle = SplatUndefZ & ~
Upper
& ~Lower;
3526
// but using the fact that the
upper
halves are either all zeros
3615
// See if the
upper
32 bits of one operand and the lower 32 bits of the
7423
// XILF with the
upper
BitSize bits set.
7642
// ^^ Replace the
upper
32-BitSize bits of the
/src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/
InstCombineCompares.cpp
2637
const APInt &
Upper
= CR.getUpper();
2641
return new ICmpInst(ICmpInst::ICMP_SLT, X, ConstantInt::get(Ty,
Upper
));
2642
if (
Upper
.isSignMask())
2646
return new ICmpInst(ICmpInst::ICMP_ULT, X, ConstantInt::get(Ty,
Upper
));
2647
if (
Upper
.isMinValue())
4684
// all uses must ignore
upper
bits of the product. The number of used low
/src/external/apache2/llvm/dist/clang/lib/CodeGen/
CGExpr.cpp
1693
llvm::Value *
Upper
=
1697
Check = Builder.CreateAnd(
Upper
, Lower);
3932
// Requesting lower bound or
upper
bound, but without provided length and
/src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/AsmParser/
AArch64AsmParser.cpp
799
uint64_t
Upper
= UINT64_C(-1) << (sizeof(T) * 4) << (sizeof(T) * 4);
801
if ((Val &
Upper
) && (Val &
Upper
) !=
Upper
)
804
return AArch64_AM::isLogicalImmediate(Val & ~
Upper
, sizeof(T) * 8);
3034
Mnemonic.
upper
() + std::string(PRCTX->Name) + " requires: ");
/src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
AttributorAttributes.cpp
377
// We can only use the lower part of the range because the
upper
part can
2168
/// (we only add items to them) and it is
upper
bounded by the number of
7127
ConstantInt *
Upper
=
7130
ConstantRange Known(Lower->getValue(),
Upper
->getValue());
/src/external/apache2/llvm/dist/llvm/lib/Target/ARM/
ARMISelLowering.cpp
5072
// the opposite of the constant in the
upper
-bound check
6389
//
Upper
32 bits of the destination/source
6396
// The
upper
32 bits come from the second return value of lsll
7011
//
upper
and lower parts of the mask with a matching value for WhichResult
7675
SDValue
Upper
= DAG.getBuildVector(
7677
if (
Upper
.getOpcode() == ISD::BUILD_VECTOR)
7678
Upper
= LowerBUILD_VECTOR(
Upper
, DAG, ST);
7679
if (Lower &&
Upper
)
7680
return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, Lower,
Upper
);
[
all
...]
Completed in 65 milliseconds
Indexes created Mon Sep 21 00:25:25 UTC 2026