dolphin_state.c 3.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103
  1. #include "dolphin_state.h"
  2. #include <furi.h>
  3. #include <api-hal.h>
  4. #include <math.h>
  5. DolphinState* dolphin_state_alloc() {
  6. DolphinState* dolphin_state = furi_alloc(sizeof(DolphinState));
  7. return dolphin_state;
  8. }
  9. void dolphin_state_free(DolphinState* dolphin_state) {
  10. free(dolphin_state);
  11. }
  12. bool dolphin_state_save(DolphinState* dolphin_state) {
  13. if(!api_hal_flash_erase(DOLPHIN_DATA_PAGE, 1)) {
  14. return false;
  15. }
  16. uint8_t* source = (uint8_t*)&dolphin_state->data;
  17. uint8_t checksum = 0;
  18. for(size_t i = 0; i < sizeof(DolphinData); i++) {
  19. checksum += source[i];
  20. }
  21. DolphinDataHeader header;
  22. header.magic = DOLPHIN_DATA_HEADER_MAGIC;
  23. header.version = DOLPHIN_DATA_HEADER_VERSION;
  24. header.checksum = checksum;
  25. header.flags = 0;
  26. header.timestamp = 0;
  27. if(!api_hal_flash_write_dword(DOLPHIN_DATA_HEADER_ADDRESS, *(uint64_t*)&header)) {
  28. return false;
  29. }
  30. uint8_t destination[sizeof(uint64_t)];
  31. size_t block_count = sizeof(DolphinData) / sizeof(uint64_t) + 1;
  32. size_t offset = 0;
  33. for(size_t i = 0; i < block_count; i++) {
  34. for(size_t n = 0; n < sizeof(uint64_t); n++) {
  35. if(offset < sizeof(DolphinData)) {
  36. destination[n] = source[offset];
  37. } else {
  38. destination[n] = 0;
  39. }
  40. offset++;
  41. }
  42. if(!api_hal_flash_write_dword(
  43. DOLPHIN_DATA_DATA_ADDRESS + i * sizeof(uint64_t), *(uint64_t*)destination)) {
  44. return false;
  45. }
  46. }
  47. return true;
  48. }
  49. bool dolphin_state_load(DolphinState* dolphin_state) {
  50. const DolphinDataHeader* header = (const DolphinDataHeader*)DOLPHIN_DATA_HEADER_ADDRESS;
  51. if(header->magic == DOLPHIN_DATA_HEADER_MAGIC &&
  52. header->version == DOLPHIN_DATA_HEADER_VERSION) {
  53. uint8_t checksum = 0;
  54. const uint8_t* source = (const uint8_t*)DOLPHIN_DATA_DATA_ADDRESS;
  55. for(size_t i = 0; i < sizeof(DolphinData); i++) {
  56. checksum += source[i];
  57. }
  58. if(header->checksum == checksum) {
  59. memcpy(
  60. &dolphin_state->data, (const void*)DOLPHIN_DATA_DATA_ADDRESS, sizeof(DolphinData));
  61. return true;
  62. }
  63. }
  64. return false;
  65. }
  66. void dolphin_state_clear(DolphinState* dolphin_state) {
  67. memset(&dolphin_state->data, 0, sizeof(DolphinData));
  68. }
  69. void dolphin_state_on_deed(DolphinState* dolphin_state, DolphinDeed deed) {
  70. const DolphinDeedWeight* deed_weight = dolphin_deed_weight(deed);
  71. int32_t icounter = dolphin_state->data.icounter + deed_weight->icounter;
  72. if(icounter >= 0) {
  73. dolphin_state->data.icounter = icounter;
  74. }
  75. }
  76. uint32_t dolphin_state_get_icounter(DolphinState* dolphin_state) {
  77. return dolphin_state->data.icounter;
  78. }
  79. uint32_t dolphin_state_get_butthurt(DolphinState* dolphin_state) {
  80. return dolphin_state->data.butthurt;
  81. }
  82. uint32_t dolphin_state_get_level(DolphinState* dolphin_state) {
  83. return 0.5f +
  84. sqrtf(1.0f + 8.0f * ((float)dolphin_state->data.icounter / DOLPHIN_LVL_THRESHOLD)) /
  85. 2.0f;
  86. }
  87. uint32_t dolphin_state_xp_to_levelup(DolphinState* dolphin_state, uint32_t level, bool remaining) {
  88. return (DOLPHIN_LVL_THRESHOLD * level * (level + 1) / 2) -
  89. (remaining ? dolphin_state->data.icounter : 0);
  90. }