Commit Graph

27884 Commits (eb21e05fef1814c0f980b080c3f8244ca7d9de8f)

Author SHA1 Message Date
John Benediktsson 8ea621e090 reddit: use calendar.elapsed for relative-time. 2015-07-30 08:54:02 -07:00
John Benediktsson 107de1d36e hacker-news: add relative timestamp on posts. 2015-07-30 08:46:44 -07:00
John Benediktsson 64d8c0ccc0 reddit: stop using tuples and just use the JSON.
Nice-looking tuples are nice but reddit keeps adding fields to their objects
and breaking our from-slots.  We could hide the error, or ignore the extra
fields but this is probably better for now.
2015-07-30 08:16:34 -07:00
John Benediktsson ae4fbd016c calendar.elapsed: adding some elapsed time words. 2015-07-30 08:10:18 -07:00
Doug Coleman 23899e2d83 io.files.windows: Need the SLOT: file from io.sockets.secure.openssl 2015-07-30 00:05:37 -07:00
Doug Coleman 639952a1de hacker-news: Fix using, fix bug printing HN company posts. Refactor a bit 2015-07-29 21:16:34 -07:00
Doug Coleman 92a0e1e701 hacker-news: use new hackernews api on firebase. 2015-07-29 21:05:20 -07:00
Doug Coleman f6ebea6320 benchmark.fasta: rename random. 2015-07-29 21:04:31 -07:00
Björn Lindqvist 22b871d82e compiler.cfg.utilities: make it so block>cfg initializes spill-area-align 2015-07-29 13:01:24 +02:00
John Benediktsson fba2eb9ace fix another doc using. 2015-07-28 20:21:12 -07:00
John Benediktsson 38afea84bf fix doc using. 2015-07-28 20:20:40 -07:00
John Benediktsson 4ded3c491c fix some help-lint errors. 2015-07-28 20:06:59 -07:00
John Benediktsson 823524c3a0 io.backend.unix.macosx: change to << require >>. 2015-07-28 19:33:24 -07:00
John Benediktsson 71dd957f77 command-line: rename file to path for user-init-error which is kinda exactly like a source-file-error. 2015-07-28 19:30:20 -07:00
John Benediktsson 9ad9cd3f14 unix: don't need << >>. 2015-07-28 19:23:54 -07:00
John Benediktsson 9b77a785e9 math.floats.env: don't need << >>. 2015-07-28 19:23:43 -07:00
John Benediktsson 3649d21541 ui: cleanup some usings. 2015-07-28 19:14:14 -07:00
John Benediktsson acded37575 ui.images: don't need to << >>. 2015-07-28 19:14:01 -07:00
John Benediktsson 60d7d84b56 ui.commands: don't need to \ . 2015-07-28 19:13:43 -07:00
John Benediktsson e26493b97b io.backend.unix.macosx: change USE: to require. 2015-07-28 19:13:29 -07:00
John Benediktsson 0fbd2fd472 alien.libraries: don't need << >>. 2015-07-28 19:13:13 -07:00
John Benediktsson 194e0cc598 disjoint-sets: some cleanup. 2015-07-28 18:14:20 -07:00
John Benediktsson 663fba1d7d json.reader: fix segfault when parsing non-JSON documents. 2015-07-28 18:10:24 -07:00
John Benediktsson 922cbebf8a json.reader: enforce json> takes a string. 2015-07-28 18:02:57 -07:00
Björn Lindqvist 8a731681bf compiler.cfg.*: tests against #1308 2015-07-28 17:58:29 -07:00
Björn Lindqvist a8c0a25d87 compiler.cfg.ssa.destruction.coalescing: refactor and maybe a fix for #1308
the eliminatable-copy? word is the fix. the previous code only checked
that the registers had the same register class, but you also need to
check that they dont have the same representation size. because a copy
from double-rep -> double-2-rep is not eliminatable
2015-07-28 17:58:29 -07:00
Björn Lindqvist b544c1b352 compiler.cfg.*: some extra unit tests for the compiler 2015-07-28 17:58:29 -07:00
Björn Lindqvist 820207c5b0 compiler.cfg.ssa.destruction.coalescing: simpler code for setting up the
initial leader-map and class-element-map
2015-07-28 17:58:28 -07:00
Björn Lindqvist 1b6fa50ff2 cpu.x86: define %alien-invoke and %alien-indirect using %alien-assembly 2015-07-28 17:58:28 -07:00
Björn Lindqvist 5e29aac0a6 Docs: various more compiler-related docs 2015-07-28 17:58:28 -07:00
Björn Lindqvist aca610813d compiler.cfg.representations.selection: use a union instead of a generic
to see if an insn is peephole-optimizable + test
2015-07-28 17:58:28 -07:00
Björn Lindqvist 44c9b2c8e8 compiler.tree.*: new docs 2015-07-28 17:58:28 -07:00
Björn Lindqvist 2c5f00d865 compiler.cfg.*: even more docs 2015-07-28 17:58:28 -07:00
Björn Lindqvist e095b54644 compiler.tree.escape-analysis.*: new doc files 2015-07-28 17:58:28 -07:00
Björn Lindqvist 06560b24a6 compiler.tree.escape-analysis.allocations: stub doc file from comments 2015-07-28 17:58:27 -07:00
Björn Lindqvist b4e4792cb6 compiler.cfg.*: a bunch of docs updates 2015-07-28 17:58:27 -07:00
Björn Lindqvist cdf9a8535b compiler.cfg.representations.selection: some initial docs from comments 2015-07-28 17:58:27 -07:00
Björn Lindqvist 31aae02916 compiler.cfg.linear-scan.live-intervals: simpler code for finding the
sync points in the cfg
2015-07-28 17:58:27 -07:00
Björn Lindqvist 78d5c0a743 compiler.cfg.instructions: ##read -> read-insn and ##write -> write-insn 2015-07-28 17:58:27 -07:00
Björn Lindqvist 81c7659360 compiler.cfg.instructions: rename ##allocation to allocation-insn,
because it's nicer if all instruction unions have the -insn suffix and
the ## prefix is reserved for tuples
2015-07-28 17:58:27 -07:00
Doug Coleman 0babf4558f math.statistics: fix docs 2015-07-27 12:41:02 -07:00
Doug Coleman 3d4bc1de1a core: rename parse-call( to parse-call-paren 2015-07-27 09:54:08 -07:00
Doug Coleman 270155bae4 math.statistics: clean up some weird stack effects 2015-07-27 09:54:07 -07:00
John Benediktsson 57b0ce8d9e ui.gadgets.panes: don't use extract-keys, don't clone twice in specified-font. 2015-07-27 08:42:42 -07:00
John Benediktsson 4f09d852f3 ui.gadgets.sliders: rename slider-pen-tuple to slider-pen. 2015-07-27 08:41:01 -07:00
John Benediktsson 332e3ad52f ui.gadgets.grids: rename grid-layout-tuple to grid-layout. 2015-07-27 08:40:30 -07:00
John Benediktsson ca0f80f230 bootstrap: cleanup usings. 2015-07-26 21:20:55 -07:00
Jon Harper 53efceb0ad math.integers, comment and simplify bignum/f
change the "while" that could only execute once to "when"
change the f/loop word name to "mantissa-and-guard" since it's what it
computes
change the check against 2^53 to be explicit
2015-07-26 12:33:56 -07:00
Jon Harper 5424ad5586 math.integers, bignum/f, improve performance.
This changes avoids looping many times if the denominator is a power of
2. After this change, the implementation matches the linked sbcl
algorithm.  This was probably a mistake done when porting the algorithm.
Basically, as an optimization, all trailing zeros are removed from the
base2 representation of the denominator to have smaller bignums to
divide. But the previous factor implementation didn't take this into
account when making the initial guess of the shift of the numerator to
obtain a result in the range [2^54-1,2^53]. The loop would then correct
the initial guess by a factor of 2 at each iteration, so it would run as
many iteration as the denominator base2 power reduction, instead of only
a few times. For pathological cases, the speed up is huge (10^4):
1 1000 2^ bignum/f
2015-07-26 12:33:55 -07:00
Jon Harper cc6d90a096 math.integers, fix bignum/f for results in ]0x1.0p-1022,0x0.4p-1022] 2015-07-26 12:33:55 -07:00