计算机导论——CSAPP, cachelab

parB
最后一个61*67矩阵卡在2112了

代码如下

if ( M == 61 )
    {
       for (k = 0; k< 66;k=k+6)//A[k][j],B[j][k]
       {
          
         for (j = 60; j <61; j++)
           {
              temp0=A[k][j];
             temp1=A[k+1][j];
             temp2=A[k+2][j];
             temp3=A[k+3][j];
             temp4=A[k+4][j];
             temp5=A[k+5][j];
              B[j][k]=temp0;
             B[j][k+1]=temp1;
             B[j][k+2]=temp2;
             B[j][k+3]=temp3;
             B[j][k+4]=temp4;
             B[j][k+5]=temp5;
           }
          
          
         for (j = 0; j <60; j = j +6)
           {   
         for (i = k; i < k + 3;i++)
           {
              
              temp0 = A[i][j];
              temp1 =A[i][j+1];
              temp2 =A[i][j+2];
              temp3 =A[i][j+3];
              temp4 =A[i][j+4];
              temp5 =A[i][j+5];
              
              B[j][i] = temp0;
              B[j+1][i] =temp1;
              B[j+2][i] =temp2;
              B[j][i+3] =temp3;
             B[j+1][i+3] = temp4;
             B[j+2][i+3] = temp5;
           
           }
              
          for (i = j; i < j + 3;i++)
           {
              
              temp0 =B[i][k+3];
              temp1 =B[i][k+4];
              temp2 =B[i][k+5];
           
              temp3 =A[k+3][i];
              temp4 =A[k+4][i];
              temp5 =A[k+5][i];
           
              B[i][k+3] =temp3;
              B[i][k+4] =temp4;
              B[i][k+5] =temp5;
         
              B[i+3][k] =temp0;
             B[i+3][k+1] = temp1;
             B[i+3][k+2] = temp2;
        
           }
          for (i = j + 3; i < j +6; i ++)
           {
              
              temp0 =A[k+3][i];
              temp1 =A[k+4][i];
              temp2 =A[k+5][i];
              B[i][k+3] =temp0;
              B[i][k+4] =temp1;
              B[i][k+5] =temp2;
          
           }
              
       }
    }
for (j = 0; j < 61;j++)//A[k][j],B[j][k]
       {
          
          for (k = 66; k <67;k++)
          {
             temp0=A[k][j];
             B[j][k]=temp0;
          }
       }  
    }
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值