HomeSort by relevance Sort by last modified time
    Searched defs:Size (Results 201 - 225 of 467) sorted by null

1 2 3 4 5 6 7 891011>>

  /external/llvm/lib/Target/Mips/
MipsSEISelDAGToDAG.cpp 365 unsigned Size = CN->getValueSizeInBits(0);
367 if (Size == 32)
374 AnalyzeImm.Analyze(Imm, Size, false);
  /external/llvm/lib/Target/R600/
AMDGPUISelLowering.cpp 203 uint64_t Size = TD->getTypeAllocSize(GV->getType()->getElementType());
206 MFI->LDSSize += Size;
SIInsertWaits.cpp 143 unsigned Size = TRI->getMinimalPhysRegClass(Reg)->getSize();
144 Result.Named.LGKM = Size > 4 ? 2 : 1;
188 unsigned Size = TRI->getMinimalPhysRegClass(Reg)->getSize();
190 assert(Size >= 4);
194 Result.second = Result.first + Size / 4;
  /external/llvm/lib/Target/SystemZ/
SystemZLongBranch.cpp 79 // The size of the block in bytes, excluding terminators.
81 uint64_t Size;
91 : Address(0), Size(0), Alignment(0), NumTerminators(0) {}
103 // The current size of the terminator in bytes.
104 uint64_t Size;
114 TerminatorInfo() : Branch(0), Size(0), TargetBlock(0), ExtraRelaxSize(0) {}
193 Position.Address += Block.Size;
203 Position.Address += Terminator.Size;
211 Terminator.Size = TII->getInstSizeInBytes(MI);
251 // that no branches need relaxation. Return the size of the function unde
    [all...]
  /external/llvm/lib/Target/X86/MCTargetDesc/
X86AsmBackend.cpp 96 unsigned Size = 1 << getFixupKindLog2Size(Fixup.getKind());
98 assert(Fixup.getOffset() + Size <= DataSize &&
105 assert(isIntN(Size * 8 + 1, Value) &&
108 for (unsigned i = 0; i != Size; ++i)
  /external/llvm/lib/Transforms/Utils/
LowerSwitch.cpp 122 unsigned Size = End - Begin;
124 if (Size == 1)
127 unsigned Mid = Size / 2;
292 DEBUG(dbgs() << "Clusterify finished. Total clusters: " << Cases.size()
  /external/llvm/tools/llvm-nm/
llvm-nm.cpp 106 cl::opt<bool> PrintSize("print-size",
107 cl::desc("Show symbol size instead of address"));
108 cl::alias PrintSizeS("S", cl::desc("Alias for --print-size"),
111 cl::opt<bool> SizeSort("size-sort", cl::desc("Sort symbols by size"));
146 uint64_t Size;
156 else if (a.Address == b.Address && a.Name == b.Name && a.Size < b.Size)
164 if (a.Size < b.Size)
    [all...]
  /external/llvm/tools/llvm-readobj/
MachODumper.cpp 146 uint64_t Size;
171 Section.Size = Sect.Size;
183 Section.Size = Sect.Size;
251 W.printHex ("Size", Section.Size);
365 W.printString("Symbol", SymbolName.size() > 0 ? SymbolName : "-");
378 << " " << (SymbolName.size() > 0 ? SymbolName : "-")
  /external/llvm/tools/llvm-symbolizer/
LLVMSymbolize.cpp 67 // Getting symbol size is linear for Mach-O files, so assume that symbol
78 if (Module->isMachO() && SymbolName.size() > 0 && SymbolName[0] == '_')
81 // with same address size. Make sure we choose the correct one.
90 uint64_t &Size) const {
99 if (it->first.Size != 0 && it->first.Addr + it->first.Size <= Address)
103 Size = it->first.Size;
117 uint64_t Start, Size;
119 FunctionName, Start, Size)) {
    [all...]
  /external/llvm/utils/TableGen/
DAGISelMatcherEmitter.cpp 28 // To reduce generated source code size.
68 Entry = NodePredicates.size();
77 Entry = PatternPredicates.size();
85 Entry = ComplexPatterns.size();
94 Entry = NodeXForms.size();
164 // string while we get the size. Unfortunately, the offset of the
165 // children depends on the VBR size of the child, so for large children we
285 // For each case we emit the size, then the opcode, then the matcher.
291 IdxSize = 2; // size of opcode in table is 2 bytes.
294 IdxSize = 1; // size of type in table is 1 byte
    [all...]
  /external/lzma/C/
Ppmd7.h 49 UInt32 Size;
63 Bool Ppmd7_Alloc(CPpmd7 *p, UInt32 size, ISzAlloc *alloc);
103 void (*Decode)(void *p, UInt32 start, UInt32 size);
  /external/lzma/CPP/Common/
MyVector.h 25 int Size() const { return _size; }
48 int size = v.Size(); local
49 Reserve(Size() + size);
50 for (int i = 0; i < size; i++)
99 int left = 0, right = Size();
116 int left = 0, right = Size();
132 static void SortRefDown(T* p, int k, int size, int (*compare)(const T*, const T*, void *), void *param)
138 if (s > size)
152 int size = _size; local
193 int size = v.Size(); local
    [all...]
  /external/lzma/CPP/Windows/
FileFind.h 32 UInt64 Size;
  /external/opencv/cvaux/src/
cvface.cpp 144 long Size = Rect.width*Rect.height;
146 if ( (Size > SizeIdeal) || ( Size < (SizeIdeal/5) ) )
  /external/openfst/src/include/fst/
bi-table.h 54 // I Size() const;
77 table.entry2id_.size(),
92 id_ref = id2entry_.size();
104 I Size() const { return id2entry_.size(); }
160 keys_(table.keys_.size(), compact_hash_func_, compact_hash_equal_),
175 I key = id2entry_.size();
189 I Size() const { return id2entry_.size(); }
193 if (n < 0 || n > id2entry_.size())
    [all...]
interval-set.h 86 T Size() const { return intervals_.size(); }
125 return intervals_.size() == 1 &&
178 T size = 0; local
179 for (T i = 0; i < intervals_.size(); ++i) {
183 for (T j = i + 1; j < intervals_.size(); ++j) {
192 intervals_[size++] = inti;
194 intervals_.resize(size);
sparse-tuple-weight.h 179 size_t Size() const {
183 return rest_.size() + 1;
333 if(FLAGS_fst_weight_separator.size() != 1) {
334 FSTERROR() << "FLAGS_fst_weight_separator.size() is not equal to 1";
341 if (FLAGS_fst_weight_parentheses.size() != 2) {
342 FSTERROR() << "FLAGS_fst_weight_parentheses.size() is not equal to 2";
355 size_t n = w.Size();
374 if(FLAGS_fst_weight_separator.size() != 1) {
375 FSTERROR() << "FLAGS_fst_weight_separator.size() is not equal to 1";
382 if (FLAGS_fst_weight_parentheses.size() != 2)
    [all...]
string-weight.h 142 size_t Size() const { return first_ ? rest_.size() + 1 : 0; }
236 int32 size; local
237 ReadType(strm, &size);
238 for (int i = 0; i < size; ++i) {
248 int32 size = Size(); local
249 WriteType(strm, size);
259 if (Size() != 1)
298 if (w1.Size() != w2.Size()
    [all...]
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
string-weight.h 134 Label Size() const { return first_ ? rest_.size() + 1 : 0; }
228 int32 size = 0; local
229 ReadType(strm, &size);
230 for (int i = 0; i < size; ++i) {
240 int32 size = Size(); local
241 WriteType(strm, size);
251 if (Size() != 1)
290 if (w1.Size() != w2.Size()
    [all...]
  /frameworks/av/libvideoeditor/vss/common/inc/
LVM_Types.h 48 #define LVM_MAXINT_8 127 /* Maximum positive integer size */
150 LVM_UINT32 Size; /* Region size in bytes */
  /frameworks/av/media/libeffects/lvm/lib/SpectrumAnalyzer/lib/
LVPSA.h 75 LVM_UINT16 MaxInputBlockSize; /* Maximum expected input block size (in samples) */
92 LVM_UINT32 Size; /* Region size in bytes */
  /frameworks/av/media/libeffects/lvm/lib/StereoWidening/lib/
LVCS.h 133 LVCS_TOOMANYSAMPLES = 3, /* Maximum block size exceeded */
185 LVM_UINT32 Size; /* Region size in bytes */
215 LVM_UINT16 MaxBlockSize; /* Maximum block size in sample pairs */
372 /* LVCS_TooManySamples NumSamples was larger than the maximum block size */
  /frameworks/base/media/mca/filterfw/native/core/
gl_frame.cpp 166 bool GLFrame::CopyDataTo(uint8_t* buffer, int size) {
167 return (size >= Size())
184 return (data_size == Size()) ? UploadTexturePixels(data) : false;
214 int GLFrame::Size() const {
  /art/compiler/utils/
assembler.h 158 CHECK_LE(position, Size() - static_cast<int>(sizeof(T)));
163 CHECK_LE(position, Size() - static_cast<int>(sizeof(T)));
170 fixup->set_position(Size());
195 // Get the size of the emitted code.
196 size_t Size() const {
224 // size before we start emitting to the buffer. This allows us to
226 // limit implied by the minimum gap size.
250 int ComputeGap() { return buffer_->Capacity() - buffer_->Size(); }
319 // Size of generated code
320 size_t CodeSize() const { return buffer_.Size(); }
    [all...]
  /external/chromium/third_party/libjingle/source/talk/p2p/base/
stun.cc 51 ASSERT(transaction_id_.size() == 16);
56 for (unsigned i = 0; i < attrs_->size(); i++)
62 ASSERT(str.size() == 16);
137 for (unsigned i = 0; i < attrs_->size(); i++) {
160 ASSERT(transaction_id.size() == 16);
198 for (unsigned i = 0; i < attrs_->size(); i++) {
219 if (length != StunAddressAttribute::SIZE)
227 if (length != StunUInt32Attribute::SIZE)
323 : StunAttribute(type, SIZE), family_(0), port_(0), ip_(0) {
347 : StunAttribute(type, SIZE), bits_(0)
    [all...]

Completed in 574 milliseconds

1 2 3 4 5 6 7 891011>>