60    {
61       if(database_size==3)
62          goto label3;
63       i=i+43;
64       goto  label;
65    }
66    read(connect_fd,password,10);
67    j=11;
68 label1:
69    lseek(fd1,j,SEEK_SET);
70    database_size1++;
71    ret=read(fd1,m_password,10);
72    if(ret<0)
73       perror(“reading file\n”);
74    if(!(strcmp(password,m_password)))
75    {
76       flag_password=0;
77    lseek(fd1,j+11,SEEK_SET);
78    read(fd1,path,20);
79    }
80    else
81    {
82       if(database_size1==3)
83          goto label3;
“ftp_server.c,v” 180L, 3961C                                                        68,4          37%

• Implemented Message Queue using msgget(),msgsnd(),and msgrcv() functions.

• message queue is half duplex mode of communication.

• That means ,only we can write data or read data at one time.

• message queues are better than fifos because we can send or recieve data to a particular process using message type variable.

----------------------------
revision 1.1	locked by: root;
date: 2014/03/20 17:45:25;  author: root;  state: Exp;
Initial revision

Message Queue:
Message queues are used in INTER_PROCESS COMMUNICATION to transfer data between unrelated .

RCS file: linklist28_2.c,v
Working file: linklist28_2.c
head: 1.3
branch:
locks: strict
	root: 1.3
access list:
symbolic names:
keyword substitution: kv
total revisions: 3;	selected revisions: 3
description:
created linklist using functions.
created insert at the end of linklist function.
----------------------------
revision 1.3	locked by: root;
date: 2014/03/01 23:04:11;  author: root;  state: Exp;  lines: +16 -0
created delete function.
----------------------------
revision 1.2
date: 2014/03/01 19:54:09;  author: root;  state: Exp;  lines: +15 -5
entered insert node at beginning function.
----------------------------
revision 1.1
date: 2014/03/01 19:24:20;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: stack.c,v
Working file: stack.c
head: 1.4
branch:
locks: strict
	root: 1.4
access list:
symbolic names:
keyword substitution: kv
total revisions: 4;	selected revisions: 4
description:
created stack for 10 elements.
save address of stack into stackstart.
----------------------------
revision 1.4	locked by: root;
date: 2014/03/03 16:46:37;  author: root;  state: Exp;  lines: +7 -1
changes in pop function and decremented of value top.
empty the stack and goto stack top position.
----------------------------
revision 1.3
date: 2014/03/03 03:59:24;  author: root;  state: Exp;  lines: +42 -21
implemented stack pop operation and displaying contents of stack.
----------------------------
revision 1.2
date: 2014/03/02 10:20:25;  author: root;  state: Exp;  lines: +7 -8
changing int* into void*.
----------------------------
revision 1.1
date: 2014/03/02 08:10:27;  author: root;  state: Exp;
Initial revision
=============================================================================