You probably want portable C code here, which your compiler will turn into proper ARM assembly. ARM has conditional moves, and these can be conditional on overflow. The algorithm then becomes: add and conditionally set the destination to unsigned(-1), if overflow was detected. uint16_t add16(uint16_t a, uint16_t b) { uint16_t c = a + b; if … Read more
The article Branchfree Saturating Arithmetic provides strategies for this: Their addition solution is as follows: u32b sat_addu32b(u32b x, u32b y) { u32b res = x + y; res |= -(res < x); return res; } modified for uint8_t: uint8_t sat_addu8b(uint8_t x, uint8_t y) { uint8_t res = x + y; res |= -(res < x); … Read more
I would just do this. It basically takes the minimum between 100 (the max health) and what the health would be with 15 extra points. It ensures that the user’s health does not exceed 100. public void getHealed() { health = Math.min(health + 15, 100); } To ensure that hitpoints do not drop below zero, … Read more