equal
deleted
inserted
replaced
848 LOG2(_L("iLastError %d"), iLastError ); |
848 LOG2(_L("iLastError %d"), iLastError ); |
849 // I assume only the first one has been tried and failed. |
849 // I assume only the first one has been tried and failed. |
850 // However, we retry all. |
850 // However, we retry all. |
851 count = iQueuedMessages->Count(); |
851 count = iQueuedMessages->Count(); |
852 TInt i; |
852 TInt i; |
853 for ( i = 0; i < count; i++ ) |
853 for ( i = 0; i < count; ++i ) |
854 { |
854 { |
855 iQueuedMessages->At( i )->iStatus = EWaiting; |
855 iQueuedMessages->At( i )->iStatus = EWaiting; |
856 } |
856 } |
857 // Leave here, and RunL will retry after a pause |
857 // Leave here, and RunL will retry after a pause |
858 User::Leave( iLastError ); |
858 User::Leave( iLastError ); |
1133 // twice from the same file, we get the same TID and the |
1133 // twice from the same file, we get the same TID and the |
1134 // same URL. This way we can test the pruning function in |
1134 // same URL. This way we can test the pruning function in |
1135 // server MTM |
1135 // server MTM |
1136 |
1136 |
1137 TInt i; |
1137 TInt i; |
1138 for ( i = 0; i < aUrl.Length(); i++ ) |
1138 for ( i = 0; i < aUrl.Length(); ++i ) |
1139 { |
1139 { |
1140 random += aUrl[ i ]; |
1140 random += aUrl[ i ]; |
1141 } |
1141 } |
1142 |
1142 |
1143 target.Des().Num( random ); |
1143 target.Des().Num( random ); |
1239 encodeBuffer->Write( position, &KMmsRelativeToken, 1 ); |
1239 encodeBuffer->Write( position, &KMmsRelativeToken, 1 ); |
1240 position++; |
1240 position++; |
1241 |
1241 |
1242 length -= 2; // actual integer length |
1242 length -= 2; // actual integer length |
1243 |
1243 |
1244 for (i = 0; i < length; i++) |
1244 for (i = 0; i < length; ++i) |
1245 { |
1245 { |
1246 array[i] = TInt8( ( temp >> ( KConst8 * (3 - i) ) ) & 0xFF ); |
1246 array[i] = TInt8( ( temp >> ( KConst8 * (3 - i) ) ) & 0xFF ); |
1247 } |
1247 } |
1248 |
1248 |
1249 // write short length |
1249 // write short length |