Scribd
Upload
483 views

Unix Network Programming Volume 2 PDF

Uploaded by

Aiden Aiden
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
483 views

Unix Network Programming Volume 2 PDF

Uploaded by

Aiden Aiden
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 92
UNIX NETWORK PROGRAMMING SECOND EDITION W a = ~, <> \Wellimplemented interpracess communications (IPC) are key to the performance af irwslly every non-trivial UNIX program. In UNIX Network Programming, Moiume 2, Second Edition, legendary UNIK expert W. Richart Stevens presents 8 comprebersive guide to every form of IPG, mluding message passing, synchronization, shared memory, and Remote Procedure Calls (RPC). you've read Stevens’ bes-stling first edition of UNIX Network Programming, this book expands is 1°C coverage by @ factor of five! You won't just. learn about IC "from the outside." You'll acwally create implenientations of Pesix message queues, read-weite locks, and semaphores, gaining an in-depth understanding of these capabilities you simply can't get anywhere else. ‘The book contains extensive new source cade—allcarcfully optimized snd available (on the Web. You'll even find 2 complete guide to meaSuring IPC performance with message passing bandwidth and latency programs, and thread and process synchronization programs. The better you understand IPC, the belter your UNIX software will run, ‘This Look contains all you need to know. ABOUT THE AUTHOR W. RICHARD STEVENS is author of UNIX Network Programming, Virst Ktion, ‘widely recognized as the classic text m UNIX networking and LINK Network Programming, Volume 1, Second dition, Ke is also author of Advanced Programming in the UNIX Environment and the TCPAP ftusirater Series, Stevens {san ackrowledged UNIX and networking expert, sought-after ‘instructor, and occasional consultant, PRENTICE HALL ‘Uppes Sale River. RS 07458 prec ppt cam Function protetype = Dool.t elmt_control (CLIENT “d, unsigned int requsl, char “pln; CLIENT “elmt create (const char *hat, unsigned Long prognum, ‘unsigned long veremum, const char protect); void elnt_deserey (chew cl) ine oor binaline fl ine oor _cata tint fil, door arse *ayp): Ane door exente(Door_server_proe “proc, void *eedie, int all: ine door ered deor_eredt ‘ed : Ant door tato( ine ff, door info *#fo); int door xetura(char ‘ditty, size_t datas, door desc ¢ ‘dowplt, size t mies); ine door revoke (ine fl) Beorereate proc *door_server_creste(Door create proc “proc): int door uabina(voia) 7 old exr dump(const char “fal, 7 void erx_magiconst char “ft, <0: a8 BeleeegRgeeeesiss void aur quiticonst char ‘ft, 3) 512 void exe ret (const char “fat. 01: on vote eer ayalconat char ‘fat, 0: 5 Ine femea (ine ff, ine omd, .. /* struct flock “ag */ Vy 198 int fmeaeint ff, stzvct stat “hyf); 8 key t ftek(conse char *pallneme, ime i) Ea int feruncateline fi, off ¢ lexgtht: a7 int maetowe crgt miles) id int mg_getaterngd e migdes, struct me attr tal: % ine mametléyingd © myles, const struct sigevent *nelfation): 9 nat maepaniconst char ‘namie, int ofiag, (* weet made, struct mqactr *ettr*/ 1+ % ine maunLlakiconst char *name) 7 Tne mage (ine mg, ine ond, aeruct seq ae 7m int maggot (key t fey, Sint ofl) 150 PILE ‘*popaniconst char “commund, const char ype): ls

You might also like