Home
last modified time | relevance | path

Searched refs:TE (Results 1 – 25 of 109) sorted by relevance

12345

/freebsd/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/java_api/
H A Dtst.ProbeData.ksh.out3 0: 54 45 0 0 1c 0 TE....
8 0: 54 45 0 0 1c 0 TE....
13 0: 54 45 0 0 1c 0 TE....
18 0: 54 45 0 0 1c 0 TE....
23 0: 54 45 0 0 1c 0 TE....
28 0: 54 45 0 0 1c 1 TE....
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp1256 /// Checks if the specified gather tree entry \p TE can be represented as a
1260 std::optional<OrdersType> findReusedOrderedScalars(const TreeEntry &TE);
1263 std::optional<OrdersType> findPartiallyOrderedLoads(const TreeEntry &TE);
1272 std::optional<OrdersType> getReorderingData(const TreeEntry &TE,
2659 /// Checks if the given \p TE is a gather node with clustered reused scalars
2661 void reorderNodeWithReuses(TreeEntry &TE, ArrayRef<int> Mask) const;
2667 TreeEntry *TE = nullptr; in getVectorizedOperand() local
2669 TE = getTreeEntry(V); in getVectorizedOperand()
2670 if (TE && is_contained(TE in getVectorizedOperand()
3247 const TreeEntry *TE = getTreeEntry(V); newTreeEntry() local
3577 TreeEntry *TE = nullptr; global() member
3743 if (TreeEntry *TE = BundleMember->TE) { schedule() local
4222 findReusedOrderedScalars(const BoUpSLP::TreeEntry & TE) findReusedOrderedScalars() argument
4856 findPartiallyOrderedLoads(const BoUpSLP::TreeEntry & TE) findPartiallyOrderedLoads() argument
4928 getReorderingData(const TreeEntry & TE,bool TopToBottom) getReorderingData() argument
5187 reorderNodeWithReuses(TreeEntry & TE,ArrayRef<int> Mask) const reorderNodeWithReuses() argument
5257 __anon07b2d7743f02( const std::unique_ptr<TreeEntry> &TE) reorderTopToBottom() argument
5509 if (TreeEntry *TE = getVectorizedOperand(UserTE, I)) { canReorderOperands() local
5530 __anon07b2d7744802(TreeEntry *TE) canReorderOperands() argument
5560 for (const std::unique_ptr<TreeEntry> &TE : VectorizableTree) { reorderBottomToTop() local
5672 __anon07b2d7744f02(const TreeEntry *TE) reorderBottomToTop() argument
5769 TreeEntry *TE = Op.second; reorderBottomToTop() local
7049 TreeEntry *TE = buildTree_rec() local
7110 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local
7125 TreeEntry *TE = nullptr; buildTree_rec() local
7200 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local
7213 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local
7274 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local
7296 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local
7354 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local
7370 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local
7416 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local
8913 __anon07b2d7748902(const std::unique_ptr<TreeEntry> &TE) adjustExtracts() argument
9182 if (const TreeEntry *TE = getTreeEntry(Op)) { getOperandEntry() local
9189 for (const TreeEntry *TE : MIt->second) { getOperandEntry() local
9198 __anon07b2d7749302(const std::unique_ptr<TreeEntry> &TE) getOperandEntry() argument
9888 for (const std::unique_ptr<TreeEntry> &TE : VectorizableTree) { getEntryCost() local
10002 __anon07b2d774ac02(const TreeEntry *TE, unsigned Limit) isFullyVectorizableTinyTree() argument
10128 __anon07b2d774ae02(const std::unique_ptr<TreeEntry> &TE) isTreeTinyAndNotFullyVectorizable() argument
10155 __anon07b2d774af02(const std::unique_ptr<TreeEntry> &TE) isTreeTinyAndNotFullyVectorizable() argument
10454 TreeEntry &TE = *VectorizableTree[I]; getTreeCost() local
10662 __anon07b2d774b802(const TreeEntry *TE, ArrayRef<int> Mask, bool) getTreeCost() argument
10928 isGatherShuffledSingleRegisterEntry(const TreeEntry * TE,ArrayRef<Value * > VL,MutableArrayRef<int> Mask,SmallVectorImpl<const TreeEntry * > & Entries,unsigned Part,bool ForOrder) isGatherShuffledSingleRegisterEntry() argument
11132 for (const TreeEntry *TE : UsedTEs.front()) { isGatherShuffledSingleRegisterEntry() local
11148 for (const TreeEntry *TE : SecondEntries) { isGatherShuffledSingleRegisterEntry() local
11299 isGatherShuffledEntry(const TreeEntry * TE,ArrayRef<Value * > VL,SmallVectorImpl<int> & Mask,SmallVectorImpl<SmallVector<const TreeEntry * >> & Entries,unsigned NumParts,bool ForOrder) isGatherShuffledEntry() argument
11881 if (const TreeEntry *TE = R.getTreeEntry(VecBase)) adjustExtracts() local
11894 __anon07b2d774d402(const std::unique_ptr<TreeEntry> &TE) adjustExtracts() argument
11936 if (const TreeEntry *TE = R.getTreeEntry(VecOp)) adjustExtracts() local
11947 if (const TreeEntry *TE = R.getTreeEntry(VecOp)) adjustExtracts() local
12004 __anon07b2d774db02(const TreeEntry *TE) needToDelay() argument
12218 __anon07b2d774e102(const std::unique_ptr<TreeEntry> &TE) vectorizeOperand() argument
12228 __anon07b2d774e202(const TreeEntry *TE) vectorizeOperand() argument
12289 __anon07b2d774e502(const std::unique_ptr<TreeEntry> &TE) vectorizeOperand() argument
12305 __anon07b2d774e602(const std::unique_ptr<TreeEntry> &TE) vectorizeOperand() argument
12342 __anon07b2d774e902(const std::unique_ptr<TreeEntry> &TE) processBuildVector() argument
12395 if (const auto *TE = getTreeEntry( processBuildVector() local
12470 __anon07b2d774ee02(const TreeEntry *TE) processBuildVector() argument
12596 if (const auto *TE = getTreeEntry(VecOp)) processBuildVector() local
12894 if (const TreeEntry *TE = getTreeEntry(V)) vectorizeTree() local
13717 for (const std::unique_ptr<TreeEntry> &TE : VectorizableTree) vectorizeTree() local
13727 auto *TE = const_cast<TreeEntry *>(E); vectorizeTree() local
15555 const TreeEntry *TE = getTreeEntry(U); computeMinimumValueSizes() local
15796 TreeEntry *TE = VectorizableTree[Idx].get(); computeMinimumValueSizes() local
[all...]
/freebsd/contrib/llvm-project/compiler-rt/lib/fuzzer/
H A DFuzzerTracePC.cpp162 auto ObservePC = [&](const PCTableEntry *TE) { in UpdateObservedPCs() argument
163 if (ObservedPCs.insert(TE).second && DoPrintNewPCs) { in UpdateObservedPCs()
165 GetNextInstructionPc(TE->PC)); in UpdateObservedPCs()
170 auto Observe = [&](const PCTableEntry *TE) { in UpdateObservedPCs() argument
171 if (PcIsFuncEntry(TE)) in UpdateObservedPCs()
172 if (++ObservedFuncs[TE->PC] == 1 && NumPrintNewFuncs) in UpdateObservedPCs()
173 CoveredFuncs.push_back(TE->PC); in UpdateObservedPCs()
174 ObservePC(TE); in UpdateObservedPCs()
202 uintptr_t TracePC::PCTableEntryIdx(const PCTableEntry *TE) { in PCTableEntryIdx() argument
206 if (TE >= M.Start && TE < M.Stop) in PCTableEntryIdx()
[all …]
H A DFuzzerTracePC.h126 uintptr_t PCTableEntryIdx(const PCTableEntry *TE);
129 bool PcIsFuncEntry(const PCTableEntry *TE) { return TE->PCFlags & 1; } in PcIsFuncEntry() argument
H A DFuzzerMerge.cpp263 TPC.ForEachObservedPC([&](const TracePC::PCTableEntry *TE) { in CrashResistantMergeInternalStep() argument
264 if (AllPCs.insert(TE).second) in CrashResistantMergeInternalStep()
265 OF << " " << TPC.PCTableEntryIdx(TE); in CrashResistantMergeInternalStep()
H A DFuzzerFork.cpp256 if (auto *TE = TPC.PCTableEntryByIdx(Idx)) in RunOneMergeJob() local
257 if (TPC.PcIsFuncEntry(TE)) in RunOneMergeJob()
259 TPC.GetNextInstructionPc(TE->PC)); in RunOneMergeJob()
H A DFuzzerLoop.cpp394 auto HandlePC = [&](const TracePC::PCTableEntry *TE) { in CheckExitOnSrcPosOrItem() argument
395 if (!PCsSet->insert(TE->PC).second) in CheckExitOnSrcPosOrItem()
397 std::string Descr = DescribePC("%F %L", TE->PC + 1); in CheckExitOnSrcPosOrItem()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineTraceMetrics.cpp1187 const MachineBasicBlock *MBB = TE.MTM.MF->getBlockNumbered(getBlockNum()); in getPHIDepth()
1189 getPHIDeps(PHI, Deps, MBB, TE.MTM.MRI); in getPHIDepth()
1195 DepCycle += TE.MTM.SchedModel.computeOperandLatency(Dep.DefMI, Dep.DefOp, in getPHIDepth()
1205 ArrayRef<unsigned> PRDepths = TE.getProcResourceDepths(getBlockNum()); in getResourceDepth()
1207 ArrayRef<unsigned> PRCycles = TE.MTM.getProcReleaseAtCycles(getBlockNum()); in getResourceDepth()
1215 PRMax = TE.MTM.getCycles(PRMax); in getResourceDepth()
1221 Instrs += TE.MTM.BlockInfo[getBlockNum()].InstrCount; in getResourceDepth()
1222 if (unsigned IW = TE.MTM.SchedModel.getIssueWidth()) in getResourceDepth()
1233 ArrayRef<unsigned> PRDepths = TE.getProcResourceDepths(getBlockNum()); in getResourceLength()
1234 ArrayRef<unsigned> PRHeights = TE.getProcResourceHeights(getBlockNum()); in getResourceLength()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86InstrFoldTables.h34 friend bool operator<(const X86FoldTableEntry &TE, unsigned Opcode) {
35 return TE.KeyOp < Opcode;
H A DX86EvexToVex.cpp
H A DX86FloatingPoint.cpp584 bool operator<(const TableEntry &TE) const { return from < TE.from; } in operator <()
585 friend bool operator<(const TableEntry &TE, unsigned V) { in operator <() argument
586 return TE.from < V; in operator <()
589 const TableEntry &TE) { in operator <() argument
590 return V < TE.from; in operator <()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineTraceMetrics.h266 Ensemble &TE; variable
269 unsigned getBlockNum() const { return &TBI - &TE.BlockInfo[0]; } in getBlockNum()
272 explicit Trace(Ensemble &te, TraceBlockInfo &tbi) : TE(te), TBI(tbi) {} in Trace()
310 return TE.Cycles.lookup(&MI); in getInstrCycles()
/freebsd/contrib/llvm-project/llvm/lib/Target/ARM/Utils/
H A DARMBaseInfo.cpp30 return ChooseMask(PredBlockMask::TT, PredBlockMask::TE); in expandPredBlockMask()
33 case PredBlockMask::TE: in expandPredBlockMask()
H A DARMBaseInfo.h108 TE = 0b1100, enumerator
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCInstrDFP.td62 (ins s5imm:$TE, f8rc:$FRB, u2imm:$RMC),
63 "dquai", "$TE, $FRT, $FRB, $RMC", []>;
65 (ins s5imm:$TE, fpairrc:$FRB, u2imm:$RMC),
66 "dquaiq", "$TE, $FRT, $FRB, $RMC", []>;
/freebsd/sys/contrib/device-tree/Bindings/display/panel/
H A Dpanel-dsi-cm.txt10 - te-gpios: panel TE gpio
/freebsd/contrib/llvm-project/clang/lib/Analysis/
H A DExprMutationAnalyzer.cpp59 if (const auto *TE = OP->getTrueExpr()->IgnoreParens()) in canExprResolveTo() local
60 if (canExprResolveTo(TE, Target)) in canExprResolveTo()
71 if (const auto *TE = OP->getTrueExpr()->IgnoreParens()) in canExprResolveTo() local
72 if (canExprResolveTo(TE, Target)) in canExprResolveTo()
/freebsd/contrib/llvm-project/clang/lib/Sema/
H A DSemaExprMember.cpp709 TypoExpr *&TE) { in LookupMemberExprInRecord() argument
745 TE = SemaRef.CorrectTypoDelayed( in LookupMemberExprInRecord()
762 [=](Sema &SemaRef, TypoExpr *TE, TypoCorrection TC) mutable { in LookupMemberExprInRecord() argument
795 TypoExpr *TE = nullptr; in BuildMemberReferenceExpr() local
800 TE)) in BuildMemberReferenceExpr()
802 if (TE) in BuildMemberReferenceExpr()
803 return TE; in BuildMemberReferenceExpr()
1356 TypoExpr *TE = nullptr; in LookupMemberExpr() local
1358 SS, HasTemplateArgs, TemplateKWLoc, TE)) in LookupMemberExpr()
1365 return ExprResult(TE); in LookupMemberExpr()
H A DSemaExprCXX.cpp8697 bool VisitTypoExpr(TypoExpr *TE) { in VisitTypoExpr() argument
8698 TypoExprs.insert(TE); in VisitTypoExpr()
8724 for (TypoExpr *TE : TypoExprs) { in EmitAllDiagnostics()
8725 auto &State = SemaRef.getTypoExprState(TE); in EmitAllDiagnostics()
8729 ExprResult Replacement = IsAmbiguous ? ExprError() : TransformCache[TE]; in EmitAllDiagnostics()
8742 SemaRef.clearDelayedTypo(TE); in EmitAllDiagnostics()
8761 for (auto *TE : TypoExprs) { in CheckAndAdvanceTypoExprCorrectionStreams() local
8762 auto &State = SemaRef.getTypoExprState(TE); in CheckAndAdvanceTypoExprCorrectionStreams()
8763 TransformCache.erase(TE); in CheckAndAdvanceTypoExprCorrectionStreams()
8828 for (auto *TE : TypoExprs) { in CheckForRecursiveTypos() local
[all …]
/freebsd/contrib/llvm-project/llvm/lib/MC/MCDisassembler/
H A DMCDisassembler.cpp75 SMC_PCASE(TE, 1) in getSMCPriority()
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DImmutableSet.h436 typename TreeTy::iterator& TE) {
439 if (TI == TE || !I->isElementEqual(&*TI))
616 typename TreeTy::iterator TI = T->begin(), TE = T->end();
617 if (!compareTreeWithSection(TNew, TI, TE))
619 if (TI != TE)
/freebsd/contrib/llvm-project/clang/lib/Tooling/Refactoring/
H A DASTSelection.cpp118 if (auto *TE = dyn_cast<CXXThisExpr>(S)) { in TraverseStmt() local
119 if (TE->isImplicit()) in TraverseStmt()
/freebsd/contrib/ntp/scripts/deprecated/
H A Dhtml2man.in218 print MANOUT ".TE\n";
/freebsd/sys/arm/conf/
H A DALPINE67 device ses # Enclosure Services (SES and SAF-TE)
/freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DExprEngineCXX.cpp1167 void ExprEngine::VisitCXXThisExpr(const CXXThisExpr *TE, ExplodedNode *Pred, in VisitCXXThisExpr() argument
1175 getContext().getCanonicalType(TE->getType()), in VisitCXXThisExpr()
1180 Bldr.generateNode(TE, Pred, state->BindExpr(TE, LCtx, V)); in VisitCXXThisExpr()

12345