3809     int resrows=Ar1>Ar0?Ar1-Ar0:A.size(),rescols=Btran.size();  in in_mmult_mod()  local
3819       for (int k=0;k<resrows;k+=mmult_int_blocksize){  in in_mmult_mod()
3821 	if (kend>resrows)  in in_mmult_mod()
3822 	  kend=resrows;  in in_mmult_mod()
3845     int kstart=ptr->k,resrows=ptr->kend,n=ptr->n,rescols=ptr->rescols;  in do_thread_mmult_double()  local
3847     if (kstart>=resrows)  in do_thread_mmult_double()
3849     for (int k=kstart;k<resrows;k+=mmult_double_blocksize){  in do_thread_mmult_double()
3851       if (kend>resrows)  in do_thread_mmult_double()
3852 	kend=resrows;  in do_thread_mmult_double()
3870     int resrows=Ar1>Ar0?Ar1-Ar0:A.size(),rescols=Btran.size();  in in_mmult_double()  local
3885       int kstep=int(std::ceil(resrows/double(nthreads))),k=0;  in in_mmult_double()
3889 	if (k>resrows)  in in_mmult_double()
3890 	  k=resrows;  in in_mmult_double()
3911       for (int k=0;k<resrows;k+=mmult_double_blocksize){  in in_mmult_double()
3913 	if (kend>resrows)  in in_mmult_double()
3914 	  kend=resrows;  in in_mmult_double()
3951     int resrows,rescols;  in mmult_mod()  local
3952     resrows=Ar1>Ar0?Ar1-Ar0:A.size();  in mmult_mod()
3958       C.resize(resrows+Crbeg);  in mmult_mod()
3959       for (int i=0;i<resrows;++i){  in mmult_mod()
3968 	resrows>strassen_limit && rescols >strassen_limit && Acols>strassen_limit && Crbeg==0 && Ccbeg==0){  in mmult_mod()
3974 …   double nstep=std::ceil(std::log(giacmin(resrows,rescols)/double(strassen_limit))/std::log(2.0));  in mmult_mod()
4359     int resrows=mrows(a);  in mmult_int()  local
4361     vector< vector<int> > ai(resrows,vector<int>(n));  in mmult_int()
4363     vector< vector<int> > ci(resrows,vector<int>(rescols));  in mmult_int()
4377       c=vecteur(resrows);  in mmult_int()
4378       for (int i=0;i<resrows;++i){  in mmult_int()
4497     int resrows=ad.size();  in mmult_double()  local
4500       c=matrix_double(resrows,vector<giac_double>(rescols));  in mmult_double()
4502       c.resize(resrows);  in mmult_double()
4503       for (int i=0;i<resrows;++i)  in mmult_double()
4515       int kstep=int(std::ceil(resrows/double(nthreads))),k=0;  in mmult_double()
4519 	if (k>resrows)  in mmult_double()
4520 	  k=resrows;  in mmult_double()
4540       for (int k=0;k<resrows;k+=mmult_double_blocksize){  in mmult_double()
4542 	if (kend>resrows)  in mmult_double()
4543 	  kend=resrows;  in mmult_double()
4559       int resrows=mrows(a);  in mmult_double()  local
4563 …if (!ad.empty() && resrows>=2*mmult_double_blocksize && rescols>=2*mmult_double_blocksize && (n=ad…  in mmult_double()
4564 	if (n>=CALL_LAPACK && resrows>=CALL_LAPACK && rescols>=CALL_LAPACK){  in mmult_double()
4639 	  integer M(resrows),N(rescols),K(n);  in mmult_double()
4640 	  double * A = new double[resrows*n];  in mmult_double()
4642 	  double * C = new double[resrows*rescols];  in mmult_double()
4652 	  lapack2matrice(C,resrows,rescols,res);  in mmult_double()
4657 	matrix_double c(resrows,vector<giac_double>(rescols));  in mmult_double()
4668       res.reserve(resrows);  in mmult_double()
4689     int resrows=mrows(a);  in mmult_double()  local
4692     res.reserve(resrows);  in mmult_double()
4795 	int resrows=mrows(a);  in mmult_atranb()  local
4798 	res.reserve(resrows);  in mmult_atranb()