RCS file: server.c,v Working file: server.c head: 1.1 branch: locks: strict root: 1.1 access list: symbolic names: keyword substitution: kv total revisions: 1; selected revisions: 1 description: successfully implemented socket programming. this is server,in which we create two sockets. one … Continue reading
#include #include //#include #include #include int main() { int sockfd,true,aret,bret; char ch[5]; struct sockaddr_in server_add,client_add; socklen_t len; server_add.sin_family = AF_INET; server_add.sin_port=htons(7770); server_add.sin_addr.s_addr = inet_addr(“127.0.0.1″); if(setsockopt(sockfd,SOL_SOCKET,SO_REUSEADDR,&true,sizeof(int))==-1) { sockfd = socket(AF_INET,SOCK_STREAM,0); if(sockfd==-1) { printf(“fail in openning socket”); } } printf(“sockfd =%d\n”,sockfd); bret … Continue reading
This is rcs file of init function where this function helps in initialisation of our driver and file operations . file operations which are used further to mapped various function to the kernel mode function. similarly there is open function … Continue reading
Eurekkkkkkaaaaaaaa…………….. Successfully implemented client server communication using threads and socket. Problems which you might face 1>unsuccessfull bind() 2>unlinking not successfull in AF_INET,,,unlink() won’t work in this case. 2.1>server_addr.sin_addr.s_addr=IPaddress like 192.168.1.0 not taking showing warning. 3>when to create processing_client and server … Continue reading
Big Endian In big endian, you store the most significant byte in the smallest address. Here’s how it would look: Address Value 1000 90 1001 AB 1002 12 1003 CD Little Endian In little endian, you store the least … Continue reading
Following are some of the major differences between the thread and the processes : Processes do not share their address space while threads executing under same process share the address space. From the above point its clear that processes execute … Continue reading
head 1.1; access; symbols; locks root:1.1; strict; comment @ * @; 1.1 date 2014.06.13.07.23.51; author root; state Exp; branches; next ; desc @client of threads. @ 1.1 log @Initial revision @ texthead 1.1; access; symbols; locks root:1.1; strict; comment @ … Continue reading
Optimization Levels Without any optimization option, the compiler’s goal is to reduce the cost of compilation and to make debugging produce the expected results. Statements are independent: if you stop the program with a breakpoint between statements, you can then … Continue reading
What is a Thread? Technically, a thread is defined as an independent stream of instructions that can be scheduled to run as such by the operating system. But what does this mean? To the software developer, the concept of a … Continue reading
RCS file: multiple_thread.c,v Working file: multiple_thread.c head: 1.1 branch: locks: strict access list: symbolic names: keyword substitution: kv total revisions: 1; selected revisions: 1 description: multiple thread —————————- revision 1.1 date: 2014/06/09 09:07:02; author: root; state: Exp; Initial revision =============================================================================
#apply the ioctl in the kernel layer and get quantum and set quantum is work fine….and after changing the quantum size we are able to write according to that but we are not able to read when we are changing … Continue reading
RCS file: thread2.c,v Working file: thread2.c head: 1.1 branch: locks: strict access list: symbolic names: keyword substitution: kv total revisions: 1; selected revisions: 1 description: create a thread —————————- revision 1.1 date: 2014/06/08 08:18:53; author: root; state: Exp; Initial revision … Continue reading
RCS file: fun1,v Working file: fun1 head: 1.1 branch: locks: strict access list: symbolic names: keyword substitution: kv total revisions: 1; selected revisions: 1 description: a program of function with argument passing using shell script —————————- revision 1.1 date: 2014/06/07 … Continue reading
1 #include 2 #include 3 int main() 4 { 5 int a,b,c,i,n; 6 b=0; 7 c=1; 8 printf(“enter the value \n”); 9 scanf(“%d”,&a); 10 int *d; 11 d=(int*)malloc(sizeof(a)); 12 *(d+0)=0; 13 *(d+1)=1; 14 i=2; 15 while(i<a) 16 { 17 *(d+i)=b+c;b=c;c=*(d+i); … Continue reading
head 1.15; access; symbols; locks root:1.15; strict; comment @ * @; 1.15 date 2014.05.11.08.48.49; author root; state Exp; branches; next 1.14; 1.14 date 2014.05.10.07.23.56; author root; state Exp; branches; next 1.13; 1.13 date 2014.05.10.07.17.59; author root; state Exp; branches; next … Continue reading