1.6
date 2015.03.29.13.01.22; author ashish; state Exp;
branches;
next 1.5;

1.5
date 2015.03.29.12.57.43; author ashish; state Exp;
branches;
next 1.4;

1.4
date 2015.03.29.12.56.00; author ashish; state Exp;
branches;
next 1.3;

1.3
date 2015.03.29.12.54.16; author ashish; state Exp;
branches;
next 1.2;

1.2
date 2015.03.29.12.44.26; author ashish; state Exp;
branches;
next 1.1;

1.1
date 2015.03.29.12.40.43; author ashish; state Exp;
branches;
next ;

desc
@showing communication between two file using socket by using AF_UNIX
@

1.6
log
@in the similar way..the more client can be connected

1.5
log
@now giving the connect(),call at the client side so that the req of client that can be for read or write operation,can be listen at the side of server
at the server giving the accept() call,where it creat the copy of socket created above but that would be unnamed,so that created socket will coonected to that particular client for the req came from the client
@
text
@d28 1
@

1.4
log
@now giving a call for listen,by using listen()
so that the req from the client side can be listen by server
with this call a listen queue will be created
where the req from client will be taken
@
text
@d23 1
a23 1

1.3
log
@giving the socket family and its path
socket have been created
now giving the name to the socket by using bind(),call,now the socket in the server have been created as nameed socket
same socket have been created in the client side,but that s unmaed
@
text
@d23 1
a23 1

1.2
log
@includeng the header files
creating the socket by giving the socket(),where we are using the family AF_UNIX
@
text
@d12 1
a12 1

1.1
log
@Initial revision
@
text
@d12 1
a12 1

1.1
date 2015.03.24.13.44.13; author ashish; state Exp;
branches;
next ;

desc
@programme for orphan condition where the child terminates after the termination of parents,
where the child beacme the orphan
@

1.1
log
@Initial revision
@
text
@#include
#include
#include
#include

int main()

{

char *lines;
int n;
pid_t pid;
printf(“its starting\n”);
pid=fork();
printf(“pid->%d\n”,pid);

switch(pid)
{

case -1: printf (“error\n”);
break;

case 0: lines=”mmm child”;
printf(“child id is:%d\t %d\n”,getpid(),getppid());
n=7;
break;
//its orphan state because here child s going to be terminate after the parent….so the child would be orphan here..//

default: lines=”mm parent”;
printf(“parent id is :%d\n”,getppid());
n=5;
break;

}

for(;n>0;n–)
{
puts(lines);
printf(“%s:my id:%d \t my parent pid is %d\n”,lines,getpid(),getppid());

//sleep(1);
}//child became orphan and it will terminate with pid of init process//
exit(0);
}

@

1.3
date 2015.03.24.12.56.57; author ashish; state Exp;
branches;
next 1.2;

1.2
date 2015.03.24.12.54.03; author ashish; state Exp;
branches;
next 1.1;

1.1
date 2015.03.24.12.53.35; author ashish; state Exp;
branches;
next ;

desc
@programme to use atexit()
@

1.3
log
@now calling the atexit(),from the main(),where the function declared above will be passed as an argu to this function
checking the condition for succeding this func
then if it succed then the ext(),will be called and then final exit would be done

@

1.2
log
@declaring header files
now giving the defination of a function ,which will be called at the time of exit
@
text
@a2 1
///#include
@

1.1
log
@Initial revision
@
text
@d3 1
a3 1
//#include
@

1.7
date 2015.03.24.13.22.13; author ashish; state Exp;
branches;
next 1.6;

1.6
date 2015.03.24.13.20.46; author ashish; state Exp;
branches;
next 1.5;

1.5
date 2015.03.24.13.16.32; author ashish; state Exp;
branches;
next 1.4;

1.4
date 2015.03.24.13.14.02; author ashish; state Exp;
branches;
next 1.3;

1.3
date 2015.03.24.13.12.18; author ashish; state Exp;
branches;
next 1.2;

1.2
date 2015.03.24.13.11.36; author ashish; state Exp;
branches;
next 1.1;

1.1
date 2015.03.24.13.10.53; author ashish; state Exp;
branches;
next ;

desc
@@

1.7
log
@now we will use WEXITSTATUS(),where it willl fetch the code with which the child have been terminated.

@

1.6
log
@now using the fun WIFEXITED(),where it will take the variable in its argu to point where the exit code have been stored

@

1.5
log
@now taking a if(),condition which will run when the value return by the fork() would be greater than the 0,i.e for parent
where a c1pid variable of prototype pid_t have been declared which will get the return pid of child when it will terminate by giving the wait() to parent so that parent can wait,and child can terminate normally
@
text
@a16 1

@

1.4
log
@providing a for loop
where child and parent would execute in sequence by printing their mesages and pids
where pids will be obtained by using getpid(),getppid()
@
text
@a18 1

a21 1

@

1.3
log
@now doing a fork

where the child and parent would be created
now defining the exit code for each of parent and child
@
text
@a8 1

@

1.2
log
@declaring the header files
declaing the variabels
@
text
@a53 1

@

1.1
log
@Initial revision
@
text
@d54 1
@

1.5
date 2015.03.23.13.44.10; author ashish; state Exp;
branches;
next 1.4;

1.4
date 2015.03.23.13.42.03; author ashish; state Exp;
branches;
next 1.3;

1.3
date 2015.03.23.13.40.25; author ashish; state Exp;
branches;
next 1.2;

1.2
date 2015.03.23.13.39.13; author ashish; state Exp;
branches;
next 1.1;

1.1
date 2015.03.23.13.38.06; author ashish; state Exp;
branches;
next ;

desc
@programme for sorting the array by using selection sorting
@

1.5
log
@further process will be done .
displayoing the sorted list.

@

1.4
log
@checking the condition,if the element pointed by the first loop variable is greater thean the element pointed by the second one
if the condition will be true then,only the loop will run
@
text
@a24 1

@

1.3
log
@taking the 2 for loop
first will run from initial position to the end of the length
and second will run from the next pt from the first one up to the last of the length of the array
@
text
@a23 1

@

1.2
log
@taking a array
asking the user to enter the size of array
entering the element of array by the user
@
text
@a22 1

@

1.1
log
@Initial revision
@
text
@d22 1
a22 2

@

1.8
date 2015.03.23.13.36.10; author ashish; state Exp;
branches;
next 1.7;

1.7
date 2015.03.23.13.34.43; author ashish; state Exp;
branches;
next 1.6;

1.6
date 2015.03.23.13.33.26; author ashish; state Exp;
branches;
next 1.5;

1.5
date 2015.03.23.13.31.25; author ashish; state Exp;
branches;
next 1.4;

1.4
date 2015.03.23.13.29.32; author ashish; state Exp;
branches;
next 1.3;

1.3
date 2015.03.23.13.27.59; author ashish; state Exp;
branches;
next 1.2;

1.2
date 2015.03.23.13.26.32; author ashish; state Exp;
branches;
next 1.1;

1.1
date 2015.03.23.13.25.39; author ashish; state Exp;
branches;
next ;

desc
@programme for insertion sorting
@

1.8
log
@displaying the sorted list of arrays
@
text
@

1.7
log
@then out of the loop,the element stored in the temp variable will be copied to the position pointed by the j variable
@
text
@d28 1
a28 1

@

1.6
log
@if the condition will be true then the element pointed by the j is copied to the j+1,
and j will be reduced by 1 to its initial value
@
text
@a26 1

@

1.5
log
@copying the first element in a temporary varible say temp
now taking a while loop,which will chek the condition that if the variable in temp is less than the vaible pointed by the j variable to the next of the array
@
text
@a24 1

@

1.4
log
@taking a for loop which will run up to the size of array nd will start from second to start of the array
@
text
@a23 1

@

1.3
log
@displaying the elements entered by the user
@
text
@a20 1

@

1.2
log
@entering array of number from user
@
text
@a19 1

@

1.1
log
@Initial revision

1.9
date 2015.03.24.12.44.39; author ashish; state Exp;
branches;
next 1.8;

1.8
date 2015.03.24.12.42.21; author ashish; state Exp;
branches;
next 1.7;

1.7
date 2015.03.24.12.38.12; author ashish; state Exp;
branches;
next 1.6;

1.6
date 2015.03.24.12.31.24; author ashish; state Exp;
branches;
next 1.5;

1.5
date 2015.03.24.12.20.10; author ashish; state Exp;
branches;
next 1.4;

1.4
date 2015.03.24.12.17.36; author ashish; state Exp;
branches;
next 1.3;

1.3
date 2015.03.24.12.14.13; author ashish; state Exp;
branches;
next 1.2;

1.2
date 2015.03.24.12.06.33; author ashish; state Exp;
branches;
next 1.1;

1.1
date 2015.03.24.12.05.45; author ashish; state Exp;
branches;
next ;

desc
@this is the programme for communication using threads and messagqueue
@

1.9
log
@now the req client will rcv the result using msgrcv(),and final result will be displayed
in similar manner the more client for different operations would be made
@
text

@
1.8
log
@now the proc will write the result in the server using write(),
now the server will read the result using read(),
and will send th result to the req client using msgsnd() func
@
text
@a59 1

d61 1
a61 1
@

1.7
log
@now doing the execl to access the process which will take out the result
in the process the data wiill be received using msgrcv(),now the further calculation will be depending upon the type of operator
@
text
@d60 1
@

1.6
log
@now creating a pipe which will return two file descripters one for read and one for write
now doing a fork(),which will creat a child and parent.
now we will write the the data using the write fd of pipe to the client which will do the further calculation
@
text
@d53 1
a53 2

@

1.5
log
@declaring a structure to access the operator and operands on which the calculation will be ddone
now reciving the req from first client using msgrcv(),which will access using the id return by msgget,creted for sending and receiving the requests
@
text
@d53 2
a54 1

@

1.4
log
@now,giving the defination of thrd(),
creating the two mesgques,one for sending and reciving the result,and second for the reciving and sending the result
where the both will returns the unique id
@
text
@a18 1

@

1.3
log
@now,declaring the variable,thd,thd_id of prototype pthread_t
now creating a thread using pthread_creat(),where it will give a unique thread id
we have to creat multi,thrd so,,,thrd(),should be provided with a loop
@
text
@a2 1

@

1.2
log
@including the all header file needed
declaring a function for creating a thread
@
text
@d3 1
@

1.1
log
@Initial revision
@
text
@a1 1

@

1.7
date 2015.03.16.21.25.33; author ashish; state Exp;
branches;
next 1.6;

1.6
date 2015.03.16.21.22.29; author ashish; state Exp;
branches;
next 1.5;

1.5
date 2015.03.16.21.17.18; author ashish; state Exp;
branches;
next 1.4;

1.4
date 2015.03.16.21.09.27; author ashish; state Exp;
branches;
next 1.3;

1.3
date 2015.03.16.21.07.19; author ashish; state Exp;
branches;
next 1.2;

1.2
date 2015.03.16.21.03.47; author ashish; state Exp;
branches;
next 1.1;

1.1
date 2015.03.16.17.18.55; author ashish; state Exp;
branches;
next ;

desc
@including the header
creating a message queue for for receing and sending the data.
creating another msgque for receiving and sending the result
@

1.7
log
@now the received result would be written in the req client using msgsnd()
@
text
@#include”header_mq.h”//header containing the header files ,a structure which is having the variable for number and operator,union semun used for semaphore,and a sem buffer//

int main()
{
int mq_req,mq_res,mq_send,mq_recv,ret,p1[2],w1,result;
char a[4],b[4];
struct mesg req;
mq_req=msgget(620,IPC_CREAT|0666);//creating the message queue for requesting which have the a unique keyid,and mode//
if(mq_req==-1)
{
printf(“error\n”);
exit(1);
}
printf(“created for sending req\n”);
mq_res=msgget(720,IPC_CREAT|0666);//creating another message queue for taking result,with another unique keyid,and the mod//
if(mq_res==-1)
{
printf(“error1\n”);
exit(1);
}
printf(“created for result\n”);
while(1)
{
mq_recv=msgrcv(mq_req,&req,sizeof(struct mesg),0,0);//s is the message receive fun() which will receive the message from the mesg queue,where the argu says,id which have been return by the mesg queue creat(),second is the ptr which will point to the message receive,then size of the mesg pntd by the ptr,mesg type,and messg flag//

if(mq_recv==-1)
{
printf(“error2\n”);
exit(1);
}
printf(“created for receiving\n”);

printf(“readed data is %d %c %d\n”,req.data.num1,req.data.operator,req.data.num2);//here the data from the client have been received by the use of mmessg recv()//
pipe(p1);//createing the pipe for accessing the procc client//
printf(“pipe1 have been created\nrfd->%d\nwfd->%d\n”,p1[0],p1[1]);
ret=fork();//fork have been done to creat a child and parent proceess//
if(ret==0)
{
printf(“child\n”);
printf(“c1\n”);
write(p1[1],&req,sizeof(struct mesg));//writing the data in the process client using write(),and doing the execl to enter in proc clint//
sprintf(a,”%d”,p1[0]);
sprintf(b,”%d”,p1[1]);
printf(“c2\n”);
// execl(“/home/ashish/ash/pj3/messagequeue/proc”,”./proc”,a,b,NULL);//use to access the proc where the switch is used to go in diff operation such as,addition,sub,div,ettc,,//
}
else
{ wait(&w1);
printf(“parent\n”);
// read(p1[0],&result,sizeof(int));//reading the result from the proc client//
printf(“server result->%d\n”,result);
mq_send=msgsnd(mq_res,&result,sizeof(int),0);//here the received result is send to the req client,where the final result is stored//
}

}
}
@

1.6
log
@result have been written to the parent by the proc client
@
text
@d50 1
a50 1
read(p1[0],&result,sizeof(int));//reading the result from the proc client//
@

1.5
log
@*** empty log message ***
@
text
@d45 1
a45 1
execl(“/home/ashish/ash/pj3/messagequeue/proc”,”./proc”,a,b,NULL);//use to access the proc where the switch is used to go in diff operation such as,addition,sub,div,ettc,,//
@

1.4
log
@writing the data received from req client to the proc client
then accessing the proc client by doing the execl.
@
text
@d45 1
a45 1
// execl(“/home/ashish/ash/pj3/messagequeue/proc”,”./proc”,a,b,NULL);//use to access the proc where the switch is used to go in diff operation such as,addition,sub,div,ettc,,//
@

1.3
log
@now a pipe is created which returns the fd for read and write.
doing a fork so that a child andd parent can be created.
reading the data before doing fork,from the req client
@
text
@d45 1
a45 1
execl(“/home/ashish/ash/pj3/messagequeue/proc”,”./proc”,a,b,NULL);//use to access the proc where the switch is used to go in diff operation such as,addition,sub,div,ettc,,//
@

1.2
log
@now putting a while loop.
in this loop furthe programming would be done
now creting a messg receving (),which will have the arg as,1.id return by the mesgque created,2.a ptr which will points to the messg to be received,3.this is the size of the message pts by the ptr,and then messg type and flag
@
text
@d32 1
@

1.1
log
@Initial revision
@
text
@d25 1
@

if((front==0&&rear==SIZE-1)||(front==rear+1))//this condition will check the queue and print that queue will be full.

and for the empty queue

if(front==rear==-1)//this is the condition for checking that queue is empty