274c12fc56
* Streams: string stream * String stream: updated insert/delete api * Streams: generic stream interface and string stream implementation * Streams: helpers for insert and delete_and_insert * FFF: now compatible with streams * MinUnit: introduced tests with arguments * FFF: stream access violation * Streams: copy data between streams * Streams: file stream * FFF: documentation * FFStream: documentation * FFF: alloc as file * MinUnit: support for nested tests * Streams: changed delete_and_insert, now it returns success flag. Added ability dump stream inner parameters and data to cout. * FFF: simplified file open function * Streams: unit tests * FFF: tests * Streams: declare cache_size constant as define, to allow variable modified arrays * FFF: lib moved to a separate folder * iButton: new FFF * RFID: new FFF * Animations: new FFF * IR: new FFF * NFC: new FFF * Flipper file format: delete lib * U2F: new FFF * Subghz: new FFF and streams * Streams: read line * Streams: split * FuriCore: implement memset with extra asserts * FuriCore: implement extra heap asserts without inventing memset * Scene manager: protected access to the scene id stack with a size check * NFC worker: dirty fix for issue where hal_nfc was busy on app start * Furi: update allocator to erase memory on allocation. Replace furi_alloc with malloc. * FuriCore: cleanup memmgr code. * Furi HAL: furi_hal_init is split into critical and non-critical parts. The critical part is currently clock and console. * Memmgr: added ability to track allocations and deallocations through console. * FFStream: some speedup * Streams, FF: minor fixes * Tests: restore * File stream: a slightly more thread-safe version of file_stream_delete_and_insert Co-authored-by: Aleksandr Kutuzov <alleteam@gmail.com>
193 lines
5.8 KiB
C
193 lines
5.8 KiB
C
#include "dolphin_state.h"
|
|
#include "dolphin/helpers/dolphin_deed.h"
|
|
#include <stdint.h>
|
|
#include <storage/storage.h>
|
|
#include <furi.h>
|
|
#include <furi_hal.h>
|
|
#include <math.h>
|
|
#include <toolbox/saved_struct.h>
|
|
|
|
#define TAG "DolphinState"
|
|
#define DOLPHIN_STATE_PATH "/int/dolphin.state"
|
|
#define DOLPHIN_STATE_HEADER_MAGIC 0xD0
|
|
#define DOLPHIN_STATE_HEADER_VERSION 0x01
|
|
#define LEVEL2_THRESHOLD 735
|
|
#define LEVEL3_THRESHOLD 2940
|
|
#define BUTTHURT_MAX 14
|
|
#define BUTTHURT_MIN 0
|
|
|
|
DolphinState* dolphin_state_alloc() {
|
|
return malloc(sizeof(DolphinState));
|
|
}
|
|
|
|
void dolphin_state_free(DolphinState* dolphin_state) {
|
|
free(dolphin_state);
|
|
}
|
|
|
|
bool dolphin_state_save(DolphinState* dolphin_state) {
|
|
if(!dolphin_state->dirty) {
|
|
return true;
|
|
}
|
|
|
|
bool result = saved_struct_save(
|
|
DOLPHIN_STATE_PATH,
|
|
&dolphin_state->data,
|
|
sizeof(DolphinStoreData),
|
|
DOLPHIN_STATE_HEADER_MAGIC,
|
|
DOLPHIN_STATE_HEADER_VERSION);
|
|
|
|
if(result) {
|
|
FURI_LOG_I(TAG, "State saved");
|
|
dolphin_state->dirty = false;
|
|
} else {
|
|
FURI_LOG_E(TAG, "Failed to save state");
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
bool dolphin_state_load(DolphinState* dolphin_state) {
|
|
bool success = saved_struct_load(
|
|
DOLPHIN_STATE_PATH,
|
|
&dolphin_state->data,
|
|
sizeof(DolphinStoreData),
|
|
DOLPHIN_STATE_HEADER_MAGIC,
|
|
DOLPHIN_STATE_HEADER_VERSION);
|
|
|
|
if(success) {
|
|
if((dolphin_state->data.butthurt > BUTTHURT_MAX) ||
|
|
(dolphin_state->data.butthurt < BUTTHURT_MIN)) {
|
|
success = false;
|
|
}
|
|
}
|
|
|
|
if(!success) {
|
|
FURI_LOG_W(TAG, "Reset dolphin-state");
|
|
memset(dolphin_state, 0, sizeof(*dolphin_state));
|
|
dolphin_state->dirty = true;
|
|
}
|
|
|
|
return success;
|
|
}
|
|
|
|
uint64_t dolphin_state_timestamp() {
|
|
FuriHalRtcDateTime datetime;
|
|
struct tm current;
|
|
|
|
furi_hal_rtc_get_datetime(&datetime);
|
|
|
|
current.tm_year = datetime.year - 1900;
|
|
current.tm_mday = datetime.day;
|
|
current.tm_mon = datetime.month - 1;
|
|
|
|
current.tm_hour = datetime.hour;
|
|
current.tm_min = datetime.minute;
|
|
current.tm_sec = datetime.second;
|
|
|
|
return mktime(¤t);
|
|
}
|
|
|
|
bool dolphin_state_is_levelup(uint32_t icounter) {
|
|
return (icounter == LEVEL2_THRESHOLD) || (icounter == LEVEL3_THRESHOLD);
|
|
}
|
|
|
|
uint8_t dolphin_get_level(uint32_t icounter) {
|
|
if(icounter <= LEVEL2_THRESHOLD) {
|
|
return 1;
|
|
} else if(icounter <= LEVEL3_THRESHOLD) {
|
|
return 2;
|
|
} else {
|
|
return 3;
|
|
}
|
|
}
|
|
|
|
uint32_t dolphin_state_xp_above_last_levelup(uint32_t icounter) {
|
|
uint32_t threshold = 0;
|
|
if(icounter <= LEVEL2_THRESHOLD) {
|
|
threshold = 0;
|
|
} else if(icounter <= LEVEL3_THRESHOLD) {
|
|
threshold = LEVEL2_THRESHOLD + 1;
|
|
} else {
|
|
threshold = LEVEL3_THRESHOLD + 1;
|
|
}
|
|
return icounter - threshold;
|
|
}
|
|
|
|
uint32_t dolphin_state_xp_to_levelup(uint32_t icounter) {
|
|
uint32_t threshold = 0;
|
|
if(icounter <= LEVEL2_THRESHOLD) {
|
|
threshold = LEVEL2_THRESHOLD;
|
|
} else if(icounter <= LEVEL3_THRESHOLD) {
|
|
threshold = LEVEL3_THRESHOLD;
|
|
} else {
|
|
threshold = (uint32_t)-1;
|
|
}
|
|
return threshold - icounter;
|
|
}
|
|
|
|
void dolphin_state_on_deed(DolphinState* dolphin_state, DolphinDeed deed) {
|
|
DolphinApp app = dolphin_deed_get_app(deed);
|
|
int8_t weight_limit =
|
|
dolphin_deed_get_app_limit(app) - dolphin_state->data.icounter_daily_limit[app];
|
|
uint8_t deed_weight = CLAMP(dolphin_deed_get_weight(deed), weight_limit, 0);
|
|
|
|
uint8_t xp_to_levelup = dolphin_state_xp_to_levelup(dolphin_state->data.icounter);
|
|
if(xp_to_levelup) {
|
|
deed_weight = MIN(xp_to_levelup, deed_weight);
|
|
dolphin_state->data.icounter += deed_weight;
|
|
dolphin_state->data.icounter_daily_limit[app] += deed_weight;
|
|
}
|
|
|
|
/* decrease butthurt:
|
|
* 0 deeds accumulating --> 0 butthurt
|
|
* +1....+15 deeds accumulating --> -1 butthurt
|
|
* +16...+30 deeds accumulating --> -1 butthurt
|
|
* +31...+45 deeds accumulating --> -1 butthurt
|
|
* +46...... deeds accumulating --> -1 butthurt
|
|
* -4 butthurt per day is maximum
|
|
* */
|
|
uint8_t butthurt_icounter_level_old = dolphin_state->data.butthurt_daily_limit / 15 +
|
|
!!(dolphin_state->data.butthurt_daily_limit % 15);
|
|
dolphin_state->data.butthurt_daily_limit =
|
|
CLAMP(dolphin_state->data.butthurt_daily_limit + deed_weight, 46, 0);
|
|
uint8_t butthurt_icounter_level_new = dolphin_state->data.butthurt_daily_limit / 15 +
|
|
!!(dolphin_state->data.butthurt_daily_limit % 15);
|
|
int32_t new_butthurt = ((int32_t)dolphin_state->data.butthurt) -
|
|
(butthurt_icounter_level_old != butthurt_icounter_level_new);
|
|
new_butthurt = CLAMP(new_butthurt, BUTTHURT_MAX, BUTTHURT_MIN);
|
|
|
|
dolphin_state->data.butthurt = new_butthurt;
|
|
dolphin_state->data.timestamp = dolphin_state_timestamp();
|
|
dolphin_state->dirty = true;
|
|
|
|
FURI_LOG_D(
|
|
TAG,
|
|
"icounter %d, butthurt %d",
|
|
dolphin_state->data.icounter,
|
|
dolphin_state->data.butthurt);
|
|
}
|
|
|
|
void dolphin_state_butthurted(DolphinState* dolphin_state) {
|
|
if(dolphin_state->data.butthurt < BUTTHURT_MAX) {
|
|
dolphin_state->data.butthurt++;
|
|
dolphin_state->data.timestamp = dolphin_state_timestamp();
|
|
dolphin_state->dirty = true;
|
|
}
|
|
}
|
|
|
|
void dolphin_state_increase_level(DolphinState* dolphin_state) {
|
|
furi_assert(dolphin_state_is_levelup(dolphin_state->data.icounter));
|
|
++dolphin_state->data.icounter;
|
|
dolphin_state->dirty = true;
|
|
}
|
|
|
|
void dolphin_state_clear_limits(DolphinState* dolphin_state) {
|
|
furi_assert(dolphin_state);
|
|
|
|
for(int i = 0; i < DolphinAppMAX; ++i) {
|
|
dolphin_state->data.icounter_daily_limit[i] = 0;
|
|
}
|
|
dolphin_state->data.butthurt_daily_limit = 0;
|
|
dolphin_state->dirty = true;
|
|
}
|