代码搜索:如何学习 Ls?
找到约 10,000 项符合「如何学习 Ls?」的源代码
代码结果 10,000
www.eeworm.com/read/147766/5723227
s copy_user.s
/* Copyright 2002 Andi Kleen, SuSE Labs.
* Subject to the GNU Public License v2.
*
* Functions to copy from and to user space.
*/
#define FIX_ALIGNMENT 1
#include
#includ
www.eeworm.com/read/141300/5770624
c inc_lsd.c
/*
* MW. Include for spice - LSData functions
*/
#include
#include
#include
#include
#include "datadef.h"
char *Message = "Michael Widlok, all right
www.eeworm.com/read/140582/5787511
sh examine-proc.sh
#!/bin/sh
TZ=GMT export TZ
ls -l /proc/net/ipsec_*
find /proc/net/ipsec -ls
rmmod ipsec
ls -l /proc/net/ipsec_*
find /proc/net/ipsec -ls
insmod /ipsec.o
ls -l /proc/net/ipsec_*
find /proc/net/ips
www.eeworm.com/read/140582/5787796
sh examine-proc.sh
#!/bin/sh
TZ=GMT export TZ
ls -l /proc/net/ipsec_*
find /proc/net/ipsec -ls
www.eeworm.com/read/130382/5958859
c listmng.c
/*____________________________________________________________________________
Copyright (C) 1997 Network Associates Inc. and affiliated companies.
All rights reserved.
$Id: ListMng.c,v 1.5 19
www.eeworm.com/read/128531/5985845
s copy_user.s
/* Copyright 2002 Andi Kleen, SuSE Labs.
* Subject to the GNU Public License v2.
*
* Functions to copy from and to user space.
*/
#include
/* #define FIX_ALIGNMENT 1 */
www.eeworm.com/read/101082/6249054
c 0.list.c
#ifndef lint
static char sccsid[] = "@(#)0.list.c 4.1 (Berkeley) 2/11/83";
#endif not lint
#include
#include "def.h"
struct list *consls(v,ls) /* make list */
VERT v;
struct list *ls;
{
www.eeworm.com/read/101082/6249064
c 1.finish.c
#ifndef lint
static char sccsid[] = "@(#)1.finish.c 4.1 (Berkeley) 2/11/83";
#endif not lint
#include
#include "def.h"
#include "1.incl.h"
fingraph()
{
/* if any entry statements, add a
www.eeworm.com/read/440959/6283669
c algo11-2.c
/* algo11-2.c 通过置换-选择排序产生不等长的初始归并段文件 */
#include"c1.h"
typedef int InfoType; /* 定义其它数据项的类型 */
#include"c10-1.h" /* 定义KeyType、RedType及SqList */
#define MAXKEY INT_MAX
#define RUNEND_SYMBOL I
www.eeworm.com/read/440959/6283679
c bo11-1.c
/* bo11-1.c k路平衡归并的函数 */
FILE *fp[k+1]; /* k+1个文件指针(fp[k]为大文件指针),全局变量 */
typedef int LoserTree[k]; /* 败者树是完全二叉树且不含叶子,可采用顺序存储结构 */
typedef RedType ExNode,External[k+1]; /* 外结点,有改变 */
External