dolphin_state.c 3.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121
  1. #include "dolphin_state.h"
  2. #include <furi.h>
  3. #include <api-hal.h>
  4. typedef struct {
  5. uint8_t magic;
  6. uint8_t version;
  7. uint8_t checksum;
  8. uint8_t flags;
  9. uint32_t timestamp;
  10. } DolphinDataHeader;
  11. #define DOLPHIN_DATA_PAGE 0xC0
  12. #define DOLPHIN_DATA_HEADER_ADDRESS 0x080C0000U
  13. #define DOLPHIN_DATA_DATA_ADDRESS (DOLPHIN_DATA_HEADER_ADDRESS + sizeof(DolphinDataHeader))
  14. #define DOLPHIN_DATA_HEADER_MAGIC 0xD0
  15. #define DOLPHIN_DATA_HEADER_VERSION 0x01
  16. typedef struct {
  17. uint32_t limit_ibutton;
  18. uint32_t limit_nfc;
  19. uint32_t limit_ir;
  20. uint32_t limit_rfid;
  21. uint32_t flags;
  22. uint32_t icounter;
  23. uint32_t butthurt;
  24. } DolphinData;
  25. struct DolphinState {
  26. DolphinData data;
  27. };
  28. DolphinState* dolphin_state_alloc() {
  29. DolphinState* dolphin_state = furi_alloc(sizeof(DolphinState));
  30. return dolphin_state;
  31. }
  32. void dolphin_state_release(DolphinState* dolphin_state) {
  33. free(dolphin_state);
  34. }
  35. bool dolphin_state_save(DolphinState* dolphin_state) {
  36. if(!api_hal_flash_erase(DOLPHIN_DATA_PAGE, 1)) {
  37. return false;
  38. }
  39. uint8_t* source = (uint8_t*)&dolphin_state->data;
  40. uint8_t checksum = 0;
  41. for(size_t i = 0; i < sizeof(DolphinData); i++) {
  42. checksum += source[i];
  43. }
  44. DolphinDataHeader header;
  45. header.magic = DOLPHIN_DATA_HEADER_MAGIC;
  46. header.version = DOLPHIN_DATA_HEADER_VERSION;
  47. header.checksum = checksum;
  48. header.flags = 0;
  49. header.timestamp = 0;
  50. if(!api_hal_flash_write_dword(DOLPHIN_DATA_HEADER_ADDRESS, *(uint64_t*)&header)) {
  51. return false;
  52. }
  53. uint8_t destination[sizeof(uint64_t)];
  54. size_t block_count = sizeof(DolphinData) / sizeof(uint64_t) + 1;
  55. size_t offset = 0;
  56. for(size_t i = 0; i < block_count; i++) {
  57. for(size_t n = 0; n < sizeof(uint64_t); n++) {
  58. if(offset < sizeof(DolphinData)) {
  59. destination[n] = source[offset];
  60. } else {
  61. destination[n] = 0;
  62. }
  63. offset++;
  64. }
  65. if(!api_hal_flash_write_dword(
  66. DOLPHIN_DATA_DATA_ADDRESS + i * sizeof(uint64_t), *(uint64_t*)destination)) {
  67. return false;
  68. }
  69. }
  70. return true;
  71. }
  72. bool dolphin_state_load(DolphinState* dolphin_state) {
  73. const DolphinDataHeader* header = (const DolphinDataHeader*)DOLPHIN_DATA_HEADER_ADDRESS;
  74. if(header->magic == DOLPHIN_DATA_HEADER_MAGIC &&
  75. header->version == DOLPHIN_DATA_HEADER_VERSION) {
  76. uint8_t checksum = 0;
  77. const uint8_t* source = (const uint8_t*)DOLPHIN_DATA_DATA_ADDRESS;
  78. for(size_t i = 0; i < sizeof(DolphinData); i++) {
  79. checksum += source[i];
  80. }
  81. if(header->checksum == checksum) {
  82. memcpy(
  83. &dolphin_state->data, (const void*)DOLPHIN_DATA_DATA_ADDRESS, sizeof(DolphinData));
  84. return true;
  85. }
  86. }
  87. return false;
  88. }
  89. void dolphin_state_clear(DolphinState* dolphin_state) {
  90. memset(&dolphin_state->data, 0, sizeof(DolphinData));
  91. }
  92. void dolphin_state_on_deed(DolphinState* dolphin_state, DolphinDeed deed) {
  93. const DolphinDeedWeight* deed_weight = dolphin_deed_weight(deed);
  94. int32_t icounter = dolphin_state->data.icounter + deed_weight->icounter;
  95. if(icounter >= 0) {
  96. dolphin_state->data.icounter = icounter;
  97. }
  98. }
  99. uint32_t dolphin_state_get_icounter(DolphinState* dolphin_state) {
  100. return dolphin_state->data.icounter;
  101. }
  102. uint32_t dolphin_state_get_butthurt(DolphinState* dolphin_state) {
  103. return dolphin_state->data.butthurt;
  104. }