|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
include/llvm/Support/Automaton.h 96 unsigned NumHeads = Heads.size();
lib/CodeGen/MachinePipeliner.cpp 2840 for (unsigned i = 0, e = cycleInstrs.size(); i < e; ++i) {
2846 for (unsigned i = 0, e = cycleInstrs.size(); i < e; ++i) {
lib/Target/Mips/MipsISelLowering.cpp 2933 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
2941 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i)
tools/clang/lib/StaticAnalyzer/Frontend/AnalysisConsumer.cpp 625 const unsigned LocalTUDeclsSize = LocalTUDecls.size();
tools/clang/tools/extra/clangd/ClangdLSPServer.cpp 208 for (size_t Index = 0; Index < ReplyCallbacks.size(); ++Index) {
270 if (ReplyCallbacks.size() > MaxReplayCallbacks) {
tools/clang/tools/extra/clangd/Selection.cpp 171 if (UnclaimedTokens || V.Nodes.size() == 1) {
tools/lldb/source/Target/StackFrameRecognizer.cpp 56 m_recognizers.push_front({(uint32_t)m_recognizers.size(), false, recognizer, false, module, RegularExpressionSP(),
64 m_recognizers.push_front({(uint32_t)m_recognizers.size(), false, recognizer, true, ConstString(), module,
83 if (recognizer_id >= m_recognizers.size()) return false;
usr/include/c++/7.4.0/bits/deque.tcc 114 const size_type __len = size();
238 if (static_cast<size_type>(__index) < (size() >> 1))
269 if (static_cast<size_type>(__elems_before) <= (size() - __n) / 2)
643 if (static_cast<size_type>(__index) < size() / 2)
675 const size_type __length = this->size();
763 const size_type __length = size();
870 if (this->max_size() - this->size() < __new_elems)
895 if (this->max_size() - this->size() < __new_elems)
usr/include/c++/7.4.0/bits/stl_deque.h 949 __x.size())
1292 const size_type __len = size();
1314 const size_type __len = size();
1402 if (__n >= this->size())
1406 __n, this->size());
1943 if (__len > size())
1946 std::advance(__mid, size());
1960 if (__n > size())
1963 _M_fill_insert(end(), __n - size(), __val);
2260 { return __x.size() == __y.size()
2260 { return __x.size() == __y.size()
usr/include/c++/7.4.0/bits/stl_stack.h 191 { return c.size(); }
utils/TableGen/AsmWriterEmitter.cpp 502 SmallVector<std::string, 4> AsmNames(Registers.size());
544 for (unsigned i = 0, e = Registers.size(); i != e; ++i) {
570 O << " assert(RegNo && RegNo < " << (Registers.size()+1)
utils/TableGen/CodeGenRegisters.cpp 1213 SubRegIndices.emplace_back(Name, Namespace, SubRegIndices.size() + 1);
1221 SubRegIndices.emplace_back(Def, SubRegIndices.size() + 1);
1230 Registers.emplace_back(Def, Registers.size() + 1);
1589 assert(Registers.size() == Registers.back().EnumValue &&
1593 IntEqClasses UberSetIDs(Registers.size()+1);
1767 std::vector<UberRegSet*> RegSets(Registers.size());
2422 BitVector BV(Registers.size() + 1);
utils/TableGen/DFAPacketizerEmitter.cpp 474 size_t Sz = V.size();
utils/TableGen/GlobalISelEmitter.cpp 1010 return Predicates.size();
utils/TableGen/RegisterInfoEmitter.cpp 107 assert(Registers.size() <= 0xffff && "Too many regs to fit in tables");
128 assert(Registers.size() == Registers.back().EnumValue &&
130 OS << " NUM_TARGET_REGS \t// " << Registers.size()+1 << "\n";
815 for (size_t i = 0, e = SubRegIndices.size(); i != e; ++i) {
828 " --IdxA; assert(IdxA < " << SubRegIndices.size()
845 " --IdxA; assert(IdxA < " << SubRegIndices.size()
879 SmallVector<DiffVec, 4> SubRegLists(Regs.size());
880 SmallVector<DiffVec, 4> SuperRegLists(Regs.size());
881 SmallVector<DiffVec, 4> RegUnitLists(Regs.size());
882 SmallVector<unsigned, 4> RegUnitInitScale(Regs.size());
886 SmallVector<MaskVec, 4> RegUnitLaneMasks(Regs.size());
892 SmallVector<SubRegIdxVec, 4> SubRegIdxLists(Regs.size());
1112 << Regs.size() + 1 << ", RA, PC, " << TargetName << "MCRegisterClasses, "
1515 << " InitMCRegisterInfo(" << TargetName << "RegDesc, " << Regs.size() + 1