# New Ticket Created by Nick Glencross
# Please include the string: [perl #35020]
# in the subject line of all future correspondence about this issue.
# <URL: https://rt.perl.org/rt3/Ticket/Display.html?id=35020 >
These typos were part of a patch in #34989, but I confused everyone with
patch #34988 which got created through an accident.
This patch supersedes typos3.patch in #34989. I also made reference to
'rellocation' perhaps being 'relocation', but not feeling brave enough
to fix it as it is used in 'real code'.
This will be the last typo fixes from me for a few months now...
Regards,
Nick
Index: src/gc_gms.c
===================================================================
--- src/gc_gms.c (revision 7857)
+++ src/gc_gms.c (working copy)
@@ -70,7 +70,7 @@
A mark phase now processes the root set and only objects from the
young generation. When all objects are either referenced by the root
-set or only by the young generation, the algoritm is correct and
+set or only by the young generation, the algorithm is correct and
complete.
But there is of course the possibilty that a young object is
Index: src/gc_ims.c
===================================================================
--- src/gc_ims.c (revision 7857)
+++ src/gc_ims.c (working copy)
@@ -214,7 +214,7 @@
The current sweep of the whole arena is done, or with implicit reclamation:
-Garbage gets appened to the free-list by merging the unscanned
+Garbage gets appended to the free-list by merging the unscanned
from-space with the free-list, these objects are all considered white.
All other items are in the to-space and are black. These objects
constitute the from-space of the new collection cycle.
@@ -365,7 +365,7 @@
* we run the copying collector, if memory pool statistics indicate
* that this amount of the total size could be freed
*
- * This factor also depends on the allocatio color of buffer headers,
+ * This factor also depends on the allocation color of buffer headers,
* which is set to black now. So we are always one DOD cycle behind
* and the statistics are rather wrong.
*/
@@ -933,8 +933,8 @@
=item C<void Parrot_dod_ims_wb(Interp*, PMC *agg, PMC *new)>
-Write barriere called by the DOD_WRITE_BARRIER macro. Always when a
-white object gets store into a black aggregate, either the object must
+Write barrier called by the DOD_WRITE_BARRIER macro. Always when a
+white object gets stored into a black aggregate, either the object must
be greyed or the aggregate must be rescanned - by greying it.
=cut
Index: src/dod.c
===================================================================
--- src/dod.c (revision 7857)
+++ src/dod.c (working copy)
@@ -925,7 +925,7 @@
int bound = sizeof(size_t) * 8;
/* Shifting a value by its size (in bits) or larger is undefined behaviour.
- So need an explict check to return 0 if there is no prefix, rather than
+ So need an explicit check to return 0 if there is no prefix, rather than
attempting to rely on (say) 0xFFFFFFFF << 32 being 0. */
for (i = 0; i < bound; i++) {
if (val1 == val2) {
Index: src/malloc.c
===================================================================
--- src/malloc.c (revision 7857)
+++ src/malloc.c (working copy)
@@ -1,7 +1,7 @@
/*
This is a version (aka dlmalloc) of malloc/free/realloc written by
Doug Lea and released to the public domain. Use, modify, and
- redistribute this code without permission or acknowledgment in any
+ redistribute this code without permission or acknowledgement in any
way you wish. Send questions, comments, complaints, performance
data, etc to [EMAIL PROTECTED]
@@ -345,7 +345,7 @@
checking is fairly extensive, and will slow down execution
noticeably. Calling malloc_stats or mallinfo with DEBUG set will
attempt to check every non-mmapped allocated and free chunk in the
- course of computing the summmaries. (By nature, mmapped regions
+ course of computing the summaries. (By nature, mmapped regions
cannot be checked very much automatically.)
Setting DEBUG may also be helpful if you are trying to modify
@@ -2091,7 +2091,7 @@
and consolidated sets of chunks, which is what these bins hold, so
they can be found quickly. All procedures maintain the invariant
that no consolidated chunk physically borders another one, so each
- chunk in a list is known to be preceeded and followed by either
+ chunk in a list is known to be preceded and followed by either
inuse chunks or the ends of memory.
Chunks in bins are kept in size order, with ties going to the
@@ -3123,7 +3123,7 @@
if (contiguous(av)) {
/*
- We can tolerate forward non-contiguities here (usually due
+ We can tolerate forward non-continuities here (usually due
to foreign calls) but treat them as part of our space for
stats reporting.
*/
Index: src/thread.c
===================================================================
--- src/thread.c (revision 7857)
+++ src/thread.c (working copy)
@@ -346,7 +346,7 @@
* clone the PMC into caller, if its not a shared PMC
* the PMC is not in the parents root set nor in the
* stack so block DOD during clone
- * XXX should probably aquire the parent's interpreter mutex
+ * XXX should probably acquire the parent's interpreter mutex
*/
Parrot_block_DOD(parent);
if (PObj_is_PMC_shared_TEST((PObj*)retval))
Index: src/mmd.c
===================================================================
--- src/mmd.c (revision 7857)
+++ src/mmd.c (working copy)
@@ -321,7 +321,7 @@
}
/*
- * return possibly new dstination
+ * return possible new destination
*/
PMC*
mmd_dispatch_p_ppp(Interp *interpreter,
@@ -1129,7 +1129,7 @@
=item C<static PMC* mmd_search_default(Interp *, STRING *meth, PMC *arg_tuple)>
Default implementation of MMD search. Search scopes for candidates, walk the
-class hierarchy, sort all candidates by their manhattan distance, and return
+class hierarchy, sort all candidates by their Manhattan distance, and return
result
=cut
@@ -1759,7 +1759,7 @@
table = interpreter->binop_mmd_funcs;
if ((INTVAL)table->x < type && type < enum_class_core_max) {
/*
- * pre-alloacte the function table
+ * pre-allocate the function table
*/
for (i = 0; i < MMD_USER_FIRST; ++i) {
mmd_register(interpreter, i, enum_class_core_max - 1,
Index: docs/dev/rx.dev
===================================================================
--- docs/dev/rx.dev (revision 7857)
+++ docs/dev/rx.dev (working copy)
@@ -16,7 +16,7 @@
=over 4
-=item B<rx_alloacate_info>
+=item B<rx_allocate_info>
Initializes a regular expression object and allocates the memory.
@@ -122,7 +122,7 @@
//handle their own substitutions (s///). Now
this
//is not the case. This can probably be
removed.
- IntStack stack; //Sets up an intstack for internal use
(backtrackig purposes)
+ IntStack stack; //Sets up an intstack for internal use
(backtracking purposes)
} rxinfo;
Index: docs/pmc/array.pod
===================================================================
--- docs/pmc/array.pod (revision 7857)
+++ docs/pmc/array.pod (working copy)
@@ -41,7 +41,7 @@
set I0, P0
This will put the size of the array in register C<P0> into C<I0>. In the
-same way, assigning an integer driectly to the array sets the size of the
+same way, assigning an integer directly to the array sets the size of the
array. For instance:
new P0, .Array
Index: docs/pmc/struct.pod
===================================================================
--- docs/pmc/struct.pod (revision 7857)
+++ docs/pmc/struct.pod (working copy)
@@ -34,7 +34,7 @@
The third initializer is the byte offset of the data item in the structure.
This entry can be 0 if packing of the structure is aligned to the item's sizes
or the alignment is the item's size. Otherwise these offsets must be set
-correctly as Parrot doesn't know, how your C compiler packs arbitray data.
+correctly as Parrot doesn't know, how your C compiler packs arbitrary data.
Parrot only knows the size of each item.
=back
Index: docs/pmc/perlhash.pod
===================================================================
--- docs/pmc/perlhash.pod (revision 7857)
+++ docs/pmc/perlhash.pod (working copy)
@@ -65,7 +65,7 @@
defined I0, P0["a"]
-TODO: Steve Fink sayd:
+TODO: Steve Fink said:
And if there were a keys() method, then 'defined' and 'exists' are
very different. (And there ought to be, and would be if we weren't
Index: docs/glossary.pod
===================================================================
--- docs/glossary.pod (revision 7857)
+++ docs/glossary.pod (working copy)
@@ -256,7 +256,7 @@
=head2 Warnock's Dilemma
The dilemma you face when posting a message to a public forum about
-something and not even getting an acknowledgment of its
+something and not even getting an acknowledgement of its
existence. This leaves you wondering if your problem is unimportant or
previously addressed, if everyone's waiting on someone else to answer
you, or if maybe your mail never actually made it to anyone else in
Index: docs/pdds/pdd17_basic_types.pod
===================================================================
--- docs/pdds/pdd17_basic_types.pod (revision 7857)
+++ docs/pdds/pdd17_basic_types.pod (working copy)
@@ -44,7 +44,7 @@
a value of 0 if a boolean false is assigned.
If an out-of-range value is assigned to an Integer PMC, the PMC will
-throw an exception if exact math is enaabled.
+throw an exception if exact math is enabled.
=item Float
Index: docs/pdds/pdd09_gc.pod
===================================================================
--- docs/pdds/pdd09_gc.pod (revision 7857)
+++ docs/pdds/pdd09_gc.pod (working copy)
@@ -132,7 +132,7 @@
Currently only one GC system is active (selected at configure or
compile time). But future versions might support switching GC systems
-during runtime to accomodate for different work loads.
+during runtime to accommodate for different work loads.
=over 4
Index: ops/pmc.ops
===================================================================
--- ops/pmc.ops (revision 7857)
+++ ops/pmc.ops (working copy)
@@ -52,7 +52,7 @@
=item B<new>(out PMC, in INT, in PMC, in PMC)
Like above. The fourth argument is a property hash - it isn't copied in,
-only referended. The initializer may be NULL.
+only referenced. The initializer may be NULL.
=cut
@@ -203,7 +203,7 @@
=item B<get_repr>(out STR, in PMC)
-Set $1 to a string reprentation of $2
+Set $1 to a string representation of $2
=cut
Index: ops/debug.ops
===================================================================
--- ops/debug.ops (revision 7857)
+++ ops/debug.ops (working copy)
@@ -12,7 +12,7 @@
=head1 DESCRIPTION
-Parrot debuger
+Parrot debugger
=cut
Index: ops/object.ops
===================================================================
--- ops/object.ops (revision 7857)
+++ ops/object.ops (working copy)
@@ -56,8 +56,8 @@
Find the method $3 for object $2 and put it in $1.
Throws a Method_Not_Found_Exception for a non-existent method.
-The returned PMC may be outdatet, when the call is actually performed and
-changes to the underlaying classes where made.
+The returned PMC may be outdated, when the call is actually performed and
+changes to the underlying classes where made.
=cut
Index: NEWS
===================================================================
--- NEWS (revision 7857)
+++ NEWS (working copy)
@@ -41,7 +41,7 @@
- String iterators
- String bitwise vtables
- Many new opcodes
- - Suppport for JIT, where malloced memory isn't executable
+ - Support for JIT, where malloced memory isn't executable
- Priority DOD scheme for objects that need timely destruction
- Improved byte code loading (e.g. onLoad functions)
- Language updates: forth, Perl6/P6C, m4
Index: include/parrot/caches.h
===================================================================
--- include/parrot/caches.h (revision 7857)
+++ include/parrot/caches.h (working copy)
@@ -35,7 +35,7 @@
Meth_cache_entry ***idx; /* bufstart idx */
/* PMC **hash */ /* for non-constant keys */
struct Stack_Chunk * frame_cache; /* register frame cache */
- PMC* retc_cache; /* return contiunations recyling */
+ PMC* retc_cache; /* return continuations recycling */
} Caches;
void init_object_cache(Parrot_Interp interpreter);
Index: include/parrot/debug.h
===================================================================
--- include/parrot/debug.h (revision 7857)
+++ include/parrot/debug.h (working copy)
@@ -76,7 +76,7 @@
/* PDB_line_t
* A line in the source file.
*
- * opcode: A pointer to the opcode in the bytecode correspoinding to
+ * opcode: A pointer to the opcode in the bytecode corresponding to
* this line.
* source_offset: Offset from the source file start.
* number: Line number.
Index: include/parrot/intlist.h
===================================================================
--- include/parrot/intlist.h (revision 7857)
+++ include/parrot/intlist.h (working copy)
@@ -29,7 +29,7 @@
Buffer chunk_list; /* holding list of chunks for fast access (1)
*/
size_t n_chunks; /* number of used chunks in chunk_list (1) */
/* all above items, marked (1) are only valid in the head junk
- * s. intlist.c for a detailled description */
+ * s. intlist.c for a detailed description */
INTVAL start;
INTVAL end;
IntList_Chunk* next;
Index: include/parrot/interpreter.h
===================================================================
--- include/parrot/interpreter.h (revision 7857)
+++ include/parrot/interpreter.h (working copy)
@@ -25,7 +25,7 @@
PARROT_PROFILE_FLAG = 0x08, /* gathering profile information */
PARROT_GC_DEBUG_FLAG = 0x10, /* debugging memory management */
- PARROT_EXTERN_CODE_FLAG = 0x100, /* reusing anothers interps code */
+ PARROT_EXTERN_CODE_FLAG = 0x100, /* reusing another's interps code */
PARROT_DESTROY_FLAG = 0x200, /* the last interpreter shall cleanup */
PARROT_IS_THREAD = 0x1000, /* interpreter is a thread */
Index: jit/i386/jit_emit.h
===================================================================
--- jit/i386/jit_emit.h (revision 7857)
+++ jit/i386/jit_emit.h (working copy)
@@ -1267,7 +1267,7 @@
/* ABS - ST(0) = ABS(ST(0)) */
# define emitm_fabs(pc) emitm_fl_4(pc, 1)
-/* Comparisions */
+/* Comparisons */
# define emitm_fcom(pc, sti) emitm_fl_3(pc, emit_b000, emit_b010, sti)
@@ -1420,7 +1420,7 @@
jit_emit_fstore_m_n(pc, mem); \
}
-/* Integer comparisions */
+/* Integer comparisons */
# define jit_emit_cmp_rr(pc, reg1, reg2) \
emitm_alul_r_r(pc, 0x39, reg2, reg1)
# define jit_emit_cmp_rr_i(pc, r1, r2) jit_emit_cmp_rr(pc, r1, r2)
@@ -2797,7 +2797,7 @@
cur_op = CORE_OPS_wrapper__;
}
/*
- * op functions have the signature (cur_op, intepreter)
+ * op functions have the signature (cur_op, interpreter)
* we use the interpreter already on stack and only push the
* cur_op
*/
@@ -3192,7 +3192,7 @@
#endif /* JIT_EMIT */
#if JIT_EMIT == 0
# define REQUIRES_CONSTANT_POOL 0
-/* # define INT_REGISTERS_TO_MAP 4 definiton at top */
+/* # define INT_REGISTERS_TO_MAP 4 definition at top */
# define FLOAT_REGISTERS_TO_MAP 4
# ifndef JIT_IMCC
Index: ast/astparser.c
===================================================================
--- ast/astparser.c (revision 7857)
+++ ast/astparser.c (working copy)
@@ -568,7 +568,7 @@
/*------------------------------------------------------------------.
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
-| TOP (cinluded). |
+| TOP (inclusive). |
`------------------------------------------------------------------*/
#if defined (__STDC__) || defined (__cplusplus)
Index: ast/node.c
===================================================================
--- ast/node.c (revision 7857)
+++ ast/node.c (working copy)
@@ -167,7 +167,7 @@
{
/*
* Python abuses add as concat and mul as repeat
- * so only arithmethic PMCs are symmetric
+ * so only arithmetic PMCs are symmetric
*/
return 0; /* if python */
Index: ChangeLog
===================================================================
--- ChangeLog (revision 7857)
+++ ChangeLog (working copy)
@@ -21,7 +21,7 @@
* Complex PMC
* Dynamic loading improved including bundles of PMC classes
* Experimental support for "make install"
- * IA64 and hppa JIT supprt
+ * IA64 and hppa JIT support
* ICU unicode support
* IO layer handling code
* IO readline and buffered IO fixes
@@ -64,7 +64,7 @@
* String iterators
* String bitwise vtables
* Many new opcodes
- * Suppport for JIT, where malloced memory isn't executable
+ * Support for JIT, where malloced memory isn't executable
* Priority DOD scheme for objects that need timely destruction
* Improved bytecode loading (e.g. onLoad functions)
* Language updates: forth, Perl6/P6C, m4
@@ -414,7 +414,7 @@
2002-03-16 14:38 ajgough
* Makefile.in: Small fix to Makefile.in to keep Irix make happy
- with commenting.
+ with comenting.
2002-03-16 11:45 simon
@@ -3372,7 +3372,7 @@
2002-01-06 02:17 gregor
* interpreter.c:
- Removed unneccessary include.
+ Removed unnecessary include.
2002-01-05 12:37 simon
@@ -4276,7 +4276,7 @@
Some changes to the strings docs, but not yet complete.
Also, PerlString was copying pointers to strings, rather than
- strings themselves, so some action-at-a-distance bugs were creaping
+ strings themselves, so some action-at-a-distance bugs were creeping
in, I think I've fixed this so everything works nicely.
2001-12-28 04:56 gregor
@@ -4986,7 +4986,7 @@
part), so we call the prederef() function with sufficient args that
it can go look up opfunc pointers and op arg types and put the
opfunc and arg pointers at cur_opcode[0] .. cur_opcode[N - 1],
- where N is the number of args (counding the op itself as one arg).
+ where N is the number of args (counting the op itself as one arg).
We assume that sizeof(INTVAL) <= sizeof(void *), so we can continue
to have inline INTVAL constants.
@@ -6548,7 +6548,7 @@
2001-10-17 22:08 gregor
* Parrot/Assembler.pm, lib/Parrot/Assembler.pm:
- * Now handles label-and-commment-only lines.
+ * Now handles label-and-comment-only lines.
2001-10-17 22:04 bdwheele
@@ -6616,7 +6616,7 @@
2001-10-16 20:43 gregor
* Makefile.in:
- * Fixed dependancies for building Parrot/OpLib/core.pm
+ * Fixed dependencies for building Parrot/OpLib/core.pm
2001-10-16 19:35 bdwheele
@@ -8197,7 +8197,7 @@
global_setup.h, interpreter.h, io.h, memory.h, parrot.h,
process_opfunc.pl, register.h, stacks.h, string.h, strnative.h:
Committed some files that were missed in the last *.h moving
- commmit.
+ commit.
2001-09-18 02:17 gregor
Index: classes/parrotinterpreter.pmc
===================================================================
--- classes/parrotinterpreter.pmc (revision 7857)
+++ classes/parrotinterpreter.pmc (working copy)
@@ -102,7 +102,7 @@
=item C<static void
clone_regs_thread(Parrot_Interp d, Parrot_Interp s, PMC *dest)>
-Copy/clone thread start paramaters. All resources are created in the
+Copy/clone thread start parameters. All resources are created in the
destination interpreter.
=cut
Index: classes/slice.pmc
===================================================================
--- classes/slice.pmc (revision 7857)
+++ classes/slice.pmc (working copy)
@@ -151,7 +151,7 @@
{
parrot_range_t *r = PMC_struct_val(self);
if (!r || (INTVAL) r == -1)
- real_exception(interpreter, NULL, E_StopIteration, "StopIteratrion");
+ real_exception(interpreter, NULL, E_StopIteration, "StopIteration");
if (r->type == enum_type_INTVAL) {
RVal_int(r->cur) += RVal_int(r->step);
if (RVal_int(r->step) > 0) {
@@ -290,7 +290,7 @@
INTVAL get_integer() {
parrot_range_t *r = PMC_struct_val(SELF);
if (!r || (INTVAL) r == -1)
- real_exception(INTERP, NULL, E_StopIteration, "StopIteratrion");
+ real_exception(INTERP, NULL, E_StopIteration, "StopIteration");
return RVal_int(r->cur);
}
Index: README
===================================================================
--- README (revision 7857)
+++ README (working copy)
@@ -31,7 +31,7 @@
For most of the platforms that we are supporting initially,
Parrot should build out of the box.
-The list of targetted platforms can be found in PLATFORMS.
+The list of targeted platforms can be found in PLATFORMS.
The current configure system is primitive, as it's only
a temporary solution. It will be happy with most any answers
Index: types/bignum.c
===================================================================
--- types/bignum.c (revision 7857)
+++ types/bignum.c (working copy)
@@ -684,7 +684,7 @@
}
break;
default:
- BN_EXCEPT(PINT_ BN_INVALID_OPERATION, "An unknown error occured");
+ BN_EXCEPT(PINT_ BN_INVALID_OPERATION, "An unknown error occurred");
}
}
@@ -1204,7 +1204,7 @@
=item C<int
BN_really_zero(PINTD_ BIGNUM* bn, int allow_neg_zero)>
-Sets any number which should be zero to a cannonical zero.
+Sets any number which should be zero to a canonical zero.
To check if a number is equal to zero, use C<BN_is_zero()>.
@@ -1844,7 +1844,7 @@
/* Do the numbers overlap (within precision (and a bit) digits)?
If not, we can simply use the first and round given the second
- by catenating `01' to the result... Remember that we also know
+ by concatenating `01' to the result... Remember that we also know
that neither is zero */
if (context->precision > -1 &&
@@ -2376,7 +2376,7 @@
BN_EXCEPT(PINT_ BN_OVERFLOW, "overflow in multiplication");
}
if (i < -context->elimit) {
- BN_EXCEPT(PINT_ BN_UNDERFLOW, "underflow in multipliaction");
+ BN_EXCEPT(PINT_ BN_UNDERFLOW, "underflow in multiplication");
}
result->expn = i;
@@ -2836,7 +2836,7 @@
/* We assume we've been given something to divide */
/* Make some temporaries, set all signs to positive for simplicity */
- /* We use result as a tempory, and store the reversed result in t2 */
+ /* We use result as a temporary, and store the reversed result in t2 */
div = BN_new(PINT_ 1);
BN_copy(PINT_ div, one);
BN_copy(PINT_ rem, div); /* In case doing int-div and don't div*/
Index: languages/perl6/perl6
===================================================================
--- languages/perl6/perl6 (revision 7857)
+++ languages/perl6/perl6 (working copy)
@@ -155,7 +155,7 @@
-h|--help Print this message and exit
--help-(imcc|parrot|test|parser|output|global)
Print detailed help for one subpart
- -v|--verbose Print mesages about compile stages (repeat for
+ -v|--verbose Print messages about compile stages (repeat for
more verbosity)
-V|--version Print versions and exit
-w|--warnings Print warnings (repeat for more warnings)
@@ -1054,7 +1054,7 @@
=item -v|--verbose
-Print mesages about compile stages
+Print messages about compile stages
=item -vv
