| /* |
| * Copyright (C) 2017 Amlogic, Inc. All rights reserved. |
| * * |
| This program is free software; you can redistribute it and/or modify |
| * it under the terms of the GNU General Public License as published by |
| * the Free Software Foundation; either version 2 of the License, or |
| * (at your option) any later version. |
| * * |
| This program is distributed in the hope that it will be useful, but WITHOUT |
| * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for |
| * more details. |
| * * |
| You should have received a copy of the GNU General Public License along |
| * with this program; if not, write to the Free Software Foundation, Inc., |
| * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
| * * |
| Description: |
| */ |
| |
| #include "../v2_burning_i.h" |
| |
| #define OPTIMUS_PROMPT_SIZE_MIN (4U<<20)//mininal size to prompt burning progress step |
| |
| struct ProgressInfo{ |
| u32 itemSzLow; |
| u32 itemSzHigh; |
| |
| u8 startStep; |
| u8 endStep; |
| u8 totalStepNum; |
| u8 currentStep; |
| |
| u32 bytesToIncOneStep; |
| u32 unReportSzInByte; |
| |
| u32 bytesToUpdateStep; |
| u32 reserv; |
| |
| }; |
| static struct ProgressInfo _progressInfo = {0}; |
| |
| int optimus_progress_init(const unsigned itemSzHigh, const unsigned itemSzLow, const u32 startStep, const u32 endStep) |
| { |
| _progressInfo.itemSzLow = itemSzLow; |
| _progressInfo.itemSzHigh = itemSzHigh; |
| |
| _progressInfo.startStep = startStep; |
| _progressInfo.endStep = endStep; |
| _progressInfo.currentStep = startStep; |
| _progressInfo.totalStepNum = endStep - startStep; |
| |
| _progressInfo.unReportSzInByte = 0;//clear it |
| |
| //ATTENTION: as divisor / is lossy, _progressInfo.bytesToIncOneStep * _progressInfo.totalStepNum <= item size, so 100% is sometimes not exactly Burn Completed!! |
| _progressInfo.bytesToIncOneStep = ((((u64)itemSzHigh)<<32) + itemSzLow) / _progressInfo.totalStepNum; |
| _progressInfo.bytesToUpdateStep = (OPTIMUS_PROMPT_SIZE_MIN > _progressInfo.bytesToIncOneStep) ? OPTIMUS_PROMPT_SIZE_MIN : _progressInfo.bytesToIncOneStep; |
| |
| |
| DWN_DBG("item size 0x[%x, %x], currentStep %d, totalStepNum %d, bytesToIncOneStep 0x%x\n", |
| itemSzHigh, itemSzLow, _progressInfo.currentStep, _progressInfo.totalStepNum, _progressInfo.bytesToIncOneStep); |
| return 0; |
| } |
| |
| int optimus_progress_exit(void) |
| { |
| return 0; |
| } |
| |
| int optimus_update_progress(const unsigned thisBurnSz) |
| { |
| _progressInfo.unReportSzInByte += thisBurnSz; |
| |
| if (_progressInfo.bytesToUpdateStep > _progressInfo.unReportSzInByte) { |
| return 0; |
| } |
| |
| //if it is first time to prompt UI progress steps |
| if (_progressInfo.unReportSzInByte == thisBurnSz && _progressInfo.startStep + 1 == _progressInfo.currentStep) |
| { |
| printf("\n"); |
| } |
| |
| _progressInfo.currentStep += _progressInfo.unReportSzInByte / _progressInfo.bytesToIncOneStep; |
| _progressInfo.unReportSzInByte %= _progressInfo.bytesToIncOneStep; |
| |
| printf("Downloading %%%d\r", _progressInfo.currentStep); |
| if (_progressInfo.currentStep == _progressInfo.endStep) { |
| printf("\n"); |
| } |
| |
| return 0; |
| } |
| |
| //outStr will be null-terminater after format |
| int optimus_hex_data_2_ascii_str(const unsigned char* hexData, const unsigned nBytes, char* outStr, const unsigned strSz) |
| { |
| int i = 1; |
| if (strSz < 2 * nBytes + 1) { |
| DWN_ERR("strSz(%d) > 2 * nBytes(%d)\n", strSz, nBytes); |
| return __LINE__; |
| } |
| |
| sprintf(outStr, "%02x", hexData[0]); |
| for (; i < nBytes; ++i) |
| { |
| sprintf(outStr, "%s%02x", outStr, hexData[i]); |
| } |
| |
| return 0; |
| } |
| |
| unsigned add_sum(const void* pBuf, const unsigned size) |
| { |
| unsigned sum = 0; |
| const unsigned* data = (const unsigned*)pBuf; |
| unsigned wordLen = size>>2; |
| unsigned rest = size & 3; |
| |
| for (; wordLen/4; wordLen -= 4) |
| { |
| sum += *data++; |
| sum += *data++; |
| sum += *data++; |
| sum += *data++; |
| } |
| while (wordLen--) |
| { |
| sum += *data++; |
| } |
| |
| if (rest == 0) |
| { |
| ; |
| } |
| else if(rest == 1) |
| { |
| sum += (*data) & 0xff; |
| } |
| else if(rest == 2) |
| { |
| sum += (*data) & 0xffff; |
| } |
| else if(rest == 3) |
| { |
| sum += (*data) & 0xffffff; |
| } |
| |
| return sum; |
| } |
| |