Searched refs:Base (Results 201 - 225 of 943) sorted by last modified time

1234567891011>>

/external/mesa3d/src/mesa/main/
H A Dtexstate.c159 * \param texBaseFormat Base format of the texture associated with the
506 vprog = &ctx->VertexProgram.Current->Base;
515 fprog = &ctx->FragmentProgram.Current->Base;
/external/llvm/unittests/Support/
H A DCasting.cpp184 // for example, Derived inherits from Base, and we do `isa<Base>(Derived)`.
189 class Base { class in namespace:__anon26527::inferred_upcasting
192 Base() {} function in class:__anon26527::inferred_upcasting::Base
195 class Derived : public Base {
200 // Even with no explicit classof() in Base, we should still be able to cast
204 EXPECT_TRUE(isa<Base>(D));
205 Base *BP = dyn_cast<Base>(&D);
H A DCommandLineTest.cpp47 typedef cl::opt<T> Base; typedef in class:__anon26528::StackOption
51 explicit StackOption(const M0t &M0) : Base(M0) {}
55 StackOption(const M0t &M0, const M1t &M1) : Base(M0, M1) {}
59 StackOption(const M0t &M0, const M1t &M1, const M2t &M2) : Base(M0, M1, M2) {}
64 : Base(M0, M1, M2, M3) {}
/external/llvm/utils/TableGen/
H A DFixedLenDecoderEmitter.cpp39 unsigned Base, Width, Offset; member in struct:__anon26592::EncodingField
41 : Base(B), Width(W), Offset(O) { }
51 void addField(unsigned Base, unsigned Width, unsigned Offset) { argument
52 Fields.push_back(EncodingField(Base, Width, Offset));
1072 << "(insn, " << OI->Base << ", " << OI->Width
1079 << "(insn, " << OI->Base << ", " << OI->Width
1946 unsigned Base = ~0U;
1959 if (Base != ~0U) {
1960 OpInfo.addField(Base, Width, Offset);
1961 Base
[all...]
/external/llvm/utils/unittest/googletest/include/gtest/internal/
H A Dgtest-port.h1033 // Downcasts the pointer of type Base to Derived.
1034 // Derived must be a subclass of Base. The parameter MUST
1038 template <class Derived, class Base>
1039 Derived* CheckedDowncastToActualType(Base* base) {
/external/lzma/C/
H A DPpmd7.c22 #define REF(ptr) ((UInt32)((Byte *)(ptr) - (p)->Base))
55 #define NODE(offs) ((CPpmd7_Node *)(p->Base + (offs)))
62 p->Base = 0;
91 alloc->Free(alloc, p->Base);
93 p->Base = 0;
98 if (p->Base == 0 || p->Size != size)
107 if ((p->Base = (Byte *)alloc->Alloc(alloc, p->AlignOffset + size
290 p->Text = p->Base + p->AlignOffset;
H A DPpmd7.h51 Byte *Base, *LoUnit, *HiUnit, *Text, *UnitsStart; member in struct:__anon26722
66 #define Ppmd7_WasAllocated(p) ((p)->Base != NULL)
78 #define Ppmd7_GetPtr(p, offs) ((void *)((p)->Base + (offs)))
/external/lzma/CS/7zip/Compress/LZMA/
H A DLzmaBase.cs5 internal abstract class Base class in namespace:SevenZip.Compression.LZMA
H A DLzmaDecoder.cs15 BitTreeDecoder[] m_LowCoder = new BitTreeDecoder[Base.kNumPosStatesMax];
16 BitTreeDecoder[] m_MidCoder = new BitTreeDecoder[Base.kNumPosStatesMax];
17 BitTreeDecoder m_HighCoder = new BitTreeDecoder(Base.kNumHighLenBits);
24 m_LowCoder[posState] = new BitTreeDecoder(Base.kNumLowLenBits);
25 m_MidCoder[posState] = new BitTreeDecoder(Base.kNumMidLenBits);
48 uint symbol = Base.kNumLowLenSymbols;
53 symbol += Base.kNumMidLenSymbols;
138 BitDecoder[] m_IsMatchDecoders = new BitDecoder[Base.kNumStates << Base.kNumPosStatesBitsMax];
139 BitDecoder[] m_IsRepDecoders = new BitDecoder[Base
[all...]
H A DLzmaEncoder.cs53 Base.State _state = new Base.State();
55 UInt32[] _repDistances = new UInt32[Base.kNumRepDistances];
61 for (UInt32 i = 0; i < Base.kNumRepDistances; i++)
171 RangeCoder.BitTreeEncoder[] _lowCoder = new RangeCoder.BitTreeEncoder[Base.kNumPosStatesEncodingMax];
172 RangeCoder.BitTreeEncoder[] _midCoder = new RangeCoder.BitTreeEncoder[Base.kNumPosStatesEncodingMax];
173 RangeCoder.BitTreeEncoder _highCoder = new RangeCoder.BitTreeEncoder(Base.kNumHighLenBits);
177 for (UInt32 posState = 0; posState < Base.kNumPosStatesEncodingMax; posState++)
179 _lowCoder[posState] = new RangeCoder.BitTreeEncoder(Base.kNumLowLenBits);
180 _midCoder[posState] = new RangeCoder.BitTreeEncoder(Base
[all...]
/external/lzma/Java/SevenZip/Compression/LZMA/
H A DBase.java0 // Base.java
5 public class Base class
H A DDecoder.java4 import SevenZip.Compression.LZMA.Base;
13 BitTreeDecoder[] m_LowCoder = new BitTreeDecoder[Base.kNumPosStatesMax];
14 BitTreeDecoder[] m_MidCoder = new BitTreeDecoder[Base.kNumPosStatesMax];
15 BitTreeDecoder m_HighCoder = new BitTreeDecoder(Base.kNumHighLenBits);
22 m_LowCoder[m_NumPosStates] = new BitTreeDecoder(Base.kNumLowLenBits);
23 m_MidCoder[m_NumPosStates] = new BitTreeDecoder(Base.kNumMidLenBits);
42 int symbol = Base.kNumLowLenSymbols;
46 symbol += Base.kNumMidLenSymbols + m_HighCoder.Decode(rangeDecoder);
126 short[] m_IsMatchDecoders = new short[Base.kNumStates << Base
[all...]
H A DEncoder.java4 import SevenZip.Compression.LZMA.Base;
53 int _state = Base.StateInit();
55 int[] _repDistances = new int[Base.kNumRepDistances];
59 _state = Base.StateInit();
61 for (int i = 0; i < Base.kNumRepDistances; i++)
170 BitTreeEncoder[] _lowCoder = new BitTreeEncoder[Base.kNumPosStatesEncodingMax];
171 BitTreeEncoder[] _midCoder = new BitTreeEncoder[Base.kNumPosStatesEncodingMax];
172 BitTreeEncoder _highCoder = new BitTreeEncoder(Base.kNumHighLenBits);
177 for (int posState = 0; posState < Base.kNumPosStatesEncodingMax; posState++)
179 _lowCoder[posState] = new BitTreeEncoder(Base
[all...]
/external/llvm/unittests/ExecutionEngine/JIT/
H A DJITTest.cpp79 const std::unique_ptr<JITMemoryManager> Base; member in class:__anon26479::RecordingJITMemoryManager
83 : Base(JITMemoryManager::CreateDefaultMemManager()) {
88 return Base->getPointerToNamedFunction(Name, AbortOnFailure);
91 virtual void setMemoryWritable() { Base->setMemoryWritable(); }
92 virtual void setMemoryExecutable() { Base->setMemoryExecutable(); }
93 virtual void setPoisonMemory(bool poison) { Base->setPoisonMemory(poison); }
94 virtual void AllocateGOT() { Base->AllocateGOT(); }
95 virtual uint8_t *getGOTBase() const { return Base->getGOTBase(); }
111 uint8_t *Result = Base->startFunctionBody(F, ActualSize);
120 return Base
[all...]
/external/llvm/examples/OCaml-Kaleidoscope/Chapter2/
H A Dast.ml5 (* expr - Base type for all expression nodes. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter3/
H A Dast.ml5 (* expr - Base type for all expression nodes. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter4/
H A Dast.ml5 (* expr - Base type for all expression nodes. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter5/
H A Dast.ml5 (* expr - Base type for all expression nodes. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter6/
H A Dast.ml5 (* expr - Base type for all expression nodes. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter7/
H A Dast.ml5 (* expr - Base type for all expression nodes. *)
/external/llvm/include/llvm/Analysis/
H A DPtrUseVisitor.h196 typedef InstVisitor<DerivedT> Base; typedef in class:llvm::PtrUseVisitor
267 return Base::visitIntrinsicInst(II);
279 Base::visitCallSite(CS);
H A DValueTracking.h88 /// ComputeMultiple - This function computes the integer multiple of Base that
93 bool ComputeMultiple(Value *V, unsigned Base, Value *&Multiple,
/external/llvm/include/llvm/CodeGen/
H A DSelectionDAG.h802 SDValue getIndexedLoad(SDValue OrigLoad, SDLoc dl, SDValue Base,
831 SDValue getIndexedStore(SDValue OrigStoe, SDLoc dl, SDValue Base,
1153 /// location that is 'Dist' units away from the location that the 'Base' load
1155 bool isConsecutiveLoad(LoadSDNode *LD, LoadSDNode *Base,
/external/llvm/include/llvm/IR/
H A DCallSite.h334 CallInst, InvokeInst, User::op_iterator> Base; typedef in class:llvm::CallSite
337 CallSite(Base B) : Base(B) {}
338 CallSite(Value* V) : Base(V) {}
339 CallSite(CallInst *CI) : Base(CI) {}
340 CallSite(InvokeInst *II) : Base(II) {}
341 CallSite(Instruction *II) : Base(II) {}
355 typedef CallSiteBase<> Base; typedef in class:llvm::ImmutableCallSite
357 ImmutableCallSite(const Value* V) : Base(V) {}
358 ImmutableCallSite(const CallInst *CI) : Base(C
[all...]
H A DDominators.h68 typedef DominatorTreeBase<BasicBlock> Base; typedef in class:llvm::DominatorTree
81 if (Base::compare(Other))
88 using Base::dominates;
101 using Base::isReachableFromEntry;

Completed in 439 milliseconds

1234567891011>>