OpenGrok
Home
Sort by:
relevance
|
last modified time
|
path
Full Search
in project(s):
src
xsrc
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:TI
(Results
1 - 25
of
99
) sorted by relevancy
1
2
3
4
/src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/PDB/Native/
NativeTypePointer.h
25
codeview::TypeIndex
TI
);
29
codeview::TypeIndex
TI
, codeview::PointerRecord PR);
53
codeview::TypeIndex
TI
;
NativeTypeVTShape.h
25
codeview::TypeIndex
TI
, codeview::VFTableShapeRecord SR);
38
codeview::TypeIndex
TI
;
/src/external/apache2/llvm/dist/llvm/lib/DebugInfo/PDB/Native/
NativeEnumTypes.cpp
27
Optional<TypeIndex>
TI
= Types.getFirst();
28
while (
TI
) {
29
CVType CVT = Types.getType(*
TI
);
34
Matches.push_back(*
TI
);
43
Matches.push_back(*
TI
);
46
TI
= Types.getNext(*
TI
);
/src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
EscapeEnumerator.cpp
40
Instruction *
TI
= CurBB->getTerminator();
41
if (!isa<ReturnInst>(
TI
) && !isa<ResumeInst>(
TI
))
45
TI
= CI;
46
Builder.SetInsertPoint(
TI
);
/src/external/apache2/llvm/dist/llvm/lib/DebugInfo/CodeView/
AppendingTypeTableBuilder.cpp
94
TypeIndex
TI
;
98
TI
= insertRecordBytes(C.RecordData);
99
return
TI
;
MergingTypeTableBuilder.cpp
119
TypeIndex
TI
;
123
TI
= insertRecordBytes(C.RecordData);
124
return
TI
;
LazyRandomTypeCollection.cpp
150
Error LazyRandomTypeCollection::ensureTypeExists(TypeIndex
TI
) {
151
if (contains(
TI
))
154
return visitRangeForType(
TI
);
170
Error LazyRandomTypeCollection::visitRangeForType(TypeIndex
TI
) {
171
assert(!
TI
.isSimple());
173
return fullScanForType(
TI
);
175
auto Next = llvm::upper_bound(PartialOffsets,
TI
,
205
TypeIndex
TI
= TypeIndex::fromArrayIndex(0);
206
if (auto EC = ensureTypeExists(
TI
)) {
210
return
TI
;
[
all
...]
/src/lib/libcurses/PSD.doc/
twinkle2.c
60
static char *
TI
;
87
TI
= tgetstr("
ti
", &ptr);
88
if (
TI
== NULL) {
89
printf("terminal does not have the
ti
capability\n");
102
puts(
TI
);
/src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/
BasicBlockUtils.h
194
/// *all* edges from
TI
to the specified successor will be merged into the same
205
BasicBlock *SplitCriticalEdge(Instruction *
TI
, unsigned SuccNum,
212
BasicBlock *SplitKnownCriticalEdge(Instruction *
TI
, unsigned SuccNum,
233
Instruction *
TI
= (*PI)->getTerminator();
234
for (unsigned i = 0, e =
TI
->getNumSuccessors(); i != e; ++i)
235
if (
TI
->getSuccessor(i) == Succ)
236
MadeChange |= !!SplitCriticalEdge(
TI
, i, Options);
247
Instruction *
TI
= Src->getTerminator();
250
assert(i !=
TI
->getNumSuccessors() && "Edge doesn't exist!");
251
if (
TI
->getSuccessor(i) == Dst
[
all
...]
/src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
PruneEH.cpp
104
const Instruction *
TI
= BB.getTerminator();
105
if (CheckUnwind &&
TI
->mayThrow()) {
107
} else if (CheckReturn && isa<ReturnInst>(
TI
)) {
SampleProfileProbe.cpp
233
auto *
TI
= BB.getTerminator();
234
for (unsigned I = 0, E =
TI
->getNumSuccessors(); I != E; ++I) {
235
auto *Succ =
TI
->getSuccessor(I);
/src/external/apache2/llvm/dist/llvm/lib/IR/
Dominators.cpp
44
const Instruction *
TI
= Start->getTerminator();
46
for (unsigned int i = 0, n =
TI
->getNumSuccessors(); i < n; ++i) {
47
if (
TI
->getSuccessor(i) == End)
/src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/
WebAssemblyLateEHPrepare.cpp
157
MachineInstr *
TI
= &*Pos;
158
if (
TI
->getOpcode() == WebAssembly::CATCHRET)
235
MachineInstr *
TI
= &*Pos;
237
switch (
TI
->getOpcode()) {
240
MachineBasicBlock *TBB =
TI
->getOperand(0).getMBB();
242
BuildMI(MBB,
TI
,
TI
->getDebugLoc(), TII.get(WebAssembly::BR))
244
TI
->eraseFromParent();
251
BuildMI(MBB,
TI
,
TI
->getDebugLoc(), TII.get(WebAssembly::RETHROW)
[
all
...]
/src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
SMTConstraintManager.h
247
const TargetInfo &
TI
= getBasicVals().getContext().getTargetInfo();
262
(&
TI
.getLongDoubleFormat() == &llvm::APFloat::x87DoubleExtended() ||
263
&
TI
.getLongDoubleFormat() == &llvm::APFloat::PPCDoubleDouble())))
/src/external/apache2/llvm/dist/clang/lib/Driver/
Action.cpp
250
auto
TI
= DevToolChains.begin();
251
for (; I != E; ++I, ++
TI
)
252
Work(*I, *
TI
, (*I)->getOffloadingArch());
/src/external/apache2/llvm/dist/clang/lib/Lex/
PPExpressions.cpp
383
const TargetInfo &
TI
= PP.getTargetInfo();
386
NumBits =
TI
.getIntWidth();
388
NumBits =
TI
.getWCharWidth();
390
NumBits =
TI
.getChar16Width();
392
NumBits =
TI
.getChar32Width();
394
NumBits =
TI
.getCharWidth();
402
Val.setIsUnsigned(!TargetInfo::isTypeSigned(
TI
.getWCharType()));
/src/external/apache2/llvm/dist/clang/tools/clang-import-test/
clang-import-test.cpp
208
TargetInfo *
TI
= TargetInfo::CreateTargetInfo(
210
Ins->setTarget(
TI
);
/src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
CFGPrinter.h
236
const Instruction *
TI
= Node->getTerminator();
237
if (
TI
->getNumSuccessors() == 1)
242
if (OpNo >=
TI
->getNumSuccessors())
245
BasicBlock *SuccBB =
TI
->getSuccessor(OpNo);
264
MDNode *WeightsNode =
TI
->getMetadata(LLVMContext::MD_prof);
SparsePropagation.h
191
void getFeasibleSuccessors(Instruction &
TI
, SmallVectorImpl<bool> &Succs,
196
void visitTerminator(Instruction &
TI
);
288
Instruction &
TI
, SmallVectorImpl<bool> &Succs, bool AggressiveUndef) {
289
Succs.resize(
TI
.getNumSuccessors());
290
if (
TI
.getNumSuccessors() == 0)
293
if (BranchInst *BI = dyn_cast<BranchInst>(&
TI
)) {
332
if (
TI
.isExceptionalTerminator() ||
333
TI
.isIndirectTerminator()) {
338
SwitchInst &SI = cast<SwitchInst>(
TI
);
349
Succs.assign(
TI
.getNumSuccessors(), true)
[
all
...]
/src/external/apache2/llvm/dist/llvm/lib/Target/SystemZ/
SystemZLongBranch.cpp
341
SmallVector<TerminatorInfo, 16>::iterator
TI
= Terminators.begin();
346
skipTerminator(Position, *
TI
, true);
347
++
TI
;
442
SmallVector<TerminatorInfo, 16>::iterator
TI
= Terminators.begin();
447
assert(Position.Address <=
TI
->Address &&
449
if (mustRelaxBranch(*
TI
, Position.Address))
450
relaxBranch(*
TI
);
451
skipTerminator(Position, *
TI
, false);
452
++
TI
;
/src/external/apache2/llvm/dist/llvm/lib/Transforms/Coroutines/
CoroElide.cpp
191
auto
TI
= BB->getTerminator();
195
if (isa<SwitchInst>(
TI
) &&
196
CoroSuspendSwitches.count(cast<SwitchInst>(
TI
))) {
197
Worklist.push_back(cast<SwitchInst>(
TI
)->getSuccessor(1));
198
Worklist.push_back(cast<SwitchInst>(
TI
)->getSuccessor(2));
226
auto *
TI
= B.getTerminator();
227
if (
TI
->getNumSuccessors() == 0 && !
TI
->isExceptionalTerminator() &&
228
!isa<UnreachableInst>(
TI
))
238
if (llvm::all_of(Terminators, [&](auto *
TI
) {
[
all
...]
/src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/
CFGMST.h
126
Instruction *
TI
= BB.getTerminator();
130
if (int successors =
TI
->getNumSuccessors()) {
132
BasicBlock *TargetBB =
TI
->getSuccessor(i);
133
bool Critical = isCriticalEdge(
TI
, i);
/src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
VPlanHCFGBuilder.cpp
282
Instruction *
TI
= BB->getTerminator();
283
assert(
TI
&& "Terminator expected.");
284
unsigned NumSuccs =
TI
->getNumSuccessors();
287
VPBasicBlock *SuccVPBB = getOrCreateVPBB(
TI
->getSuccessor(0));
291
VPBasicBlock *SuccVPBB0 = getOrCreateVPBB(
TI
->getSuccessor(0));
293
VPBasicBlock *SuccVPBB1 = getOrCreateVPBB(
TI
->getSuccessor(1));
297
assert(isa<BranchInst>(
TI
) && "Unsupported terminator!");
298
auto *Br = cast<BranchInst>(
TI
);
/src/external/apache2/llvm/dist/llvm/utils/TableGen/
DFAEmitter.cpp
61
DfaTransitionInfo
TI
;
71
TI
.emplace_back(FromState, ToState);
80
sort(
TI
);
81
TI
.erase(std::unique(
TI
.begin(),
TI
.end()),
TI
.end());
83
DfaTransitions.emplace(std::make_pair(FromId, A), std::make_pair(ToId,
TI
));
/src/external/apache2/llvm/dist/clang/lib/AST/
Mangle.cpp
68
const TargetInfo &
TI
= Context.getTargetInfo();
69
const llvm::Triple &Triple =
TI
.getTriple();
84
TI
.getCXXABI() == TargetCXXABI::Microsoft)
189
const TargetInfo &
TI
= Context.getTargetInfo();
190
if (CC == CCM_Other || (MCXX &&
TI
.getCXXABI() == TargetCXXABI::Microsoft)) {
231
llvm::alignTo(ASTContext.getTypeSize(AT),
TI
.getPointerWidth(0)) /
232
TI
.getPointerWidth(0);
233
Out << ((
TI
.getPointerWidth(0) / 8) * ArgWords);
Completed in 46 milliseconds
1
2
3
4
Indexes created Tue Feb 24 01:34:59 UTC 2026