UNIX environment advanced programming error table

The following errors were fixed in the second printing.

1. Page 413, third paragraph. if a signal is related to an expiring timer, it is sent to an arbitrary thread, not necessarily to the thread that scheduled the timer. hardware-related signals are usually delivered to the thread
   Generating the fault (FreeBSD 5.2.1 seems to depart from this is some cases, however). Look
   Here for some test programs that strate the behavior of signals with multithreaded processes.
2. Page 67, sentence before Section 3.7. The size is 2 GB, not 2 TB.
3. Page 523, Figure 15.26. The largest message we can send on FreeBSD 5.2.1 is 2048 bytes. The kernel limits this value to the maximum size in bytes allowed on a queue.
4. Page 367, Figure 11.6. pthread_cancel_push shocould be
   Pthread_cleanup_push.
5. Page 382, last sentence on page.
   Pthread_mutex_destroy shocould be pthread_cond_destroy.
6. Page 357, function prototype
   Pthread_create. The argument for the start routine is
   Void *, not a void.
7. Page 158, near bottom of page.
   Tempfile shocould be tmpfile.
8. Page 853, solution to exercise 1.3.
   Ptr shoshould be msg to make it consistent with the function prototype
   Perror shown earlier in the book.

The following errors were fixed in the third printing.

9. Page 194, function prototypes
   Setenv and unsetenv. These functions return-1 on error, which is more specific than simply a nonzero return value.
10. Page 306, Figure 10.4. The Corrigenda for the Single UNIX Specification added
    Abort and sockatmark to the list of reentrant functions.
11. Page 361, middle of page. The discussion
    Pthread_join has been cleaned up, making it clear which thread is placed in the detached state and that it is implementation-specific whether this function fails.
12. Page 365, Example at end of page. "nonzero" shocould be "zero ."
13. Page 367, middle of page. The behavior of implementations varies concerning whether cleanup handlers are called if a thread returns from its start routine.
14. Page 367, end of page. pthread_join for a detached thread might not fail in some implementations, so change "will" to "can ."
15. Page 374, middle of page. fh [idx]
    = Fp-> f_next shoshould be
    Fh [idx] = fp. actually, I shoshould apologize for this one. I 've written this logic (correctly) so many times that I have no good excuse for getting it wrong this time. same problem occurs again near
    The top of page 377.
16. Page 374, end of page. In the statement.
    Idx = HASH (fp) at the beginning
    Foo_find, fp is undefined at this point. The correct thing to do is to search every hash chain to find a matching ID. Same problem occurs again in the middle of page 377.
17. Page 391, function prototype
    Pthread_attr_setstack. Remove the const type qualifier.
18. Pages 414-415, Figure 12.16. Change the variable
    Wait to waitloc to allow compilation on some platforms.
19. Page 599, Figure 17.16. The variable
    Len shoshould be declared to be of type socklen_t.
20. Pages 849 and 851 (Figures B .3 and B .4).
    Snprintf and vsnprintf CILS shoshould specify one byte less than the size of the buffer to prevent overwriting the byte after the end of the buffer with a newline.

Here are the errors fixed in the same th printing:

21. Page 255, top of page. ac_flag shoshould be
    Ac_stat.
22. Page 14, first paragraph. the statement that all threads in a process share the same stacks is a little misleading: each thread executes on its own stack, although any thread can access the stack of the other threads in
    Process, because the address space is shared among the threads.
23. Page 701, last paragraph. Figure 15.8 shocould be Figure 15.19.