Home
last modified time | relevance | path

Searched refs:Sz (Results 1 – 25 of 46) sorted by relevance

12

/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DMemAlloc.h25 LLVM_ATTRIBUTE_RETURNS_NONNULL inline void *safe_malloc(size_t Sz) { in safe_malloc() argument
26 void *Result = std::malloc(Sz); in safe_malloc()
31 if (Sz == 0) in safe_malloc()
39 size_t Sz) { in safe_calloc() argument
40 void *Result = std::calloc(Count, Sz); in safe_calloc()
45 if (Count == 0 || Sz == 0) in safe_calloc()
52 LLVM_ATTRIBUTE_RETURNS_NONNULL inline void *safe_realloc(void *Ptr, size_t Sz) { in safe_realloc() argument
53 void *Result = std::realloc(Ptr, Sz); in safe_realloc()
58 if (Sz == 0) in safe_realloc()
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DThreadSafetyUtil.h51 void *allocate(size_t Sz) { in allocate() argument
52 return Allocator->Allocate(Sz, alignof(AlignmentType)); in allocate()
70 inline void *operator new(size_t Sz, in new() argument
72 return R.allocate(Sz); in new()
87 SimpleArray(T *Dat, size_t Cp, size_t Sz = 0)
88 : Data(Dat), Size(Sz), Capacity(Cp) {} in Data()
189 void setValues(unsigned Sz, const T& C) { in setValues() argument
190 assert(Sz <= Capacity); in setValues()
191 Size = Sz; in setValues()
192 for (unsigned i = 0; i < Sz; ++i) { in setValues()
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DSourceMgr.cpp91 size_t Sz = Buffer->getBufferSize(); in GetOrCreateOffsetCache() local
92 assert(Sz <= std::numeric_limits<T>::max()); in GetOrCreateOffsetCache()
94 for (size_t N = 0; N < Sz; ++N) { in GetOrCreateOffsetCache()
123 size_t Sz = Buffer->getBufferSize(); in getLineNumber() local
124 if (Sz <= std::numeric_limits<uint8_t>::max()) in getLineNumber()
126 else if (Sz <= std::numeric_limits<uint16_t>::max()) in getLineNumber()
128 else if (Sz <= std::numeric_limits<uint32_t>::max()) in getLineNumber()
159 size_t Sz = Buffer->getBufferSize(); in getPointerForLineNumber() local
160 if (Sz <= std::numeric_limits<uint8_t>::max()) in getPointerForLineNumber()
162 else if (Sz <= std::numeric_limits<uint16_t>::max()) in getPointerForLineNumber()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/MC/
H A DConstantPools.h32 ConstantPoolEntry(MCSymbol *L, const MCExpr *Val, unsigned Sz, SMLoc Loc_) in ConstantPoolEntry()
33 : Label(L), Value(Val), Size(Sz), Loc(Loc_) {} in ConstantPoolEntry()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp1008 const unsigned Sz = Order.size(); in fixupOrderingIndices() local
1009 SmallBitVector UnusedIndices(Sz, /*t=*/true); in fixupOrderingIndices()
1010 SmallBitVector MaskedIndices(Sz); in fixupOrderingIndices()
1011 for (unsigned I = 0; I < Sz; ++I) { in fixupOrderingIndices()
1012 if (Order[I] < Sz) in fixupOrderingIndices()
1313 unsigned getMinVF(unsigned Sz) const { in getMinVF()
1314 return std::max(2U, getMinVecRegSize() / Sz); in getMinVF()
4180 unsigned Sz = Mask.size(); in reorderOrder() local
4184 PrevOrder.resize(Sz); in reorderOrder()
4189 Order.assign(Sz, S in reorderOrder()
4345 unsigned Sz = getNumElems(TE.getVectorFactor(), PartSz, I); findReusedOrderedScalars() local
4415 unsigned Sz = Order.size(); isReverseOrder() local
4483 const SCEV *Sz = SE.getConstant(Dist->getType(), Size * (SCEVs.size() - 1)); calculateRtStride() local
4563 const unsigned Sz = VL.size(); canVectorizeLoads() local
4655 unsigned Sz = DL->getTypeSizeInBits(ScalarTy); canVectorizeLoads() local
4945 unsigned Sz = TE.Scalars.size(); getReorderingData() local
4954 unsigned Sz = TE.Scalars.size(); getReorderingData() local
5096 for (unsigned Id = 0, Sz = TE.Scalars.size(); Id < Sz; ++Id) getReorderingData() local
5099 for (unsigned Id = 0, Sz = Phis.size(); Id < Sz; ++Id) getReorderingData() local
5129 int Sz = TE.Scalars.size(); getReorderingData() local
5175 isRepeatedNonIdentityClusteredMask(ArrayRef<int> Mask,unsigned Sz) isRepeatedNonIdentityClusteredMask() argument
5190 const unsigned Sz = TE.Scalars.size(); reorderNodeWithReuses() local
5218 unsigned Sz = Order.size(); combineOrders() local
5396 const unsigned Sz = Order.size(); reorderTopToBottom() local
5722 const unsigned Sz = Order.size(); reorderBottomToTop() local
7631 unsigned Sz = Scalars.size(); buildAltOpShuffleMask() local
7765 for (int I = 0, Sz = ExtMask.size(); I < Sz; ++I) { combineMasks() local
8262 const unsigned Sz = R.DL->getTypeSizeInBits(ScalarTy); getBuildVectorCost() local
8462 __anon07b2d7747a02(unsigned Sz, Value *V) computeExtractCost() argument
8582 for (unsigned Idx = 0, Sz = CommonMask.size(); Idx < Sz; ++Idx) transformMaskAfterShuffle() local
8627 for (unsigned Idx = 0, Sz = CommonMask.size(); Idx < Sz; ++Idx) estimateNodesPermuteCost() local
9114 for (unsigned Idx = 0, Sz = CommonMask.size(); Idx < Sz; ++Idx) add() local
9153 for (unsigned Idx = 0, Sz = CommonMask.size(); Idx < Sz; ++Idx) global() local
9318 const unsigned Sz = UniqueValues.size(); getEntryCost() local
11119 for (int I = 0, Sz = VL.size(); I < Sz; ++I) isGatherShuffledSingleRegisterEntry() local
11240 for (unsigned I = 0, Sz = Entries.size(); I < Sz; ++I) { isGatherShuffledSingleRegisterEntry() local
11338 for (int I = 0, Sz = VL.size(); I < Sz; ++I) isGatherShuffledEntry() local
11846 for (unsigned Idx = 0, Sz = CommonMask.size(); Idx < Sz; ++Idx) transformMaskAfterShuffle() local
11875 for (int I = 0, Sz = Mask.size(); I < Sz; ++I) { adjustExtracts() local
12064 for (unsigned Idx = 0, Sz = CommonMask.size(); Idx < Sz; ++Idx) add() local
12100 for (unsigned Idx = 0, Sz = CommonMask.size(); Idx < Sz; ++Idx) add() local
12118 for (unsigned Idx = 0, Sz = CommonMask.size(); Idx < Sz; ++Idx) add() local
12127 for (unsigned Idx = 0, Sz = CommonMask.size(); Idx < Sz; ++Idx) add() local
12157 for (unsigned Idx = 0, Sz = CommonMask.size(); Idx < Sz; ++Idx) global() local
12176 for (int I = 0, Sz = ExtMask.size(); I < Sz; ++I) { global() local
12478 for (int I = 0, Sz = Mask.size(); I < Sz; ++I) { processBuildVector() local
12582 for (unsigned I = 0, Sz = ExtractMask.size(); I < Sz; ++I) { processBuildVector() local
12589 for (unsigned I = 0, Sz = ExtractMask.size(); I < Sz; ++I) { processBuildVector() local
12703 for (int I = 0, Sz = GatheredScalars.size(); I < Sz; ++I) { processBuildVector() local
15913 const unsigned Sz = R.getVectorElementSize(Chain[0]); vectorizeStoreChain() local
16107 unsigned Sz = 1 + Log2_32(MaxVF) - Log2_32(MinVF); vectorizeStores() local
16154 unsigned Sz = EndIdx >= End ? End : EndIdx; vectorizeStores() local
16478 unsigned Sz = R.getVectorElementSize(I0); tryToVectorizeList() local
16965 int Sz = Data.size(); isGoodForReduction() local
17278 for (unsigned Cnt = 0, Sz = OrigReducedVals.size(); Cnt < Sz; ++Cnt) { tryToReduce() local
17463 for (unsigned Cnt = 0, Sz = ReducedVals.size(); Cnt < Sz; ++Cnt) { tryToReduce() local
17683 unsigned Sz = InstVals.size(); tryToReduce() local
[all...]
H A DLoadStoreVectorizer.cpp717 APInt Sz = C[CEnd].OffsetFromLeader + in splitChainByAlignment() local
720 if (Sz.sgt(VecRegBytes)) in splitChainByAlignment()
723 {CEnd, static_cast<unsigned>(Sz.getLimitedValue())}); in splitChainByAlignment()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGenTypes/
H A DMachineValueType.h257 #define GET_VT_ATTR(Ty, N, Sz, Any, Int, FP, Vec, Sc, NElem, EltTy) EltTy, in getVectorElementType() argument
270 #define GET_VT_ATTR(Ty, N, Sz, Any, Int, FP, Vec, Sc, NElem, EltTy) NElem, in getVectorMinNumElements() argument
299 #define GET_VT_ATTR(Ty, N, Sz, Any, Int, FP, Vec, Sc, NElem, EltTy) \ in getSizeInBits() argument
300 TypeSize(Sz, Sc || Ty == aarch64svcount /* FIXME: Not in the td. */), in getSizeInBits()
/freebsd/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMMachineFunctionInfo.h278 void setPromotedConstpoolIncrease(int Sz) {
279 PromotedGlobalsIncrease = Sz;
273 setPromotedConstpoolIncrease(int Sz) setPromotedConstpoolIncrease() argument
/freebsd/contrib/llvm-project/compiler-rt/lib/profile/
H A DInstrProfilingWriter.c137 uint32_t Sz = in writeOneValueProfData() local
142 SiteCountArray[I] = (uint8_t *)COMPILER_RT_ALLOCA(Sz); in writeOneValueProfData()
143 memset(SiteCountArray[I], 0, Sz); in writeOneValueProfData()
/freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/
H A DSPIRVPreLegalizer.cpp303 unsigned Sz = RegType.getScalarSizeInBits(); in widenScalarLLTNextPow2() local
304 if (Sz == 1) in widenScalarLLTNextPow2()
306 unsigned NewSz = std::min(std::max(1u << Log2_32_Ceil(Sz), 8u), 64u); in widenScalarLLTNextPow2()
307 if (NewSz != Sz) in widenScalarLLTNextPow2()
619 for (unsigned i = 0, Sz = ToProcess.size(); i + 1 < Sz; i += 2) { in insertInlineAsmProcess() local
H A DSPIRVModuleAnalysis.cpp110 for (size_t i = 0, Sz = UseCaps.size(); i < Sz; ++i) { in getSymbolicOperandRequirements() local
112 if (i == Sz - 1 || !AvoidCaps.S.contains(Cap)) in getSymbolicOperandRequirements()
/freebsd/contrib/llvm-project/llvm/utils/TableGen/
H A DDFAPacketizerEmitter.cpp279 size_t Sz = V.size(); in emitForItineraries() local
280 for (unsigned I = 0; I < Sz; ++I) { in emitForItineraries()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DVectorUtils.cpp470 int Sz = Mask.size(); in processShuffleMasks() local
471 unsigned SzDest = Sz / NumOfDestRegs; in processShuffleMasks()
472 unsigned SzSrc = Sz / NumOfSrcRegs; in processShuffleMasks()
480 if (Idx == Sz) in processShuffleMasks()
482 if (Mask[Idx] >= Sz || Mask[Idx] == PoisonMaskElem) in processShuffleMasks()
/freebsd/contrib/llvm-project/clang/lib/AST/Interp/
H A DProgram.cpp65 unsigned Sz = Desc->getAllocSize(); in createGlobalString() local
66 auto *G = new (Allocator, Sz) Global(Ctx.getEvalID(), Desc, /*isStatic=*/true, in createGlobalString()
/freebsd/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/Orc/Shared/
H A DSimplePackedSerialization.h547 size_t Sz = SPSArgList<uint64_t>::size(static_cast<uint64_t>(M.size())); in size() local
549 Sz += SPSArgList<SPSString, SPSValueT>::size(E.first(), E.second); in size()
550 return Sz; in size()
/freebsd/contrib/llvm-project/clang/lib/Analysis/
H A DThreadSafetyCommon.cpp793 unsigned Sz = std::min(ESz, MSz); in mergeEntryMap() local
795 for (unsigned i = 0; i < Sz; ++i) { in mergeEntryMap()
829 unsigned Sz = CurrentLVarMap.size(); in mergeEntryMapBackEdge() local
832 for (unsigned i = 0; i < Sz; ++i) in mergeEntryMapBackEdge()
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DDebugProgramInstruction.h471 if (auto Sz = getFragmentSizeInBits()) in getFragmentOrEntireVariable() local
472 return {*Sz, 0}; in getFragmentOrEntireVariable()
/freebsd/contrib/llvm-project/compiler-rt/lib/fuzzer/
H A DFuzzerCorpus.h338 if(size_t Sz = GetFeature(i)) in PrintFeatureSet()
339 Printf("[%zd: id %zd sz%zd] ", i, SmallestElementPerFeature[i], Sz); in PrintFeatureSet()
337 if(size_t Sz = GetFeature(i)) PrintFeatureSet() local
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DFunctionSpecialization.cpp660 int64_t Sz = *Metrics.NumInsts.getValue(); in run() local
661 assert(Sz > 0 && "CodeSize should be positive"); in run()
663 unsigned FuncSize = static_cast<unsigned>(Sz); in run()
/freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DCallEvent.cpp183 unsigned Idx = 0, Sz = B->size(); in getCalleeStackFrame() local
184 for (; Idx < Sz; ++Idx) in getCalleeStackFrame()
188 assert(Idx < Sz); in getCalleeStackFrame()
/freebsd/contrib/file/tests/
H A Dmatilde.arm.testfile58 …�<:w��`�@��ؠ7k���ᡳd�:�[ @<0UrBd�ɯP ��.=��?� �E;q��<*���c��a)�&�(Sz�1���Q��?u2 <>\��0…
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/
H A DCodeGenTarget.cpp66 #define GET_VT_ATTR(Ty, N, Sz, Any, Int, FP, Vec, Sc, NElem, EltTy) \ in getEnumName() argument
/freebsd/contrib/llvm-project/clang/lib/CodeGen/
H A DCGOpenMPRuntime.cpp3577 llvm::Value *Sz = CGF.EmitScalarExpr(SE); in getPointerAndSize() local
3578 Sz = CGF.EmitScalarConversion( in getPointerAndSize()
3579 Sz, SE->getType(), CGF.getContext().getSizeType(), SE->getExprLoc()); in getPointerAndSize()
3580 SizeVal = CGF.Builder.CreateNUWMul(SizeVal, Sz); in getPointerAndSize()
3810 llvm::Value *Sz = CGF.EmitScalarExpr(IE->getHelper(I).Upper); in emitTaskInit() local
3811 Sz = CGF.Builder.CreateIntCast(Sz, CGF.SizeTy, /*isSigned=*/false); in emitTaskInit()
3813 NumOfElements ? CGF.Builder.CreateNUWMul(NumOfElements, Sz) : Sz; in emitTaskInit()
4265 llvm::Value *Sz = CGF.EmitScalarExpr(IE->getHelper(I).Upper); in emitDependClause() local
4266 Sz = CGF.Builder.CreateIntCast(Sz, CGF.IntPtrTy, /*isSigned=*/false); in emitDependClause()
4267 ClauseIteratorSpace = CGF.Builder.CreateNUWMul(Sz, ClauseIteratorSpace); in emitDependClause()
[all …]
/freebsd/lib/libc/nls/
H A Dhu_HU.ISO8859-2.msg58 26 Sz�veges f�jl foglalt
/freebsd/contrib/llvm-project/llvm/lib/IR/
H A DInstructions.cpp1949 int Sz = Mask.size(); in isTransposeMask() local
1950 if (Sz < 2 || !isPowerOf2_32(Sz)) in isTransposeMask()
1964 for (int I = 2; I < Sz; ++I) { in isTransposeMask()
2256 for (unsigned K = 0, Sz = Mask.size(); K < Sz; K += VF) { in isOneUseSingleSourceMask() local

12