| /* |
| * misc.c - various assorted functions |
| * |
| * Copyright (c) 2007 Sascha Hauer <s.hauer@pengutronix.de>, Pengutronix |
| * |
| * See file CREDITS for list of people who contributed to this |
| * project. |
| * |
| * This program is free software; you can redistribute it and/or modify |
| * it under the terms of the GNU General Public License version 2 |
| * as published by the Free Software Foundation. |
| * |
| * 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 |
| */ |
| |
| #include <common.h> |
| #include <malloc.h> |
| #include <errno.h> |
| #include <fs.h> |
| #include <linux/ctype.h> |
| |
| /* |
| * Like simple_strtoul() but handles an optional G, M, K or k |
| * suffix for Gigabyte, Megabyte or Kilobyte |
| */ |
| unsigned long strtoul_suffix(const char *str, char **endp, int base) |
| { |
| unsigned long val; |
| char *end; |
| |
| val = simple_strtoul(str, &end, base); |
| |
| switch (*end) { |
| case 'G': |
| val *= 1024; |
| case 'M': |
| val *= 1024; |
| case 'k': |
| case 'K': |
| val *= 1024; |
| end++; |
| default: |
| break; |
| } |
| |
| if (endp) |
| *endp = (char *)end; |
| |
| return val; |
| } |
| EXPORT_SYMBOL(strtoul_suffix); |
| |
| /* |
| * This function parses strings in the form <startadr>[-endaddr] |
| * or <startadr>[+size] and fills in start and size accordingly. |
| * <startadr> and <endadr> can be given in decimal or hex (with 0x prefix) |
| * and can have an optional G, M, K or k suffix. |
| * |
| * examples: |
| * 0x1000-0x2000 -> start = 0x1000, size = 0x1001 |
| * 0x1000+0x1000 -> start = 0x1000, size = 0x1000 |
| * 0x1000 -> start = 0x1000, size = ~0 |
| * 1M+1k -> start = 0x100000, size = 0x400 |
| */ |
| int parse_area_spec(const char *str, ulong *start, ulong *size) |
| { |
| char *endp; |
| ulong end; |
| |
| if (!isdigit(*str)) |
| return -1; |
| |
| *start = strtoul_suffix(str, &endp, 0); |
| |
| str = endp; |
| |
| if (!*str) { |
| /* beginning given, but no size, assume maximum size */ |
| *size = ~0; |
| return 0; |
| } |
| |
| if (*str == '-') { |
| /* beginning and end given */ |
| end = strtoul_suffix(str + 1, NULL, 0); |
| if (end < *start) { |
| printf("end < start\n"); |
| return -1; |
| } |
| *size = end - *start + 1; |
| return 0; |
| } |
| |
| if (*str == '+') { |
| /* beginning and size given */ |
| *size = strtoul_suffix(str + 1, NULL, 0); |
| return 0; |
| } |
| |
| return -1; |
| } |
| EXPORT_SYMBOL(parse_area_spec); |