R=r
DELTA=9  (2 added, 5 deleted, 2 changed)
OCL=24107
CL=24152

convert to uppercase names.

R=r
DELTA=613  (460 added, 61 deleted, 92 changed)
OCL=24139
CL=24145

make t->width of funarg struct be width of struct.

emit MOVSL for 4-byte copy.

R=ken
OCL=24108
CL=24111

if you clone inside a traced pid, the child
is automatically attached and stopped,
apparently.

R=r
DELTA=63  (41 added, 12 deleted, 10 changed)
OCL=24096
CL=24106

'def' instead of 'func', 'const', or 'type'

R=r
OCL=24092
CL=24094

R=ken
OCL=24025
CL=24025

Bitten by invisible chars too many times.

R=ken
OCL=24024
CL=24024

R=r
DELTA=2  (0 added, 2 deleted, 0 changed)
OCL=23993
CL=23995

throwing away dead code at end of file.

also fix an uninitialized memory error
found by valgrind.

R=r
DELTA=7  (5 added, 2 deleted, 0 changed)
OCL=23991
CL=23994

which valgrind complains about.

R=ken
OCL=23990
CL=23990

- added more test cases
- fixed a bug in test script which prevented errors to show up...

R=r
OCL=23832
CL=23974

picked up by valgrind.
fixes test/escape.go on linux.

R=ken
OCL=23971
CL=23971

R=rsc
DELTA=2  (0 added, 0 deleted, 2 changed)
OCL=23967
CL=23970

R=ken
OCL=23965
CL=23965

syntax of function types and making them "reference types" like slice,
map, and chan. First step in Russ' proposal.

DELTA=111  (32 added, 15 deleted, 64 changed)
OCL=23669
CL=23964

R=ken
OCL=23958
CL=23961

R=r
DELTA=367  (111 added, 59 deleted, 197 changed)
OCL=23957
CL=23960

R=rsc
DELTA=4  (0 added, 0 deleted, 4 changed)
OCL=23896
CL=23928

R=rsc
DELTA=15  (1 added, 0 deleted, 14 changed)
OCL=23889
CL=23889

heuristic to not print bogus strings.
fix one error message format.

R=ken
OCL=23849
CL=23851

(most of this has been integrated into pretty,
the rest has been archived).

R=r
OCL=23842
CL=23842

R=r
OCL=23821
CL=23823

R=r
OCL=23820
CL=23820

R=r
DELTA=48  (48 added, 0 deleted, 0 changed)
OCL=23715
CL=23732

don't use intermediate register to move
32-or-fewer-bit immediate constants
into memory.

R=ken
OCL=23726
CL=23726

R=ken
OCL=23712
CL=23714

trying to find all the places where
spans might be recorded.

Free can cascade into complicated
span manipulations that move them
from list to list; the old code had the
possibility of accidentally processing
a span twice or jumping to a different
list, causing an infinite loop.

R=r
DELTA=70  (28 added, 25 deleted, 17 changed)
OCL=23704
CL=23710

- added Slice, Cut, InsertArray, AppendArray
- renamed Remove -> Delete (so we have: Insert, Delete, Cut)
- more factoring of code
- extra tests (could use some more)

R=r,rsc
DELTA=179  (127 added, 22 deleted, 30 changed)
OCL=23648
CL=23685

TBR=ken
OCL=23650
CL=23650

R=r
OCL=23646
CL=23646

R=r
DELTA=11  (6 added, 0 deleted, 5 changed)
OCL=23629
CL=23631

R=rsc
DELTA=48  (48 added, 0 deleted, 0 changed)
OCL=23624
CL=23626

not pointers to structs.

fix defered dotdotdot.

R=r,ken
DELTA=25  (7 added, 5 deleted, 13 changed)
OCL=23620
CL=23625

- clarified legal map key types (must support comparison)
- updated open issues/todo list

R=r
DELTA=81  (48 added, 19 deleted, 14 changed)
OCL=23580
CL=23621

fixes latent bugs in go and defer

R=r
OCL=23613
CL=23613

R=r
DELTA=43  (29 added, 5 deleted, 9 changed)
OCL=23608
CL=23611

R=r
OCL=23602
CL=23602

R=r
OCL=23592
CL=23592

R=r
DELTA=30  (26 added, 0 deleted, 4 changed)
OCL=23533
CL=23569

R=rsc
DELTA=18  (18 added, 0 deleted, 0 changed)
OCL=23544
CL=23547