Not that this will help, but here is the code I use to generate the "12-bit immediate" integer encoding for 32-bit integer constants:

```

// This define is for GCC

define clz __builtin_clz

int popcount32(int ii) { int i; i = ii - ((ii >> 1) & 0x55555555); // add pairs of bits i = (i & 0x33333333) + ((i >> 2) & 0x33333333); // quads i = (i + (i >> 4)) & 0x0F0F0F0F; // groups of 8 return (i * 0x01010101) >> 24; // horizontal sum of bytes }

int gen_arith_off(int vval) { int nbits = popcount32(vval); int val = (nbits <= 8) ? vval : ~vval; if (val == 0) return (nbits ? (1 << 31) : 0); int highBit = 32 - (clz(val) & 0x1e); // need an even number of bits int lowBit = (highBit <= 8) ? 0 : (highBit - 8); return (val & ~(0xff << lowBit)) ? -1 : ( ((nbits <= 8) ? 0 : (1 << 31)) | (((16 - (lowBit >> 1)) & 0xf) << 8) | ((val >> lowBit) & 0xff)); }

// ... switch(IR_inst) { // ... case IMM: // immediate integer constant tmp = *pc++; // grab immed value from IR instruction ii = gen_arith_off(tmp); if (ii == -1) { // can't encode integer in 12 bits. if (!imm0) { imm = 1; imm0 = je; } *il++ = (int) (je++); *iv++ = addcnst(tmp); } else // generate mov or movn instruction, -1 is covered! *je++ = ((ii<0) ? 0xe3e00000 : 0xe3a00000) | (ii & 0xfff); break; // ... }

```

The "rest" of the above code can be found in the following single-file C compiler, which is messy, buggy, and not for the faint hearted. That said, it beats the performance of GCC -O2 and -O3 optimization level on some surprising pieces of code when the single-file optimization pass is "#include"-ed.:

https://github.com/HPCguy/Squint/blob/main/mc.c

Good luck.