1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
|
/* Copyright (C) 2007 IBM
Author: Pete Eberlein eberlein@us.ibm.com
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
published by the Free Software Foundation; either version 2 of the
License, or (at your option) any later version.
This program is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
02111-1307, USA.
The GNU General Public License is contained in the file COPYING.
*/
#include <stdio.h>
#include <stdlib.h>
#include <strings.h>
#define CMPB(result,a,b) \
asm ("cmpb %0, %1, %2\n" : "=r"(result) : "r"(a), "r"(b))
int main(int argc, char *argv[])
{
int i, j, k;
unsigned long mask;
for (i = 1; i < 256; i++) {
mask = 0;
if (i & 1)
mask += 0xff;
if (i & 2)
mask += 0xff00;
if (i & 4)
mask += 0xff0000;
if (i & 8)
mask += 0xff000000;
if (i & 16)
mask += 0xff00000000;
if (i & 32)
mask += 0xff0000000000;
if (i & 64)
mask += 0xff000000000000;
if (i & 128)
mask += 0xff00000000000000;
for (j = 0; j < 256; j++)
for (k = 0; k < 256; k++)
if (j != k) {
unsigned long a, b, result;
a = (mask & (j * 0x101010101010101)) +
((~mask) & (k * 0x101010101010101));
b = j * 0x101010101010101;
CMPB(result, a, b);
if (result != mask) {
printf("%8lx %8lx %8lx %8lx\n", mask, a, b, result);
exit(1);
}
}
}
return 0;
}
|
