C test

2. Write the 'standard' MIN macro. That is, a macro that takes two arguments and returns the smaller of the two arguments.

#define MIN(A,B) ((A) <= (B) ? (A) : (B))

1. Using the #define statement, how would you declare a manifest constant that returns the number of seconds in a year? Disregard leap years in your answer.

#define SECONDS_PER_YEAR (60UL * 60UL * 24UL * 365UL)

5. Using the variable a, write down definitions for the following: (a) An integer (b) A pointer to an integer (c) A pointer to a pointer to an integer (d) An array of ten integers (e) An array of ten pointers to integers (f) A pointer to an array of ten integers (g) A pointer to a function that takes an integer as an argument and returns an integer (h) An array of ten pointers to functions that take an integer argument and return an integer.

(a) int a; // An integer (b) int *a; // A pointer to an integer (c) int **a; // A pointer to a pointer to an integer (d) int a[10]; // An array of 10 integers (e) int *a[10]; // An array of 10 pointers to integers (f) int (*a)[10]; // A pointer to an array of 10 integers (g) int (*a)(int); // A pointer to a function a that takes an integer argument and returns an integer (h) int (*a[10])(int); // An array of 10 pointers to functions that take an integer argument and return an integer

9. Embedded systems always require the user to manipulate bits in registers or variables. Given an integer variable a, write two code fragments. The first should set bit 3 of a. The second should clear bit 3 of a. In both cases, the remaining bits should be unmodified.

(c) Use #defines and bit masks. This is a highly portable method, and is the one that should be used. My optimal solution to this problem would be: #define BIT3 (0x1 << 3) static int a; void set_bit3(void) { a |= BIT3; } void clear_bit3(void) { a &= ~BIT3; }

3. What is the purpose of the preprocessor directive #error?

?

8. What does the keyword volatile mean? Give three different examples of its use.

A volatile variable is one that can change unexpectedly. Consequently, the compiler can make no assumptions about the value of the variable. In particular, the optimizer must be careful to reload the variable every time it is used instead of holding a copy in a register. Examples of volatile variables are: (a) Hardware registers in peripherals (e.g., status registers) (b) Non-stack variables referenced within an interrupt service routine. (c) Variables shared by multiple tasks in a multi-threaded application.

14. Although not as common as in non-embedded computers, embedded systems still do dynamically allocate memory from the heap. What are the problems with dynamic memory allocation in embedded systems?

Here, I expect the user to mention memory fragmentation, problems with garbage collection, variable execution time, etc. This topic has been covered extensively in ESP, mainly by Plauger. His explanations are far more insightful than anything I could offer here, so go and read those back issues! Having lulled the candidate into a sense of false security, I then offer up this tidbit:

13. Comment on the following code fragment? unsigned int zero = 0; unsigned int compzero = 0xFFFF; /*1's complement of zero */

On machines where an int is not 16 bits, this will be incorrect. It should be coded: unsigned int compzero = ~0;

(a) Can a parameter be both const and volatile? Explain your answer. (b) Can a pointer be volatile? Explain your answer. (c) What is wrong with the following function?: int square(volatile int *ptr) { return *ptr * *ptr; }

The answers are as follows: (a) Yes. An example is a read only status register. It is volatile because it can change unexpectedly. It is const because the program should not attempt to modify it. (b) Yes. Although this is not very common. An example is when an interrupt service routine modifies a pointer to a buffer. (c) This one is wicked. The intent of the code is to return the square of the value pointed to by *ptr. However, since *ptr points to a volatile parameter, the compiler will generate code that looks something like this: int square(volatile int *ptr) { int a,b; a = *ptr; b = *ptr; return a * b; }

10. Embedded systems are often characterized by requiring the programmer to access a specific memory location. On a certain project it is required to set an integer variable at the absolute address 0x67a9 to the value 0xaa55. The compiler is a pure ANSI compiler. Write code to accomplish this task.

int *ptr; ptr = (int *)0x67a9; *ptr = 0xaa55;

4. Infinite loops often arise in embedded systems. How does one code an infinite loop in C?

while(1) { ... }

7. What does the keyword const mean?

As soon as the interviewee says 'const means constant', I know I'm dealing with an amateur. Dan Saks has exhaustively covered const in the last year, such that every reader of ESP should be extremely familiar with what const can and cannot do for you. If you haven't been reading that column, suffice it to say that const means "read-only". Although this answer doesn't really do the subject justice, I'd accept it as a correct answer. (If you want the detailed answer, then read Saks' columns - carefully!). If the candidate gets the answer correct, then I'll ask him these supplemental questions: What do the following incomplete [2] declarations mean? const int a; int const a; const int *a; int * const a; int const * a const; The first two mean the same thing, namely a is a const (read-only) integer. The third means a is a pointer to a const integer (i.e., the integer isn't modifiable, but the pointer is). The fourth declares a to be a const pointer to an integer (i.e., the integer pointed to by a is modifiable, but the pointer is not). The final declaration declares a to be a const pointer to a const integer (i.e., neither the integer pointed to by a, nor the pointer itself may be modified). If the candidate correctly answers these questions, I'll be impressed. Incidentally, one might wonder why I put so much emphasis on const, since it is very easy to write a correctly functioning program without ever using it. There are several reasons: (a) The use of const conveys some very useful information to someone reading your code. In effect, declaring a parameter const tells the user about its intended usage. If you spend a lot of time cleaning up the mess left by other people, then you'll quickly learn to appreciate this extra piece of information. (Of course, programmers that use const, rarely leave a mess for others to clean up...) (b) const has the potential for generating tighter code by giving the optimizer some additional information. (c) Code that uses const liberally is inherently protected by the compiler against inadvertent coding constructs that result in parameters being changed that should not be. In short, they tend to have fewer bugs.

11. Interrupts are an important part of embedded systems. Consequently, many compiler vendors offer an extension to standard C to support interrupts. Typically, this new key word is __interrupt. The following code uses __interrupt to define an interrupt service routine. Comment on the code. __interrupt double compute_area(double radius) { double area = PI * radius * radius; printf("nArea = %f", area); return area; }

This function has so much wrong with it, it's almost tough to know where to start. (a) Interrupt service routines cannot return a value. If you don't understand this, then you aren't hired. (b) ISR's cannot be passed parameters. See item (a) for your employment prospects if you missed this. (c) On many processors / compilers, floating point operations are not necessarily re-entrant. In some cases one needs to stack additional registers, in other cases, one simply cannot do floating point in an ISR. Furthermore, given that a general rule of thumb is that ISRs should be short and sweet, one wonders about the wisdom of doing floating point math here. (d) In a similar vein to point (c), printf() often has problems with reentrancy and performance. If you missed points (c) & (d) then I wouldn't be too hard on you. Needless to say, if you got these two points, then your employment prospects are looking better and better.

15. Typedef is frequently used in C to declare synonyms for pre-existing data types. It is also possible to use the preprocessor to do something similar. For instance, consider the following code fragment: #define dPS struct s * typedef struct s * tPS; The intent in both cases is to define dPS and tPS to be pointers to structure s. Which method (if any) is preferred and why?

This is a very subtle question, and anyone that gets it right (for the right reason) is to be congratulated or condemned ("get a life" springs to mind). The answer is the typedef is preferred. Consider the declarations: dPS p1,p2; tPS p3,p4; The first expands to struct s * p1, p2; which defines p1 to be a pointer to the structure and p2 to be an actual structure, which is probably not what you wanted. The second example correctly defines p3 & p4 to be pointers.

16. C allows some appalling constructs. Is this construct legal, and if so what does this code do? int a = 5, b = 7, c; c = a+++b;

This question is intended to be a lighthearted end to the quiz, as, believe it or not, this is perfectly legal syntax. The question is how does the compiler treat it? Those poor compiler writers actually debated this issue, and came up with the "maximum munch" rule, which stipulates that the compiler should bite off as big a (legal) chunk as it can. Hence, this code is treated as: c = a++ + b; Thus, after this code is executed, a = 6, b = 7 & c = 12; If you knew the answer, or guessed correctly - then well done. If you didn't know the answer then I would not consider this to be a problem. I find the biggest benefit of this question is that it is very good for stimulating questions on coding styles, the value of code reviews and the benefits of using lint. Well folks, there you have it. That was my version of the C test. I hope you had as much fun doing it as I had writing it. If you think the test is a good test, then by all means use it in your recruitment. Who knows, I may get lucky in a year or two and end up being on the receiving end of my own work.

12. What does the following code output and why? void foo(void) { unsigned int a = 6; int b = -20; (a+b > 6) ? puts("> 6") : puts("<= 6"); }

This question tests whether you understand the integer promotion rules in C - an area that I find is very poorly understood by many developers. Anyway, the answer is that this outputs "> 6". The reason for this is that expressions involving signed and unsigned types have all operands promoted to unsigned types. Thus -20 becomes a very large positive integer and the expression evaluates to greater than 6. This is a very important point in embedded systems where unsigned data types should be used frequently (see reference 2). If you get this one wrong, then you are perilously close to not being hired.

6. What are the uses of the keyword static?

This simple question is rarely answered completely. Static has three distinct uses in C: (a) A variable declared static within the body of a function maintains its value between function invocations. (b) A variable declared static within a module [1], (but outside the body of a function) is accessible by all functions within that module. It is not accessible by functions within any other module. That is, it is a localized global. (c) Functions declared static within a module may only be called by other functions within that module. That is, the scope of the function is localized to the module within which it is declared. Most candidates get the first part correct. A reasonable number get the second part correct, while a pitiful number understand answer (c). This is a serious weakness in a candidate, since they obviously do not understand the importance and benefits of localizing the scope of both data and code.