| /external/llvm/tools/llvm-mc/ |
| Disassembler.cpp | 43 uint64_t Index;
45 for (Index = 0; Index < Bytes.first.size(); Index += Size) {
49 S = DisAsm.getInstruction(Inst, Size, Data.slice(Index), Index,
53 SM.PrintMessage(SMLoc::getFromPointer(Bytes.second[Index]),
66 SM.PrintMessage(SMLoc::getFromPointer(Bytes.second[Index]),
|
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-elf/ |
| group2.d | 17 \[Index\] Name
|
| group4.d | 17 \[Index\] Name
|
| group5.d | 17 \[Index\] Name
|
| group6.d | 17 \[Index\] Name
|
| group7.d | 13 \[Index\] Name
18 \[Index\] Name
23 \[Index\] Name
28 \[Index\] Name
|
| /external/pdfium/third_party/bigint/ |
| BigUnsigned.cc | 30 void BigUnsigned::setBlock(Index i, Blk newBlock) {
42 for (Index j = len; j < i; j++)
53 BigUnsigned::Index BigUnsigned::bitLength() const {
58 Index leftmostBlockLen = 0;
67 void BigUnsigned::setBit(Index bi, bool newBit) {
68 Index blockI = bi / N;
83 Index i = len;
144 Index i;
157 // For each block index that is present in both inputs...
202 Index i
[all...] |
| /external/clang/include/clang/CodeGen/ |
| BackendUtil.h | 41 std::unique_ptr<llvm::FunctionInfoIndex> Index = nullptr);
|
| /external/clang/lib/ |
| Makefile | 14 Index ASTMatchers
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| VectorBlock.h | 16 /** \deprecated use DenseMase::head(Index) */
19 MatrixBase<Derived>::start(Index size)
25 /** \deprecated use DenseMase::head(Index) */
28 MatrixBase<Derived>::start(Index size) const
34 /** \deprecated use DenseMase::tail(Index) */
37 MatrixBase<Derived>::end(Index size)
43 /** \deprecated use DenseMase::tail(Index) */
46 MatrixBase<Derived>::end(Index size) const
|
| /external/eigen/doc/examples/ |
| Tutorial_ReductionsVisitorsBroadcasting_maxnorm.cpp | 12 MatrixXf::Index maxIndex;
|
| /external/eigen/test/ |
| array_replicate.cpp | 17 typedef typename MatrixType::Index Index;
23 Index rows = m.rows();
24 Index cols = m.cols();
|
| corners.cpp | 18 typedef typename MatrixType::Index Index;
19 Index rows = m.rows();
20 Index cols = m.cols();
22 Index r = internal::random<Index>(1,rows);
23 Index c = internal::random<Index>(1,cols);
33 Index sr = internal::random<Index>(1,rows) - 1
[all...] |
| dontalign.cpp | 22 typedef typename MatrixType::Index Index;
27 Index rows = m.rows();
28 Index cols = m.cols();
|
| eigensolver_generalized_real.cpp | 16 typedef typename MatrixType::Index Index;
20 Index rows = m.rows();
21 Index cols = m.cols();
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| IncompleteCholesky.h | 36 typedef typename MatrixType::Index Index;
37 typedef PermutationMatrix<Dynamic, Dynamic, Index> PermutationType;
39 typedef Matrix<Index,Dynamic, 1> IndexType;
40 typedef std::vector<std::list<Index> > VectorList;
49 Index rows() const { return m_L.rows(); }
51 Index cols() const { return m_L.cols(); }
127 inline void updateList(const IdxType& colPtr, IdxType& rowIdx, SclType& vals, const Index& col, const Index& jk, IndexType& firstElt, VectorList& listCol);
146 Index n = m_L.cols();
[all...] |
| /external/llvm/include/llvm/DebugInfo/PDB/DIA/ |
| DIADataStream.h | 23 llvm::Optional<RecordType> getItemAtIndex(uint32_t Index) const override;
|
| DIAEnumSourceFiles.h | 26 ChildTypePtr getChildAtIndex(uint32_t Index) const override;
|
| DIAEnumSymbols.h | 26 std::unique_ptr<PDBSymbol> getChildAtIndex(uint32_t Index) const override;
|
| /external/llvm/lib/Target/SystemZ/ |
| SystemZISelDAGToDAG.cpp | 32 // base+displacement+index for load and store operands
35 // base+displacement+index for load address operands
38 // base+displacement+index+ADJDYNALLOC
57 // Base + Disp + Index + (IncludesDynAlloc ? ADJDYNALLOC : 0)
60 SDValue Index;
64 : Form(form), DR(dr), Base(), Disp(0), Index(),
67 // True if the address can have an index register.
83 errs() << " Index ";
84 if (Index.getNode())
85 Index.getNode()->dump()
[all...] |
| /external/eigen/Eigen/src/SparseCholesky/ |
| SimplicialCholesky.h | 44 typedef typename MatrixType::Index Index;
45 typedef SparseMatrix<Scalar,ColMajor,Index> CholMatrixType;
68 inline Index cols() const { return m_matrix.cols(); }
69 inline Index rows() const { return m_matrix.rows(); }
112 const PermutationMatrix<Dynamic,Dynamic,Index>& permutationP() const
117 const PermutationMatrix<Dynamic,Dynamic,Index>& permutationPinv() const
188 Index size = matrix.cols();
222 inline bool operator() (const Index& row, const Index& col, const Scalar&) cons
[all...] |
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| radeon_compiler.c | 124 c->Program.InputsRead |= 1 << inst->U.I.SrcReg[i].Index;
129 c->Program.OutputsWritten |= 1 << inst->U.I.DstReg.Index;
149 if (inst->U.I.SrcReg[i].File == RC_FILE_INPUT && inst->U.I.SrcReg[i].Index == input) {
151 inst->U.I.SrcReg[i].Index = new_input.Index;
158 c->Program.InputsRead |= 1 << new_input.Index;
180 if (inst->U.I.DstReg.File == RC_FILE_OUTPUT && inst->U.I.DstReg.Index == output) {
181 inst->U.I.DstReg.Index = new_output;
203 if (inst->U.I.DstReg.File == RC_FILE_OUTPUT && inst->U.I.DstReg.Index == output) {
205 inst->U.I.DstReg.Index = tempreg
[all...] |
| /external/chromium-trace/catapult/third_party/closure_linter/closure_linter/common/ |
| position.py | 27 start: The index in to the string where the segment starts.
35 start: The start index.
116 def Index(index):
117 """Returns a Position object for the specified index.
120 index: The index to select, inclusively.
125 return Position(index, 1)
126 Index = staticmethod(Index)
[all...] |
| /external/eigen/Eigen/src/Core/ |
| VectorBlock.h | 25 * It is the return type of DenseBase::segment(Index,Index) and DenseBase::segment<int>(Index) and
44 * \sa class Block, DenseBase::segment(Index,Index,Index,Index), DenseBase::segment(Index,Index)
75 inline VectorBlock(VectorType& vector, Index start, Index size
[all...] |
| /external/eigen/Eigen/src/Eigenvalues/ |
| ComplexEigenSolver.h | 63 typedef typename MatrixType::Index Index;
107 ComplexEigenSolver(Index size)
224 ComplexEigenSolver& setMaxIterations(Index maxIters)
231 Index getMaxIterations()
286 const Index n = m_eivalues.size();
291 for(Index k=n-1 ; k>=0 ; k--)
295 for(Index i=k-1 ; i>=0 ; i--)
314 for(Index k=0 ; k<n ; k++)
324 const Index n = m_eivalues.size()
[all...] |
