How well does Mathematica code exported to C compare to code directly written for C?

Question

Essentially what it says in the title. Mathematica can, IIRC, export it's code to C. How much overhead does that inflict on the code, as compared to writing it from scratch in C?

Answer 1

In addition to the answers given, you may tweak specific commands to give better performance. For example Part[] is a candidate for this. Part has to do bound checks. In time critical inner loops you can switch that off be using, Compiler`GetElement[] instead. Very cautious with this one.

Another thing you might want to try (never needed this myself) is give platform specific compile optimization options that your CPU supports:

Needs["CompiledFunctionTools`"]
Compiler`$CCompilerOptions = {"SystemCompileOptions" -> "-fPIC -O3"}

I think default optimization is -O2.

Furthermore, for example basic arithmetic operations are quite optimized and linking to the runtime lib should be quite fast.

Edit:

One important point I forgot, the internal optimizer will find a good way to formulate your expressions

Experimental`OptimizeExpression[{x^2 Sin[x^2]}]

Also, with the symbolic power you can simplify expression you could never do by hand or pen an paper....

To see what can be compiled have a look at:

Compile`CompilerFunctions[]

Find get warning about external symbols not included you can alternatively use:

On[Compile::noinfo]

Also RuntimeAttributes -> Listable provides for very easy parallelization.

Answer 2

A lot depends on how you write your code in Mathematica. In my experience, the rule of thumb is that the generated code will be efficient if the code inside Compile more or less resembles the code I would write in plain C (and it is clear why). Idiomatic (high-level) Mathematica code tends to be immutable. At the same time, Compile can handle a number of higher-level functions, such as Transpose, Partition, Map, MapThread, etc. Most of these functions return expressions, and even though these expressions are probably passed to the calling function, they must be created. For example, a call to ReplacePart which replaces a single part in a large array will necessarily lead to copying of that array. Thus, immutability generally implies creating copies.

So, if you write your code in this style and hand it to Compile, you have to keep in mind that lots of small (or large) memory allocations on the heap, and copying of lists (tensors) will be happening. Since this is not apparent for someone who is used to high-level Mathematica programming, the slowdown this may incur may be surprising. See this and this answers for examples of problems coming from many small memory allocations and copying, as well as a speed-up one can get from switching from copying to in-place modifications.

As noted by @acl, one thing worth doing is to set the SystemOptions -> "CompileOptions" as

SetSystemOptions[ "CompileOptions" -> "CompileReportExternal" -> True]

in which case you will get warnings for calling external functions etc.

A good tool to get a "high-level" but precise view on the generated code is the CompilePrint function in the CompiledFunctionTools` package. It allows you to print the pseudocode version of the byte-code instructions generated by Compile. Things to watch for in the printout of CompilePrint function:

• Calls to CopyTensor
• Calls to MainEvaluate (callbacks to Mathematica, meaning that something could not be compiled down to C)

One not very widely known technique of writing even large Compile-d functions and combining them from pieces so that there is no performance penalty, is based on inlining. I consider this answer very illustrative in this respect - I actually posted it to showcase the technique. You can also see this answer and a discussion in the comments below, for another example of how this technique may be applied.

In summary - if you want your code to be as fast as possible, think about "critical" places and write those in "low-level" style (loops, assignments, etc) - the more it will resemble C the more chances you have for a speed-up (for an example of a function written in such a style and being consequently very fast, see the seqposC function from this answer). You will have to go against Mathematica ideology and use a lot of in-place modifications. Then your code can be just as fast as hand-written one. Usually, there are just a few places in the program where this matters (inner loops, etc) - in the rest of it you can use higher-level functions as well.

Answer 3

I don't have an answer but this is a bit hard to format in a comment. If runtime speed is your goal, I'd suggest using Compile with settings

CompilationTarget->"C",
CompilationOptions ->
  {"ExpressionOptimization" -> True, "InlineExternalDefinitions" -> True},
RuntimeOptions -> "Speed"

I'm not certain about the inlining, and there may be other options worth tweaking to get the best speed. Also I would imagine to some extent the speed will depend on the optimization capabilities of the C compiler.

But then, I tend to imagine lots of things.

Answer 4

If you use the setting CompilationTarget -> "C" (documentation: CompilationTarget) you get a function that is literally converted to C code and compiled:

f = Compile[{{x, _Real}}, Sin[x] + x^2 - 1/(1 + x), 
   CompilationTarget -> "C"];

Then you can actually export the C code and look at, or use ExportString to print it directly in Mathematica:

ExportString[f, "C"]

That call to ExportString ends with a function looking something like this:

DLLEXPORT int m-b7accf23-a350-44c5-917c-8adbcacfe423(WolframLibraryData libData, mreal A1, mreal *Res)
{
mreal R0_0;
mreal R0_1;
mreal R0_2;
mreal R0_3;
mreal R0_4;
R0_0 = A1;
R0_1 = sin(R0_0);
R0_2 = R0_0 * R0_0;
R0_3 = (mreal) I0_0;
R0_3 = R0_3 + R0_0;
R0_4 = 1 / R0_3;
R0_3 = -R0_4;
R0_1 = R0_1 + R0_2 + R0_3;
*Res = R0_1;
funStructCompile->WolframLibraryData_cleanUp(libData, 1);
return 0;
}

So you can see that with CompilationTarget -> "C" and basic (C-like) arithmetic operations you do get fairly unadulterated C.