C FAQs
C FAQs
Q: A:
long.
If you might need large values (above 32,767 or below -32,767), use
Otherwise, if space is very important (i.e. if there are large arrays or many structures), use short. Otherwise, use int. If well-defined overflow characteristics are important and negative values are not, or if you want to steer clear of sign-extension problems when manipulating bits or bytes, use one of the corresponding unsigned types. Although character types (especially unsigned char) can be used as ``tiny'' integers, doing so is sometimes more trouble than it's worth. The compiler will have to emit extra code to convert between char and int (making the executable larger), and unexpected sign extension can be troublesome. A similar space/time tradeoff applies when deciding between float and double. (Many compilers still convert all float values to double during expression evaluation.) None of the above rules apply if pointers to the variable must have a particular type. Base type Minimum size(bits) Char 8 Short 16 Int 16 32long Minimum Maximum value(signed) value(signed) -127 127 -32767 32767 -32767 32767 -2,147,483,647 2,147,483,647 Maximum value(unsigned) 255 65535 65535
4,294,967,295
Q: A:
go, it does take the position that the exact size of an object (i.e. in bits) is
an implementation detail. Most programs do not need precise control over these sizes; many programs that do try to achieve this control would be better off if they didn't. Type int is supposed to represent a machine's natural word size. It's the right type to use for most integer variables;
Q:
int16
Since C doesn't define sizes exactly, I've been using typedefs like
and int32. I can then define these typedefs to be int, short, long, etc. depending on what machine I'm using. That should solve everything, right?
A:
If you truly need control over exact type sizes, this is the right
approach. There remain several things to be aware of: There might not be an exact match on some machines. (There are, for example, 36-bit machines.) A typedef like int16 or int32 accomplishes nothing if its intended meaning is ``at least'' the specified size, because types int and long are already essentially defined as being ``at least 16 bits'' and ``at least 32 bits,'' respectively. Typedefs will never do anything about byte order problems (e.g. if you're trying to interchange data or conform to externally-imposed storage layouts). You no longer have to define your own typedefs, because the Standard header <inttypes.h> contains a complete set.
Q: A:
What should the 64-bit type be on a machine that can support it?
The new C99 Standard specifies type long long as effectively being at
least 64 bits, and this type has been implemented by a number of compilers for some time. (Others have implemented extensions such as __longlong.) On the other hand, it's also appropriate to implement type short int as 16, int as 32, and long int as 64 bits, and some compilers do.
Q: A:
you probably want. The * in a pointer declaration is not part of the base type; it is part of the declarator containing the name being declared . The correct form is:
char *p1, *p2;
Q:
char *p;
I'm trying to declare a pointer and allocate some space for it, but it's
*p = malloc(10);
A: Q:
2. 3. 4.
{ printf("%d\n", i); }
A:
Q:
but the compiler gave me error messages. Can't a structure in C contain a pointer to itself?
A:
1. To fix this code, first give the structure a tag (e.g. ``struct node''). Then, declare the next field as a simple struct node *, or disentangle the typedef declaration from the structure definition, or both. One corrected version would be: typedef struct node { node *next; } *NODEPTR; node *NODEPTR; struct node { NODEPTR next; }; char *item; struct Or typedef struct char *item;
2.
Finally, here is a rearrangement incorporating both suggestions: struct node { }; char *item; typedef struct node *NODEPTR; struct node
*next;
Q: A: Q:
int f() {
What's the difference between const char *p, char const *p?
constant character (you can't change any pointed-to characters). char * const p declares a constant pointer to a (variable) character (i.e. you can't change the pointer).
A:
initialization of ``automatic aggregates'' (i.e. non-static local arrays, structures, or unions). You have four possible workarounds: If the array won't be written to or if you won't need a fresh copy during any subsequent calls, you can declare it static (or perhaps make it global). If the array won't be written to, you could replace it with a pointer:
f() { char *a = "Hello, world!"; }
You can always initialize local char * variables to point to string literals
If neither of the above conditions hold, you'll have to initialize the array by hand with strcpy when the function is called:
f() { char a[14]; strcpy(a, "Hello, world!"); }
Q: A:
char *p = malloc(10);
allowed in initializers only for automatic variables (that is, for local, non-static variables).
Q:
Why?
A: Q:
int i = 3; i = i++;
on several compilers. Some gave i the value 3, and some gave 4. Which compiler is correct?
A:
that neither i++ nor ++i is the same as i+1. If you want to increment i, use i=i+1, i+=1, i++, or ++i, not some combination. See also question)
Under C's integral promotion rules, the multiplication is carried out using int arithmetic, and the result may overflow or be truncated before being promoted and assigned to the long int left-hand side. Use an explicit cast on at least one of the operands to force long arithmetic:
long int c = (long int)a * b;
or perhaps
long int c = (long int)a * (long int)b;
Q:
{
work?
A:
by the compiler. In other words, str is a pointer (of type char *), and it is legal to assign to it.
A:
If you might need large values (tens of thousands), use long. Otherwise, if space is very important, use short. Otherwise, use int.
1.4:
What should the 64-bit type be on a machine that can support it?
A:
1.7:
A:
The best arrangement is to place each definition in some relevant .c file, with an external declaration in a header file.
A:
A:
Nothing.
1.14: I can't seem to define a linked list node which contains a pointer to itself.
A:
Structures in C can certainly contain pointers to themselves; the discussion and example in section 6.5 of K&R make this clear. Problems arise if an attempt is made to define (and use) a typedef in the midst of such a declaration; avoid this.
1.21: How do I declare an array of N pointers to functions returning pointers to functions returning pointers to char?
A:
char *(*(*a[N])())(); Using a chain of typedefs, or the cdecl program, makes these
declarations easier.
1.25: My compiler is complaining about an invalid redeclaration of a function, but I only define it once.
A:
A:
1.30: What am I allowed to assume about the initial values of variables which are not explicitly initialized?
A:
Uninitialized variables with "static" duration start out as 0, as if the programmer had initialized them. Variables with "automatic" duration, and dynamically-allocated memory, start out containing garbage (with the exception of calloc).
A:
A:
Function calls are not allowed in initializers for global or static variables.
1.32: What is the difference between char a[] = "string"; and char *p = "string"; ?
A:
The first declares an initialized and modifiable array; the second declares a pointer initialized to a not-necessarilymodifiable constant string.
A:
2.1:
What's the difference between struct x1 { ... }; and typedef struct { ... } x2; ?
A:
2.2:
A:
C is not C++.
2.3:
A:
2.4:
A:
One good way is to use structure pointers which point to structure types which are not publicly defined.
A:
2.6:
I came across some code that declared a structure with the last member an array of one element, and then did some tricky allocation to make it act like the array had several elements. Is this legal or portable?
A:
An official interpretation has deemed that it is not strictly conforming with the C Standard.
2.8:
A:
No.
2.10: Can I pass constant values to functions which accept structure arguments?
A:
A:
A:
2.13: Why does sizeof report a larger size than I expect for a structure type?
A:
2.14: How can I determine the byte offset of a field within a structure?
A:
A:
2.18: I have a program which works correctly, but dumps core after it finishes. Why?
A:
Check to see if main() is misdeclared, perhaps because a preceding structure type declaration is missing its trailing semicolon, causing main() to be declared as returning a structure. See also questions 10.9 and 16.4.
A:
In the original ANSI C, only the first-named member; in C99, using "designated initializers", yes, any member.
2.22: What's the difference between an enumeration and a set of preprocessor #defines?
A:
There is little difference. The C Standard states that enumerations are compatible with integral types.
A:
No.
Section 3. Expressions
3.1:
A:
The variable i is both modified and separately referenced in the same expression.
3.2:
Under my compiler, the code "int i = 7; printf("%d\n", i++ * i++);" prints 49. Regardless of the order of evaluation, shouldn't it print 56?
A:
The operations implied by the postincrement and postdecrement operators ++ and -- are performed at some time after the operand's former values are yielded and before the end of the expression, but not necessarily immediately after, or before other parts of the expression are evaluated.
3.3:
A:
3.3b: Here's a slick expression: "a ^= b ^= a ^= b". It swaps a and b without using a temporary.
A:
3.4:
A:
Operator precedence and explicit parentheses impose only a partial ordering on the evaluation of an expression, which does not generally include the order of side effects.
3.5:
A:
3.8:
A:
A point (at the end of a full expression, or at the ||, &&, ?:, or comma operators, or just before a function call) at which all side effects are guaranteed to be complete.
3.9:
So given a[i] = i++; we don't know which cell of a[] gets written to, but i does get incremented by one, right?
A:
Not necessarily! Once an expression or program becomes undefined, *all* aspects of it become undefined.
A:
++i adds one to i and "returns" the incremented value; i++ returns the prior, unincremented value.
3.12b: If I'm not using the value of the expression, should I use ++i or i++ to increment a variable?
A:
Since the two forms differ only in the value yielded, they are entirely equivalent when only their side effect is needed.
3.14: Why doesn't the code "int a = 1000, b = 1000; long int c = a * b;" work?
A:
A:
No.
Section 4. Pointers
4.2:
A:
4.3:
A:
4.5:
I want to use a char * pointer to step over some ints. Why doesn't "((int *)p)++;" work?
A:
In C, a cast operator is a conversion operator, and by definition it yields an rvalue, which cannot be assigned to, or incremented with ++.
4.8:
I have a function which accepts, and is supposed to initialize, a pointer, but the pointer in the caller remains unchanged.
A:
The called function probably altered only the passed copy of the pointer.
4.9:
Can I use a void ** pointer as a parameter so that a function can accept a generic pointer by reference?
A:
Not portably.
4.10: I have a function which accepts a pointer to an int. How can I pass a constant like 5 to it?
A:
In C99, you can use a "compound literal". Otherwise, declare a temporary variable.
A:
4.12: I've seen different syntax used for calling functions via pointers.
A:
The extra parentheses and explicit * are now officially optional, although some older implementations require them.
A:
See question 13.1, 8.6, or 19.25, depending on what you're trying to do.
5.1:
A:
For each pointer type, there is a special value -- the "null pointer" -- which is distinguishable from all other pointer values and which is not the address of any object or function.
5.2:
A:
A constant 0 in a pointer context is converted into a null pointer at compile time. A "pointer context" is an initialization, assignment, or comparison with one side a variable or expression of pointer type, and (in ANSI standard C) a function argument which has a prototype in scope declaring a parameter as being of pointer type. In other contexts (function arguments without prototypes, or in the variable part of variadic function calls) a constant 0 with an appropriate explicit cast is required.
5.3:
Is the abbreviated pointer comparison "if(p)" to test for nonnull pointers valid?
A:
Yes. The construction "if(p)" works, regardless of the internal representation of null pointers, because the compiler
essentially rewrites it as "if(p != 0)" and goes on to convert 0 into the correct null pointer.
5.4:
A:
NULL is simply a preprocessor macro, defined as a null pointer constant, typically 0 or ((void *)0), which is used (as a stylistic convention, in preference to unadorned 0's) to generate null pointers.
5.5:
How should NULL be defined on a machine which uses a nonzero bit pattern as the internal representation of a null pointer?
A:
The same as on any other machine: as 0. (The compiler makes the translation, upon seeing a 0, not the preprocessor; see also question 5.4.)
5.6:
If NULL were defined as "((char *)0)," wouldn't that make function calls which pass an uncast NULL work?
A:
Not in the most general case. (A cast might still required to tell the compiler which kind of null pointer is required, since it may be different from (char *)0.)
5.9:
should I use?
A:
5.10: But wouldn't it be better to use NULL, in case the value of NULL changes?
A:
5.12: I use the preprocessor macro "#define Nullptr(type) (type *)0" to help me build null pointers of the correct type.
A:
5.13: This is strange. NULL is guaranteed to be 0, but the null pointer is not?
A:
A "null pointer" is a language concept whose particular internal value does not matter. A null pointer is requested in source code with the character "0". "NULL" is a preprocessor macro, which is always #defined as 0 (or ((void *)0)).
A:
The fact that null pointers are represented both in source code, and internally to most machines, as zero invites unwarranted assumptions. The use of a preprocessor macro (NULL) may seem to suggest that the value could change some day, or on some weird machine.
5.15: I'm confused. I just can't understand all this null pointer stuff.
A:
A simple rule is, "Always use `0' or `NULL' for null pointers, and always cast them when they are used as arguments in function calls."
5.16: Given all the confusion surrounding null pointers, wouldn't it be easier simply to require them to be represented internally by zeroes?
A:
5.17: Seriously, have any actual machines really used nonzero null pointers?
A:
Machines manufactured by Prime, Honeywell-Bull, and CDC, as well as Symbolics Lisp Machines, have done so.
A:
It means that you've written, via a null pointer, to an invalid location. (See also question 16.8.)
6.1:
I had the definition char a[6] in one source file, and in another I declared extern char *a. Why didn't it work?
A:
The declaration extern char *a simply does not match the actual definition. Use extern char a[].
6.2:
A:
Not at all. Arrays are not pointers. A reference like x[3] generates different code depending on whether x is an array or a pointer.
6.3:
A:
An lvalue of type array-of-T which appears in an expression decays into a pointer to its first element; the type of the
resultant pointer is pointer-to-T. So for an array a and pointer p, you can say "p = a;" and then p[3] and a[3] will access the same element.
6.4:
Why are array and pointer declarations interchangeable as function formal parameters?
A:
6.7:
A:
6.8:
A:
Arrays automatically allocate space which is fixed in size and location; pointers are dynamic.
6.9:
A:
An array name is "constant" in that it cannot be assigned to, but an array is *not* a pointer.
A:
Yes, array subscripting is commutative in C. The array subscripting operation a[e] is defined as being identical to *((a)+(e)).
A:
The type.
A:
Usually, you don't want to. Consider using a pointer to one of the array's elements instead.
A:
6.15: How can I declare local arrays of a size matching a passed-in array?
A:
A:
The traditional solution is to allocate an array of pointers, and then initialize each pointer to a dynamically-allocated "row." See the full list for code samples.
A:
Not if the pointer points outside of the block of memory it is intended to access.
6.18: My compiler complained when I passed a two-dimensional array to a function expecting a pointer to a pointer.
A:
The rule by which arrays decay into pointers is *not* applied recursively. An array of arrays (i.e. a two-dimensional array in C) decays into a pointer to an array, not a pointer to a pointer.
6.19: How do I write functions which accept two-dimensional arrays when the width is not known at compile time?
A:
6.20: How can I use statically- and dynamically-allocated multidimensional arrays interchangeably when passing them to
functions?
A:
There is no single perfect method, but see the full list for some ideas.
6.21: Why doesn't sizeof properly report the size of an array which is a parameter to a function?
A:
The sizeof operator reports the size of the pointer parameter which the function actually receives.
7.1:
A:
The pointer variable answer has not been set to point to any valid storage. The simplest way to correct this fragment is to use a local array, instead of a pointer.
7.2:
I can't get strcat() to work. I tried "char *s3 = strcat(s1, s2);" but I got strange results.
A:
Again, the main problem here is that space for the concatenated result is not properly allocated.
7.3:
But the man page for strcat() says that it takes two char *'s as arguments. How am I supposed to know to allocate things?
A:
In general, when using pointers you *always* have to consider memory allocation, if only to make sure that the compiler is doing it for you.
7.3b: I just tried the code "char *p; strcpy(p, "abc");" and it worked. Why didn't it crash?
A:
A:
Only enough memory to hold the pointer itself, not any memory for the pointer to point to.
7.5a: I have a function that is supposed to return a string, but when it returns to its caller, the returned string is garbage.
A:
Make sure that the pointed-to memory is properly (i.e. not locally) allocated.
A:
Return a pointer to a statically-allocated buffer, a buffer passed in by the caller, or memory obtained with malloc().
7.6:
Why am I getting "warning: assignment of pointer from integer lacks a cast" for calls to malloc()?
A:
7.7:
Why does some code carefully cast the values returned by malloc to the pointer type being allocated?
A:
7.7c: In a call to malloc(), what does an error like "Cannot convert `void *' to `int *'" mean?
A:
7.8:
Why does so much code leave out the multiplication by sizeof(char) when allocating strings?
A:
A:
7.14: I've heard that some operating systems don't actually allocate malloc'ed memory until the program tries to use it. Is this legal?
A:
7.16: I'm allocating a large array for some numeric work, but malloc() is acting strangely.
A:
Make sure the number you're trying to pass to malloc() isn't bigger than a size_t can hold.
7.17: I've got 8 meg of memory in my PC. Why can I only seem to malloc 640K or so?
A:
Under the segmented architecture of PC compatibles, it can be difficult to use more than 640K with any degree of transparency. See also question 19.23.
A:
Make sure you aren't using more memory than you malloc'ed, especially for strings (which need strlen(str) + 1 bytes).
7.20: You can't use dynamically-allocated memory after you free it, can you?
A:
No. Some early documentation implied otherwise, but the claim is no longer valid.
A:
C's pass-by-value semantics mean that called functions can never permanently change the values of their arguments.
7.22: When I call malloc() to allocate memory for a local pointer, do I have to explicitly free() it?
A:
Yes.
7.23: When I free a dynamically-allocated structure containing pointers, do I also have to free each subsidiary pointer?
A:
Yes.
A:
7.25: Why doesn't my program's memory usage go down when I free memory?
A:
Most implementations of malloc/free do not return freed memory to the operating system.
A:
7.27: So can I query the malloc package to find out how big an allocated block is?
A:
Not portably.
A:
ANSI C sanctions this usage, although several earlier implementations do not support it.
A:
calloc() takes two arguments, and initializes the allocated memory to all-bits-0.
A:
alloca() allocates memory which is automatically freed when the function which called alloca() returns. alloca() cannot be written portably, is difficult to implement on machines without a stack, and fails under certain conditions if implemented simply.
8.1:
A:
8.2:
Why won't the test if(string == "value") correctly compare string against the value?
A:
8.3:
A:
Strings are arrays, and you can't assign arrays directly. Use strcpy() instead.
8.6:
How can I get the numeric (character set) value corresponding to a character?
A:
8.9:
A:
9.1:
A:
There's no one right answer; see the full list for some discussion.
9.2:
A:
When a Boolean value is generated by a built-in operator, it is guaranteed to be 1 or 0. (This is *not* true for some library routines such as isalpha.)
9.3:
A:
10.2: I've got some cute preprocessor macros that let me write C code that looks more like Pascal. What do y'all think?
A:
Bleah.
A:
There is no good answer to this question. The best all-around solution is probably to forget about using a macro.
A:
/* (no trailing ;) */
A:
Header files (also called ".h files") should generally contain common declarations and macro, structure, and typedef definitions, but not variable or function definitions.
A:
10.8a: What's the difference between #include <> and #include "" ?
A:
Roughly speaking, the <> syntax is for Standard headers and "" is for project headers.
10.8b: What are the complete rules for header file searching?
A:
The exact behavior is implementation-defined; see the full list for some discussion.
10.9: I'm getting strange syntax errors on the very first declaration in a file, but it looks fine.
A:
Perhaps there's a missing semicolon at the end of the last declaration in the last header file you're #including.
10.10b: I'm #including the header file for a function, but the linker keeps saying it's undefined.
A:
A:
10.12: How can I construct preprocessor #if expressions which compare strings?
A:
You can't do it directly; try #defining several manifest constants and implementing conditionals on those.
A:
No.
10.14: Can I use an #ifdef in a #define line, to define something two different ways?
A:
No.
A:
Unfortunately, no.
A:
10.18: How can I preprocess some code to remove selected conditional compilations, without preprocessing everything?
A:
A:
If the compiler documentation is unhelpful, try extracting printable strings from the compiler or preprocessor executable.
10.20: I have some old code that tries to construct identifiers with a macro like "#define Paste(a, b) a/**/b", but it doesn't work any more.
A:
10.22: What does the message "warning: macro replacement within a string literal" mean?
A:
10.23-4:
A:
10.25: I've got this tricky preprocessing I want to do and I can't figure out a way to do it.
A:
10.26: How can I write a macro which takes a variable number of arguments?
A:
Here is one popular trick. Note that the parentheses around printf's argument list are in the macro call, not the definition.
A:
In 1983, the American National Standards Institute (ANSI) commissioned a committee to standardize the C language. Their work was ratified as ANS X3.159-1989, and has since been adopted as ISO/IEC 9899:1990, and later amended.
A:
Copies are available electronically from ansi.com, from ANSI in New York, or from Global Engineering Documents in Englewood, CO, or from any national standards body, or from ISO in Geneva, or republished within one or more books. See the unabridged list for details.
A:
A:
You have mixed the new-style prototype declaration "extern int func(float);" with the old-style definition "int func(x) float x;". "Narrow" types are treated differently according to which syntax is used. This problem can be fixed by avoiding narrow types, or by using either new-style (prototype) or old-style syntax consistently.
A:
Doing so is currently legal, for most argument types (see question 11.3).
11.5: Why does the declaration "extern int f(struct x *p);" give me a warning message?
A:
A structure declared (or even mentioned) for the first time within a prototype cannot be compatible with other structures declared in the same source file.
11.8: Why can't I use const values in initializers and array dimensions?
A:
11.8b: If you can't modify string literals, why aren't they defined as being arrays of const characters?
A:
11.9: What's the difference between "const char *p" and "char * const p"?
A:
The former declares a pointer to a constant character; the latter declares a constant pointer to a character.
11.10: Why can't I pass a char ** to a function which expects a const char **?
A:
The rule which permits slight mismatches in qualified pointer assignments is not applied recursively.
A:
11.12b: Can I declare main() as void, to shut off these annoying "main returns no value" messages?
A:
No.
A:
11.14a: I believe that declaring void main() can't fail, since I'm calling exit() instead of returning.
A:
It doesn't matter whether main() returns or not, the problem is that its caller may not even be able to *call* it correctly.
A:
Yes.
11.15: The book I've been using always uses void main().
A:
It's wrong.
11.16: Is exit(status) truly equivalent to returning the same status from main()?
A:
11.17: How do I get the ANSI "stringizing" preprocessing operator `#' to stringize the macro's value instead of its name?
A:
You can use a two-step #definition to force a macro to be expanded as well as stringized.
11.18: What does the message "warning: macro replacement within a string literal" mean?
A:
Some pre-ANSI compilers/preprocessors expanded macro parameters even inside string literals and character constants.
11.19: I'm getting strange syntax errors inside lines I've #ifdeffed out.
A:
Under ANSI C, #ifdeffed-out text must still consist of "valid preprocessing tokens." This means that there must be no newlines inside quotes, and no unterminated comments or quotes (i.e. no single apostrophes).
A:
The #pragma directive provides a single, well-defined "escape hatch" which can be used for extensions.
A:
A:
Yes, in ANSI C.
A:
A:
memmove() offers guaranteed behavior if the source and destination arguments overlap.
A:
11.27: Why does the ANSI Standard place limits on the length and casesignificance of external identifiers?
A:
The problem is older linkers which cannot be forced (by mere words in a Standard) to upgrade.
11.29: My compiler is rejecting the simplest possible test programs, with all kinds of syntax errors.
A:
11.30: Why are some ANSI/ISO Standard library functions showing up as undefined, even though I've got an ANSI compiler?
A:
11.31: Does anyone have a tool for converting old-style C programs to ANSI C, or for automatically generating prototypes?
A:
11.32: Why won't frobozz-cc, which claims to be ANSI compliant, accept this code?
A:
Are you sure that the code being rejected doesn't rely on some non-Standard extension?
11.33: What's the difference between implementation-defined, unspecified, and undefined behavior?
A:
If you're writing portable code, ignore the distinctions. Otherwise, see the full list.
A:
The Standard talks about three kinds of conformance: conforming programs, strictly conforming programs, and conforming implementations. (See the full list for definitions.)
11.34: I'm appalled that the ANSI Standard leaves so many issues undefined.
A:
11.35: I just tried some allegedly-undefined code on an ANSI-conforming compiler, and got the results I expected.
A:
A compiler may do anything it likes when faced with undefined behavior, including doing what you expect.
12.1: What's wrong with the code "char c; while((c = getchar()) != EOF) ..."?
A:
A:
12.2: Why won't the code "while(!feof(infp)) { fgets(buf, MAXLINE, infp); fputs(buf, outfp); }" work?
A:
12.4: My program's prompts and intermediate output don't always show up on the screen.
A:
It's best to use an explicit fflush(stdout) whenever output should definitely be visible.
12.5: How can I read one character at a time, without waiting for the RETURN key?
A:
A:
"%%".
12.9: How can printf() use %f for type double, if scanf() requires %lf?
A:
C's "default argument promotions" mean that values of type float are promoted to double.
12.9b: What printf format should I use for a typedef when I don't know the underlying type?
A:
Use a cast to convert the value to a known type, then use the printf format matching that type.
A:
12.11: How can I print numbers with commas separating the thousands?
A:
A:
12.12b: Why *does* the call "char s[30]; scanf("%s", s);" work?
A:
What scanf() needs is pointers, and arrays are always passed to functions as pointers. See question 6.3.
A:
Unlike printf(), scanf() uses %lf for double, and %f for float.
A:
You can't.
12.17: When I read numbers from the keyboard with scanf "%d\n", it seems to hang until I type one extra line of input.
A:
12.18a: I'm reading a number with scanf %d and then a string with
A:
12.19: I'm re-prompting the user if scanf() fails, but sometimes it seems to go into an infinite loop.
A:
scanf() tends to "jam" on bad input since it does not discard it.
12.20: Why does everyone say not to use scanf()? What should I use instead?
A:
scanf() has a number of problems. Usually, it's easier to read entire lines and then interpret them.
12.21: How can I tell how much destination buffer space I'll need for an arbitrary sprintf call? How can I avoid overflowing the destination buffer with sprintf()?
A:
A:
A:
Don't worry about it. It is only meaningful for a program to inspect the contents of errno after an error has been reported.
A:
fgetpos() and fsetpos() use a special typedef which may allow them to work with larger files than ftell() and fseek().
12.26a: Will fflush(stdin) flush unread characters from the standard input stream?
A:
No.
A:
It depends on what you're trying to do; see the full list for details. (But first see question 12.20.)
A:
12.30: I'm trying to update a file in place, by using fopen mode "r+", but it's not working.
A:
A:
Use freopen().
12.34: Once I've used freopen(), how can I get the original stream back?
A:
A:
You could write your own printf variant which printed everything twice. See question 15.5.
A:
A:
A:
13.5: Why do some versions of toupper() act strangely if given an upper-case letter?
A:
Older versions of toupper() and tolower() did not always work as expected in this regard.
A:
Try strtok().
A:
A:
You'll have to write a "helper" comparison function which takes two generic pointer arguments, converts them to char **, and dereferences them, yielding char *'s which can be usefully compared.
13.9: Now I'm trying to sort an array of structures, but the compiler is complaining that the function is of the wrong type for qsort().
A:
The comparison function must be declared as accepting "generic pointers" (const void *) which it then converts to structure pointers.
A:
Algorithms like insertion sort and merge sort work well, or you can keep the list in order as you build it.
13.11: How can I sort more data than will fit in memory?
A:
You want an "external sort"; see the full list for details.
A:
A:
The ANSI mktime() function converts a struct tm to a time_t. No standard routine exists to parse strings.
A:
The ANSI/ISO Standard C mktime() and difftime() functions provide some (limited) support for both problems.
A:
A:
(int)((double)rand() / ((double)RAND_MAX + 1) * N)
13.17: Each time I run my program, I get the same sequence of numbers
A:
You can call srand() to seed the pseudo-random number generator with a truly random initial value.
13.18: I need a random true/false value, so I'm just taking rand() % 2, but it's alternating 0, 1, 0, 1, 0...
A:
13.20: How can I generate random numbers with a normal or Gaussian distribution?
A:
13.25: I get errors due to library functions being undefined even though I #include the right header files.
A:
You may have to explicitly ask for the correct libraries to be searched.
13.26: I'm still getting errors due to library functions being undefined, even though I'm requesting the right libraries.
A:
13.28: What does it mean when the linker says that _end is undefined?
A:
You generally get that message only when other symbols are undefined, too.
A:
14.1: When I set a float variable to 3.1, why is printf printing it as 3.0999999?
A:
Most computers use base 2 for floating-point numbers, and many fractions (including 0.1 decimal) are not exactly representable in base 2.
A:
Make sure that you have #included <math.h>, and correctly declared other functions returning double.
A:
14.4a: My floating-point calculations are acting strangely and giving me different answers on different machines.
A:
First, see question 14.2 above. If the problem isn't that simple, see the full list for a brief explanation, or any good programming book for a better one.
14.5: What's a good way to check for "close enough" floating-point equality?
A:
The best way is to use an accuracy threshold which is relative to the magnitude of the numbers being compared.
A:
A:
A:
14.9: How do I test for IEEE NaN and other special values?
A:
There is not yet a portable way, but see the full list for ideas.
A:
It is straightforward to define a simple structure and some arithmetic functions to manipulate them.
14.13: I'm having trouble with a Turbo C program which crashes and says something like "floating point formats not linked."
A:
You may have to insert a dummy call to a floating-point library function to force loading of floating-point support.
15.1: I heard that you have to #include <stdio.h> before calling printf(). Why?
A:
15.2: How can %f be used for both float and double arguments in printf()?
A:
In variable-length argument lists, types char and short int are promoted to int, and float is promoted to double.
15.3: Why don't function prototypes guard against mismatches in printf's arguments?
A:
Function prototypes do not provide any information about the number and types of variable arguments.
15.4: How can I write a function that takes a variable number of arguments?
A:
15.5: How can I write a function that takes a format string and a variable number of arguments, like printf(), and passes them to printf() to do most of the work?
A:
15.6: How can I write a function analogous to scanf(), that calls scanf() to do most of the work?
A:
15.8: How can I discover how many arguments a function was actually called with?
A:
Any function which takes a variable number of arguments must be able to determine *from the arguments' values* how many of them there are.
15.9: My compiler isn't letting me declare a function that accepts *only* variable arguments.
A:
A:
Because the "default argument promotions" apply in variablelength argument lists, you should always use va_arg(argp, double).
A:
Use a typedef.
15.12: How can I write a function which takes a variable number of arguments and passes them to some other function ?
A:
15.13: How can I call a function with an argument list built up at run time?
A:
You can't.
16.1b: I'm getting baffling syntax errors which make no sense at all, and it seems like large chunks of my program aren't being compiled.
A:
A:
A:
Look for very large, local arrays. (See also questions 11.12b, 16.4, 16.5, and 18.4.)
16.4: I have a program that seems to run correctly, but then crashes as it's exiting.
A:
16.5: This program runs perfectly on one machine, but I get weird results on another.
A:
16.6: Why does the code "char *p = "hello, world!"; p[0] = 'H';" crash?
A:
String literals are not modifiable, except (in effect) when they are used as array initializers.
A:
It generally means that your program tried to access memory it shouldn't have, invariably as a result of stack corruption or improper pointer use.
A:
There is no one "best style," but see the full list for a few suggestions.
A:
Not particularly.
A:
A:
They're part of a trick which allows prototypes to be turned off for a pre-ANSI compiler.
17.5: I came across some code that puts a (void) cast before each call to printf(). Why?
A:
A:
It's a naming convention which encodes information about a variable's type in its name.
17.9: Where can I get the "Indian Hill Style Guide" and other coding standards?
A:
17.10: Some people say that goto's are evil and that I should never use them. Isn't that a bit extreme?
A:
18.1: I'm looking for C development tools (cross-reference generators, code beautifiers, etc.).
A:
A:
A:
18.4: I just typed in this program, and it's acting strangely. Can you see anything wrong with it?
A:
A:
A:
Not really. A good compiler may match most of lint's diagnostics; few provide all.
A:
18.9b: Where can I find some good code examples to study and learn from?
A:
A:
There are far too many books on C to list here; the full list contains a few pointers.
A:
A:
A:
A:
A:
18.15c: Where are some collections of useful code fragments and examples?
A:
A:
18.16: Where and how can I get copies of all these freely distributable programs?
A:
See the regular postings in the comp.sources.unix and comp.sources.misc newsgroups, or the full version of this list, for information.
19.1: How can I read a single character from the keyboard without waiting for the RETURN key?
A:
19.2: How can I find out how many characters are available for reading, or do a non-blocking read?
A:
19.3: How can I display a percentage-done indication that updates itself in place, or show one of those "twirling baton" progress indicators?
A:
19.4: How can I clear the screen, or print text in color, or move the cursor?
A:
19.5: How do I read the arrow keys? What about function keys?
A:
Such things depend on the keyboard, operating system, and library you're using.
A:
A:
It's system-dependent.
A:
A:
A:
Use inport() and outport() functions, or memory-mapped I/O (see question 19.25).
A:
A:
A:
You can try the access() or stat() functions. Otherwise, the only guaranteed and portable way is to try opening the file.
19.12: How can I find out the size of a file, prior to reading it in?
A:
You might be able to get an estimate using stat() or fseek/ftell (but see the full list for caveats).
A:
Try stat().
19.13: How can a file be shortened in-place without completely clearing or rewriting it?
A:
A:
19.15: How can I recover the file name given an open file descriptor?
A:
This problem is, in general, insoluble. It is best to remember the names of files yourself as you open them
A:
A:
Open the source and destination files and copy a character or block at a time, or see question 19.27.
A:
A:
19.18: How can I increase the allowable number of simultaneously open files?
A:
A:
A:
Your operating system may provide a routine which returns this information.
A:
19.24: What does the error message "DGROUP exceeds 64K" mean?
A:
A:
A:
Use system().
19.30: How can I invoke another program and trap its output?
A:
A:
argv[0] may contain all or part of the pathname. You may be able to duplicate the command language interpreter's search path logic to locate the executable.
19.32: How can I automatically locate a program's configuration files in the same directory as the executable?
A:
A:
19.36: How can I read in an object file and jump to locations in it?
A:
19.37: How can I implement a delay, or time a user's response, with sub-second resolution?
A:
A:
Use signal().
A:
A:
These questions have more to do with the networking facilities you have available than they do with C.
19.40b: How do I... Use BIOS calls? Write ISR's? Create TSR's?
A:
19.40c: I'm trying to compile a program in which "union REGS" and int86() are undefined.
A:
A:
19.41: But I can't use all these nonstandard, system-dependent functions, because my program has to be ANSI compatible!
A:
That's an impossible requirement. Any real program requires at least a few services which ANSI doesn't define.
A:
Either pass pointers to several locations which the function can fill in, or have the function return a structure containing the desired values.
A:
20.5: How can I write data files which can be read on other machines with different data formats?
A:
A:
The most straightforward thing to do is to maintain a correspondence table of names and function pointers.
A:
Use arrays of char or int, with a few macros to access the desired bit at the proper index.
20.9: How can I determine whether a machine's byte order is big-endian or little-endian?
A:
A:
You can write code using pointers or unions; see the full list for details.
A:
Internally, integers are already in binary. During I/O, you may be able to select a base.
20.11: Can I use base-2 constants (something like 0b101010)? Is there a printf() format for binary?
A:
20.12: What is the most efficient way to count the number of bits which are set in an integer?
A:
Many "bit-fiddling" problems like this one can be sped up and streamlined using lookup tables.
A:
20.14: Are pointers really faster than arrays? How much do function calls slow things down?
A:
Precise answers to these and many similar questions depend on the processor and compiler in use.
20.15b: People claim that optimizing compilers are good, but mine can't even replace i/=2 with a shift.
A:
A:
A:
Not directly.
20.18: Is there a way to have non-constant case labels (i.e. ranges or arbitrary expressions)?
A:
No.
A:
Yes.
20.20: Why don't C comments nest? Are they legal inside quoted strings?
A:
C comments don't nest because PL/I's comments don't either. The character sequences /* and */ are not special within doublequoted strings.
A:
A:
A:
It is a macro which documents an assumption being made by the programmer; it terminates the program if the assumption is violated.
20.25: How can I call FORTRAN (C++, BASIC, Pascal, Ada, LISP) functions from C?
A:
The answer is entirely dependent on the machine and the specific calling sequences of the various compilers in use.
A:
Several freely distributable programs are available, namely ptoc, p2c, and f2c. See the full list for details.
A:
20.28: I need to compare two strings for close, but not necessarily exact, equality.
A:
A:
A mapping of strings (or other data structures) to integers, for easier searching.
20.31: How can I find the day of the week given the date?
A:
A:
No.
20.34: How do you write a program which produces its own source code as output?
A:
Here's one:
char*s="char*s=%c%s%c;main(){printf(s,34,s,34);}"; main(){printf(s,34,s,34);}
A:
It's a devastatingly devious way of unrolling a loop. See the full list for details.
A:
It was reserved to allow functions with multiple, differentlynamed entry points, but it has been withdrawn.
A:
C was derived from B, which was inspired by BCPL, which was a simplification of CPL.
A:
A:
An "lvalue" denotes an object that has a location; an "rvalue" is any expression that has a value.
1.
What will print out? main() { char *p1=name; char *p2; p2=(char*)malloc(20); memset (p2, 0, 20); while(*p2++ = *p1++); printf(%sn,p2); } Answer:empty string.
2.
What will be printed as the result of the operation below: main() { int x=20,y=35; x=y++ + x++; y= ++y + ++x; printf(%d%dn,x,y); } Answer : 5794
3.
What will be printed as the result of the operation below: main() { int x=5; printf(%d,%d,%dn,x,x< <2,x>>2); } Answer: 5,20,1
4.
What will be printed as the result of the operation below: #define swap(a,b) a=a+b;b=a-b;a=a-b; void main() { int x=5, y=10; swap (x,y); printf(%d %dn,x,y); swap2(x,y); printf(%d %dn,x,y); } int swap2(int a, int b) { int temp; temp=a; b=a; a=temp; return 0; } Answer: 10, 5 10, 5
5.
What will be printed as the result of the operation below: main() { char *ptr = Cisco Systems; *ptr++; printf(%sn,ptr);
What will be printed as the result of the operation below: main() { char s1[]=Cisco; char s2[]= systems; printf(%s,s1); } Answer: Cisco
7.
What will be printed as the result of the operation below: main() { char *p1; char *p2; p1=(char *)malloc(25); p2=(char *)malloc(25); strcpy(p1,Cisco); strcpy(p2,systems); strcat(p1,p2); printf(%s,p1); } Answer: Ciscosystems
8.
Answer: all the functions in the file1.c can access the variable.
10. WHat
#define TRUE 0 // some code while(TRUE) { // some code } Answer: This will not go into the loop as TRUE is defined as 0.
11. What
int x; int modifyvalue() { return(x+=10); } int changevalue(int x) { return(x+=1); } void main() { int x=10; x++; changevalue(x); x++; modifyvalue(); printf("First output:%dn",x); x++; changevalue(x); printf("Second output:%dn",x); modifyvalue(); printf("Third output:%dn",x); } Answer: 12 , 13 , 13
12. What
main() { int x=10, y=15; x = x++; y = ++y; printf(%d %dn,x,y); } Answer: 11, 16
13. What
main() { int a=0; if(a==0) printf(Cisco Systemsn); printf(Cisco Systemsn); } Answer: Two lines with Cisco Systems will be printed.