HomeSort by relevance Sort by last modified time
    Searched defs:At (Results 1 - 25 of 35) sorted by null

1 2

  /external/compiler-rt/lib/tsan/rtl/
tsan_ignoreset.cc 41 u32 IgnoreSet::At(uptr i) const {
  /art/runtime/base/
array_slice.h 6 * You may obtain a copy of the License at
81 array_ = &array->At(start_offset, element_size_, alignment);
85 T& At(size_t index) {
90 const T& At(size_t index) const {
96 return At(index);
100 return At(index);
length_prefixed_array.h 6 * You may obtain a copy of the License at
36 T& At(size_t index, size_t element_size = sizeof(T), size_t alignment = alignof(T)) {
41 const T& At(size_t index, size_t element_size = sizeof(T), size_t alignment = alignof(T)) const {
  /external/eigen/Eigen/src/MetisSupport/
MetisSupport.h 8 // with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
34 MatrixType At = A.transpose();
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
    [all...]
  /external/pdfium/xfa/src/fxbarcode/common/
BC_CommonByteArray.cpp 12 * You may obtain a copy of the License at
52 int32_t CBC_CommonByteArray::At(int32_t index) {
  /external/webrtc/webrtc/system_wrappers/include/
aligned_array.h 60 T& At(size_t row, size_t col) {
65 const T& At(size_t row, size_t col) const {
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/algorithm/string/detail/
sequence.hpp 6 // (See accompanying file LICENSE_1_0.txt or copy at
31 BOOST_STRING_TYPENAME InputT::iterator At,
35 Input.insert( At, Begin, End );
41 BOOST_STRING_TYPENAME InputT::iterator At,
44 ::boost::algorithm::detail::insert( Input, At, ::boost::begin(Insert), ::boost::end(Insert) );
113 BOOST_STRING_TYPENAME InputT::iterator At=Input.erase( From, To );
118 Input.insert( At, Begin, End );
  /external/pdfium/xfa/src/fxbarcode/qrcode/
BC_QRCoder.cpp 12 * You may obtain a copy of the License at
85 int32_t CBC_QRCoder::At(int32_t x, int32_t y, int32_t& e) {
BC_QRCoderBitVector.cpp 12 * You may obtain a copy of the License at
48 int32_t CBC_QRCoderBitVector::At(int32_t index, int32_t& e) {
100 int32_t num = bits->At(i, e);
  /external/v8/src/interpreter/
constant-array-builder.cc 46 Handle<Object> ConstantArrayBuilder::ConstantArraySlice::At(
78 Handle<Object> ConstantArrayBuilder::At(size_t index) const {
80 return idx16_slice_.At(index);
82 return idx8_slice_.At(index);
93 fixed_array->set(i, *At(static_cast<size_t>(i)));
  /art/compiler/utils/mips64/
constants_mips64.h 6 * You may obtain a copy of the License at
76 // Use the At(pc) function to create references to Instr.
77 static Instr* At(uintptr_t pc) { return reinterpret_cast<Instr*>(pc); }
  /external/ceres-solver/internal/ceres/
cxsparse.cc 168 cs_di At;
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;
  /art/compiler/utils/mips/
constants_mips.h 6 * You may obtain a copy of the License at
100 // Use the At(pc) function to create references to Instr.
101 static Instr* At(uintptr_t pc) { return reinterpret_cast<Instr*>(pc); }
  /art/compiler/utils/x86_64/
constants_x86_64.h 6 * You may obtain a copy of the License at
126 // Use the At(pc) function to create references to Instr.
127 static Instr* At(uintptr_t pc) { return reinterpret_cast<Instr*>(pc); }
  /art/compiler/utils/x86/
constants_x86.h 6 * You may obtain a copy of the License at
117 // Use the At(pc) function to create references to Instr.
118 static Instr* At(uintptr_t pc) { return reinterpret_cast<Instr*>(pc); }
  /external/llvm/include/llvm/MC/MCParser/
MCAsmLexer.h 52 Greater, GreaterEqual, GreaterGreater, At
172 /// Look ahead at the next token to be lexed.
  /external/llvm/lib/Target/Hexagon/
HexagonGenMux.cpp 68 MachineBasicBlock::iterator At;
75 : At(It), DefR(DR), PredR(PR), SrcT(TOp), SrcF(FOp), Def1(D1),
253 // Check if the conversion to MUX is possible (either "up", i.e. at the
284 MachineBasicBlock::iterator At = CanDown ? Def2 : Def1;
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)
HexagonEarlyIfConv.cpp 175 void predicateInstr(MachineBasicBlock *ToB, MachineBasicBlock::iterator At,
178 MachineBasicBlock::iterator At, MachineBasicBlock *FromB,
217 DEBUG(dbgs() << "Checking flow pattern at BB#" << B->getNumber() << "\n");
295 // !TOk && FOk (at least one must be true by now).
408 // execute at run-time. If we convert this case, the "undef" will
709 MachineBasicBlock::iterator At, MachineInstr *MI,
712 if (At != ToB->end())
713 DL = At->getDebugLoc();
722 MachineInstrBuilder MIB = BuildMI(*ToB, At, DL, TII->get(COpc))
740 BuildMI(*ToB, At, DL, D
    [all...]
HexagonExpandCondsets.cpp 289 // live segments that begin with a register, and end at a block boundary.
378 /// will start a new live segment. This may happen at a position that falls
381 /// will occur at the last use, but for now the segment can be terminated
382 /// right at the place where the new segment will start. The segments will be
393 // If LT does not end at a block boundary, the termination is done.
397 // If LT ended at a block boundary, it's possible that its value number
398 // is picked up at the beginning other blocks. Create a new value number
432 // For each def in MI we need to insert a new live segment starting at MX
434 // that contains MX, we need to terminate it at MX.
456 // There is no live segment after MX. End this segment at the end o
    [all...]
  /external/pdfium/third_party/lcms2-2.6/src/
cmsplugin.c 459 cmsUInt32Number NextAligned, At;
464 At = io -> Tell(io);
465 NextAligned = _cmsALIGNLONG(At);
466 BytesToNextAlignedPos = NextAligned - At;
476 cmsUInt32Number NextAligned, At;
481 At = io -> Tell(io);
482 NextAligned = _cmsALIGNLONG(At);
483 BytesToNextAlignedPos = NextAligned - At;
492 // To deal with text streams. 2K at most
  /external/v8/src/arm64/
instructions-arm64.h 419 // Where Instruction looks at instructions generated by the Assembler,
420 // InstructionSequence looks at instructions sequences generated by the
424 static InstructionSequence* At(Address address) {
  /art/compiler/utils/arm/
constants_arm.h 6 * You may obtain a copy of the License at
113 VS = 6, // Overflow | Unordered (i.e. at least one NaN operand)
228 // Example: Test whether the instruction at ptr does set the condition code
232 // Instr* instr = Instr::At(ptr);
442 // Use the At(pc) function to create references to Instr.
443 static Instr* At(uintptr_t pc) { return reinterpret_cast<Instr*>(pc); }
  /art/runtime/
dex_instruction.h 6 * You may obtain a copy of the License at
200 // Reads an instruction out of the stream at the specified address.
201 static const Instruction* At(const uint16_t* code) {
208 return At(reinterpret_cast<const uint16_t*>(this) + offset);
  /external/clang/lib/AST/
ASTDiagnostic.cpp 52 if (const AttributedType *AT = dyn_cast<AttributedType>(Ty)) {
53 QT = AT->desugar();
57 if (const AdjustedType *AT = dyn_cast<AdjustedType>(Ty)) {
58 QT = AT->desugar();
62 if (const AutoType *AT = dyn_cast<AutoType>(Ty)) {
63 if (!AT->isSugared())
65 QT = AT->desugar();
440 const Attr *At = reinterpret_cast<Attr *>(Val);
441 assert(At && "Received null Attr object!");
442 OS << '\'' << At->getSpelling() << '\''
    [all...]
  /system/core/libpixelflinger/
scanline.cpp 7 ** You may obtain a copy of the License at
164 /* To understand the values here, have a look at:
657 // All iterated values are sampled at the pixel center
815 uint32_t At = texel.c[0];
833 Cf += ((Ct - Cf) * (At + (At>>(sat-1)))) >> sat;
    [all...]

Completed in 475 milliseconds

1 2