mirror of
https://github.com/ThomasDickey/mawk-snapshots.git
synced 2026-01-27 03:14:29 +00:00
227 lines
4.5 KiB
Plaintext
227 lines
4.5 KiB
Plaintext
3
|
|
4
|
|
1
|
|
0 -1
|
|
reg4.1<<: >>
|
|
reg4.2<<: >>
|
|
reg4.3<<: >>
|
|
reg4.4<<: >>
|
|
reg4.5<<: >>
|
|
reg4.1<<: >>
|
|
reg4.2<<: >>
|
|
reg4.3<<: >>
|
|
reg4.4<<: >>
|
|
reg4.5<<: >>
|
|
reg4.1<<: >>
|
|
reg4.2<<: >>
|
|
reg4.3<<: >>
|
|
reg4.4<<: >>
|
|
reg4.5<<: >>
|
|
reg4.1<<: >>
|
|
reg4.2<<: >>
|
|
reg4.3<<: >>
|
|
reg4.4<<: >>
|
|
reg4.5<<: >>
|
|
reg4.1<<: >>
|
|
reg4.2<<: >>
|
|
reg4.3<<: >>
|
|
reg4.4<<: >>
|
|
reg4.5<<: >>
|
|
reg4.1<<: >>
|
|
reg4.2<<: >>
|
|
reg4.3<<: >>
|
|
reg4.4<<: >>
|
|
reg4.5<<: >>
|
|
reg4.1<<: >>
|
|
reg4.2<<: >>
|
|
reg4.3<<: >>
|
|
reg4.4<<: >>
|
|
reg4.5<<: >>
|
|
reg4.3<<: to >>
|
|
reg4.5<<: to >>
|
|
reg4.1<<: >>
|
|
reg4.2<<: >>
|
|
reg4.3<<: >>
|
|
reg4.4<<: >>
|
|
reg4.5<<: >>
|
|
reg4.1<<: >>
|
|
reg4.2<<: >>
|
|
reg4.3<<: >>
|
|
reg4.4<<: >>
|
|
reg4.5<<: >>
|
|
reg4.3<<: Some care is needed so that things like >>
|
|
reg4.5<<: Some care is needed so that things like >>
|
|
reg4.1<<: >>
|
|
reg4.2<<: >>
|
|
reg4.3<<: >>
|
|
reg4.4<<: >>
|
|
reg4.5<<: >>
|
|
reg4.3<<: static unsigned last_dhash ; >>
|
|
reg4.5<<: static unsigned last_dhash ; >>
|
|
reg4.1<<: >>
|
|
reg4.2<<: >>
|
|
reg4.3<<: >>
|
|
reg4.4<<: >>
|
|
reg4.5<<: >>
|
|
reg4.1<<: >>
|
|
reg4.2<<: >>
|
|
reg4.3<<: >>
|
|
reg4.4<<: >>
|
|
reg4.5<<: >>
|
|
reg4.3<<: ARRAY A ; >>
|
|
reg4.5<<: ARRAY A ; >>
|
|
reg4.3<<: STRING *sval ; >>
|
|
reg4.5<<: STRING *sval ; >>
|
|
reg4.3<<: { >>
|
|
reg4.1<<: >>
|
|
reg4.2<<: >>
|
|
reg4.3<<: >>
|
|
reg4.4<<: >>
|
|
reg4.5<<: >>
|
|
reg4.3<<: { >>
|
|
reg4.1<<: >>
|
|
reg4.2<<: >>
|
|
reg4.3<<: >>
|
|
reg4.4<<: >>
|
|
reg4.5<<: >>
|
|
reg4.3<<: } >>
|
|
reg4.1<<: >>
|
|
reg4.2<<: >>
|
|
reg4.3<<: >>
|
|
reg4.4<<: >>
|
|
reg4.5<<: >>
|
|
reg4.3<<: { >>
|
|
reg4.3<<: else >>
|
|
reg4.5<<: else >>
|
|
reg4.3<<: } >>
|
|
reg4.1<<: >>
|
|
reg4.2<<: >>
|
|
reg4.3<<: >>
|
|
reg4.4<<: >>
|
|
reg4.5<<: >>
|
|
reg4.3<<: } >>
|
|
reg4.3<<: return p ; >>
|
|
reg4.5<<: return p ; >>
|
|
reg4.3<<: } >>
|
|
reg4.4<<: } >>
|
|
reg4.1<<: >>
|
|
reg4.2<<: >>
|
|
reg4.3<<: >>
|
|
reg4.4<<: >>
|
|
reg4.5<<: >>
|
|
reg4.1<<: >>
|
|
reg4.2<<: >>
|
|
reg4.3<<: >>
|
|
reg4.4<<: >>
|
|
reg4.5<<: >>
|
|
reg4.1<<: >>
|
|
reg4.2<<: >>
|
|
reg4.3<<: >>
|
|
reg4.4<<: >>
|
|
reg4.5<<: >>
|
|
reg4.3<<: ARRAY A ; >>
|
|
reg4.5<<: ARRAY A ; >>
|
|
reg4.3<<: double d ; >>
|
|
reg4.5<<: double d ; >>
|
|
reg4.3<<: int cflag ; >>
|
|
reg4.5<<: int cflag ; >>
|
|
reg4.3<<: { >>
|
|
reg4.4<<: { >>
|
|
reg4.3<<: ANODE *ap ; >>
|
|
reg4.5<<: ANODE *ap ; >>
|
|
reg4.1<<: >>
|
|
reg4.2<<: >>
|
|
reg4.3<<: >>
|
|
reg4.4<<: >>
|
|
reg4.5<<: >>
|
|
reg4.3<<: break ; >>
|
|
reg4.5<<: break ; >>
|
|
reg4.3<<: } >>
|
|
reg4.3<<: } >>
|
|
reg4.3<<: else >>
|
|
reg4.5<<: else >>
|
|
reg4.1<<: >>
|
|
reg4.2<<: >>
|
|
reg4.3<<: >>
|
|
reg4.4<<: >>
|
|
reg4.5<<: >>
|
|
reg4.1<<: >>
|
|
reg4.2<<: >>
|
|
reg4.3<<: >>
|
|
reg4.4<<: >>
|
|
reg4.5<<: >>
|
|
26..12: each array is of size A_HASH_PRIME.
|
|
reg5.1<<A_HASH_PRIME>>
|
|
26..12: each array is of size A_HASH_PRIME.
|
|
reg5.2<<A_HASH_PRIME>>
|
|
11..7: On the D_ANODE list, we use real deletion and move to the
|
|
reg5.1<<D_ANODE>>
|
|
11..7: On the D_ANODE list, we use real deletion and move to the
|
|
reg5.2<<D_ANODE>>
|
|
32..5: (1) d1 != d2, but sprintf(A_FMT,d1) == sprintf(A_FMT,d1)
|
|
reg5.1<<A_FMT>>
|
|
32..5: (1) d1 != d2, but sprintf(A_FMT,d1) == sprintf(A_FMT,d1)
|
|
reg5.2<<A_FMT>>
|
|
42..12:#define _dhash(d) (((int)(d)&0x7fff)%A_HASH_PRIME)
|
|
reg5.1<<A_HASH_PRIME>>
|
|
42..12:#define _dhash(d) (((int)(d)&0x7fff)%A_HASH_PRIME)
|
|
reg5.2<<A_HASH_PRIME>>
|
|
34..6:#define _dhash(d) (((int)(d)&0x7fff)%A_HASH_PRIME)
|
|
reg5.3<<0x7fff>>
|
|
27..12: unsigned h = hash(s) % A_HASH_PRIME ;
|
|
reg5.1<<A_HASH_PRIME>>
|
|
27..12: unsigned h = hash(s) % A_HASH_PRIME ;
|
|
reg5.2<<A_HASH_PRIME>>
|
|
22..8: p->cp->type = C_NOINIT ;
|
|
reg5.1<<C_NOINIT>>
|
|
22..8: p->cp->type = C_NOINIT ;
|
|
reg5.2<<C_NOINIT>>
|
|
11..7:/* on the D_ANODE list, when we find a node we move it
|
|
reg5.1<<D_ANODE>>
|
|
11..7:/* on the D_ANODE list, when we find a node we move it
|
|
reg5.2<<D_ANODE>>
|
|
8..7:static D_ANODE *find_by_dval(A, d, cflag)
|
|
reg5.1<<D_ANODE>>
|
|
8..7:static D_ANODE *find_by_dval(A, d, cflag)
|
|
reg5.2<<D_ANODE>>
|
|
12..7: register D_ANODE *p = A[h].dlink ;
|
|
reg5.1<<D_ANODE>>
|
|
12..7: register D_ANODE *p = A[h].dlink ;
|
|
reg5.2<<D_ANODE>>
|
|
3..7: D_ANODE *q = 0 ; /* trails p for move to front */
|
|
reg5.1<<D_ANODE>>
|
|
3..7: D_ANODE *q = 0 ; /* trails p for move to front */
|
|
reg5.2<<D_ANODE>>
|
|
28..7: zfree(p, sizeof(D_ANODE)) ;
|
|
reg5.1<<D_ANODE>>
|
|
28..7: zfree(p, sizeof(D_ANODE)) ;
|
|
reg5.2<<D_ANODE>>
|
|
1..1:extern unsigned hash() ;
|
|
reg6.2<<e>>
|
|
23..6: which is two hash tables in one. One for strings
|
|
reg6.1<<ables >>
|
|
23..2: which is two hash tables in one. One for strings
|
|
reg6.3<<ab>>
|
|
19..5: and one for doubles.
|
|
reg6.4<<bles.>>
|
|
1 aFOOc
|
|
4 XaXbXcX
|
|
3 XaXcX
|
|
1 abX
|
|
1 abX
|
|
1 abcX
|
|
2 aXcX
|
|
1 aFOOc
|
|
4 XaXbXcX
|
|
3 XaXcX
|
|
1 abX
|
|
1 abX
|
|
1 abcX
|
|
1 a(b)c
|
|
4 {}a{}b{}c{}
|
|
3 {}a{b}c{}
|
|
3 {}a{bb}c{b}
|
|
2 a(bb)c(b)
|
|
1 a b c
|
|
1 a b c
|