mirror of
git://git.code.sf.net/p/cdesktopenv/code
synced 2025-03-09 15:50:02 +00:00
Fix 80 typos in comments
(cherry picked from commit 7dca902a85dc02e5df66f0f45a00d1575e7a0220)
This commit is contained in:
parent
53443bb981
commit
39a14c1000
58 changed files with 80 additions and 80 deletions
|
@ -383,7 +383,7 @@ atmain.o : atmain.C
|
|||
fi
|
||||
fi
|
||||
|
||||
/* astsa is a standalone subset of ast for imbedded applications */
|
||||
/* astsa is a standalone subset of ast for embedded applications */
|
||||
|
||||
PAXFILTER = ;*.[ch];$(PROTO) $(PROTOFLAGS) -c "" -p
|
||||
|
||||
|
|
|
@ -70,7 +70,7 @@ typedef struct Opt_s
|
|||
char name[64]; /* current long name or flag */
|
||||
Optdisc_t* disc; /* user discipline */
|
||||
intmax_t number; /* # numeric argument */
|
||||
unsigned char assignment; /* option arg assigment op */
|
||||
unsigned char assignment; /* option arg assignment op */
|
||||
unsigned char pads[sizeof(void*)-1];
|
||||
_OPT_PRIVATE_
|
||||
} Opt_t;
|
||||
|
|
|
@ -556,7 +556,7 @@ tst lib_memccpy string.h unistd.h stdlib.h fcntl.h signal.h sys/types.h sys/stat
|
|||
signal(SIGALRM, gotcha);
|
||||
/*
|
||||
* sgi ia64 dumps here as of 3Q 2001
|
||||
* bug acknowleged 1Q 2003
|
||||
* bug acknowledged 1Q 2003
|
||||
*/
|
||||
memccpy(dstbuf, srcbuf, 0, siz + 10);
|
||||
alarm(0);
|
||||
|
|
|
@ -107,7 +107,7 @@ cat{
|
|||
# endif /* TCSANOW */
|
||||
#endif /* _hdr_termios */
|
||||
|
||||
/* set ECHOCTL if driver can echo control charaters as ^c */
|
||||
/* set ECHOCTL if driver can echo control characters as ^c */
|
||||
#ifdef LCTLECH
|
||||
# ifndef ECHOCTL
|
||||
# define ECHOCTL LCTLECH
|
||||
|
|
|
@ -157,7 +157,7 @@ dumproot(register Hash_root_t* root, register int flags)
|
|||
/*
|
||||
* dump hash table accounting info
|
||||
* if tab is 0 then dump all tables in hash_info.list
|
||||
* flags are HASH_* flags that specifiy optional dump info
|
||||
* flags are HASH_* flags that specify optional dump info
|
||||
*/
|
||||
|
||||
void
|
||||
|
|
|
@ -43,7 +43,7 @@ typedef void* (*Hash_region_f)(void*, void*, size_t, int);
|
|||
typedef struct /* root local pointers */
|
||||
{
|
||||
Hash_hash_f hash; /* name hash routine */
|
||||
Hash_compare_f compare; /* name comparision routine */
|
||||
Hash_compare_f compare; /* name comparison routine */
|
||||
Hash_alloc_f alloc; /* value allocation routine */
|
||||
Hash_free_f free; /* value free routine */
|
||||
Hash_region_f region; /* region alloc/free routine */
|
||||
|
|
|
@ -143,7 +143,7 @@ struct _dtdisc_s
|
|||
struct _dt_s
|
||||
{ Dtsearch_f searchf;/* search function */
|
||||
Dtdisc_t* disc; /* object type definitition */
|
||||
Dtdata_t* data; /* sharable data */
|
||||
Dtdata_t* data; /* shareable data */
|
||||
Dtmemory_f memoryf;/* for memory allocation */
|
||||
Dtmethod_t* meth; /* storage method */
|
||||
ssize_t nview; /* #parent view dictionaries */
|
||||
|
@ -175,8 +175,8 @@ struct _dtstat_s
|
|||
#define DT_STACK 0000000040 /* stack: insert/delete at top */
|
||||
#define DT_QUEUE 0000000100 /* queue: insert top, delete at tail */
|
||||
#define DT_DEQUE 0000000200 /* deque: insert top, append at tail */
|
||||
#define DT_RHSET 0000000400 /* rhset: sharable unique objects */
|
||||
#define DT_RHBAG 0000001000 /* rhbag: sharable repeated objects */
|
||||
#define DT_RHSET 0000000400 /* rhset: shareable unique objects */
|
||||
#define DT_RHBAG 0000001000 /* rhbag: shareable repeated objects */
|
||||
#define DT_METHODS 0000001777 /* all currently supported methods */
|
||||
#define DT_ORDERED (DT_OSET|DT_OBAG)
|
||||
|
||||
|
|
|
@ -69,7 +69,7 @@ typedef struct Opt_s
|
|||
char name[64]; /* current long name or flag */
|
||||
Optdisc_t* disc; /* user discipline */
|
||||
intmax_t number; /* # numeric argument */
|
||||
unsigned char assignment; /* option arg assigment op */
|
||||
unsigned char assignment; /* option arg assignment op */
|
||||
unsigned char pads[sizeof(void*)-1];
|
||||
_OPT_PRIVATE_
|
||||
} Opt_t;
|
||||
|
|
|
@ -24,7 +24,7 @@
|
|||
* Glenn Fowler
|
||||
* AT&T Research
|
||||
*
|
||||
* homogenous stack routine definitions
|
||||
* homogeneous stack routine definitions
|
||||
*/
|
||||
|
||||
#ifndef _STACK_H
|
||||
|
|
|
@ -91,7 +91,7 @@ struct _vmalloc_s
|
|||
#define VM_TRACE 0000001 /* generate traces of calls */
|
||||
#define VM_DBCHECK 0000002 /* check for boundary overwrite */
|
||||
#define VM_DBABORT 0000004 /* abort on any warning */
|
||||
#define VM_SHARE 0000010 /* sharable across processes */
|
||||
#define VM_SHARE 0000010 /* shareable across processes */
|
||||
#define VM_MEMORYF 0000020 /* vm was allocated by memoryf */
|
||||
#define VM_FLAGS 0000017 /* user-settable flags */
|
||||
|
||||
|
|
|
@ -163,7 +163,7 @@ typedef unsigned long Cctype_t;
|
|||
char tbuf[2 * PATH_MAX]; /* type string */ \
|
||||
Cctype_t cctype[UCHAR_MAX + 1]; /* char code types */ \
|
||||
unsigned int count[UCHAR_MAX + 1]; /* char frequency count */ \
|
||||
unsigned int multi[UCHAR_MAX + 1]; /* muti char count */ \
|
||||
unsigned int multi[UCHAR_MAX + 1]; /* multi char count */ \
|
||||
int keep[MAXNEST]; /* ckmagic nest stack */ \
|
||||
char* cap[MAXNEST]; /* ckmagic mime stack */ \
|
||||
char* msg[MAXNEST]; /* ckmagic text stack */ \
|
||||
|
|
|
@ -24,7 +24,7 @@
|
|||
* Glenn Fowler
|
||||
* AT&T Research
|
||||
*
|
||||
* multi-pass commmand line option parse assist
|
||||
* multi-pass command line option parse assist
|
||||
*
|
||||
* int fun(char** argv, int last)
|
||||
*
|
||||
|
|
|
@ -25,7 +25,7 @@
|
|||
* AT&T Research
|
||||
*
|
||||
* common process execution support with
|
||||
* proper sfio, signal and wait() syncronization
|
||||
* proper sfio, signal and wait() synchronization
|
||||
*
|
||||
* _ contains the process path name and is
|
||||
* placed at the top of the environment
|
||||
|
|
|
@ -187,7 +187,7 @@ init(register char* s)
|
|||
{
|
||||
/*
|
||||
* load the default locale messages
|
||||
* this assumes one mesage set for ast (AST_MESSAGE_SET or fallback to 1)
|
||||
* this assumes one message set for ast (AST_MESSAGE_SET or fallback to 1)
|
||||
* different packages can share the same message catalog
|
||||
* name by using different message set numbers
|
||||
* see <mc.h> mcindex()
|
||||
|
|
|
@ -368,7 +368,7 @@ expand(Notice_t* notice, register Buffer_t* b, const Item_t* item)
|
|||
}
|
||||
|
||||
/*
|
||||
* generate a copright notice
|
||||
* generate a copyright notice
|
||||
*/
|
||||
|
||||
static void
|
||||
|
|
|
@ -116,7 +116,7 @@ typedef struct Cenv_s
|
|||
int mappedslash; /* inverse mapped '/' */
|
||||
regflags_t flags; /* flags arg to regcomp */
|
||||
int type; /* BRE,ERE,ARE,SRE,KRE */
|
||||
unsigned char* cursor; /* curent point in re */
|
||||
unsigned char* cursor; /* current point in re */
|
||||
unsigned char* pattern; /* the original pattern */
|
||||
unsigned char* literal; /* literal restart pattern */
|
||||
int parno; /* number of last open paren */
|
||||
|
|
|
@ -117,7 +117,7 @@ static const char* rexname(Rex_t* rex)
|
|||
#define GOOD 1 /* some parse was found */
|
||||
#define CUT 2 /* no match and no backtrack */
|
||||
#define BEST 3 /* an unbeatable parse was found */
|
||||
#define BAD 4 /* error ocurred */
|
||||
#define BAD 4 /* error occurred */
|
||||
|
||||
/*
|
||||
* REG_SHELL_DOT test
|
||||
|
|
|
@ -21,7 +21,7 @@
|
|||
***********************************************************************/
|
||||
#include "sfhdr.h"
|
||||
|
||||
/* Read formated data from a stream
|
||||
/* Read formatted data from a stream
|
||||
**
|
||||
** Written by Kiem-Phong Vo.
|
||||
*/
|
||||
|
|
|
@ -686,7 +686,7 @@ loop_fmt:
|
|||
|
||||
if(v < 0)
|
||||
goto pop_fmt;
|
||||
else if(v > 0) /* extf comsumed v input bytes */
|
||||
else if(v > 0) /* extf consumed v input bytes */
|
||||
{ n_input += v;
|
||||
if(!(ft->flags&SFFMT_SKIP) )
|
||||
n_assign += 1;
|
||||
|
|
|
@ -184,7 +184,7 @@ static short sum[] = { 0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334, 36
|
|||
* tl.time is the seconds since the epoch for the leap event
|
||||
*
|
||||
* adding: the first additional second
|
||||
* subtracting: the first dissappearing second
|
||||
* subtracting: the first disappearing second
|
||||
*/
|
||||
|
||||
static Tm_leap_t leap[] =
|
||||
|
@ -245,10 +245,10 @@ static Tm_zone_t zone[] =
|
|||
"CAN", "AST", "ADT", ( 4 * 60), TM_DST, /* Atlantic */
|
||||
0, "NST", 0, ( 3 * 60 + 30), 0, /* Newfoundland */
|
||||
"GBR", "", "BST", ( 0 * 60), TM_DST, /* British Summer */
|
||||
"EUR", "WET", "WEST", ( 0 * 60), TM_DST, /* Western Eurpoean */
|
||||
"EUR", "WET", "WEST", ( 0 * 60), TM_DST, /* Western European */
|
||||
0, "CET", "CEST", -( 1 * 60), TM_DST, /* Central European */
|
||||
0, "MET", "MEST", -( 1 * 60), TM_DST, /* Middle European */
|
||||
0, "EET", "EEST", -( 2 * 60), TM_DST, /* Eastern Eurpoean */
|
||||
0, "EET", "EEST", -( 2 * 60), TM_DST, /* Eastern European */
|
||||
"ISR", "IST", "IDT", -( 3 * 60), TM_DST, /* Israel */
|
||||
"IND", "IST", 0, -( 5 * 60 + 30 ), 0, /* India */
|
||||
"CHN", "HKT", 0, -( 8 * 60), 0, /* Hong Kong */
|
||||
|
|
|
@ -42,7 +42,7 @@ static char sccsid[] = "@(#)gamma.c 8.1 (Berkeley) 6/4/93";
|
|||
/*
|
||||
* This code by P. McIlroy, Oct 1992;
|
||||
*
|
||||
* The financial support of UUNET Communications Services is greatfully
|
||||
* The financial support of UUNET Communications Services is gratefully
|
||||
* acknowledged.
|
||||
*/
|
||||
|
||||
|
|
|
@ -42,7 +42,7 @@ static char sccsid[] = "@(#)lgamma.c 8.2 (Berkeley) 11/30/93";
|
|||
/*
|
||||
* Coded by Peter McIlroy, Nov 1992;
|
||||
*
|
||||
* The financial support of UUNET Communications Services is greatfully
|
||||
* The financial support of UUNET Communications Services is gratefully
|
||||
* acknowledged.
|
||||
*/
|
||||
|
||||
|
|
|
@ -340,7 +340,7 @@ extern char *setstate(const char *arg_state)
|
|||
|
||||
/* If we are using the trivial TYPE_0 R.N.G., just do the old linear
|
||||
congruential bit. Otherwise, we do our fancy trinomial stuff, which is the
|
||||
same in all ther other cases due to all the global variables that have been
|
||||
same in all the other cases due to all the global variables that have been
|
||||
set up. The basic operation is to add the number at the rear pointer into
|
||||
the one at the front pointer. Then both pointers are advanced to the next
|
||||
location cyclically in the table. The value returned is the sum generated,
|
||||
|
|
|
@ -63,7 +63,7 @@ void _STUB_vmmapopen(){}
|
|||
/* magic word signaling file/segment is ready */
|
||||
#define MM_MAGIC ((unsigned int)(('P'<<24) | ('&'<<16) | ('N'<<8) | ('8')) )
|
||||
|
||||
/* default mimimum region size */
|
||||
/* default minimum region size */
|
||||
#define MM_MINSIZE (64*_Vmpagesize)
|
||||
|
||||
/* macros to get the data section and size */
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue