Custom Query (1030 matches)

cl:last could be faster by implementing some special cases and open coding the general case.

I looked at the sbcl source for LAST, and we may have both guessed at least
partly right.

As i understand the code, they special-case both the case where N=0 and the
one where N=1, and  a  simpler iterative loop in each of those cases, and
a more generaj iterative loop for other values of N.

In addition. a compiler-macro is defined on LAST, which may expand
into one of the simpler loops if N is constant and does not call out-of-line
code in any event .

We don't provide interface databases that include new Leopard stuff (like NSGradient, for example).

At some fairly near future date, we might want to build interfaces with -mmacosx-version-min=10.5 or come up with some scheme to allow the user to switch between various versions.

​http://clozure.com/pipermail/openmcl-devel/2011-January/012498.html

describes a problem which affected someone running ARM Linux. It's not clear what Linux versions and architectures are affected.

Traditionally, Linux maps in pages of the initial thread's control/C stack as they're touched. The new (or at least previously unobserved) behavior involves the kernel not mapping a page that would be adjacent to another mapped region (like the guard page region that CCL uses to detect stack overflow) and causes the stack limit check in the recursive marker to fail.

I think that the simplest fix is likely to ensure that all pages between the stack area's softlimit and current sp are mapped read-write, so that the kernel's lazy faulting-in of stack pages doesn't try to exercise policy.