|
|
1.1 root 1: short pat[][8] =
2: {
3: 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
4: 0xb6db, 0xeb6d, 0xb6db, 0xeb6d, 0xb6db, 0xeb6d, 0xb6db, 0xeb6d,
5: 0xFFFF, 0xFFFF, 0xFFFF, 0xFFFF, 0xFFFF, 0xFFFF, 0xFFFF, 0xFFFF,
6: 0xAAAA, 0xAAAA, 0xAAAA, 0xAAAA, 0xAAAA, 0xAAAA, 0xAAAA, 0xAAAA,
7: 0x5555, 0x5555, 0x5555, 0x5555, 0x5555, 0x5555, 0x5555, 0x5555,
8: };
9:
10: fillbuf(buf, n)
11: char *buf;
12: {
13: int i = 0;
14: register j;
15:
16: while(n > 0){
17: if(i >= sizeof(pat)/sizeof(pat[0]))
18: i = 0;
19: for(j = 0; j < 64; j++, buf += 16)
20: memcpy(buf, pat[i], 16);
21: n--;
22: i++;
23: }
24: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.