代码搜索:PIPE

找到约 7,786 项符合「PIPE」的源代码

代码结果 7,786
www.eeworm.com/read/373386/9457933

c pipe.c

#include main() { int filedes[2]; char buffer[80]; pipe(filedes); if(fork()>0){ /* 父进程*/ char s[ ] = "hello!\n"; write(filedes[1],s,sizeof(s)); } else{ /*子进程*/ read(filedes[0],buffer,80); p
www.eeworm.com/read/177326/9459500

c pipe.c

/* * Boa, an http server * Based on code Copyright (C) 1995 Paul Phillips * Some changes Copyright (C) 1997-99 Jon Nelson * * This program is free softwa
www.eeworm.com/read/176362/9501053

h pipe.h

#if !defined(Pipe_H) #define Pipe_H #include "SecurityAttributes.h" #include #include using namespace std; /////////////////////////////////////////////////////
www.eeworm.com/read/176340/9502796

c pipe.c

/* * pipe.c -- fifo driver for scull * * Copyright (C) 2001 Alessandro Rubini and Jonathan Corbet * Copyright (C) 2001 O'Reilly & Associates * * The source code in this file can be freely used,
www.eeworm.com/read/366740/9801383

c pipe.c

#include #include #include #include #include #define INPUT 0 #define OUTPUT 1 int main(){ int file1[2]; pid_t ch
www.eeworm.com/read/366740/9801386

txt pipe.txt

#include int pipe(int filedis[2]); #define INPUT 0 #define OUTPUT 1 int main() { int file_descriptors1[2]; int file_descriptors2[2]; int pid1,pid2; char buf1[256]; int returned
www.eeworm.com/read/366089/9833113

c pipe.c

#include #include #include //子进程读数据 void read_data(int pipes[]) { int c; int rc; //关闭写的一端 close(pipes[1]); //读数据并打印 while ((rc = read(pipes[0], &c,
www.eeworm.com/read/169620/9848727

c pipe.c

/*从shell里面 ->sp start ->sp writepipe */ #include "vxworks.h" #include "fcntl.h" #define PIPEHI "/pipe/highpipe" #define PIPELOW "/pipe/lowpipe" #define MAXNUM 10
www.eeworm.com/read/365428/9863830

c pipe.c

/* * linux/fs/pipe.c * * (C) 1991 Linus Torvalds */ #include // 信号头文件。定义信号符号常量,信号结构以及信号操作函数原型。 #include // 调度程序头文件,定义了任务结构task_struct、初始任务0 的数据, // 还有一些有关描述符参数设置和获取的嵌入式汇编
www.eeworm.com/read/168707/9900447

c pipe.c

/* * pipe.c -- fifo driver for scull * * Copyright (C) 2001 Alessandro Rubini and Jonathan Corbet * Copyright (C) 2001 O'Reilly & Associates * * The source code in this file can be freely used,