fs_test.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820
  1. /**************************************************************************************************
  2. Phyplus Microelectronics Limited confidential and proprietary.
  3. All rights reserved.
  4. IMPORTANT: All rights of this software belong to Phyplus Microelectronics
  5. Limited ("Phyplus"). Your use of this Software is limited to those
  6. specific rights granted under the terms of the business contract, the
  7. confidential agreement, the non-disclosure agreement and any other forms
  8. of agreements as a customer or a partner of Phyplus. You may not use this
  9. Software unless you agree to abide by the terms of these agreements.
  10. You acknowledge that the Software may not be modified, copied,
  11. distributed or disclosed unless embedded on a Phyplus Bluetooth Low Energy
  12. (BLE) integrated circuit, either as a product or is integrated into your
  13. products. Other than for the aforementioned purposes, you may not use,
  14. reproduce, copy, prepare derivative works of, modify, distribute, perform,
  15. display or sell this Software and/or its documentation for any purposes.
  16. YOU FURTHER ACKNOWLEDGE AND AGREE THAT THE SOFTWARE AND DOCUMENTATION ARE
  17. PROVIDED AS IS WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESS OR IMPLIED,
  18. INCLUDING WITHOUT LIMITATION, ANY WARRANTY OF MERCHANTABILITY, TITLE,
  19. NON-INFRINGEMENT AND FITNESS FOR A PARTICULAR PURPOSE. IN NO EVENT SHALL
  20. PHYPLUS OR ITS SUBSIDIARIES BE LIABLE OR OBLIGATED UNDER CONTRACT,
  21. NEGLIGENCE, STRICT LIABILITY, CONTRIBUTION, BREACH OF WARRANTY, OR OTHER
  22. LEGAL EQUITABLE THEORY ANY DIRECT OR INDIRECT DAMAGES OR EXPENSES
  23. INCLUDING BUT NOT LIMITED TO ANY INCIDENTAL, SPECIAL, INDIRECT, PUNITIVE
  24. OR CONSEQUENTIAL DAMAGES, LOST PROFITS OR LOST DATA, COST OF PROCUREMENT
  25. OF SUBSTITUTE GOODS, TECHNOLOGY, SERVICES, OR ANY CLAIMS BY THIRD PARTIES
  26. (INCLUDING BUT NOT LIMITED TO ANY DEFENSE THEREOF), OR OTHER SIMILAR COSTS.
  27. **************************************************************************************************/
  28. #include "osal.h"
  29. #include "crc16.h"
  30. #include "fs.h"
  31. #include "error.h"
  32. #include "fs_test.h"
  33. #include "log.h"
  34. #include "common.h"
  35. #include "flash.h"
  36. #ifdef FS_MODULE_TEST
  37. #define FTST_MAX_FILE_CNT 256
  38. #define FTST_MAX_FILE_SIZE 4095
  39. typedef struct{
  40. uint16_t fid;
  41. uint16_t fsize;
  42. uint16_t fcrc;
  43. uint16_t del_flg;//0: file exist; 1: file deleted
  44. }ftst_t;
  45. static ftst_t s_fpool[FTST_MAX_FILE_CNT];
  46. static uint16_t s_ftst_fid_num = 0;
  47. uint8_t s_ftst_buf[4095];
  48. static void fstest_init(void)//
  49. {
  50. int i = 0;
  51. osal_memset((void*)s_fpool, 0, sizeof(s_fpool));
  52. osal_memset(s_ftst_buf, 0, sizeof(s_ftst_buf));
  53. s_ftst_fid_num = 0;
  54. for(i = 0; i< FTST_MAX_FILE_CNT; i++)
  55. {
  56. s_fpool[i].fid = 0xffff;
  57. }
  58. }
  59. uint16_t fstest_gen_new_fid(uint16_t fid_num_limit)
  60. {
  61. uint16_t id;
  62. uint32_t i;
  63. bool new_flag = false;
  64. do
  65. {
  66. id = (uint16_t)osal_rand();
  67. new_flag = true;
  68. for(i = 0; i< s_ftst_fid_num; i++)
  69. {
  70. if((s_fpool[i].fid == id)&&(s_fpool[i].del_flg == false))
  71. {
  72. new_flag = false;
  73. break;
  74. }
  75. }
  76. }
  77. while(new_flag == false);
  78. if(s_ftst_fid_num >= fid_num_limit || s_ftst_fid_num >= FTST_MAX_FILE_CNT)
  79. {
  80. fid_num_limit = fid_num_limit>FTST_MAX_FILE_CNT ? FTST_MAX_FILE_CNT : fid_num_limit;
  81. id = id%s_ftst_fid_num;
  82. return s_fpool[id].fid;
  83. }
  84. if(id == 0xffff)
  85. id = id/2;
  86. return id;
  87. }
  88. static void fstest_gen_fsdata(ftst_t* pftst, uint16_t size_limit, uint16_t fid_num_limit)
  89. {
  90. uint16_t size;
  91. uint16_t i;
  92. size_limit = size_limit >FTST_MAX_FILE_SIZE?FTST_MAX_FILE_SIZE:size_limit;
  93. size = 1+ osal_rand()%(size_limit-1);
  94. if(pftst->fid == 0xffff){
  95. pftst->fid = fstest_gen_new_fid(fid_num_limit);
  96. }
  97. for(i = 0; i< size; i++){
  98. s_ftst_buf[i] = (uint8_t)(osal_rand()&0xff);
  99. }
  100. pftst->del_flg = 0;
  101. pftst->fcrc = crc16(0, s_ftst_buf, size);
  102. pftst->fsize = size;
  103. }
  104. static uint16_t fstest_save_fsdata(ftst_t* pftst, uint16_t fid_num_limit)
  105. {
  106. uint16_t i;
  107. fid_num_limit = (fid_num_limit > FTST_MAX_FILE_CNT )? FTST_MAX_FILE_CNT: fid_num_limit;
  108. for(i = 0; i< fid_num_limit; i++){
  109. if(s_fpool[i].fid == pftst->fid){
  110. s_fpool[i].del_flg = pftst->del_flg;
  111. s_fpool[i].fcrc = pftst->fcrc;
  112. s_fpool[i].fsize = pftst->fsize;
  113. return i;
  114. }
  115. if(s_fpool[i].fid == 0xffff){
  116. s_fpool[i].fid = pftst->fid;
  117. s_fpool[i].del_flg = pftst->del_flg;
  118. s_fpool[i].fcrc = pftst->fcrc;
  119. s_fpool[i].fsize = pftst->fsize;
  120. s_ftst_fid_num++;
  121. return i;
  122. }
  123. }
  124. LOG("file count out of test range\n");
  125. //while(1);;;
  126. return 0xffff;
  127. }
  128. bool fstest_validate_fsdata(ftst_t* pftst)
  129. {
  130. int i;
  131. int ret;
  132. uint16_t crc = 0;
  133. ftst_t* pft;
  134. if(pftst){
  135. pft = pftst;
  136. ret = hal_fs_item_read(pft->fid, s_ftst_buf, pft->fsize, NULL);
  137. if(ret != 0){
  138. LOG("ftest_validate_fsdata failed!,fid[0x%x], fsize[%d]\n", pft->fid, pft->fsize);
  139. //while(1);;;
  140. return FALSE;
  141. }
  142. crc = crc16(0, s_ftst_buf, pft->fsize);
  143. if(crc != pft->fcrc){
  144. LOG("ftest_validate_fsdata CRC error!,fid[0x%x], fsize[%d]\n", pft->fid, pft->fsize);
  145. //while(1);;;
  146. return FALSE;
  147. }
  148. return TRUE;
  149. }
  150. for(i = 0; i< s_ftst_fid_num; i++){
  151. pft = &(s_fpool[i]);
  152. if(pft->del_flg)
  153. continue;
  154. ret = hal_fs_item_read(pft->fid, s_ftst_buf, pft->fsize, NULL);
  155. if(ret != 0){
  156. LOG("ftest_validate_fsdata failed!,fid[0x%x], fsize[%d]\n", pft->fid, pft->fsize);
  157. //hile(1);;;
  158. return FALSE;
  159. }
  160. crc = crc16(0, s_ftst_buf, pft->fsize);
  161. if(crc != pft->fcrc){
  162. LOG("ftest_validate_fsdata CRC error!,fid[0x%x], fsize[%d]\n", pft->fid, pft->fsize);
  163. //while(1);;;
  164. return FALSE;
  165. }
  166. }
  167. return TRUE;
  168. }
  169. int fstest_del(void)
  170. {
  171. int ret;
  172. uint32_t id_index;
  173. while(1){
  174. id_index = osal_rand()%s_ftst_fid_num;
  175. if(s_fpool[id_index].del_flg == false){
  176. break;
  177. }
  178. }
  179. ret = hal_fs_item_del(s_fpool[id_index].fid);
  180. if(ret == PPlus_SUCCESS){
  181. s_fpool[id_index].del_flg = true;
  182. return PPlus_SUCCESS;
  183. }
  184. return PPlus_ERR_FATAL;
  185. }
  186. void ftcase_simple_write_test(void)
  187. {
  188. int i;
  189. int iret;
  190. uint16_t index;
  191. char* str_result = "Skip";
  192. ftst_t ftst_item;
  193. bool error_flag = false;
  194. fstest_init();
  195. //if(PPlus_ERR_FS_CONTEXT == hal_fs_init(FS_OFFSET_ADDRESS,FS_SECTOR_NUM))
  196. {
  197. iret = hal_fs_format(FS_OFFSET_ADDRESS,FS_SECTOR_NUM);
  198. if(iret != PPlus_SUCCESS){
  199. LOG("format error\n");
  200. while(1);
  201. }
  202. }
  203. str_result = "Success";
  204. for(i = 0; i < 20; i++)
  205. {
  206. ftst_item.fid = 0xffff;
  207. fstest_gen_fsdata(&ftst_item, 256, 0xffff);//size_limit fid_num_limit
  208. iret = hal_fs_item_write(ftst_item.fid,s_ftst_buf,ftst_item.fsize);
  209. if(iret != 0){
  210. LOG("fs write error[%d], fid[0x%x], fsize[%d]\n",iret,ftst_item.fid,ftst_item.fsize);
  211. str_result = "FS data validation error";
  212. error_flag = true;
  213. //while(1);;;
  214. break;
  215. }
  216. index = fstest_save_fsdata(&ftst_item,256);
  217. if(index == 0xffff){
  218. LOG("fs save error[%d], fid[0x%x], fsize[%d]\n",index, ftst_item.fid, ftst_item.fsize);
  219. str_result = "FS data validation error";
  220. error_flag = true;
  221. break;
  222. }
  223. if(fstest_validate_fsdata(NULL) == FALSE){
  224. str_result = "FS data validation error";
  225. error_flag = true;
  226. break;
  227. }
  228. }
  229. LOG("fstest_simple_write_test %s\n", str_result);
  230. if(error_flag == true)
  231. {
  232. LOG("fs error!\n");
  233. while(1);;;
  234. }
  235. }
  236. void ftcase_write_del_test(void)
  237. {
  238. int i;
  239. int iret;
  240. uint16_t index;
  241. uint32_t garbage_num = 0;
  242. char* str_result = "Skip";
  243. ftst_t ftst_item;
  244. bool error_flag = false;
  245. fstest_init();
  246. //if(PPlus_ERR_FS_CONTEXT == hal_fs_init(FS_OFFSET_ADDRESS,FS_SECTOR_NUM))
  247. {
  248. iret = hal_fs_format(FS_OFFSET_ADDRESS,FS_SECTOR_NUM);
  249. if(iret != PPlus_SUCCESS){
  250. LOG("format error\n");
  251. while(1);
  252. }
  253. }
  254. str_result = "Success";
  255. for(i=0;;i++){
  256. ftst_item.fid = 0xffff;
  257. fstest_gen_fsdata(&ftst_item, 256, 0xfffe);
  258. if(ftst_item.fsize > hal_fs_get_free_size()){
  259. LOG("test end!\n");
  260. break;
  261. }
  262. iret = hal_fs_item_write(ftst_item.fid , s_ftst_buf, ftst_item.fsize);
  263. if(iret != 0){
  264. LOG("fs write error[%d], fid[0x%x], fsize[%d]\n", iret,ftst_item.fid, ftst_item.fsize);
  265. str_result = "FS data validation error";
  266. error_flag = true;
  267. break;
  268. }
  269. index = fstest_save_fsdata(&ftst_item, 256);
  270. if(index == 0xffff){
  271. LOG("fs save error[%d], fid[0x%x], fsize[%d]\n", iret,ftst_item.fid, ftst_item.fsize);
  272. str_result = "FS data validation error";
  273. error_flag = true;
  274. break;
  275. }
  276. if(fstest_validate_fsdata(NULL) == FALSE){
  277. str_result = "FS data validation error";
  278. error_flag = true;
  279. break;
  280. }
  281. if(((i%8)==0) && (i>0)){
  282. iret = fstest_del();
  283. if(iret != PPlus_SUCCESS){
  284. str_result = "FS del error";
  285. error_flag = true;
  286. }
  287. }
  288. if(hal_fs_get_garbage_size(&garbage_num) > 256){
  289. iret = hal_fs_garbage_collect();
  290. if(iret != PPlus_SUCCESS){
  291. str_result = "FS compresss error";
  292. error_flag = true;
  293. }
  294. else{
  295. LOG("compress_ok\n");
  296. }
  297. }
  298. WaitMs(1);
  299. }
  300. LOG("ftcase_write_del_test %s\n", str_result);
  301. if(error_flag == true)
  302. {
  303. LOG("fs error!\n");
  304. while(1);;;
  305. }
  306. }
  307. void ftcase_write_del_and_ble_enable_test(void)
  308. {
  309. static int i;
  310. int iret;
  311. uint16_t index;
  312. ftst_t ftst_item;
  313. bool error_flag = false;
  314. static bool firstFlag = true;
  315. uint32_t garbage_num = 0;
  316. if(firstFlag == true)
  317. {
  318. fstest_init();
  319. //if(PPlus_ERR_FS_CONTEXT == hal_fs_init(FS_OFFSET_ADDRESS,FS_SECTOR_NUM))
  320. {
  321. iret = hal_fs_format(FS_OFFSET_ADDRESS,FS_SECTOR_NUM);
  322. if(iret != PPlus_SUCCESS){
  323. LOG("format error\n");
  324. while(1);
  325. }
  326. }
  327. firstFlag = false;
  328. i =0;
  329. }
  330. else
  331. {
  332. i++;
  333. }
  334. {
  335. ftst_item.fid = 0xffff;
  336. fstest_gen_fsdata(&ftst_item, 256, 0xfffe);
  337. if(ftst_item.fsize > hal_fs_get_free_size()){
  338. LOG("\nreinit_and_test:%d %d \n",ftst_item.fsize,hal_fs_get_free_size());
  339. firstFlag = true;
  340. return;
  341. }
  342. iret = hal_fs_item_write(ftst_item.fid , s_ftst_buf, ftst_item.fsize);
  343. if(iret != 0){
  344. LOG("fs write error[%d], fid[0x%x], fsize[%d],%d\n", iret,ftst_item.fid, ftst_item.fsize);
  345. iret = hal_fs_item_write(ftst_item.fid , s_ftst_buf, ftst_item.fsize);//to debug
  346. error_flag = true;
  347. while(1);;;
  348. }
  349. index = fstest_save_fsdata(&ftst_item, 256);
  350. if(index == 0xffff){
  351. LOG("fs save error[%d], fid[0x%x], fsize[%d]\n", iret,ftst_item.fid, ftst_item.fsize);
  352. error_flag = true;
  353. while(1);;;
  354. }
  355. if(fstest_validate_fsdata(NULL) == FALSE){
  356. LOG("FS data validation error\n");
  357. error_flag = true;
  358. while(1);;;
  359. }
  360. if(((i%4)==0) && (i>0)){
  361. iret = fstest_del();
  362. if(iret != PPlus_SUCCESS){
  363. LOG("FS del error\n");
  364. error_flag = true;
  365. while(1);;;
  366. }
  367. else{
  368. LOG(".");
  369. }
  370. }
  371. if(hal_fs_get_garbage_size(&garbage_num) > 1024){
  372. iret = hal_fs_garbage_collect();
  373. if(iret != PPlus_SUCCESS){
  374. LOG("FS compresss error,%d\n",iret);
  375. error_flag = true;
  376. while(1);
  377. }
  378. else{
  379. LOG("compress_ok\n");
  380. }
  381. }
  382. }
  383. if(error_flag == true)
  384. {
  385. LOG("fs error!\n");
  386. while(1);;;
  387. }
  388. }
  389. #endif
  390. #ifdef FS_EXAMPLE
  391. uint8_t id_buf[4095];
  392. void fs_example(void)
  393. {
  394. int ret;
  395. uint32_t free_size;
  396. uint16 id = 1,id_len;
  397. uint16 i,file_len;
  398. static uint8_t testCase = 1;
  399. static uint8_t testCycle = 0;
  400. bool errFlag;
  401. uint32_t garbage_num = 0;
  402. if(testCycle >= 10){
  403. LOG("fs example end!\n");
  404. return;
  405. }
  406. if(hal_fs_initialized() == FALSE){
  407. ret = hal_fs_init(0x11005000,4);
  408. if(PPlus_SUCCESS != ret)
  409. LOG("error:%d\n",ret);
  410. }
  411. osal_memset(id_buf,0x00,4095);
  412. for(i=0;i<4095;i++){
  413. id_buf[i] = i%256;
  414. }
  415. switch(testCase)
  416. {
  417. case 1://write two files to fs,one is the mix length,one is the max length
  418. {
  419. LOG("\nfs_write................................................\n");
  420. free_size = hal_fs_get_free_size();
  421. LOG("free_size:%d\n",free_size);
  422. id = 1;
  423. id_len = 1;
  424. if(id_len < free_size){
  425. ret = hal_fs_item_write(id,id_buf,id_len);
  426. if(PPlus_SUCCESS != ret)
  427. LOG("error:%d\n",ret);
  428. else
  429. LOG("write ok\n");
  430. }
  431. id = 4095;
  432. id_len = 4095;
  433. if(id_len < free_size){
  434. ret = hal_fs_item_write(id,id_buf,id_len);
  435. if(PPlus_SUCCESS != ret)
  436. LOG("error:%d\n",ret);
  437. else
  438. LOG("write ok\n");
  439. }
  440. free_size = hal_fs_get_free_size();
  441. LOG("free_size:%d\n",free_size);
  442. break;
  443. }
  444. case 2://read the two files
  445. {
  446. LOG("\nfs_read................................................\n");
  447. osal_memset(id_buf,0x00,4095);
  448. id = 1;
  449. ret = hal_fs_item_read(id,id_buf,4095,&file_len);
  450. if(PPlus_SUCCESS != ret)
  451. LOG("error:%d\n",ret);
  452. LOG("id:%d\n",id);
  453. LOG("id len:%d\n",file_len);
  454. LOG("id data:\n");
  455. errFlag = FALSE;
  456. for(i=0;i<file_len;i++){
  457. if(id_buf[i] != i%256){
  458. errFlag = TRUE;
  459. break;
  460. }
  461. }
  462. if(errFlag)
  463. LOG("error\n");
  464. else
  465. LOG("ok\n");
  466. osal_memset(id_buf,0x00,4095);
  467. id = 4095;
  468. hal_fs_item_read(id,id_buf,4095,&file_len);
  469. if(PPlus_SUCCESS != ret)
  470. LOG("error:%d\n",ret);
  471. LOG("\nid:%d\n",id);
  472. LOG("id len:%d\n",file_len);
  473. LOG("id data:\n");
  474. errFlag = FALSE;
  475. for(i=0;i<file_len;i++){
  476. if(id_buf[i] != i%256){
  477. errFlag = TRUE;
  478. break;
  479. }
  480. }
  481. if(errFlag)
  482. LOG("error\n");
  483. else
  484. LOG("ok\n");
  485. break;
  486. }
  487. case 3://delete the two files
  488. {
  489. LOG("\nfs_delete................................................\n");
  490. LOG("free_size:%d\n",hal_fs_get_free_size());
  491. LOG("garbage_size:%d garbage_num:%d\n",hal_fs_get_garbage_size(&garbage_num),garbage_num);
  492. id = 1;
  493. ret = hal_fs_item_del(id);
  494. if(PPlus_SUCCESS != ret)
  495. LOG("error:%d\n",ret);
  496. else{
  497. LOG("ok\n");
  498. ret = hal_fs_item_read(id,id_buf,4095,&file_len);
  499. if(ret != PPlus_ERR_FS_NOT_FIND_ID)
  500. LOG("error:%d\n",ret);
  501. }
  502. id = 4095;
  503. ret = hal_fs_item_del(id);
  504. if(PPlus_SUCCESS != ret)
  505. LOG("error:%d\n",ret);
  506. else{
  507. LOG("ok\n");
  508. ret = hal_fs_item_read(id,id_buf,4095,&file_len);
  509. if(ret != PPlus_ERR_FS_NOT_FIND_ID)
  510. LOG("error:%d\n",ret);
  511. }
  512. LOG("free_size:%d\n",hal_fs_get_free_size());
  513. LOG("garbage_size:%d garbage_num:%d\n",hal_fs_get_garbage_size(&garbage_num),garbage_num);
  514. break;
  515. }
  516. case 4://garbage collect
  517. {
  518. LOG("\nfs_garbage_collect................................................\n");
  519. LOG("free_size:%d\n",hal_fs_get_free_size());
  520. LOG("garbage_size:%d garbage_num:%d\n",hal_fs_get_garbage_size(&garbage_num),garbage_num);
  521. ret = hal_fs_garbage_collect();
  522. if(PPlus_SUCCESS != ret)
  523. LOG("error:%d\n",ret);
  524. LOG("free_size:%d\n",hal_fs_get_free_size());
  525. LOG("garbage_size:%d garbage_num:%d\n",hal_fs_get_garbage_size(&garbage_num),garbage_num);
  526. break;
  527. }
  528. default:
  529. break;
  530. }
  531. testCase++;
  532. if(testCase > 4){
  533. testCase = 1;
  534. testCycle++;
  535. LOG("\nfs test cycle:%d................................................\n",testCycle);
  536. }
  537. }
  538. #endif
  539. #ifdef FS_TIMING_TEST
  540. #define TOGGLE_GPIO GPIO_P14
  541. uint8_t id_buf[4095];
  542. void fs_timing_test(void)
  543. {
  544. uint8_t testCase = 4;
  545. uint16_t i,file_len;
  546. int ret;
  547. uint32_t garbage_size,garbage_num;
  548. hal_gpio_write(TOGGLE_GPIO,1);
  549. WaitMs(1);
  550. testCase = 9;
  551. switch(testCase)
  552. {
  553. case 0:
  554. hal_gpio_write(TOGGLE_GPIO,0);
  555. flash_sector_erase(0x11005000);
  556. hal_gpio_write(TOGGLE_GPIO,1);
  557. WaitMs(1);
  558. break;
  559. case 1:
  560. hal_gpio_write(TOGGLE_GPIO,0);
  561. WriteFlash(0x1100500c,0x12345678);
  562. hal_gpio_write(TOGGLE_GPIO,1);
  563. WaitMs(1);
  564. break;
  565. case 2:
  566. hal_gpio_write(TOGGLE_GPIO,0);
  567. osal_memcpy((uint8_t*)id_buf,(uint8_t*)0x11005000,4);
  568. hal_gpio_write(TOGGLE_GPIO,1);
  569. WaitMs(1);
  570. break;
  571. case 3:
  572. hal_gpio_write(TOGGLE_GPIO,0);
  573. ret = hal_fs_format(0x11005000,3);
  574. hal_gpio_write(TOGGLE_GPIO,1);
  575. WaitMs(1);
  576. if(ret != PPlus_SUCCESS){
  577. LOG("ret:%d",ret);
  578. }
  579. break;
  580. case 4:
  581. hal_gpio_write(TOGGLE_GPIO,0);
  582. ret = hal_fs_init(0x11005000,3);
  583. hal_gpio_write(TOGGLE_GPIO,1);
  584. WaitMs(1);
  585. if(ret != PPlus_SUCCESS){
  586. LOG("ret:%d",ret);
  587. }
  588. ret = hal_fs_item_write(1,id_buf,1);
  589. ret = hal_fs_item_write(2,id_buf,2);
  590. ret = hal_fs_item_write(3,id_buf,3);
  591. ret = hal_fs_item_write(4,id_buf,4);
  592. ret = hal_fs_item_write(5,id_buf,5);
  593. ret = hal_fs_item_write(6,id_buf,6);
  594. ret = hal_fs_item_write(7,id_buf,7);
  595. ret = hal_fs_item_write(8,id_buf,8);
  596. ret = hal_fs_item_write(9,id_buf,9);
  597. ret = hal_fs_item_write(10,id_buf,10);
  598. WaitMs(1);
  599. break;
  600. case 5:
  601. hal_gpio_write(TOGGLE_GPIO,0);
  602. ret = hal_fs_init(0x11005000,3);
  603. hal_gpio_write(TOGGLE_GPIO,1);
  604. WaitMs(1);
  605. if(ret != PPlus_SUCCESS){
  606. LOG("ret:%d",ret);
  607. }
  608. break;
  609. case 6:
  610. LOG("write file\n");
  611. for(i=0;i<4095;i++)
  612. id_buf[i] = (i+1)%256;
  613. ret = hal_fs_format(0x11005000,3);
  614. if(ret != PPlus_SUCCESS){
  615. LOG("ret:%d",ret);
  616. }
  617. WaitMs(1);
  618. hal_gpio_write(TOGGLE_GPIO,0);
  619. ret = hal_fs_item_write(1,id_buf,1);
  620. hal_gpio_write(TOGGLE_GPIO,1);
  621. WaitMs(5);
  622. hal_gpio_write(TOGGLE_GPIO,0);
  623. ret = hal_fs_item_write(2,id_buf,100);
  624. hal_gpio_write(TOGGLE_GPIO,1);
  625. WaitMs(5);
  626. hal_gpio_write(TOGGLE_GPIO,0);
  627. ret = hal_fs_item_write(3,id_buf,100);
  628. hal_gpio_write(TOGGLE_GPIO,1);
  629. WaitMs(5);
  630. break;
  631. case 7:
  632. LOG("read file\n");
  633. ret = hal_fs_init(0x11005000,3);
  634. WaitMs(1);
  635. hal_gpio_write(TOGGLE_GPIO,0);
  636. ret = hal_fs_item_read(1,id_buf,4095,&file_len);
  637. hal_gpio_write(TOGGLE_GPIO,1);
  638. WaitMs(1);
  639. LOG("ret:%d",ret);
  640. hal_gpio_write(TOGGLE_GPIO,0);
  641. ret = hal_fs_item_read(2,id_buf,4095,&file_len);
  642. hal_gpio_write(TOGGLE_GPIO,1);
  643. WaitMs(1);
  644. LOG("ret:%d",ret);
  645. hal_gpio_write(TOGGLE_GPIO,0);
  646. ret = hal_fs_item_read(3,id_buf,4095,&file_len);
  647. hal_gpio_write(TOGGLE_GPIO,1);
  648. WaitMs(1);
  649. LOG("ret:%d",ret);
  650. break;
  651. case 8:
  652. LOG("del file\n");
  653. ret = hal_fs_init(0x11005000,3);
  654. WaitMs(1);
  655. hal_gpio_write(TOGGLE_GPIO,0);
  656. ret = hal_fs_item_del(1);
  657. hal_gpio_write(TOGGLE_GPIO,1);
  658. WaitMs(1);
  659. LOG("ret:%d",ret);
  660. hal_gpio_write(TOGGLE_GPIO,0);
  661. ret = hal_fs_item_del(2);
  662. hal_gpio_write(TOGGLE_GPIO,1);
  663. WaitMs(1);
  664. LOG("ret:%d",ret);
  665. hal_gpio_write(TOGGLE_GPIO,0);
  666. ret =hal_fs_item_del(3);
  667. hal_gpio_write(TOGGLE_GPIO,1);
  668. WaitMs(1);
  669. LOG("ret:%d",ret);
  670. break;
  671. case 9:
  672. LOG("garbage calc and collect\n");
  673. ret = hal_fs_init(0x11005000,3);
  674. if(ret != PPlus_SUCCESS){
  675. LOG("hal_fs_init error:%d\n",ret);
  676. }
  677. WaitMs(5);
  678. hal_gpio_write(TOGGLE_GPIO,0);
  679. garbage_size = hal_fs_get_garbage_size(&garbage_num);
  680. hal_gpio_write(TOGGLE_GPIO,1);
  681. LOG("garbage_num:%d garbage_size:%d\n",garbage_num,garbage_size);
  682. WaitMs(5);
  683. hal_gpio_write(TOGGLE_GPIO,0);
  684. ret = hal_fs_garbage_collect();
  685. hal_gpio_write(TOGGLE_GPIO,1);
  686. if(ret != PPlus_SUCCESS){
  687. LOG("hal_fs_garbage_collect error:%d\n",ret);
  688. }
  689. WaitMs(5);
  690. break;
  691. default:
  692. break;
  693. }
  694. while(1);;;
  695. }
  696. #endif