Dima Zavin | 2b8429d | 2009-01-26 12:21:28 -0800 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2008 The Android Open Source Project |
| 3 | * All rights reserved. |
| 4 | * |
Duy Truong | f3ac7b3 | 2013-02-13 01:07:28 -0800 | [diff] [blame] | 5 | *Copyright (c) 2009-2012, The Linux Foundation. All rights reserved. |
Shashank Mittal | 8e49dec | 2010-03-01 15:19:04 -0800 | [diff] [blame] | 6 | * |
Dima Zavin | 2b8429d | 2009-01-26 12:21:28 -0800 | [diff] [blame] | 7 | * Redistribution and use in source and binary forms, with or without |
| 8 | * modification, are permitted provided that the following conditions |
| 9 | * are met: |
| 10 | * * Redistributions of source code must retain the above copyright |
| 11 | * notice, this list of conditions and the following disclaimer. |
| 12 | * * Redistributions in binary form must reproduce the above copyright |
| 13 | * notice, this list of conditions and the following disclaimer in |
| 14 | * the documentation and/or other materials provided with the |
| 15 | * distribution. |
| 16 | * |
| 17 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 18 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 19 | * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS |
| 20 | * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE |
| 21 | * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, |
| 22 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, |
| 23 | * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS |
| 24 | * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED |
| 25 | * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, |
| 26 | * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT |
| 27 | * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 28 | * SUCH DAMAGE. |
| 29 | */ |
| 30 | |
| 31 | #include <list.h> |
| 32 | #include <stdlib.h> |
| 33 | #include <string.h> |
| 34 | #include <lib/ptable.h> |
| 35 | |
| 36 | void ptable_init(struct ptable *ptable) |
| 37 | { |
| 38 | ASSERT(ptable); |
| 39 | |
| 40 | memset(ptable, 0, sizeof(struct ptable)); |
| 41 | } |
| 42 | |
Shashank Mittal | 8e49dec | 2010-03-01 15:19:04 -0800 | [diff] [blame] | 43 | char* ptype[] = {"Apps", "Modem"}; |
| 44 | char* pperm[] = {"No", "Yes"}; |
| 45 | |
Dima Zavin | 2b8429d | 2009-01-26 12:21:28 -0800 | [diff] [blame] | 46 | void ptable_add(struct ptable *ptable, char *name, unsigned start, |
Shashank Mittal | 8e49dec | 2010-03-01 15:19:04 -0800 | [diff] [blame] | 47 | unsigned length, unsigned flags, char type, char perm) |
Dima Zavin | 2b8429d | 2009-01-26 12:21:28 -0800 | [diff] [blame] | 48 | { |
| 49 | struct ptentry *ptn; |
| 50 | |
| 51 | ASSERT(ptable && ptable->count < MAX_PTABLE_PARTS); |
| 52 | |
| 53 | ptn = &ptable->parts[ptable->count++]; |
Ajay Dudani | 1450cf0 | 2011-09-28 12:48:16 -0700 | [diff] [blame] | 54 | strlcpy(ptn->name, name, MAX_PTENTRY_NAME); |
Dima Zavin | 2b8429d | 2009-01-26 12:21:28 -0800 | [diff] [blame] | 55 | ptn->start = start; |
| 56 | ptn->length = length; |
| 57 | ptn->flags = flags; |
Shashank Mittal | 8e49dec | 2010-03-01 15:19:04 -0800 | [diff] [blame] | 58 | ptn->type = type; |
| 59 | ptn->perm = perm; |
Dima Zavin | 2b8429d | 2009-01-26 12:21:28 -0800 | [diff] [blame] | 60 | } |
| 61 | |
| 62 | void ptable_dump(struct ptable *ptable) |
| 63 | { |
| 64 | struct ptentry *ptn; |
| 65 | int i; |
| 66 | |
| 67 | for (i = 0; i < ptable->count; ++i) { |
| 68 | ptn = &ptable->parts[i]; |
| 69 | dprintf(INFO, "ptn %d name='%s' start=%08x len=%08x " |
Shashank Mittal | 8e49dec | 2010-03-01 15:19:04 -0800 | [diff] [blame] | 70 | "flags=%08x type=%s Writable=%s\n", i, ptn->name, ptn->start, ptn->length, |
Greg Grisco | d625055 | 2011-06-29 14:40:23 -0700 | [diff] [blame] | 71 | ptn->flags, ptype[(unsigned short) ptn->type], pperm[(unsigned short) ptn->perm]); |
Dima Zavin | 2b8429d | 2009-01-26 12:21:28 -0800 | [diff] [blame] | 72 | } |
| 73 | } |
| 74 | |
| 75 | struct ptentry *ptable_find(struct ptable *ptable, const char *name) |
| 76 | { |
| 77 | struct ptentry *ptn; |
| 78 | int i; |
| 79 | |
| 80 | for (i = 0; i < ptable->count; ++i) { |
| 81 | ptn = &ptable->parts[i]; |
| 82 | if (!strcmp(ptn->name, name)) |
| 83 | return ptn; |
| 84 | } |
| 85 | |
| 86 | return NULL; |
| 87 | } |
| 88 | |
| 89 | struct ptentry *ptable_get(struct ptable *ptable, int n) |
| 90 | { |
| 91 | if (n >= ptable->count) |
| 92 | return NULL; |
| 93 | return &ptable->parts[n]; |
| 94 | } |
| 95 | |
| 96 | int ptable_size(struct ptable *ptable) |
| 97 | { |
| 98 | return ptable->count; |
| 99 | } |
Neeti Desai | 7e5380b | 2012-04-27 11:12:16 -0700 | [diff] [blame] | 100 | |
| 101 | int ptable_get_index(struct ptable *ptable, const char *name) |
| 102 | { |
| 103 | for(int i=0; i < ptable->count; i++) { |
| 104 | if (!strcmp(ptable->parts[i].name, name)) |
| 105 | return i; |
| 106 | } |
| 107 | return -1; |
| 108 | } |