claunia/86Box
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Next round of sonarlint cleanups

Browse Source
This commit is contained in:
Jasmine Iwanek
2023-06-26 12:47:04 -04:00
parent 2fe3bcd5d2
commit 21adfd4d50
176 changed files with 2791 additions and 1377 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
src/floppy/fdd_td0.c
View File

@@ -61,12 +61,15 @@
/* reaches to this value */
typedef struct {
uint16_t r,
bufcnt, bufndx, bufpos, /* string buffer */
/* the following to allow block reads
from input in next_word() */
ibufcnt, ibufndx; /* input buffer counters */
uint8_t inbuf[BUFSZ]; /* input buffer */
uint16_t r;
uint16_t bufcnt; /* string buffer */
uint16_t bufndx; /* string buffer */
uint16_t bufpos; /* string buffer */
/* the following to allow block reads
from input in next_word() */
uint16_t ibufcnt; /* input buffer counters */
uint16_t ibufndx; /* input buffer counters */
uint8_t inbuf[BUFSZ]; /* input buffer */
} tdlzhuf;
typedef struct {
@@ -364,7 +367,7 @@ state_reconst(td0dsk_t *state)
for (i = 0, j = N_CHAR; j < T; i += 2, j++) {
k = i + 1;
f = state->freq[j] = state->freq[i] + state->freq[k];
for (k = j - 1; f < state->freq[k]; k--) { };
for (k = j - 1; f < state->freq[k]; k--) { }
k++;
l = (j - k) * 2;
@@ -405,7 +408,7 @@ state_update(td0dsk_t *state, int c)
/* swap nodes to keep the tree freq-ordered */
if (k > state->freq[l = c + 1]) {
while (k > state->freq[++l]) { };
while (k > state->freq[++l]) { }
l--;
state->freq[c] = state->freq[l];
state->freq[l] = k;