mirror of
git://git.sv.gnu.org/emacs.git
synced 2026-03-23 07:12:12 -07:00
Merging spelling corrections contributed by bruce mitchener.
See <1c80ccb634>.
Copied from Perforce
Change: 180956
ServerID: perforce.ravenbrook.com
This commit is contained in:
parent
85af2e8217
commit
4f60f9698c
14 changed files with 22 additions and 22 deletions
|
|
@ -46,7 +46,7 @@ static Res ArenaTrivDescribe(Arena arena, mps_lib_FILE *stream)
|
|||
}
|
||||
|
||||
|
||||
/* AbstractArenaClass -- The abstact arena class definition
|
||||
/* AbstractArenaClass -- The abstract arena class definition
|
||||
*
|
||||
* .null: Most abstract class methods are set to NULL. See
|
||||
* <design/arena/#class.abstract.null>. */
|
||||
|
|
|
|||
|
|
@ -223,7 +223,7 @@ static Res BufferInitV(Buffer buffer, BufferClass class,
|
|||
buffer->alignment = pool->alignment; /* .trans.mod */
|
||||
buffer->base = (Addr)0;
|
||||
buffer->initAtFlip = (Addr)0;
|
||||
/* In the next three assignements we really mean zero, not NULL, because
|
||||
/* In the next three assignments we really mean zero, not NULL, because
|
||||
the bit pattern is compared. It's pretty unlikely we'll encounter
|
||||
a platform where this makes a difference. */
|
||||
buffer->ap_s.init = (mps_addr_t)0;
|
||||
|
|
@ -861,7 +861,7 @@ Bool BufferTrip(Buffer buffer, Addr p, Size size)
|
|||
return FALSE;
|
||||
}
|
||||
|
||||
/* Emit event including class if loggged */
|
||||
/* Emit event including class if logged */
|
||||
if (buffer->mode & BufferModeLOGGED) {
|
||||
Bool b;
|
||||
Format format;
|
||||
|
|
@ -1170,7 +1170,7 @@ static void bufferNoSetRankSet (Buffer buffer, RankSet rankset)
|
|||
|
||||
/* bufferNoReassignSeg -- basic BufferReassignSeg method
|
||||
*
|
||||
* .noseg: basic buffers don't support attachment to sements, so this
|
||||
* .noseg: basic buffers don't support attachment to segments, so this
|
||||
* method should not be called. */
|
||||
|
||||
static void bufferNoReassignSeg (Buffer buffer, Seg seg)
|
||||
|
|
|
|||
|
|
@ -84,7 +84,7 @@ static void evwarn(const char *format, ...)
|
|||
va_end(args);
|
||||
}
|
||||
|
||||
/* everror -- flush stdout, mesage to stderr, exit */
|
||||
/* everror -- flush stdout, message to stderr, exit */
|
||||
|
||||
static void everror(const char *format, ...)
|
||||
{
|
||||
|
|
|
|||
|
|
@ -195,7 +195,7 @@
|
|||
/* EVENT_*_PARAMS -- definition of event parameters
|
||||
*
|
||||
* For each event type in EVENT_LIST, these macros list the parameters of
|
||||
* the event. THe columns are:
|
||||
* the event. The columns are:
|
||||
* - the positional index of the parameter in the list, used to define
|
||||
* numeric field names using the C preprocessor
|
||||
* - the parameter sort, similar to writef (Pointer, Addr, Word, Unsigned,
|
||||
|
|
|
|||
|
|
@ -45,7 +45,7 @@ void MeterAccumulate(Meter meter, Size amount)
|
|||
double dcount = (double)count;
|
||||
|
||||
/* .limitation.variance: This computation accumulates a running
|
||||
* mean^2, minimizing overflow, but sacrificing numerical stablity
|
||||
* mean^2, minimizing overflow, but sacrificing numerical stability
|
||||
* for small variances. For more accuracy, the data set should be
|
||||
* emitted using a telemetry stream and analyzed off-line.
|
||||
.stddev: stddev = sqrt(meanSquared - mean^2).
|
||||
|
|
@ -93,7 +93,7 @@ Res MeterWrite(Meter meter, mps_lib_FILE *stream)
|
|||
}
|
||||
|
||||
|
||||
/* MeterEmit -- emit an evnet with the current data from the meter */
|
||||
/* MeterEmit -- emit an event with the current data from the meter */
|
||||
|
||||
void MeterEmit(Meter meter)
|
||||
{
|
||||
|
|
|
|||
|
|
@ -40,7 +40,7 @@
|
|||
* we want it to just work out of the box with whatever compiler is
|
||||
* being used. In other words we do not require the client to define
|
||||
* CONFIG_PF_*.
|
||||
* (This is the case that justifes mpstd.h doing platform detection
|
||||
* (This is the case that justifies mpstd.h doing platform detection
|
||||
* by looking at preprocessor symbols; otherwise we'd simply use
|
||||
* CONFIG_PF_*).
|
||||
*
|
||||
|
|
|
|||
|
|
@ -44,7 +44,7 @@
|
|||
* .assume.i3: Assume the following about the i386 environment:
|
||||
* Steppable instructions (.assume.want) use the CS, DS & SS
|
||||
* segment registers only (see .source.i486 Table 2-3).
|
||||
* The procesor runs in 32 bit mode.
|
||||
* The processor runs in 32 bit mode.
|
||||
* The CS, DS and SS segment registers all describe identical 32-
|
||||
* bit flat address spaces.
|
||||
*/
|
||||
|
|
|
|||
|
|
@ -37,7 +37,7 @@ SRCID(pthreadext, "$Id$");
|
|||
#define PTHREADEXT_SIGRESUME SIGXCPU
|
||||
|
||||
|
||||
/* Static data initiatialized on first use of the module
|
||||
/* Static data initialized on first use of the module
|
||||
* See <design/pthreadext/#impl.static>.*
|
||||
*/
|
||||
|
||||
|
|
|
|||
|
|
@ -133,7 +133,7 @@ static TableEntry tableFind(Table table, Word key, Bool skip_deleted)
|
|||
*
|
||||
* .hash.initial: Any reasonable number.
|
||||
*
|
||||
* .hash.growth: A compromise between space inefficency (growing bigger
|
||||
* .hash.growth: A compromise between space inefficiency (growing bigger
|
||||
* than required) and time inefficiency (growing too slowly, with all
|
||||
* the rehash costs at every step). A factor of 2 means that at the
|
||||
* point of growing to a size X table, hash-work equivalent to filling
|
||||
|
|
|
|||
|
|
@ -41,7 +41,7 @@
|
|||
SRCID(thix, "$Id$");
|
||||
|
||||
|
||||
/* ThreadStruct -- thread desriptor */
|
||||
/* ThreadStruct -- thread descriptor */
|
||||
|
||||
typedef struct mps_thr_s { /* PThreads thread structure */
|
||||
Sig sig; /* <design/sig/> */
|
||||
|
|
|
|||
|
|
@ -23,7 +23,7 @@
|
|||
*
|
||||
* Other errors are assumed to only happen in certain circumstances.
|
||||
* .error.resume: ResumeThread is assumed to succeed unless the thread
|
||||
* has been destroyed (in fact, perversely, it appears to succeeed even
|
||||
* has been destroyed (in fact, perversely, it appears to succeed even
|
||||
* when the thread has been destroyed).
|
||||
* .error.suspend: SuspendThread is assumed to succeed unless the thread
|
||||
* has been destroyed.
|
||||
|
|
|
|||
|
|
@ -81,7 +81,7 @@ Res ThreadScan(ScanState ss, Thread thread, void *stackBot)
|
|||
|
||||
/* scan stack and register roots in other threads */
|
||||
|
||||
/* This dumps the relevent registers into the context */
|
||||
/* This dumps the relevant registers into the context */
|
||||
/* .context.flags */
|
||||
context.ContextFlags = CONTEXT_CONTROL | CONTEXT_INTEGER;
|
||||
/* .thread.handle.get-context */
|
||||
|
|
@ -109,8 +109,8 @@ Res ThreadScan(ScanState ss, Thread thread, void *stackBot)
|
|||
|
||||
/* (.context.regroots)
|
||||
* This scans the root registers (.context.regroots). It also
|
||||
* unecessarily scans the rest of the context. The optimisation
|
||||
* to scan only relevent parts would be machine dependent.
|
||||
* unnecessarily scans the rest of the context. The optimisation
|
||||
* to scan only relevant parts would be machine dependent.
|
||||
*/
|
||||
res = TraceScanAreaTagged(ss, (Addr *)&context,
|
||||
(Addr *)((char *)&context + sizeof(CONTEXT)));
|
||||
|
|
|
|||
|
|
@ -81,7 +81,7 @@ Res ThreadScan(ScanState ss, Thread thread, void *stackBot)
|
|||
|
||||
/* scan stack and register roots in other threads */
|
||||
|
||||
/* This dumps the relevent registers into the context */
|
||||
/* This dumps the relevant registers into the context */
|
||||
/* .context.flags */
|
||||
context.ContextFlags = CONTEXT_CONTROL | CONTEXT_INTEGER;
|
||||
/* .thread.handle.get-context */
|
||||
|
|
@ -109,8 +109,8 @@ Res ThreadScan(ScanState ss, Thread thread, void *stackBot)
|
|||
|
||||
/* (.context.regroots)
|
||||
* This scans the root registers (.context.regroots). It also
|
||||
* unecessarily scans the rest of the context. The optimisation
|
||||
* to scan only relevent parts would be machine dependent.
|
||||
* unnecessarily scans the rest of the context. The optimisation
|
||||
* to scan only relevant parts would be machine dependent.
|
||||
*/
|
||||
res = TraceScanAreaTagged(ss, (Addr *)&context,
|
||||
(Addr *)((char *)&context + sizeof(CONTEXT)));
|
||||
|
|
|
|||
|
|
@ -990,7 +990,7 @@ static Bool traceFindGrey(Seg *segReturn, Rank *rankReturn,
|
|||
Rank band = traceBand(trace);
|
||||
|
||||
/* Within the R band we look for segments of rank R first, */
|
||||
/* then succesively earlier ones. Slight hack: We never */
|
||||
/* then successively earlier ones. Slight hack: We never */
|
||||
/* expect to find any segments of RankAMBIG, so we use */
|
||||
/* this as a terminating condition for the loop. */
|
||||
for(rank = band; rank > RankAMBIG; --rank) {
|
||||
|
|
@ -1245,7 +1245,7 @@ void TraceSegAccess(Arena arena, Seg seg, AccessSet mode)
|
|||
AVER((mode & SegSM(seg) & AccessREAD) == 0
|
||||
|| TraceSetInter(SegGrey(seg), arena->flippedTraces) != TraceSetEMPTY);
|
||||
|
||||
/* If it's a write acess, then the segment must have a summary that */
|
||||
/* If it's a write access, then the segment must have a summary that */
|
||||
/* is smaller than the mutator's summary (which is assumed to be */
|
||||
/* RefSetUNIV). */
|
||||
AVER((mode & SegSM(seg) & AccessWRITE) == 0 || SegSummary(seg) != RefSetUNIV);
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue