search for: blockb

...e it happens: line 100 of RcppEigen/inst/include/Eigen/src/Core/products/GeneralMatrixMatrixTriangular.h: for(Index k2=0; k2<depth; k2+=kc) { const Index actual_kc = (std::min)(k2+kc,depth)-k2; // note that the actual rhs is the transpose/adjoint of mat pack_rhs(blockB, rhs.getSubMapper(k2,0), actual_kc, size); ^^^^^^^^^^^^^^^^^^^^^^ where 'rhs' is an object wrapping the pointer with a method getSubMapper(i, j) for accessing the data like a matrix. In the first loop iteration, you access rhs[0]; there is no defensive test for ...

...unction calls (begin() and end()). In order to locate these calls, I am currently iterating over the basic blocks in a function using the iterator. Is it possible that I could get the blocks "out of order" with respect to the control flow? For example, if I have this code: blockA if ( blockB ) { blockC } else { blockD } blockE I expect to get the blocks in alphabetical order. I can see that it is possible that LLVM could give them to me in an arbitrary order. If so, it will complicate how I need to locate the basic blocks that compose "code B" in my example above. 2....