# New Ticket Created by Nick Glencross
# Please include the string: [perl #34966]
# in the subject line of all future correspondence about this issue.
# <URL: https://rt.perl.org/rt3/Ticket/Display.html?id=34966 >
This patch against r7825 fixes about 30-odd typos. All are in
comments/docs, so all changes are just polish.
Regards,
Nick
Index: src/pdb.c
===================================================================
--- src/pdb.c (revision 7825)
+++ src/pdb.c (working copy)
@@ -200,7 +200,7 @@
=item * Print the interpreter info.
=item * Make the user interface better (add comands
-history/completition).
+history/completion).
=item * Some other things I don't remember now because it's late.
Index: src/tsq.c
===================================================================
--- src/tsq.c (revision 7825)
+++ src/tsq.c (working copy)
@@ -142,7 +142,7 @@
=item C<void
unshift_entry(QUEUE *queue, QUEUE_ENTRY *entry)>
-Does a syncronized insertion of C<entry> into the head of the queue.
+Does a synchronized insertion of C<entry> into the head of the queue.
=cut
@@ -223,7 +223,7 @@
=item C<void
insert_entry(QUEUE *queue, QUEUE_ENTRY *entry)>
-Does a syncronized insert of C<entry>.
+Does a synchronized insert of C<entry>.
=cut
Index: src/pbc_info.c
===================================================================
--- src/pbc_info.c (revision 7825)
+++ src/pbc_info.c (working copy)
@@ -32,7 +32,7 @@
=item C<static INTVAL iter(Interp*, struct PackFile_Segment *seg, void
*user_data)>
This function is passed the callback to C<PackFile_map_segments()> to
-print out the name of each segment in the directoty.
+print out the name of each segment in the directory.
=cut
Index: src/hash.c
===================================================================
--- src/hash.c (revision 7825)
+++ src/hash.c (working copy)
@@ -646,7 +646,7 @@
hash_comp_fn compare, hash_hash_key_fn keyhash,
hash_mark_key_fn mark)>
-Like above but w/o the decribed problems. The passed in C<container> PMC gets
+Like above but w/o the described problems. The passed in C<container> PMC gets
stored in the Hash end the newly created Hash is in PMC_struct_val(container).
=cut
@@ -746,7 +746,7 @@
=item C<STRING *
hash_get_idx(Interp *interpreter, Hash *hash, PMC * key)>
-Called by interator.
+Called by iterator.
=cut
Index: src/gc_gms.c
===================================================================
--- src/gc_gms.c (revision 7825)
+++ src/gc_gms.c (working copy)
@@ -74,7 +74,7 @@
complete.
But there is of course the possibilty that a young object is
-stored into an aggregate of an older gneration. This case is tracked
+stored into an aggregate of an older generation. This case is tracked
by the write barrier, which remembers all such operations in the IGP
(inter generational pointer) list. When now generation 1 is marked,
the IGP list can be considered as an extension to the root set, so
@@ -137,7 +137,7 @@
*
* A scope_enter happens on a subroutine call *and' with new_pad /
* push_pad opcodes. Each lexical scope must have its distinct register
- * frame, else timely detruction can't work.
+ * frame, else timely destruction can't work.
* If the frame needs active destruction, the old frame should be
* converted to the (new-1) generation, the inner frame is the nursery.
* On scope exit the newest (nursery) generation is collected and the
@@ -1338,7 +1338,7 @@
}
else {
/*
- * successfull lazy DOD run
+ * successful lazy DOD run
*/
++arena_base->lazy_dod_runs;
}
Index: src/gc_ims.c
===================================================================
--- src/gc_ims.c (revision 7825)
+++ src/gc_ims.c (working copy)
@@ -26,11 +26,11 @@
=head1 Drawbacks of the current mark and sweep collector.
- * can take arbitray time to complete (1s for 1 Meg objects)
+ * can take arbitrary time to complete (1s for 1 Meg objects)
* can't be used in multi-threaded Parrot
* works fast for plain (non-aggregate) objects but suffers badly
for nested aggregates or HLL objects
- * the sweep phase takes time proportional to the allocated storeage
+ * the sweep phase takes time proportional to the allocated storage
=head1 INCREMENTAL GARBAGE COLLECTION
@@ -205,7 +205,7 @@
=item c) near the end of a DOD cycle
-The rest of the root set is scanned i.e. the registers. By defering
+The rest of the root set is scanned i.e. the registers. By deferring
scanning of registers all temporaries that might have exist somewhen
just stay unscanned - they will be collected in this DOD cycle, if
we allocate new objects white or in the next DOD cycle.
@@ -232,7 +232,7 @@
Finally, we might trigger a collect run on string and buffer memory if
there is an impending shortage of resources. While the copying compactor
-is rather independend of the collector that cleans object headers, its
+is rather independent of the collector that cleans object headers, it's
more efficient to collect buffer memory when the live information is
accurate. This avoids copying of dead buffer memory.
@@ -267,7 +267,7 @@
=item the object graph
The MS and IMS scheme use the next_for_GC pointer for keeping track of
-references. This interfers with the freeze functionality, which can use
+references. This interferes with the freeze functionality, which can use
the same pointer to keep track of visited objects.
IMIR has a dedicated pointer pair to build the object graph.
@@ -282,7 +282,7 @@
=item big aggregates
Greying has to be done in increments. Big aggregates can't have a mark
-vtable that oould run arbitrarly long. This means that the DOD system
+vtable that oould run arbitrarily long. This means that the DOD system
must know the layout of arrays, hashes, and objects. This is currently
true for arrays and objects but not for hashes. But the latter need some
refactoring of internals anyway.
Index: src/events.c
===================================================================
--- src/events.c (revision 7825)
+++ src/events.c (working copy)
@@ -12,7 +12,7 @@
are due, they are placed in per interpreter task_queues, where they are
handled then by the C<check_event*> opcodes.
-IO events and signals are catched in the io_thread, which again
+IO events and signals are caught in the io_thread, which again
dispatches these to one or all interpreters.
=cut
@@ -1041,7 +1041,7 @@
=item C<void*
Parrot_do_check_events(Parrot_Interp interpreter, void *next)>
-Explicitely C<sync> called by the check_event opcode from run loops.
+Explicitly C<sync> called by the check_event opcode from run loops.
=cut
Index: src/dod.c
===================================================================
--- src/dod.c (revision 7825)
+++ 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) {
@@ -1213,7 +1213,7 @@
}
else {
/*
- * successfull lazy DOD count
+ * successful lazy DOD count
*/
++arena_base->lazy_dod_runs;
/* it was an aborted lazy dod run - we should clear
Index: src/packout.c
===================================================================
--- src/packout.c (revision 7825)
+++ src/packout.c (working copy)
@@ -324,7 +324,7 @@
Rework by Melvin; new bytecode format, make bytecode portable. (Do
endian conversion and wordsize transforms on the fly.)
-leo: rewrite to use new dirctory based format.
+leo: rewrite to use new directory based format.
=cut
Index: src/list.c
===================================================================
--- src/list.c (revision 7825)
+++ src/list.c (working copy)
@@ -1279,7 +1279,7 @@
}
}
list = list_new(interpreter, type);
- if (list->item_type == enum_type_sized) { /* overridde item_size */
+ if (list->item_type == enum_type_sized) { /* override item_size */
if (!item_size)
internal_exception(1, "No item_size for type_sized list\n");
list->item_size = item_size;
@@ -1420,7 +1420,7 @@
i = 0;
if (p && next && (( dist = (char*)next - (char*)p ) == obj_size ||
-dist == obj_size)) {
- /* we have a first object and a nexz one - calculate it's
+ /* we have a first object and a nexz one - calculate its
* arena values see also src/dod.c
*/
struct Small_Object_Arena *arena = GET_ARENA(p);
Index: src/pmc.c
===================================================================
--- src/pmc.c (revision 7825)
+++ src/pmc.c (working copy)
@@ -418,7 +418,7 @@
{
PMC *class;
/*
- * class interface - a PMC is it's own class
+ * class interface - a PMC is its own class
* put an instance of this PMC into class
*
* create a constant PMC
Index: src/string.c
===================================================================
--- src/string.c (revision 7825)
+++ src/string.c (working copy)
@@ -68,7 +68,7 @@
STRING for_alloc;
/* Create new pool data for this header to use,
- * independant of the original COW data */
+ * independent of the original COW data */
PObj_constant_CLEAR(s);
/*
* allocate a dummy strings memory
@@ -2140,7 +2140,7 @@
=item C<void
string_pin(Interp * interpreter, STRING * s)>
-Replace the apecified Parrot string's managed buffer memory by system
+Replace the specified Parrot string's managed buffer memory by system
memory.
=cut
Index: src/malloc.c
===================================================================
--- src/malloc.c (revision 7825)
+++ 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 acknowledgement in any
+ redistribute this code without permission or acknowledgment in any
way you wish. Send questions, comments, complaints, performance
data, etc to [EMAIL PROTECTED]
@@ -1891,7 +1891,7 @@
the malloc code, but "mem" is the pointer that is returned to the
user. "Nextchunk" is the beginning of the next contiguous chunk.
- Chunks always begin on even word boundries, so the mem portion
+ Chunks always begin on even word boundaries, so the mem portion
(which is returned to the user) is also on an even word boundary, and
thus at least double-word aligned.
@@ -3682,7 +3682,7 @@
We require that av->top always exists (i.e., has size >=
MINSIZE) after initialization, so if it would otherwise be
- exhuasted by current request, it is replenished. (The main
+ exhausted by current request, it is replenished. (The main
reason for ensuring it exists is that we may need MINSIZE space
to put in fenceposts in sysmalloc.)
*/
@@ -5497,10 +5497,10 @@
Wolfram Gloger ([EMAIL PROTECTED]).
* Use last_remainder in more cases.
* Pack bins using idea from [EMAIL PROTECTED]
- * Use ordered bins instead of best-fit threshhold
+ * Use ordered bins instead of best-fit threshold
* Eliminate block-local decls to simplify tracing and debugging.
* Support another case of realloc via move into top
- * Fix error occuring when initial sbrk_base not word-aligned.
+ * Fix error occurring when initial sbrk_base not word-aligned.
* Rely on page size for units instead of SBRK_UNIT to
avoid surprises about sbrk alignment conventions.
* Add mallinfo, mallopt. Thanks to Raymond Nijssen
Index: src/res_lea.c
===================================================================
--- src/res_lea.c (revision 7825)
+++ src/res_lea.c (working copy)
@@ -31,7 +31,7 @@
=item C<void
Parrot_go_collect(Interp *interpreter)>
-Does nothing other than increment the iterpreter's C<collect_runs>
+Does nothing other than increment the interpreter's C<collect_runs>
count.
=cut
Index: src/stack_common.c
===================================================================
--- src/stack_common.c (revision 7825)
+++ src/stack_common.c (working copy)
@@ -9,7 +9,7 @@
=head1 DESCRIPTION
Both the register stacks and stacks implemented in F<src/stacks.c>
-have a common funcionality, which is implemented in this file.
+have a common functionality, which is implemented in this file.
These stacks all differ only in the size of items.
Index: src/objects.c
===================================================================
--- src/objects.c (revision 7825)
+++ src/objects.c (working copy)
@@ -52,7 +52,7 @@
return new_array;
}
-/* Take the class and completely rebuild the atttribute stuff for
+/* Take the class and completely rebuild the attribute stuff for
it. Horribly destructive, and definitely not a good thing to do if
there are instantiated objects for the class */
static void
@@ -173,7 +173,7 @@
Create a vtable that dispatches either to the contained PMC in the first
attribute (deleg_pmc) or to an overridden method (delegate), depending
-on the existance of the method for this class.
+on the existence of the method for this class.
=cut
@@ -446,7 +446,7 @@
parrot_class_register(Interp* interpreter, STRING *class_name,
PMC *new_class, PMC *mro)>
-This is the way to register a new Parrot class as an instantiatable
+This is the way to register a new Parrot class as an instantiable
type. Doing this involves putting it in the class hash, setting its
vtable so that the C<init> method initializes objects of the class rather than
the class itself, and adding it to the interpreter's base type table so
@@ -1192,7 +1192,7 @@
*/
-/* Life is ever so much easiser if a class keeps its attributes at the
+/* Life is ever so much easier if a class keeps its attributes at the
end of the attribute array, since we don't have to insert and
reorder attributes. Inserting's no big deal, especially since we're
going to break horribly if you insert into a class that's been
Index: src/library.c
===================================================================
--- src/library.c (revision 7825)
+++ src/library.c (working copy)
@@ -154,7 +154,7 @@
enum_runtime_ft type)>
Locate the full patch for C<file_name> and the given file type(s). If
-successfull returns a mem_sys_allocate()ed string or NULL otherwise.
+successful, returns a mem_sys_allocate()ed string or NULL otherwise.
The C<enum_runtime_ft type> is one or more of the types defined in
F<include/parrot/library.h>.
Index: src/inter_create.c
===================================================================
--- src/inter_create.c (revision 7825)
+++ src/inter_create.c (working copy)
@@ -70,7 +70,7 @@
{
STRING *pasm1 = string_from_cstring(interpreter, "PASM1", 0);
- /* register the nci ccompiler object */
+ /* register the nci compiler object */
Parrot_compreg(interpreter, pasm1, (Parrot_compiler_func_t)PDB_compile);
}
@@ -395,7 +395,7 @@
/* intstack */
intstack_free(interpreter, interpreter->ctx.intstack);
- /* predefined excpetions */
+ /* predefined exceptions */
mem_sys_free(interpreter->exception_list);
if (interpreter->evc_func_table)
mem_sys_free(interpreter->evc_func_table);
Index: src/packfile.c
===================================================================
--- src/packfile.c (revision 7825)
+++ src/packfile.c (working copy)
@@ -360,7 +360,7 @@
/*
* while the PMCs should be constant, there possible contents like
- * a property isn't conctructed const so we have to mark them
+ * a property isn't constructed const so we have to mark them
*/
static void
mark_1_seg(Parrot_Interp interpreter, struct PackFile_ByteCode *cs)
Index: src/pmc_freeze.c
===================================================================
--- src/pmc_freeze.c (revision 7825)
+++ src/pmc_freeze.c (working copy)
@@ -322,7 +322,7 @@
=item C<static PARROT_INLINE void
op_check_size(Parrot_Interp interpreter, STRING *s, size_t len)>
-Checks the size of the "stream" buffer to see if it can accomodate
+Checks the size of the "stream" buffer to see if it can accommodate
C<len> more bytes. If not then the buffer is expanded.
=cut
@@ -1259,7 +1259,7 @@
=item C<static void
visit_todo_list(Parrot_Interp interpreter, PMC* pmc, visit_info* info)>
-Chescks the seen PMC via the todo list.
+Checks the seen PMC via the todo list.
=cut
Index: src/exceptions.c
===================================================================
--- src/exceptions.c (revision 7825)
+++ src/exceptions.c (working copy)
@@ -475,7 +475,7 @@
dest2offset(Interp * interpreter, opcode_t *dest)>
Translate an absolute bytecode location to an offset used for resuming
-after an exception had occured.
+after an exception had occurred.
=cut
@@ -486,7 +486,7 @@
{
size_t offset;
/* translate an absolute location in byte_code to an offset
- * used for resuming after an exception had occured
+ * used for resuming after an exception had occurred
*/
switch (interpreter->run_core) {
case PARROT_SWITCH_CORE:
Index: src/jit.c
===================================================================
--- src/jit.c (revision 7825)
+++ src/jit.c (working copy)
@@ -176,7 +176,7 @@
* Things get a little tricky since it's not 100% true that the
* target is unpredictable because of the set_addr opcode, we
* need to find a solution for this, in the mean time, we will
- * make each section have it's own arena and try to avoid
+ * make each section have its own arena and try to avoid
* going in and out from them as much as posible.
*
* PARROT_JUMP_RESTART
@@ -1353,7 +1353,7 @@
/*
* from C's ABI all the emitted code here is one (probably big)
* function. So we have to generate an appropriate function
- * prolog, that makes all this look like a normal fuction ;)
+ * prolog, that makes all this look like a normal function ;)
*/
Parrot_jit_begin(jit_info, interpreter);
/*
@@ -1455,7 +1455,7 @@
if (CALLS_C_CODE(cur_opcode_byte)) {
/*
* restore volatiles only - and TODO only if next
- * whouldn't load registers anyway
+ * wouldn't load registers anyway
*/
Parrot_jit_load_registers(jit_info, interpreter, 1);
}
Index: docs/ROADMAP
===================================================================
--- docs/ROADMAP (revision 7825)
+++ docs/ROADMAP (working copy)
@@ -78,7 +78,7 @@
=head2 PORTABILITY
Any items which are specific to a particular platform or require special
-attention for cross-platform compatibilty.
+attention for cross-platform compatibility.
=head2 DOCUMENTATION
@@ -301,7 +301,7 @@
=item *
-There is no way to do a case insenstive match. L<ops/rx.ops>
+There is no way to do a case insensitive match. L<ops/rx.ops>
=back
Index: docs/parrot.pod
===================================================================
--- docs/parrot.pod (revision 7825)
+++ docs/parrot.pod (working copy)
@@ -142,7 +142,7 @@
=item * Simon Cozens, Jeff Goff and Steve Fink were the release managers
for releases 0.0.1 - 0.0.4, 0.0.5 - 0.0.8, and 0.0.9 - 0.0.11 respectively.
-They have all subsquently recovered.
+They have all subsequently recovered.
=item * Many, many other people have contributed their time and expertise
to the Parrot project; see the F<CREDITS> file for details.
Index: docs/debug.pod
===================================================================
--- docs/debug.pod (revision 7825)
+++ docs/debug.pod (working copy)
@@ -17,7 +17,7 @@
debugging symbols. This means that you can run C<parrot> under
an debugger like C<gdb>.
-Debugging support can be explictly enabled with:
+Debugging support can be explicitly enabled with:
shell> perl Configure.pl --debugging
shell> make
Index: docs/memory_internals.pod
===================================================================
--- docs/memory_internals.pod (revision 7825)
+++ docs/memory_internals.pod (working copy)
@@ -225,7 +225,7 @@
pieces of code that might trigger a GC run, like C<Parrot_allocate()> or
C<string_compare()>.
-=head2 Defragmentating allocator
+=head2 Defragmenting allocator
An alternative to the above is to use a memory allocator, which is as fast
as the above and does reuse C<free()>ed items in a memory conserving way.
Index: docs/strings.pod
===================================================================
--- docs/strings.pod (revision 7825)
+++ docs/strings.pod (working copy)
@@ -102,7 +102,7 @@
Which will repeat string I<s> n times and store the result into I<d>, which it
also returns. If I<*d> or I<**d> is NULL, a new string will be allocated
to hold the result. I<s> is not modified by this operation. If I<d> is
-not of the same type as I<s>, it will be upgraded appropiately.
+not of the same type as I<s>, it will be upgraded appropriately.
Chopping C<n> characters off the end of a string is achieved with the
unlikely-sounding
@@ -239,7 +239,7 @@
=head2 C<type>
-This specifes the character set for the string. There are currently two
+This specifies the character set for the string. There are currently two
character sets in Parrot: US ASCII and Unicode. Each character set has
a default encoding. The default character set is US ASCII.
@@ -278,7 +278,7 @@
void string_grow(Interp *, STRING *s, INTVAL newsize)
The size is given in characters; C<string_max_bytes()> is called to turn
-this into a size in bytes, and then the buffer is grown to accomodate
+this into a size in bytes, and then the buffer is grown to accommodate
(at least) that many bytes.
=head1 Transcoding
Index: imcc/pbc.c
===================================================================
--- imcc/pbc.c (revision 7825)
+++ imcc/pbc.c (working copy)
@@ -369,7 +369,7 @@
/* if no jump */
if ((addr = get_branch_reg(ins)) == 0)
continue;
- /* it's kind of a register */
+ /* it's a kind of register */
if (addr->type & VTREGISTER)
continue;
/* branch found */
Index: imcc/optimizer.c
===================================================================
--- imcc/optimizer.c (revision 7825)
+++ imcc/optimizer.c (working copy)
@@ -951,7 +951,7 @@
if (!strcmp(ins->op, ""))
set_bl=bb;
}
- /* this is the instruction, to check, it's save */
+ /* this is the instruction, to check, it's safe */
if (check_ins == ins)
continue;
Index: classes/hash.pmc
===================================================================
--- classes/hash.pmc (revision 7825)
+++ classes/hash.pmc (working copy)
@@ -858,7 +858,7 @@
PMC *iter = VTABLE_get_iter(INTERP, SELF);
INTVAL j, n;
- /* TODO: comparing Hash and PerlHash should propable be possible */
+ /* TODO: comparing Hash and PerlHash should probably be possible */
if (value->vtable->base_type != SELF->vtable->base_type)
return 0;
n = SELF.elements();
Index: classes/perlscalar.pmc
===================================================================
--- classes/perlscalar.pmc (revision 7825)
+++ classes/perlscalar.pmc (working copy)
@@ -48,7 +48,7 @@
/*
* if we morph to a string, first clear str_val
* so that after changing the vtable a parallel
- * reader doesn't get a gargabe pointer
+ * reader doesn't get a garbage pointer
*/
PMC_str_val(SELF) = NULL;
PObj_custom_mark_SET(SELF);
Index: classes/exception.pmc
===================================================================
--- classes/exception.pmc (revision 7825)
+++ classes/exception.pmc (working copy)
@@ -112,12 +112,12 @@
=item C<STRING* get_string_keyed(PMC* key)>
-Returns the Parrot string value for C<*key>. The only current recogniced
+Returns the Parrot string value for C<*key>. The only current recognized
C<key> is "_message".
=item C<STRING* get_string()>
-Return the excpetion message.
+Return the exception message.
=cut
Index: classes/pmc2c.pl
===================================================================
--- classes/pmc2c.pl (revision 7825)
+++ classes/pmc2c.pl (working copy)
@@ -8,7 +8,7 @@
=head1 SYNOPSIS
-B<This script has now been superceeded by F<classes/pmc2c2.pl>.>
+B<This script has now been superseded by F<classes/pmc2c2.pl>.>
% perl pmc2c.pl [--no-lines] [--tree] foo.pmc [foo2.pmc...]
% perl pmc2c.pl B<-f> method *.pmc
Index: classes/delegate.pmc
===================================================================
--- classes/delegate.pmc (revision 7825)
+++ classes/delegate.pmc (working copy)
@@ -160,7 +160,7 @@
XXX Actually the PMC compiler should emit different code, if a method is
present in classes/default.pmc. Some defaulted methods like this one have
-useful defaults and don't throw exceptiions.
+useful defaults and don't throw exceptions.
=cut
Index: classes/continuation.pmc
===================================================================
--- classes/continuation.pmc (revision 7825)
+++ classes/continuation.pmc (working copy)
@@ -37,7 +37,7 @@
*/
/*
- * A Continuation (and RetContinuation, Exeception_Handler) has in it's
+ * A Continuation (and RetContinuation, Exception_Handler) has in its
* context a pointer to the register frame, which contains active objects.
* Additionally ct->current_cont has he continuation of the caller.
* To avoid deep recusrion during marking of nested subroutines, we
@@ -62,7 +62,7 @@
PObj_custom_mark_destroy_SETALL(SELF);
/*
* Whenever we create a continuation, all return continuations
- * up the call chain maybe reuesed due to invoking the
+ * up the call chain maybe reused due to invoking the
* continuation. To avoid that all return continuations are
* converted to true continuations.
*/
Index: classes/bigint.pmc
===================================================================
--- classes/bigint.pmc (revision 7825)
+++ classes/bigint.pmc (working copy)
@@ -8,7 +8,7 @@
=head1 DESCRIPTION
-C<BigInt> provides arbitray precision integer mathematic functions.
+C<BigInt> provides arbitrary precision integer mathematic functions.
=head2 Functions
Index: classes/timer.pmc
===================================================================
--- classes/timer.pmc (revision 7825)
+++ classes/timer.pmc (working copy)
@@ -137,7 +137,7 @@
=item C<void init_pmc(PMC *init)>
-See F<docs/pdds/pdd02_vtables.pod> for intializers.
+See F<docs/pdds/pdd02_vtables.pod> for initializers.
=cut
Index: classes/float.pmc
===================================================================
--- classes/float.pmc (revision 7825)
+++ classes/float.pmc (working copy)
@@ -212,7 +212,7 @@
/*
* if we morph to a string, first clear str_val
* so that after changing the vtable a parallel
- * reader doesn't get a gargabe pointer
+ * reader doesn't get a garbage pointer
*/
PMC_str_val(SELF) = NULL;
PObj_custom_mark_SET(SELF);
Index: classes/boolean.pmc
===================================================================
--- classes/boolean.pmc (revision 7825)
+++ classes/boolean.pmc (working copy)
@@ -11,7 +11,7 @@
This class implements a boolean value variable.
Albeit the C<Boolean PMC> is derived from the C<Integer PMC>,
-it doesn't morph to other types. Only it's value is changed.
+it doesn't morph to other types. Only its value is changed.
=head2 Methods
Index: classes/default.pmc
===================================================================
--- classes/default.pmc (revision 7825)
+++ classes/default.pmc (working copy)
@@ -10,7 +10,7 @@
These are the vtable functions for the default PMC class.
-All methods which are not defined here get a default implementaion
+All methods which are not defined here get a default implementation
generated from F<vtable.tbl> by F<classes/pmc2c2.pl>.
=head2 Functions
@@ -523,7 +523,7 @@
=item C<void assign_string_native (PMC* value)>
-Default falbacks that call C<set_pmc> and C<set_string_native>.
+Defaults fallback to C<set_pmc> and C<set_string_native>.
=cut
Index: classes/orderedhash.pmc
===================================================================
--- classes/orderedhash.pmc (revision 7825)
+++ classes/orderedhash.pmc (working copy)
@@ -23,7 +23,7 @@
=back
-See F<t/pmc/ordereredhash.t>.
+See F<t/pmc/orderedhash.t>.
If values are set by numeric index only, there is no hash key. Iterating
over the hash doesn't show these values.
Index: classes/sub.pmc
===================================================================
--- classes/sub.pmc (revision 7825)
+++ classes/sub.pmc (working copy)
@@ -279,7 +279,7 @@
* return C(...)
* # end of B
*
- * that is the sub B() returns in it's last statement whatever
+ * that is the sub B() returns in its last statement whatever
* C() returns.
*
* We are just calling the sub C().
Index: classes/csub.pmc
===================================================================
--- classes/csub.pmc (revision 7825)
+++ classes/csub.pmc (working copy)
@@ -8,7 +8,7 @@
=head1 DESCRIPTION
-This class has been superceeded by C<NCI>.
+This class has been superseded by C<NCI>.
=cut
Index: classes/integer.pmc
===================================================================
--- classes/integer.pmc (revision 7825)
+++ classes/integer.pmc (working copy)
@@ -237,7 +237,7 @@
/*
* if we morph to a string, first clear str_val
* so that after changing the vtable a parallel
- * reader doesn't get a gargabe pointer
+ * reader doesn't get a garbage pointer
*/
PMC_str_val(SELF) = NULL;
PObj_custom_mark_SET(SELF);
Index: classes/slice.pmc
===================================================================
--- classes/slice.pmc (revision 7825)
+++ classes/slice.pmc (working copy)
@@ -359,8 +359,8 @@
=item C<PMC* nextkey_keyed (PMC* agg, INTVAL what)>
-Prepate slice PMC SELF for iteration over the passed aggregate or
-advance to next position in the range, dpending on what.
+Prepare slice PMC SELF for iteration over the passed aggregate or
+advance to next position in the range, depending on what.
=cut
