So, you already have a program that produces this text:
prefactor = +s.ds8*s.ds10*ti[0]->value();
expr = ( - 5/243.*(s.x14*s.x15*csc[49300] + 9/10.*s.x14*s.x15*csc[49301] +
1/10.*s.x14*s.x15*csc[49302] - 3/5.*s.x14*s.x15*csc[49303] -...
and
double csc19295 = + s.ds0*s.ds1*s.ds2 * ( -
32*s.x12pow2*s.x15*s.x34*s.mbpow2*s.mWpowinv2 -
32*s.x12pow2*s.x15*s.x35*s.mbpow2*s.mWpowinv2 -
32*s.x12pow2*s.x15*s.x35*s.x45*s.mWpowinv2 -...
right?
If all your functions have a similar “format” (multiply n numbers m times and add the results – or something similar) then I think you can do this:
- change the generator program to output offsets instead of strings (i.e. instead of the string “s.ds0” it will produce
offsetof(ProcessVars, ds0) - create an array of such offsets
- write an evaluator which accepts the array above and the base addresses of the structure pointers and produces an result
The array+evaluator will represent the same logic as one of your functions, but only the evaluator will be code. The array is “data” and can be either generated at runtime or saved on disk and read i chunks or with a memory mapped file.
For your particular example in func1 imagine how you would rewrite the function via an evaluator if you had access to the base address of s and csc and also a vector like representation of the constants and the offsets you need to add to the base addresses to get to x14, ds8 and csc[51370]
You need to create a new form of “data” that will describe how to process the actual data you pass to your huge number of functions.