| /external/compiler-rt/lib/tsan/rtl/ |
| H A D | tsan_ignoreset.h | 29 u32 At(uptr i) const;
|
| H A D | tsan_ignoreset.cc | 41 u32 IgnoreSet::At(uptr i) const { function in class:__tsan::IgnoreSet
|
| /external/v8/test/unittests/interpreter/ |
| H A D | constant-array-builder-unittest.cc | 38 CHECK_EQ(Handle<Smi>::cast(builder.At(i))->value(), i);
55 CHECK(builder.At(i)->SameValue(*object));
59 CHECK(builder.At(i + reserved)->SameValue(*object));
66 Handle<Object> empty = builder.At(k8BitCapacity - reserved + i);
84 CHECK(Handle<Smi>::cast(builder.At(i))->SameValue(smi));
88 CHECK(Handle<Smi>::cast(builder.At(i))->SameValue(smi));
92 CHECK(builder.At(index)->IsTheHole(isolate()));
105 CHECK(builder.At(static_cast<int>(index))->SameValue(*object));
117 CHECK(builder.At(i)->SameValue(*object));
153 CHECK(builder.At(
[all...] |
| /external/ceres-solver/internal/ceres/ |
| H A D | cxsparse.cc | 168 cs_di At; local
169 At.m = A->num_cols();
170 At.n = A->num_rows();
171 At.nz = -1;
172 At.nzmax = A->num_nonzeros();
173 At.p = A->mutable_rows();
174 At.i = A->mutable_cols();
175 At.x = A->mutable_values();
176 return At;
|
| /external/pdfium/xfa/src/fxbarcode/common/ |
| H A D | BC_CommonByteArray.h | 20 int32_t At(int32_t index);
|
| /external/pdfium/xfa/src/fxbarcode/qrcode/ |
| H A D | BC_QRCoderBitVector.h | 20 int32_t At(int32_t index, int32_t& e);
|
| H A D | BC_QRCoderBitVector.cpp | 48 int32_t CBC_QRCoderBitVector::At(int32_t index, int32_t& e) {
function in class:CBC_QRCoderBitVector
100 int32_t num = bits->At(i, e);
|
| H A D | BC_QRCoder.h | 40 int32_t At(int32_t x, int32_t y, int32_t& e);
|
| /external/webrtc/webrtc/system_wrappers/include/ |
| H A D | aligned_array.h | 60 T& At(size_t row, size_t col) { function in class:webrtc::AlignedArray
65 const T& At(size_t row, size_t col) const { function in class:webrtc::AlignedArray
|
| /external/webrtc/webrtc/system_wrappers/source/ |
| H A D | aligned_array_unittest.cc | 41 arr.At(i, j) = 20 * i + j;
47 ASSERT_EQ(arr.At(i, j), 20 * i + j);
|
| /external/eigen/Eigen/src/MetisSupport/ |
| H A D | MetisSupport.h | 34 MatrixType At = A.transpose(); local
35 // Get the number of nonzeros elements in each row/col of At+A
41 // Compute the union structure of of A(j,:) and At(j,:)
53 //Get the nonzeros in row/column j of At
54 for (typename MatrixType::InnerIterator it(At, j); it; ++it)
64 // Reserve place for A + At
76 // Add the pattern of row/column j of A to A+At
87 //Add the pattern of row/column j of At to A+At
88 for (typename MatrixType::InnerIterator it(At,
[all...] |
| /external/clang/include/clang/AST/ |
| H A D | Attr.h | 155 const Attr *At) {
156 DB.AddTaggedVal(reinterpret_cast<intptr_t>(At),
162 const Attr *At) {
163 PD.AddTaggedVal(reinterpret_cast<intptr_t>(At),
154 operator <<(const DiagnosticBuilder &DB, const Attr *At) argument
161 operator <<(const PartialDiagnostic &PD, const Attr *At) argument
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
| H A D | ANTLRCommonTreeAdaptor.h | 52 - (id<ANTLRTree>)getChild:(id<ANTLRTree>)t At:(NSInteger)i;
53 - (void) setChild:(id<ANTLRTree>)t At:(NSInteger)i Child:(id<ANTLRTree>)child;
|
| H A D | ANTLRBaseTreeAdaptor.h | 135 - (id<ANTLRTree>) getChild:(id<ANTLRTree>)aTree At:(NSInteger)i;
137 - (void) setChild:(id<ANTLRTree>)aTree At:(NSInteger)index Child:(id<ANTLRTree>)aChild;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
| H A D | ANTLRCommonTreeAdaptor.h | 52 - (id<ANTLRTree>)getChild:(id<ANTLRTree>)t At:(NSInteger)i;
53 - (void) setChild:(id<ANTLRTree>)t At:(NSInteger)i Child:(id<ANTLRTree>)child;
|
| H A D | ANTLRBaseTreeAdaptor.h | 135 - (id<ANTLRTree>) getChild:(id<ANTLRTree>)aTree At:(NSInteger)i;
137 - (void) setChild:(id<ANTLRTree>)aTree At:(NSInteger)index Child:(id<ANTLRTree>)aChild;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
| H A D | ANTLRCommonTreeAdaptor.h | 52 - (id<ANTLRTree>)getChild:(id<ANTLRTree>)t At:(NSInteger)i;
53 - (void) setChild:(id<ANTLRTree>)t At:(NSInteger)i Child:(id<ANTLRTree>)child;
|
| H A D | ANTLRBaseTreeAdaptor.h | 135 - (id<ANTLRTree>) getChild:(id<ANTLRTree>)aTree At:(NSInteger)i;
137 - (void) setChild:(id<ANTLRTree>)aTree At:(NSInteger)index Child:(id<ANTLRTree>)aChild;
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| H A D | ANTLRCommonTreeAdaptor.h | 55 - (ANTLRCommonTree *)getChild:(ANTLRCommonTree *)t At:(NSInteger)i;
56 - (void) setChild:(ANTLRCommonTree *)t At:(NSInteger)i Child:(ANTLRCommonTree *)child;
|
| H A D | ANTLRTreeAdaptor.h | 131 - (id) getChild:(id)aNode At:(NSInteger) i;
133 - (void) setChild:(id)aTree At:(NSInteger)index Child:(id)child;
|
| H A D | ANTLRBaseTreeAdaptor.h | 128 - (id<ANTLRBaseTree>) getChild:(id<ANTLRBaseTree>)aTree At:(NSInteger)i;
130 - (void) setChild:(id<ANTLRBaseTree>)aTree At:(NSInteger)index Child:(id<ANTLRBaseTree>)aChild;
|
| /external/v8/src/interpreter/ |
| H A D | constant-array-builder.h | 42 Handle<Object> At(size_t index) const;
74 Handle<Object> At(size_t index) const;
|
| H A D | constant-array-builder.cc | 42 Handle<Object> ConstantArrayBuilder::ConstantArraySlice::At( function in class:v8::internal::interpreter::ConstantArrayBuilder::ConstantArraySlice
87 Handle<Object> ConstantArrayBuilder::At(size_t index) const { function in class:v8::internal::interpreter::ConstantArrayBuilder
90 return slice->At(index);
109 fixed_array->set(array_index++, *slice->At(slice->start_index() + i));
|
| /external/llvm/lib/Target/Hexagon/ |
| H A D | HexagonGenMux.cpp | 68 MachineBasicBlock::iterator At; member in struct:__anon12612::HexagonGenMux::MuxInfo
75 : At(It), DefR(DR), PredR(PR), SrcT(TOp), SrcF(FOp), Def1(D1),
284 MachineBasicBlock::iterator At = CanDown ? Def2 : Def1; local
285 ML.push_back(MuxInfo(At, DR, PR, SrcT, SrcF, Def1, Def2));
290 MachineBasicBlock &B = *MX.At->getParent();
291 DebugLoc DL = MX.At->getDebugLoc();
295 BuildMI(B, MX.At, DL, HII->get(MxOpc), MX.DefR)
|
| /external/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolutionExpander.h | 121 /// At is an optional parameter which specifies point in code where user is
125 const Instruction *At = nullptr) {
127 return isHighCostExpansionHelper(Expr, L, At, Processed);
217 /// \brief Try to find LLVM IR value for S available at the point At.
221 /// At. Return nullptr if value was not found.
225 Value *findExistingExpansion(const SCEV *S, const Instruction *At, Loop *L);
232 const Instruction *At,
|