ag/cpython-source-deps
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fix spelling errors

Browse Source
This commit is contained in:
Anthony Green
2013-10-08 06:45:51 -04:00
parent ff06269d70
commit 128cd1d2f3
17 changed files with 39 additions and 28 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
ChangeLog
View File

@@ -1,3 +1,13 @@
2013-10-08 Ondřej Bílka <neleai@seznam.cz>
* src/aarch64/ffi.c, src/aarch64/sysv.S, src/arm/ffi.c,
src/arm/gentramp.sh, src/bfin/sysv.S, src/closures.c,
src/dlmalloc.c, src/ia64/ffi.c, src/microblaze/ffi.c,
src/microblaze/sysv.S, src/powerpc/darwin_closure.S,
src/powerpc/ffi.c, src/powerpc/ffi_darwin.c, src/sh/ffi.c,
src/tile/tile.S, testsuite/libffi.call/nested_struct11.c: Fix
spelling errors.
2013-10-08 Anthony Green <green@moxielogic.com>
* aclocal.m4, compile, config.guess, config.sub, depcomp,
@@ -5,6 +15,7 @@
* configure.ac: Update version to 3.0.14-rc0.
* Makefile.in, configure, Makefile.in, include/Makefile.in,
man/Makefile.in, testsuite/Makefile.in: Rebuilt.
* README: Mention M88K and VAX.
2013-07-15 Miod Vallat <miod@openbsd.org>

10
src/aarch64/ffi.c
View File

@@ -447,7 +447,7 @@ allocate_to_stack (struct arg_state *state, void *stack, unsigned alignment,
static void
copy_basic_type (void *dest, void *source, unsigned short type)
{
/* This is neccessary to ensure that basic types are copied
/* This is necessary to ensure that basic types are copied
sign extended to 64-bits as libffi expects. */
switch (type)
{
@@ -857,10 +857,10 @@ ffi_prep_closure_loc (ffi_closure* closure,
the stack at the point ffi_closure_SYSV() was invoked.
On the return path the assembler wrapper will reload call context
regsiters.
registers.
ffi_closure_SYSV_inner() marshalls the call context into ffi value
desriptors, invokes the wrapped function, then marshalls the return
descriptors, invokes the wrapped function, then marshalls the return
value back into the call context. */
void
@@ -924,7 +924,7 @@ ffi_closure_SYSV_inner (ffi_closure *closure, struct call_context *context,
therefore the structure is not represented as
a contiguous sequence of bytes in our saved
register context. We need to fake up a copy
of the structure layed out in memory
of the structure laid out in memory
correctly. The fake can be tossed once the
closure function has returned hence alloca()
is sufficient. */
@@ -945,7 +945,7 @@ ffi_closure_SYSV_inner (ffi_closure *closure, struct call_context *context,
therefore the structure is not represented as
a contiguous sequence of bytes in our saved
register context. We need to fake up a copy
of the structure layed out in memory
of the structure laid out in memory
correctly. The fake can be tossed once the
closure function has returned hence alloca()
is sufficient. */

2
src/aarch64/sysv.S
View File

@@ -287,7 +287,7 @@ ffi_closure_SYSV:
ldp x2, x3, [x21, #16]
ldp x4, x5, [x21, #32]
ldp x6, x7, [x21, #48]
/* Note nothing usefull is returned in x8. */
/* Note nothing useful is returned in x8. */
/* We are done, unwind our frame. */
ldp x21, x22, [x29, #-16]

4
src/arm/ffi.c
View File

@@ -537,7 +537,7 @@ typedef struct ffi_trampoline_table ffi_trampoline_table;
typedef struct ffi_trampoline_table_entry ffi_trampoline_table_entry;
struct ffi_trampoline_table {
/* contigious writable and executable pages */
/* contiguous writable and executable pages */
vm_address_t config_page;
vm_address_t trampoline_page;
@@ -577,7 +577,7 @@ ffi_trampoline_table_alloc ()
{
ffi_trampoline_table *table = NULL;
/* Loop until we can allocate two contigious pages */
/* Loop until we can allocate two contiguous pages */
while (table == NULL) {
vm_address_t config_page = 0x0;
kern_return_t kt;

2
src/arm/gentramp.sh
View File

@@ -84,7 +84,7 @@ EOF
}
# WARNING - Don't modify the trampoline code size without also updating the relevent libffi code
# WARNING - Don't modify the trampoline code size without also updating the relevant libffi code
trampoline () {
cat << END

2
src/bfin/sysv.S
View File

@@ -32,7 +32,7 @@
.align 4
/*
There is a "feature" in the bfin toolchain that it puts a _ before funcion names
There is a "feature" in the bfin toolchain that it puts a _ before function names
that's why the function here it's called _ffi_call_SYSV and not ffi_call_SYSV
*/
.global _ffi_call_SYSV;

2
src/closures.c
View File

@@ -382,7 +382,7 @@ open_temp_exec_file_opts_next (void)
}
/* Return a file descriptor of a temporary zero-sized file in a
writable and exexutable filesystem. */
writable and executable filesystem. */
static int
open_temp_exec_file (void)
{

12
src/dlmalloc.c
View File

@@ -1255,7 +1255,7 @@ extern void* sbrk(ptrdiff_t);
#define SIZE_T_BITSIZE (sizeof(size_t) << 3)
/* Some constants coerced to size_t */
/* Annoying but necessary to avoid errors on some plaftorms */
/* Annoying but necessary to avoid errors on some platforms */
#define SIZE_T_ZERO ((size_t)0)
#define SIZE_T_ONE ((size_t)1)
#define SIZE_T_TWO ((size_t)2)
@@ -1409,7 +1409,7 @@ static int win32munmap(void* ptr, size_t size) {
#define CALL_MORECORE(S) MFAIL
#endif /* HAVE_MORECORE */
/* mstate bit set if continguous morecore disabled or failed */
/* mstate bit set if contiguous morecore disabled or failed */
#define USE_NONCONTIGUOUS_BIT (4U)
/* segment bit set in create_mspace_with_base */
@@ -3090,8 +3090,8 @@ static void internal_malloc_stats(mstate m) {
and choose its bk node as its replacement.
2. If x was the last node of its size, but not a leaf node, it must
be replaced with a leaf node (not merely one with an open left or
right), to make sure that lefts and rights of descendents
correspond properly to bit masks. We use the rightmost descendent
right), to make sure that lefts and rights of descendants
correspond properly to bit masks. We use the rightmost descendant
of x. We could use any other leaf, but this is easy to locate and
tends to counteract removal of leftmosts elsewhere, and so keeps
paths shorter than minimally guaranteed. This doesn't loop much
@@ -5091,10 +5091,10 @@ History:
Wolfram Gloger (Gloger@lrz.uni-muenchen.de).
* Use last_remainder in more cases.
* Pack bins using idea from colin@nyx10.cs.du.edu
* 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

2
src/ia64/ffi.c
View File

@@ -401,7 +401,7 @@ ffi_call(ffi_cif *cif, void (*fn)(void), void *rvalue, void **avalue)
the closure (in the "trampoline" area), but we replace the gp
pointer with a pointer to the closure itself. We also add the real
gp pointer to the closure. This allows the function entry code to
both retrieve the user data, and to restire the correct gp pointer. */
both retrieve the user data, and to restore the correct gp pointer. */
extern void ffi_closure_unix ();

2
src/microblaze/ffi.c
View File

@@ -183,7 +183,7 @@ void ffi_closure_call_SYSV(void* register_args, void* stack_args,
ffi_type** arg_types = cif->arg_types;
/* re-allocate data for the args. This needs to be done in order to keep
* multi-word objects (e.g. structs) in contigious memory. Callers are not
* multi-word objects (e.g. structs) in contiguous memory. Callers are not
* required to store the value of args in the lower 6 words in the stack
* (although they are allocated in the stack).
*/

6
src/microblaze/sysv.S
View File

@@ -134,7 +134,7 @@ ffi_call_SYSV:
rsubi r11, r23, 8
beqi r11, ffi_call_SYSV_store64
/* Didnt match anything */
/* Didn't match anything */
bri ffi_call_SYSV_end
ffi_call_SYSV_store64:
@@ -210,7 +210,7 @@ ffi_closure_SYSV:
addik r7, r12, 0 /* closure object */
addik r1, r1, -8 /* allocate return value */
addik r8, r1, 0 /* void* rvalue */
addik r1, r1, -8 /* allocate for reutrn type/size values */
addik r1, r1, -8 /* allocate for return type/size values */
addik r9, r1, 0 /* void* rtype */
addik r10, r1, 4 /* void* rsize */
@@ -247,7 +247,7 @@ ffi_closure_SYSV_prepare_return:
rsubi r11, r10, 8
beqi r11, ffi_closure_SYSV_store64
/* Didnt match anything */
/* Didn't match anything */
bri ffi_closure_SYSV_end
ffi_closure_SYSV_store64:

2
src/powerpc/darwin_closure.S
View File

@@ -192,7 +192,7 @@ LCFI1:
lg r0,0(r3) ; size => r0
lhz r3,FFI_TYPE_TYPE(r3) ; type => r3
/* The helper will have intercepted struture returns and inserted
/* The helper will have intercepted structure returns and inserted
the caller`s destination address for structs returned by ref. */
/* r3 contains the return type so use it to look up in a table

2
src/powerpc/ffi.c
View File

@@ -376,7 +376,7 @@ ffi_prep_args_SYSV (extended_cif *ecif, unsigned *const stack)
FFI_ASSERT (gpr_base.u <= stacktop.u - ASM_NEEDS_REGISTERS);
/* The assert below is testing that the number of integer arguments agrees
with the number found in ffi_prep_cif_machdep(). However, intarg_count
is incremeneted whenever we place an FP arg on the stack, so account for
is incremented whenever we place an FP arg on the stack, so account for
that before our assert test. */
#ifndef __NO_FPRS__
if (fparg_count > NUM_FPR_ARG_REGISTERS)

2
src/powerpc/ffi_darwin.c
View File

@@ -593,7 +593,7 @@ darwin_adjust_aggregate_sizes (ffi_type *s)
/* Natural alignment for all items. */
align = p->alignment;
#else
/* Natrual alignment for the first item... */
/* Natural alignment for the first item... */
if (i == 0)
align = p->alignment;
else if (p->alignment == 16 || p->alignment < 4)

2
src/sh/ffi.c
View File

@@ -41,7 +41,7 @@
#define STRUCT_VALUE_ADDRESS_WITH_ARG 0
#endif
/* If the structure has essentialy an unique element, return its type. */
/* If the structure has essentially an unique element, return its type. */
static int
simple_type (ffi_type *arg)
{

2
src/tile/tile.S
View File

@@ -60,7 +60,7 @@
void (*fnaddr)(void));
On entry, REG_ARGS contain the outgoing register values,
and STACK_ARGS containts STACK_ARG_BYTES of additional values
and STACK_ARGS contains STACK_ARG_BYTES of additional values
to be passed on the stack. If STACK_ARG_BYTES is zero, then
STACK_ARGS is ignored.

2
testsuite/libffi.call/nested_struct11.c
View File

@@ -1,7 +1,7 @@
/* Area: ffi_call, closure_call
Purpose: Check parameter passing with nested structs
of a single type. This tests the special cases
for homogenous floating-point aggregates in the
for homogeneous floating-point aggregates in the
AArch64 PCS.
Limitations: none.
PR: none.