RCS file: header.h,v
Working file: header.h
head: 1.10
branch:
locks: strict
root: 1.10
access list:
symbolic names:
keyword substitution: kv
total revisions: 10;    selected revisions: 10
description:
This is the header file.
Included init.h.
Included module.h.
using macro MODULE_LISCENCE.
—————————-
revision 1.10    locked by: root;
date: 2014/10/08 18:25:34;  author: root;  state: Exp;  lines: +1 -0
included asm/uaccess.h.
—————————-
revision 1.9
date: 2014/10/08 07:04:32;  author: root;  state: Exp;  lines: +1 -1
included kernel.h.
—————————-
revision 1.8
date: 2014/10/08 05:30:18;  author: root;  state: Exp;  lines: +4 -0
declared macros QSETSIZE and QUANTSIZE.
declared members qset_size and quant_size in the structure ScullDev.
—————————-
revision 1.7
date: 2014/09/26 08:45:24;  author: root;  state: Exp;  lines: +1 -1
included kernel.h.
—————————-
revision 1.6
date: 2014/09/26 08:15:43;  author: root;  state: Exp;  lines: +1 -0
Included kernel.h.
—————————-
revision 1.5
date: 2014/09/26 07:36:49;  author: root;  state: Exp;  lines: +11 -0
Included slab.h.
Defined struct ScullQset.
Defined struct ScullQset.
—————————-
revision 1.4
date: 2014/09/26 07:15:22;  author: root;  state: Exp;  lines: +1 -0
Included moduleparam.h.
—————————-
revision 1.3
date: 2014/09/26 07:01:34;  author: root;  state: Exp;  lines: +3 -0
declared macro MAJORNO, MINORNO, NOD.
—————————-
revision 1.2
date: 2014/09/26 06:29:23;  author: root;  state: Exp;  lines: +3 -0
Included fs.h.
Included cdev.h.
—————————-
revision 1.1
date: 2014/09/26 06:06:05;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS FILE OF THE DECLERATIONS.H OF THE CHARACTER DRIVER

RCS file: declare.h,v
Working file: declare.h
head: 1.8
branch:
locks: strict
root: 1.8
access list:
symbolic names:
keyword substitution: kv
total revisions: 8;    selected revisions: 8
description:
This is the declerations file.
Declared extern int dev_t dev.
declared extern int nod.
—————————-
revision 1.8    locked by: root;
date: 2014/10/08 17:35:06;  author: root;  state: Exp;  lines: +1 -1
minor bug.
—————————-
revision 1.7
date: 2014/10/08 05:31:28;  author: root;  state: Exp;  lines: +2 -0
declared extern int qset_size and extern int quant_size.
given prototype of dev_release().
—————————-
revision 1.6
date: 2014/10/08 05:10:19;  author: root;  state: Exp;  lines: +1 -0
minor bug.
—————————-
revision 1.5
date: 2014/10/08 04:59:11;  author: root;  state: Exp;  lines: +1 -0
given prototype of dev_write() routine.
—————————-
revision 1.4
date: 2014/09/26 08:16:27;  author: root;  state: Exp;  lines: +1 -0
given the prototype of the function dev_open().
—————————-
revision 1.3
date: 2014/09/26 07:37:37;  author: root;  state: Exp;  lines: +1 -1
Declared Struct SCullDev *sculldev.
—————————-
revision 1.2
date: 2014/09/26 07:02:49;  author: root;  state: Exp;  lines: +4 -0
declared extern int majorno, extern int minorno.
declared extern struct file_operations fops.
declared extern struct cdev mycdev.
—————————-
revision 1.1
date: 2014/09/26 06:46:55;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS FILE OF INIT.H OF THE CHARACTER DRIVER

RCS file: init.c,v
Working file: init.c
head: 1.10
branch:
locks: strict
root: 1.10
access list:
symbolic names:
keyword substitution: kv
total revisions: 10;    selected revisions: 10
description:
This is the initialization routine.
using macro module_init.
—————————-
revision 1.10    locked by: root;
date: 2014/10/08 05:32:09;  author: root;  state: Exp;  lines: +4 -0
assigned value to qset_size and quant_size.
—————————-
revision 1.9
date: 2014/09/26 08:46:00;  author: root;  state: Exp;  lines: +1 -0
Setting the initial value of scullqset member of sculldev to null.
—————————-
revision 1.8
date: 2014/09/26 08:16:46;  author: root;  state: Exp;  lines: +1 -1
Included user defined header file file_init.h.
—————————-
revision 1.7
date: 2014/09/26 07:41:53;  author: root;  state: Exp;  lines: +15 -0
debugging messages added.
—————————-
revision 1.6
date: 2014/09/26 07:38:01;  author: root;  state: Exp;  lines: +7 -6
allocated memory to the sculldev using kmallo
kmalloc*
—————————-
revision 1.5
date: 2014/09/26 07:15:37;  author: root;  state: Exp;  lines: +15 -8
adding multiple devices.
accepting number of devises from module parameters.
printing all major and minor numbers.
—————————-
revision 1.4
date: 2014/09/26 07:02:01;  author: root;  state: Exp;  lines: +16 -2
initialising a device using cdev_init().
Adding the device using cdev_add().
—————————-
revision 1.3
date: 2014/09/26 06:33:02;  author: root;  state: Exp;  lines: +1 -1
checking the return value of alloc_chrdev_region.
—————————-
revision 1.2
date: 2014/09/26 06:29:40;  author: root;  state: Exp;  lines: +19 -0
Registering the driver using alloc_chrdev_region().
printing the major number allocated.
—————————-
revision 1.1
date: 2014/09/26 06:06:05;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS FILE OF OPEN ROUTICE OF CHAR DRIVER

RCS file: dev_open.c,v
Working file: dev_open.c
head: 1.5
branch:
locks: strict
root: 1.5
access list:
symbolic names:
keyword substitution: kv
total revisions: 5;    selected revisions: 5
description:
This is the open routine of our device.
—————————-
revision 1.5    locked by: root;
date: 2014/09/26 08:50:16;  author: root;  state: Exp;  lines: +7 -2
debugging.
—————————-
revision 1.4
date: 2014/09/26 08:49:01;  author: root;  state: Exp;  lines: +6 -0
debugging messages.
—————————-
revision 1.3
date: 2014/09/26 08:46:31;  author: root;  state: Exp;  lines: +23 -1
Implementing dev_trim().
—————————-
revision 1.2
date: 2014/09/26 08:29:40;  author: root;  state: Exp;  lines: +18 -0
using container_of function to put data into struct inode.
—————————-
revision 1.1
date: 2014/09/26 08:17:25;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS IFLE OF WRITE ROUTINE OF CHAR DRIVER

RCS file: dev_write.c,v
Working file: dev_write.c
head: 1.11
branch:
locks: strict
root: 1.11
access list:
symbolic names:
keyword substitution: kv
total revisions: 11;    selected revisions: 11
description:
this is write routine of this driver.
—————————-
revision 1.11    locked by: root;
date: 2014/10/08 18:26:11;  author: root;  state: Exp;  lines: +31 -7
writing into sculldev from user buffer using macro copy_from_user.
—————————-
revision 1.10
date: 2014/10/08 17:54:16;  author: root;  state: Exp;  lines: +30 -3
implemented create_quant.
—————————-
revision 1.9
date: 2014/10/08 17:35:16;  author: root;  state: Exp;  lines: +2 -1
implementing create_qset.
—————————-
revision 1.8
date: 2014/10/08 17:28:39;  author: root;  state: Exp;  lines: +20 -0
implementing create_qset.
—————————-
revision 1.7
date: 2014/10/08 07:05:57;  author: root;  state: Exp;  lines: +68 -17
allocated scullqsets successfully.
given prototype of create_qset.
implementing create_qset.
qsets allocated successfully.
—————————-
revision 1.6
date: 2014/10/08 05:40:37;  author: root;  state: Exp;  lines: +1 -1
*** empty log message ***
—————————-
revision 1.5
date: 2014/10/08 05:39:24;  author: root;  state: Exp;  lines: +1 -1
debugging messages.
—————————-
revision 1.4
date: 2014/10/08 05:37:26;  author: root;  state: Exp;  lines: +3 -3
minor error (% instead of /).
—————————-
revision 1.3
date: 2014/10/08 05:33:06;  author: root;  state: Exp;  lines: +22 -1
given prototype of create_scullqset().
implementing create_scullqset(().
calculating number of scullqset in function create_scullqset().
—————————-
revision 1.2
date: 2014/10/08 05:16:39;  author: root;  state: Exp;  lines: +10 -1
fetching data fropn file->private data into a local ScullDev variable.
—————————-
revision 1.1
date: 2014/10/08 05:04:21;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: server.c,v
Working file: server.c
head: 1.1
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
Server implementaton using TCP , AF_INET.
>> Calls used : socket(), bind(), listen(), accept().
>> sockaddr_in
—————————-
revision 1.1
date: 2014/08/28 05:26:46;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: client.c,v
Working file: client.c
head: 1.1
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
AF_INET client program.
calls used: bind(), connect.
—————————-
revision 1.1
date: 2014/08/28 05:31:42;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: server.c,v
Working file: server.c
head: 1.1
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
Server implementaton using TCP , AF_UNIX.
>> Calls used : socket(), bind(), listen(), accept().
—————————-
revision 1.1
date: 2014/08/28 05:26:46;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: client.c,v
Working file: client.c
head: 1.1
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
AF_UXIX client program.
calls used: bind(), connect.
—————————-
revision 1.1
date: 2014/08/28 05:31:42;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: header.h,v
Working file: header.h
head: 1.1
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
included stdio.h, sys/msg.h, stdlib.h, sys/types.h, unistd.h, sys/ipc.h.
—————————-
revision 1.1
date: 2014/08/28 04:44:56;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: server.c,v
Working file: server.c
head: 1.1
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
this is the server program.
it creates a message queue and waits to recieve data on it from a requesting client.
multiple fork calls are made according to the number of requesting client
each child of the server deals with respective client and sychronisation chived by the type field given in each message queue structure.
then the server sends a processing requst to the processing client.
once the processing client returns the result on a seperate message queue, the server puts the result back on the respective client message queue.
each client then picks up the message according to the type specified, which in turn is their own pid(process id).
—————————-
revision 1.1
date: 2014/08/28 04:54:05;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: client.c,v
Working file: client.c
head: 1.1
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
This is the requesting client program.
It sends a request on the message queue created by the server.
and waits for the processed result.
picks up the message of its own type only.
here tpre is the pid of client.
—————————-
revision 1.1
date: 2014/08/28 05:05:52;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: process.c,v
Working file: process.c
head: 1.1
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
This is the processing client.
it performs the calculations on request from the server.
and returns the answer in a message queue created by the server.
with a particular type attached to the mesage.
—————————-
revision 1.1
date: 2014/08/28 05:08:33;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: ./header.h,v
Working file: ./header.h
head: 1.1
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
Included “stdio.h” , “stdlib.h”, “unistd.h”, “linux/sem.h”, “fcntl.h”, and “signal.h”.
Declaration of the structure “package”, with members – op1(int), op2(int), arth(char), pid(pid_t), result(int).
—————————-
revision 1.1
date: 2014/08/12 10:59:58;  author: root;  state: Exp;
Initial revision
=============================================================================

SERVER PROGRAM **************************************************************

RCS file: ./server.c,v
Working file: ./server.c
head: 1.1
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
This is the server program .
Declared 3 fifos , 1 for client routines and 2 for processing routines.
fork children of the server. number of children is equal to number of clients.
Each child links with respective clients and reads the data to be processed.
then the forked child send the data to the processing client .
gets the result back, and sends it to the client.
semaphores are used wherever fifos are shared.
—————————-
revision 1.1
date: 2014/08/12 11:18:11;  author: root;  state: Exp;
Initial revision
=============================================================================

CLIENT PROGRAM **************************************************************

RCS file: ./client.c,v
Working file: ./client.c
head: 1.1
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
This is the client program.
It writes the values to b written into the fifo for server to read it.
this it pauses using pause() system call.
when the server has the answer it prompts the client by sending it a signal using kill system call.
the respective client whose pid is present in the kill() is resumed , reads the result and displays it.
—————————-
revision 1.1
date: 2014/08/12 11:21:10;  author: root;  state: Exp;
Initial revision
=============================================================================

ADD PROCESSING CLIENT *******************************************************

RCS file: ./add.c,v
Working file: ./add.c
head: 1.1
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
This is the addition processing client.
it reads the values from server using one fifo.
each processing client is using a common fifo to write back the result to server.
—————————-
revision 1.1
date: 2014/08/12 11:23:54;  author: root;  state: Exp;
Initial revision
=============================================================================

SUBTRACT PROCESSING CLIENT **************************************************

RCS file: ./subtract.c,v
Working file: ./subtract.c
head: 1.1
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
This is the subtracting client.
it reads the values from server using one fifo.
each processing client is using a common fifo to write back the result to server.
—————————-

RCS file: header.h,v
Working file: header.h
head: 1.1
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
Included stdio.h.
and fcntl.h.
,sys/types.h, stdlib.h, unistd.h.
—————————-
revision 1.1
date: 2014/08/02 03:44:56;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: pipes.c,v
Working file: pipes.c
head: 1.2
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 2;    selected revisions: 2
description:
Main function of the inter process communication program.
calling the client function to generate clients.
—————————-
revision 1.2
date: 2014/08/02 04:57:36;  author: root;  state: Exp;  lines: +17 -1
forking three independent clients.
with different values.
—————————-
revision 1.1
date: 2014/08/02 03:44:56;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: define.c,v
Working file: define.c
head: 1.4
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 4;    selected revisions: 4
description:
definations of functions client(),
operator_l()–services the client ,forks and execls appropriate service program.
—————————-
revision 1.4
date: 2014/08/02 05:14:43;  author: root;  state: Exp;  lines: +5 -3
client was showing first operand as result.
fixed it.
—————————-
revision 1.3
date: 2014/08/02 04:57:02;  author: root;  state: Exp;  lines: +9 -3
added fcntl.h.
—————————-
revision 1.2
date: 2014/08/02 03:47:28;  author: root;  state: Exp;  lines: +0 -24
*** empty log message ***
—————————-
revision 1.1
date: 2014/08/02 03:44:56;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: client.c,v
Working file: client.c
head: 1.3
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 3;    selected revisions: 3
description:
This is the client program which requests the server to
perform given operation on the two operands.
—————————-
revision 1.3
date: 2014/08/02 05:15:33;  author: root;  state: Exp;  lines: +2 -2
now the client waits for the server to get results.
—————————-
revision 1.2
date: 2014/08/02 04:58:16;  author: root;  state: Exp;  lines: +6 -3
now the client waits and reads the result from the server.
—————————-
revision 1.1
date: 2014/08/02 03:44:56;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: add.c,v
Working file: add.c
head: 1.2
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 2;    selected revisions: 2
description:
The program to add two numbers given by the client program.
writes the result back to the server.
—————————-
revision 1.2
date: 2014/08/02 04:59:01;  author: root;  state: Exp;  lines: +1 -2
*** empty log message ***
—————————-
revision 1.1
date: 2014/08/02 03:44:56;  author: root;  state: Exp;
Initial revision
=============================================================================
RCS file: subtract.c,v
Working file: subtract.c
head: 1.2
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 2;    selected revisions: 2
description:
The program to subtract two numbers given by the client program.
writes the result back to server.
—————————-
revision 1.2
date: 2014/08/02 04:59:05;  author: root;  state: Exp;  lines: +1 -2
*** empty log message ***
—————————-
revision 1.1
date: 2014/08/02 03:44:56;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: multiply.c,v
Working file: multiply.c
head: 1.2
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 2;    selected revisions: 2
description:
The program to multiply two numbers given by the client program.
writes the result back to server.
—————————-
revision 1.2
date: 2014/08/02 04:59:06;  author: root;  state: Exp;  lines: +1 -2
*** empty log message ***
—————————-
revision 1.1
date: 2014/08/02 03:44:56;  author: root;  state: Exp;
Initial revision
=============================================================================

***************************************************************

#include<stdio.h>
#include<stdlib.h>
struct cq
{
int info;
struct cq *next;
};
int getchoice();
int operation(int, struct cq **, struct cq **, struct cq **);
int enqueue( struct cq **, struct cq **, struct cq **);
int display( struct cq **, struct cq **, struct cq **);
int dequeue( struct cq **, struct cq **, struct cq **);

MAIN

***************************************************************

#include”header.h”
int main()
{
struct cq *front = NULL , *rear = NULL, *start = NULL;
int choice;
while(1)
{
choice = getchoice();
operation(choice,&front,&rear,&start);
}
}

DEFINITIONS

***********************************************************************

#include”header.h”
int flag = 0,count = -1;
int getchoice()
{
int choice;
printf(”                   1.create\n”);
printf(”                   2.enqueue\n”);
printf(”                   3.dequeue\n”);
printf(”                   4.display\n”);
printf(”                   5.exit\n”);
printf(”                Enter your choice\n”);
scanf(“%d”,&choice);
return choice;
}
int operation(int choice, struct cq **front, struct cq **rear,struct cq **start)
{
int i,k;
switch(choice)
{
case 1:    if(flag == 0)
{
printf(“successfully created!!\n”);
flag = 1;
}
else
printf(“already created\n”);
break;
case 2:{
printf(“How many elments you want to enqueue?\n”);
scanf(“%d”,&k);
if(k > (10-(count+1)))
{
printf(“no sufficient space!! you can enter %d more elements\n”,10-(count+1));
break;
}
for(i = 0; i < k; i++)
{
enqueue(front,rear,start);
}
printf(“%d elements entered!!\n”,k);break;
}
case 3:{
printf(“How many elments you want to dequeue?\n”);
scanf(“%d”,&k);
if(k > (count+1))
{
printf(” you can dequeue %d elements only\n”,(count+1));
break;
}
for(i = 0; i < k; i++)
{
dequeue(front,rear,start);
}
printf(“%d elements dequeued!!\n”,k);break;
}
case 4:display(front,rear,start);break;
case 5:exit(0);
default:printf(“invalid choice\n”);
}
}
int dequeue(struct cq **front, struct cq **rear,struct cq **start)
{
struct cq *temp;
if(flag == 0)
{
printf(“c queue not created!!\n”);
return -1;;
}
if(count == -1)
{
printf(“c queue is empty(underflow)\n”);
return 0;
}
if(!(*front))
{
temp = *start;
*front = (*start)->next;
printf(“%d is dequeued\n”,temp->info);
free(temp);
*start = NULL;
count–;
}
else if(count == 0)
{
printf(“%d is dequeued\n”,(*front)->info);
*front = *rear = NULL;
count–;
}

else if(count > 0)
{
temp = *front;
*front = (*front)->next;
printf(“%d is dequeued\n”,temp->info);
count–;
}
//    printf(“count: %d\n”,count);
display(front,rear,start);

}
int enqueue(struct cq **front, struct cq **rear,struct cq **start)
{
struct cq *temp;
if(flag == 0)
{
printf(“queue not created!!\n”);
return -1;;
}
if(count >= 9)
{
printf(“c Queue is full!\n”);
return 0;
}
if(!(*rear))
{
*rear = malloc(sizeof(struct cq));
printf(“Enter the %d element\n”,count+1);
scanf(“%d”,&((*rear)->info));
(*rear)->next = NULL;
*start = *rear;
}
else if(rear)
{
temp = malloc(sizeof(struct cq));
(*rear)->next = temp;
*rear = (*rear)->next;
printf(“Enter the %d element\n”,count+1);
scanf(“%d”,&(temp->info));
(temp)->next = NULL;
}
count++;
//    printf(“count: %d\n”,count);
display(front,rear,start);
}
int display(struct cq **front, struct cq **rear,struct cq **start)
{
struct cq *temp;
if(flag == 0)
{
printf(“queue not created!!\n”);
return -1;;
}
if(!(*rear) && !(*front))
printf(“c queue is empty\n”);
if(!(*front) && *rear)
temp = *start;
else
temp = *front;
while(temp)
{
printf(“<-%d”,temp->info);
temp = temp->next;
}
printf(“\n”);
}

}
if(flag == 1)
{
*(ma+(count)) = temp;
printf(“%d\n”,*(ma+count));
count++;
}
printf(”                            count = %d\n”,count);
temp = temp->next;

}
o:        temp = *start1;
for(i = 0; i<count; i++)
{
if(temp->next == *(ma+i))
break;
temp = temp->next;
}
printf(“common node is detected at %d\n”,temp->next->info);
temp ->next= NULL;
return 0;

}

}
printf(”                            count = %d\n”,count);
*(ma+(count)) = temp;
count++;
//        ma = realloc(ma,count+1);
temp = temp->next;

}
o:    temp->next= NULL;
printf(“loop!! fixed\n”);
free(ma);
return 0;
}

}
return 0;
}

********************************************************************************************

while(( k = readdir(i)) !=  NULL)
{
flag=1;
l=strlen(k->d_name);
for(j = l-1,s=0;j >= l-4,s < 4 ;j–,s++ )
{
if((k->d_name[j])!= m[s])
{
flag=0;
goto q;
}

}
q:         if(flag==1)
{
fd = openf(k->d_name);
while(read(fd, &ch, 1))
write(fd1,&ch,1);
close(fd);
}
}
printf(“\n”);
close(fd1);
}
int openf(char * s)
{
int fd;
fd = open(s,O_RDWR|O_CREAT,0666);
if(fd < 1)
perror(“open error”);
else
printf(“input file open succesfull fd = %d\n”,fd);
return fd;
}

printf(“\n%s**\n”,buff);
free(buff);
buff = (char*)malloc(sizeof(char));
}

}
o:printf(“\n%d blocks of size %d skipping %d bits after each read  are read form file %s\n”,n,b_size,skip,f);

}
int openf(char * s)
{
int fd;
fd = open(s,O_RDWR|O_CREAT,0666);
if(fd < 1)
perror(“open error”);
else
printf(“input file open succesfull fd = %d\n”,fd);
return fd;
}

close(fd);
close(fd1);
}
int openf(char * s)
{
int fd;
fd = open(s,O_RDWR|O_CREAT,0666);
if(fd < 1)
perror(“open error”);
else
printf(“input file open succesfull fd = %d\n”,fd);
return fd;
}

#include<stdio.h>
#include<stdlib.h>

struct distance
{    int feet;
int inches;
};
int display(struct distance *,struct distance *,struct distance *);
struct distance * add(struct distance *,struct distance *);
struct distance * input();

**************************************************************************

main file******************************************************************

#include”header.h”
int main()
{
struct distance *d1,*d2,*d3;
d1 = input();
d2 = input();
d3 = add(d1,d2);
display(d1,d2,d3);
return 0;

}
struct distance * input()
{
struct distance *d1;
d1 = (struct distance*)malloc(sizeof(struct distance));
printf(“\nenter the distance in feet”);
scanf(“%d”,&d1->feet);
printf(“\nenter the distance in inches”);
scanf(“%d”,&d1->inches);
return d1;

}
struct distance * add(struct distance *d1, struct distance *d2)
{
struct distance *d3;
d3 = (struct distance*)malloc(sizeof(struct distance));
d3->inches= d1->inches +d2->inches;
d3->feet = d1->feet +d2->feet;
if(d3->inches >= 12)
{    d3->feet++;
d3->inches-=12;
}
return d3;

}
int display(struct distance *d1,struct distance *d2,struct distance *d3)
{
printf(” %d\’ %d\” \n %d\’ %d\” \n —— \n%d\’ %d\” \n “,d1->feet,d1->inches,d2->feet,d2->inches,d3->feet,d3->inches);
}
****************************************************************************

output:::

enter the distance in feet6

enter the distance in inches7

enter the distance in feet6

enter the distance in inches7
6′ 7″
6′ 7″
——
13′ 2″