/external/clang/test/SemaCXX/ |
warn-memset-bad-sizeof.cpp | 19 template <class Dest, class Source> 20 inline Dest bit_cast(const Source& source) { 21 Dest dest; local 22 memcpy(&dest, &source, sizeof(dest)); 23 return dest;
|
/external/eigen/Eigen/src/Core/ |
PermutationMatrix.h | 553 template<typename Dest> inline void evalTo(Dest& dst) const 558 if(is_same<MatrixTypeNestedCleaned,Dest>::value && extract_data(dst) == extract_data(m_matrix)) 576 Block<Dest, Side==OnTheLeft ? 1 : Dest::RowsAtCompileTime, Side==OnTheRight ? 1 : Dest::ColsAtCompileTime>(dst, k) 577 .swap(Block<Dest, Side==OnTheLeft ? 1 : Dest::RowsAtCompileTime, Side==OnTheRight ? 1 : Dest::ColsAtCompileTime> 589 Block<Dest, Side==OnTheLeft ? 1 : Dest::RowsAtCompileTime, Side==OnTheRight ? 1 : Dest::ColsAtCompileTime [all...] |
/external/eigen/Eigen/src/SparseLU/ |
SparseLU.h | 221 template<typename Rhs, typename Dest> 222 bool _solve(const MatrixBase<Rhs> &B, MatrixBase<Dest> &X_base) const 224 Dest& X(X_base.derived()); 226 EIGEN_STATIC_ASSERT((Dest::Flags&RowMajorBit)==0, 664 template<typename Dest> 665 void solveInPlace( MatrixBase<Dest> &X) const 683 template<typename Dest> void solveInPlace(MatrixBase<Dest> &X) const 736 template<typename Dest> void evalTo(Dest& dst) cons [all...] |
SparseLU_SupernodalMatrix.h | 157 template<typename Dest> 158 void solveInPlace( MatrixBase<Dest>&X) const; 233 template<typename Dest> 234 void MappedSuperNodalMatrix<Scalar,Index>::solveInPlace( MatrixBase<Dest>&X) const
|
/external/llvm/lib/Transforms/Utils/ |
CloneFunction.cpp | 369 BasicBlock *Dest = BI->getSuccessor(!Cond->getZExtValue()); 370 VMap[OldTI] = BranchInst::Create(Dest, NewBB); 371 ToClone.push_back(Dest); 384 BasicBlock *Dest = const_cast<BasicBlock*>(Case.getCaseSuccessor()); 385 VMap[OldTI] = BranchInst::Create(Dest, NewBB); 386 ToClone.push_back(Dest); 595 BasicBlock *Dest = BI->getSuccessor(0); 596 if (!Dest->getSinglePredecessor()) { 602 assert(!isa<PHINode>(Dest->begin())); 608 // Make all PHI nodes that referred to Dest now refer to I as their source [all...] |
LoopUnroll.cpp | 381 BasicBlock *Dest = Headers[j]; 391 Dest = LoopExit; 404 Term->setSuccessor(!ContinueOnTrue, Dest); 407 if (Dest != LoopExit) { 420 BranchInst::Create(Dest, Term); 429 BasicBlock *Dest = Term->getSuccessor(0); 430 if (BasicBlock *Fold = FoldBlockIntoPredecessor(Dest, LI, LPM)) 431 std::replace(Latches.begin(), Latches.end(), Dest, Fold);
|
/external/eigen/bench/btl/libs/eigen3/ |
eigen3_interface.hh | 113 template<typename Dest, typename Src> static void triassign(Dest& dst, const Src& src) 115 typedef typename Dest::Scalar Scalar; 131 if(Dest::Flags&RowMajorBit) 140 if(Dest::Flags&RowMajorBit) 149 if(Dest::Flags&RowMajorBit)
|
/external/llvm/lib/Analysis/ |
SparsePropagation.cpp | 99 void SparseSolver::markEdgeExecutable(BasicBlock *Source, BasicBlock *Dest) { 100 if (!KnownFeasibleEdges.insert(Edge(Source, Dest)).second) 104 << " -> " << Dest->getName() << "\n"); 106 if (BBExecutable.count(Dest)) { 110 for (BasicBlock::iterator I = Dest->begin(); isa<PHINode>(I); ++I) 114 MarkBlockExecutable(Dest);
|
/external/chromium_org/chrome/browser/sync_file_system/drive_backend/ |
drive_backend_util.h | 57 template <typename Src, typename Dest> 58 void AppendContents(const Src& src, Dest* dest) { 59 dest->insert(dest->end(), src.begin(), src.end());
|
/external/chromium_org/chrome/installer/mac/ |
keystone_install_test.sh | 72 DEST="${TEMPDIR}"/Dest.app 73 rm -rf "${DEST}" 74 mkdir -p "${DEST}"/Contents 75 defaults write "${DEST}/Contents/Info" KSVersion 0 86 echo " xc=<KSPathExistenceChecker:0x45 path=${DEST}>" 95 DEST="${TEMPDIR}"/Dest.app 96 rm -rf "${DEST}" 97 defaults write "${DEST}/Contents/Info" CFBundleShortVersionString [all...] |
/external/eigen/Eigen/src/CholmodSupport/ |
CholmodSupport.h | 292 template<typename Rhs,typename Dest> 293 void _solve(const MatrixBase<Rhs> &b, MatrixBase<Dest> &dest) const 309 dest = Matrix<Scalar,Dest::RowsAtCompileTime,Dest::ColsAtCompileTime>::Map(reinterpret_cast<Scalar*>(x_cd->x),b.rows(),b.cols()); 315 void _solve(const SparseMatrix<RhsScalar,RhsOptions,RhsIndex> &b, SparseMatrix<DestScalar,DestOptions,DestIndex> &dest) const 330 dest = viewAsEigen<DestScalar,DestOptions,DestIndex>(*x_cs); 584 template<typename Dest> void evalTo(Dest& dst) cons [all...] |
/external/llvm/lib/IR/ |
SymbolTableListTraitsImpl.h | 30 ::setSymTabObject(TPtr *Dest, TPtr Src) { 35 *Dest = Src;
|
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
CallEvent.h | 155 virtual void cloneTo(void *Dest) const = 0; 437 void cloneTo(void *Dest) const override { 438 new (Dest) SimpleFunctionCall(*this); 473 void cloneTo(void *Dest) const override { new (Dest) BlockCall(*this); } 568 void cloneTo(void *Dest) const override { new (Dest) CXXMemberCall(*this); } 610 void cloneTo(void *Dest) const override { 611 new (Dest) CXXMemberOperatorCall(*this); 661 void cloneTo(void *Dest) const override {new (Dest) CXXDestructorCall(*this); [all...] |
/external/eigen/Eigen/src/SparseCore/ |
SparseProduct.h | 115 template<typename Dest> 116 void evalTo(Dest& result) const 119 internal::conservative_sparse_sparse_product_selector<_LhsNested, _RhsNested, Dest>::run(lhs(),rhs(),result); 121 internal::sparse_sparse_product_with_pruning_selector<_LhsNested, _RhsNested, Dest>::run(lhs(),rhs(),result,m_tolerance);
|
/external/llvm/lib/Target/R600/ |
AMDGPUISelLowering.h | 109 bool isTruncateFree(EVT Src, EVT Dest) const override; 110 bool isTruncateFree(Type *Src, Type *Dest) const override; 112 bool isZExtFree(Type *Src, Type *Dest) const override; 113 bool isZExtFree(EVT Src, EVT Dest) const override;
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
compat.h | 274 template <class Dest, class Source> 275 inline Dest bit_cast(const Source& source) { 276 // Compile time assertion: sizeof(Dest) == sizeof(Source) 277 // A compile error here means your Dest and Source have different sizes. 278 typedef char VerifySizesAreEqual [sizeof(Dest) == sizeof(Source) ? 1 : 280 Dest dest; local 281 memcpy(&dest, &source, sizeof(dest)); 282 return dest; [all...] |
/external/eigen/Eigen/src/SPQRSupport/ |
SuiteSparseQRSupport.h | 143 template<typename Rhs, typename Dest> 144 void _solve(const MatrixBase<Rhs> &b, MatrixBase<Dest> &dest) const 150 typename Dest::PlainObject y; 157 dest.topRows(cols()) = colsPermutation() * y.topRows(cols()); 305 template<typename Dest> void evalTo(Dest& dst) const
|
/external/llvm/include/llvm/Analysis/ |
AliasSetTracker.h | 241 AliasSet *Dest = Forward->getForwardedTarget(AST); 242 if (Dest != Forward) { 243 Dest->addRef(); 245 Forward = Dest; 247 return Dest;
|
/external/eigen/Eigen/src/PaStiXSupport/ |
PaStiXSupport.h | 157 template<typename Rhs,typename Dest> 158 bool _solve (const MatrixBase<Rhs> &b, MatrixBase<Dest> &x) const; 387 template<typename Rhs,typename Dest> 388 bool PastixBase<Base>::_solve (const MatrixBase<Rhs> &b, MatrixBase<Dest> &x) const 391 EIGEN_STATIC_ASSERT((Dest::Flags&RowMajorBit)==0, 698 template<typename Dest> void evalTo(Dest& dst) const 711 template<typename Dest> void evalTo(Dest& dst) const
|
/external/clang/lib/CodeGen/ |
CGCleanup.cpp | 325 new llvm::LoadInst(CGF.getNormalCleanupDestSlot(), "cleanup.dest", Term); 542 // The switch operand is a load from the cleanup-dest alloca. 718 // Compute the branch-through dest if we need it: 741 // TODO: clean up the possibly dead stores to the cleanup dest slot. 761 new llvm::LoadInst(getNormalCleanupDestSlot(), "cleanup.dest"); [all...] |
/external/llvm/lib/Linker/ |
LinkModules.cpp | 66 /// linkDefinedTypeBodies - Produce a body for an opaque type in the dest 141 // Mapping an opaque type to any struct, just keep the dest struct. 148 // Mapping a non-opaque source type to an opaque dest. If this is the first 150 // the dest, but fill it in later. This doesn't need to be speculative. If 204 /// linkDefinedTypeBodies - Produce a body for an opaque type in the dest 222 // Map the body of the source type over to a new body for the dest type. 394 GlobalVariable *NewGV; // New aggregate global in dest module. 395 Constant *DstInit; // Old initializer from dest module. 444 bool getLinkageResult(GlobalValue *Dest, const GlobalValue *Src, 461 // If we found a global with the same name in the dest module, but it ha [all...] |
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/ |
blockd.h | 64 #define VP8_COMBINEENTROPYCONTEXTS( Dest, A, B) \ 65 Dest = (A)+(B);
|
/external/eigen/Eigen/src/IterativeLinearSolvers/ |
IterativeSolverBase.h | 198 void _solve_sparse(const Rhs& b, SparseMatrix<DestScalar,DestOptions,DestIndex> &dest) const 210 dest.col(k) = tx.sparseView(0); 244 template<typename Dest> void evalTo(Dest& dst) const
|
/external/eigen/Eigen/src/SparseCholesky/ |
SimplicialCholesky.h | 152 template<typename Rhs,typename Dest> 153 void _solve(const MatrixBase<Rhs> &b, MatrixBase<Dest> &dest) const 162 dest = m_P * b; 164 dest = b; 167 derived().matrixL().solveInPlace(dest); 170 dest = m_diag.asDiagonal().inverse() * dest; 173 derived().matrixU().solveInPlace(dest); 176 dest = m_Pinv * dest [all...] |
/external/libvpx/libvpx/vp8/common/ |
blockd.h | 64 #define VP8_COMBINEENTROPYCONTEXTS( Dest, A, B) \ 65 Dest = (A)+(B);
|