blob: fa6a0c30113216df21d96e5bb3075cf9a849d5aa [file] [log] [blame]
wdenk2ebee312004-02-23 19:30:57 +00001/*
2 * (C) Copyright 2003
3 * Tait Electronics Limited, Christchurch, New Zealand
4 *
5 * See file CREDITS for list of people who contributed to this
6 * project.
7 *
8 * This program is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU General Public License as
10 * published by the Free Software Foundation; either version 2 of
11 * the License, or (at your option) any later version.
12 *
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
wdenkf70cbb22004-02-23 20:48:38 +000015 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
wdenk2ebee312004-02-23 19:30:57 +000016 * GNU General Public License for more details.
17 *
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software
20 * Foundation, Inc., 59 Temple Place, Suite 330, Boston,
21 * MA 02111-1307 USA
22 */
23
24/*
25 * This file provides a shell like 'test' function to return
26 * true/false from an integer or string compare of two memory
27 * locations or a location and a scalar/literal.
28 * A few parts were lifted from bash 'test' command
29 */
30
31#include <common.h>
32#include <config.h>
33#include <command.h>
34
35#define EQ 0
36#define NE 1
37#define LT 2
38#define GT 3
39#define LE 4
40#define GE 5
41
42struct op_tbl_s {
43 char *op; /* operator string */
44 int opcode; /* internal representation of opcode */
45};
46
47typedef struct op_tbl_s op_tbl_t;
48
Mike Frysinger17a266a2010-10-20 07:17:33 -040049static const op_tbl_t op_table [] = {
wdenk2ebee312004-02-23 19:30:57 +000050 { "-lt", LT },
51 { "<" , LT },
52 { "-gt", GT },
53 { ">" , GT },
54 { "-eq", EQ },
55 { "==" , EQ },
56 { "-ne", NE },
57 { "!=" , NE },
58 { "<>" , NE },
59 { "-ge", GE },
60 { ">=" , GE },
61 { "-le", LE },
62 { "<=" , LE },
63};
64
wdenk2ebee312004-02-23 19:30:57 +000065static long evalexp(char *s, int w)
66{
Frans Meulenbroekse67b02f2010-02-22 22:49:06 +010067 long l = 0;
68 long *p;
wdenk2ebee312004-02-23 19:30:57 +000069
70 /* if the parameter starts with a * then assume is a pointer to the value we want */
71 if (s[0] == '*') {
72 p = (long *)simple_strtoul(&s[1], NULL, 16);
Frans Meulenbroekse67b02f2010-02-22 22:49:06 +010073 switch (w) {
74 case 1: return((long)(*(unsigned char *)p));
75 case 2: return((long)(*(unsigned short *)p));
76 case 4: return(*p);
77 }
wdenk2ebee312004-02-23 19:30:57 +000078 } else {
79 l = simple_strtoul(s, NULL, 16);
80 }
81
82 return (l & ((1 << (w * 8)) - 1));
83}
84
85static char * evalstr(char *s)
86{
87 /* if the parameter starts with a * then assume a string pointer else its a literal */
88 if (s[0] == '*') {
89 return (char *)simple_strtoul(&s[1], NULL, 16);
90 } else {
91 return s;
92 }
93}
94
95static int stringcomp(char *s, char *t, int op)
96{
97 int n, p;
98 char *l, *r;
99
100 l = evalstr(s);
101 r = evalstr(t);
102
103 /* we'll do a compare based on the length of the shortest string */
104 n = min(strlen(l), strlen(r));
105
106 p = strncmp(l, r, n);
107 switch (op) {
108 case EQ: return (p == 0);
109 case NE: return (p != 0);
110 case LT: return (p < 0);
111 case GT: return (p > 0);
112 case LE: return (p <= 0);
113 case GE: return (p >= 0);
114 }
115 return (0);
116}
117
118static int arithcomp (char *s, char *t, int op, int w)
119{
120 long l, r;
121
122 l = evalexp (s, w);
123 r = evalexp (t, w);
124
125 switch (op) {
126 case EQ: return (l == r);
127 case NE: return (l != r);
128 case LT: return (l < r);
129 case GT: return (l > r);
130 case LE: return (l <= r);
131 case GE: return (l >= r);
132 }
133 return (0);
134}
135
136int binary_test (char *op, char *arg1, char *arg2, int w)
137{
138 int len, i;
Mike Frysinger17a266a2010-10-20 07:17:33 -0400139 const op_tbl_t *optp;
wdenk2ebee312004-02-23 19:30:57 +0000140
141 len = strlen(op);
142
143 for (optp = (op_tbl_t *)&op_table, i = 0;
Mike Frysinger17a266a2010-10-20 07:17:33 -0400144 i < ARRAY_SIZE(op_table);
wdenk2ebee312004-02-23 19:30:57 +0000145 optp++, i++) {
146
147 if ((strncmp (op, optp->op, len) == 0) && (len == strlen (optp->op))) {
148 if (w == 0) {
149 return (stringcomp(arg1, arg2, optp->opcode));
150 } else {
151 return (arithcomp (arg1, arg2, optp->opcode, w));
152 }
153 }
154 }
155
156 printf("Unknown operator '%s'\n", op);
157 return 0; /* op code not found */
158}
159
160/* command line interface to the shell test */
Wolfgang Denk6262d0212010-06-28 22:00:46 +0200161int do_itest ( cmd_tbl_t *cmdtp, int flag, int argc, char * const argv[] )
wdenk2ebee312004-02-23 19:30:57 +0000162{
wdenkf70cbb22004-02-23 20:48:38 +0000163 int value, w;
wdenk2ebee312004-02-23 19:30:57 +0000164
wdenkf70cbb22004-02-23 20:48:38 +0000165 /* Validate arguments */
Wolfgang Denk3b683112010-07-17 01:06:04 +0200166 if ((argc != 4))
167 return cmd_usage(cmdtp);
wdenk2ebee312004-02-23 19:30:57 +0000168
169 /* Check for a data width specification.
170 * Defaults to long (4) if no specification.
171 * Uses -2 as 'width' for .s (string) so as not to upset existing code
172 */
173 switch (w = cmd_get_data_size(argv[0], 4)) {
174 case 1:
175 case 2:
176 case 4:
177 value = binary_test (argv[2], argv[1], argv[3], w);
178 break;
179 case -2:
180 value = binary_test (argv[2], argv[1], argv[3], 0);
181 break;
182 case -1:
183 default:
184 puts("Invalid data width specifier\n");
185 value = 0;
186 break;
187 }
188
189 return !value;
190}
191
192U_BOOT_CMD(
193 itest, 4, 0, do_itest,
Peter Tyserdfb72b82009-01-27 18:03:12 -0600194 "return true/false on integer compare",
Wolfgang Denkc54781c2009-05-24 17:06:54 +0200195 "[.b, .w, .l, .s] [*]value1 <op> [*]value2"
wdenk2ebee312004-02-23 19:30:57 +0000196);