sbcl Log


Commit Date  
[95dab9] by Stas Boukarev Stas Boukarev

Better undefined-alien-error support on ARM.

Like on x86-64, report the name of the function being missing.
call_into_c always uses R8, so use it to look up the linkage table.

2014-06-01 19:30:09 Tree
[30d48e] by Stas Boukarev Stas Boukarev

Resolve android C type problems.

Android doesn't use off_t where SBCL expects to find it, declare
things appropriately in struct stat, struct dirent.

2014-06-01 07:10:57 Tree
[99bf31] by Stas Boukarev Stas Boukarev

Restore build on non-android.

2014-05-28 15:24:47 Tree
[e84400] by Stas Boukarev Stas Boukarev

Add support for ARM Android.

The build infrastructure for easy cross-compilation with NDK is still
missing.

2014-05-28 14:53:08 Tree
[e3588f] by Stas Boukarev Stas Boukarev , pushed by Alastair Bridgewater Alastair Bridgewater

Implement arm-softfp C calling convention for floats.

2014-05-10 19:12:24 Tree
[633025] by Alastair Bridgewater Alastair Bridgewater

tools-for-build/ldso-stubs: Rough in LDSO_STUBIFY macro for ARM.

* In order to render the file that this generates buildable on
ARM, so that genesis can resolve references to symbols in it, we
need to have a definition of LDSO_STUBIFY, which I really didn't
care about until now.

* Rough in something simple that should handle interworking as
required, in case the library functions being called are thumb
functions.

2014-05-10 19:12:15 Tree
[071b6a] by Alastair Bridgewater Alastair Bridgewater

KLUDGE tfb/ldso-stubs.lisp to at least build for ARM.

* This is an outright KLUDGE, and will not produce output that
survives make-target-1. It will, however, build, and that's
sufficient to allow hacking to proceed for make-host-1.

* At some point in the future, once the correct LDSO_STUBIFY
magic has been determined, this commit should probably be amended.

2014-05-10 02:22:49 Tree
[6380ff] by Stas Boukarev Stas Boukarev

Fix make-windows-installer.

The change of where contribs are stored is still popping up.

2014-04-05 12:18:01 Tree
[6e0340] by Stas Boukarev Stas Boukarev

Use openpty() for run-program on FreeBSD.

Opening /dev/ptmx doesn't work for me on the default installation.

2014-03-22 16:23:37 Tree
[e2327c] by Stas Boukarev Stas Boukarev

Remove unnecessary package qualifiers.

2014-03-21 04:09:39 Tree
[a4c87f] by Stas Boukarev Stas Boukarev

win32: provide error messages when loading foreign libraries.

Decode the error codes into messages.

2013-11-11 11:13:51 Tree
[ecebde] by Juho Snellman Juho Snellman

Fix release-related things

contrib changes need to be reflected in binary-distribution.sh
and documentation building too.

2013-10-17 02:56:46 Tree
[77641d] by Joshua Elsasser Joshua Elsasser

Hopefully fix the windows build to grovel time structures correctly.

It is a little misleading to say "correctly" since struct timespec
doesn't really exist on windows. Groveling the definition that we
define in our own pthreads wrapper seems the most consistent choice.

The grovel-headers.c changes have only been tested in isolation, not
with a real build. Thanks to Kyle Isom for testing, any resulting
build problems are entirely my fault.

2013-06-20 03:12:38 Tree
[7230b5] by Joshua Elsasser Joshua Elsasser

Grovel timeval and timespec struct definitions rather than hard-coding.

2013-06-20 03:12:38 Tree
[f44f6d] by Christophe Rhodes Christophe Rhodes

fix CL case conversions of characters involving iota subscript

Oh boy. Judging by the length of the web page explaining the issue
(at <http://www.tlg.uci.edu/~opoudjis/unicode/unicode_adscript.html>)
this is a bit of a minefield. I hope that this doesn't contribute
further to the trouble...

Although the combined _WITH_PROSGEGRAMMENI characters are of
general class "Lt" (i.e. titlecase), for CL purposes we treat them
as the uppercase equivalent of the lowercase _WITH_YPOGEGRAMMENI
characters (as directly specified by the case mapping data in
UnicodeData.txt). This is a little awkward, and involves a bit
of rearrangement in the indices of the misc table entries to make
the (CL) uppercase/lowercase tests efficient, but seems to be the
best of all possible worlds given that we must comply with CL's
character-to-character case mappings -- the alternative of not
providing an uppercase version of LOWERCASE_OMEGA_WITH_YPOGEGRAMMENI
seems even weirder.

The way this is done in ucd.lisp is a little bit kludgy, because we
have to avoid giving the same exception to the serbian titlecase
digraphs (Dz and friends) which mustn't map to anything, or else
we'd break invertibility. (The lowercase dz and uppercase DZ are
already (CL) case mappings of each other). Probably the thing which
will confuse future readers is that some (Unicode) titlecase
characters are (CL) upper-case-p.

2013-06-04 12:00:50 Tree
[db0110] by Christophe Rhodes Christophe Rhodes

implement primary and canonical composition, and hence NFC/NFKC

Read in the non-algorithmically-specified composition exclusions from
Unicode's CompositionExclusions.txt file, and generate a hash table
using the concatenated 42 bits of code points. This is a bit of a
sucky hash-table key, particularly on 32-bit platforms; I have a plan
to reduce the key to 24 bits (using some auxiliary information in ucd)
but the advantage of getting this try in is...

... hook in NFC/NFKC into normalization tests, and check that tests
pass.

2013-05-18 19:04:05 Tree
[7230ec] by Christophe Rhodes Christophe Rhodes

better UCD treatment of characters not allocated by Unicode

fixes lp#1178038 (reported by Ken Harris)

2013-05-18 19:04:04 Tree
[0a3a8a] by Christophe Rhodes Christophe Rhodes

add a comment about one-basing the character tables

2013-05-18 19:04:04 Tree
[4aad92] by Christophe Rhodes Christophe Rhodes

handle Hangul syllable decomposition

Entries for the codepoint range (#xac00 -- #xd7a3) have 1 for
their decomposition-info, a decomposition length of 2 or 3, but
a zero decomposition index (the decomposition is handled
algorithmically instead).

2013-05-18 19:04:04 Tree
[5b6e02] by Christophe Rhodes Christophe Rhodes

work-in-progress towards full normalization support

2013-05-18 19:04:04 Tree
[026be5] by Christophe Rhodes Christophe Rhodes

beginnings of decomposition

Store enough information in output from ucd.lisp to be able to actually
decompose individual characters. Include proof-of-concept implementation
of decomposition, not hooked into anything yet.

2013-05-18 19:04:04 Tree
[e24213] by Christophe Rhodes Christophe Rhodes

delete now-unused code from ucd.dat

2013-05-18 19:04:03 Tree
[f41b71] by Christophe Rhodes Christophe Rhodes

Incorporate some decomposition information in ucd table

Oh boy. This one is quite intricate. We have two bytes free in
the 8-byte entries for information about characters, so use one of
them to indicate if the character has a decomposition, and if so of
what kind it is. Adapt the ucd.lisp tools-for-build code to
parse and preserve that information.

However, this causes there to be more than 256 distinct possible
classes of character known to the system: not a problem in principle,
but Teemu Kalvas' implementation of the double indirection depended on
having a one-byte index. But since Unicode characters are limited to
21 bits, with a careful packing scheme we can in fact steal 3 more bits
for the index, at the cost of needing to do an extra memory reference
and some arithmetic to reconstruct the index. (In the process, change
the endianness of the ucd.dat filesystem representation, because it's
easier that way).

But wait, there's more. Before, there were only two kinds of
lower-case characters: those whose upper-case transformation
lowercase back to the original character, and those where there is
no round-trip. (The former are cl:lower-case-p, the latter aren't).
This gave rise to straightforward implementations of lower-case-p
and friends; in the new world, where there are multiple different
kinds of lower-case characters (with various decomposition classes)
we need to adjust the implementations, still fairly straightforward,
of lower-case-p and related functions.

The extra information provided in the ucd table by this commit
is largely useless on its own; the next step is to incorporate
the actual decomposition data. Stay tuned.

2013-05-18 19:04:03 Tree
[85c2a6] by Christophe Rhodes Christophe Rhodes , pushed by Christophe Rhodes Christophe Rhodes

update to unicode 6.2

2013-05-18 19:04:03 Tree
[5f0bd0] by Stas Boukarev Stas Boukarev

Use CryptGenRandom as a random seed on Windows.

Patch by Anton Kovalenko.
Fixes lp#1102748

2013-02-01 12:01:27 Tree
Older >