Regarding decompiler performance for the detection of the array bounds

[anzosasuke]

I was looking at the array bound detection by Ghidra to see how it does on the detection of the array bounds.

Take an example:

int main() {
    char input[100];  // 100-byte buffer
    printf("Enter your name: ");
    fgets(input, 50, stdin);  // fills up to newline or 99 chars

    printf("You entered: %s\n", input);
    return 0;
}

This is the decompilation output snippet:

  long in_FS_OFFSET;
  char local_78 [104];
  long local_10;

I see this increments of 4 in most cases. can anyone tell me why that is? I would greatly appreciate any thoughts.

[anzosasuke]

It was because of alignment.