parameterized macros vs. functions

I've been asked the following:

Functions can often-but not always-be written as parametrized macros. Discuss what characteristics of a function would make it unsuitable as a macro.

I'm not really sure how to answer. I know parameterized macros can evaluate their arguments more than once, leading to unexpected results. And I know you can't have a pointer to a macro where you can have one to a pointer. Beyond that I'm confused as to what would make a function unsuitable as a macro.

Any suggestions would be greatly appreciated! Thanks a lot

T.

I'm not going to give you direct answers, but a few leading questions:

What do you think the effect on the code size with larger macros is? What difference is there in the generated code between a macro and a function?

How would you debug a multi-line macro solution?

What would you do if you want to add a tracing function that shows which source file and which line you are at when the trace is output? Is there a way to do this in a macro that is better than a function?

--
Mats

From the language point of view, you already mentioned the main differences between functions and macros, namely that macro arguments may get evaluated more than once and you can't have pointers to macros (because they don't have an address). A third one is that you can't "call" macros recursively and, more generally, you can't have forward references to other macros. Furthermore, macro parameters don't have a type specification and macros don't have a return value, but you can easily emulate both.

Mats' points are mostly consequences of today's machine designs and poor optimization techniques and may be obsolete in a few (hundred) years.

Greets,
Philip

Also consider what happens if there is an error in the macro.