| // Inferno libmach/access.c | |
| // http://code.google.com/p/inferno-os/source/browse/utils/libmach/access.c | |
| // | |
| // Copyright © 1994-1999 Lucent Technologies Inc. | |
| // Power PC support Copyright © 1995-2004 C H Forsyth (forsyth@terzarima.net). | |
| // Portions Copyright © 1997-1999 Vita Nuova Limited. | |
| // Portions Copyright © 2000-2007 Vita Nuova Holdings Limited (www.vitanuova.com). | |
| // Revisions Copyright © 2000-2004 Lucent Technologies Inc. and others. | |
| // Portions Copyright © 2009 The Go Authors. All rights reserved. | |
| // | |
| // Permission is hereby granted, free of charge, to any person obtaining a copy | |
| // of this software and associated documentation files (the "Software"), to deal | |
| // in the Software without restriction, including without limitation the rights | |
| // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell | |
| // copies of the Software, and to permit persons to whom the Software is | |
| // furnished to do so, subject to the following conditions: | |
| // | |
| // The above copyright notice and this permission notice shall be included in | |
| // all copies or substantial portions of the Software. | |
| // | |
| // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR | |
| // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, | |
| // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE | |
| // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER | |
| // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, | |
| // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN | |
| // THE SOFTWARE. | |
| /* | |
| * functions to read and write an executable or file image | |
| */ | |
| #include <u.h> | |
| #include <libc.h> | |
| #include <bio.h> | |
| #include <mach_amd64.h> | |
| static int mget(Map*, uvlong, void*, int); | |
| static int mput(Map*, uvlong, void*, int); | |
| static Seg* reloc(Map*, uvlong, vlong*); | |
| /* | |
| * routines to get/put various types | |
| */ | |
| int | |
| geta(Map *map, uvlong addr, uvlong *x) | |
| { | |
| uint32 l; | |
| uvlong vl; | |
| if (mach->szaddr == 8){ | |
| if (get8(map, addr, &vl) < 0) | |
| return -1; | |
| *x = vl; | |
| return 1; | |
| } | |
| if (get4(map, addr, &l) < 0) | |
| return -1; | |
| *x = l; | |
| return 1; | |
| } | |
| int | |
| get8(Map *map, uvlong addr, uvlong *x) | |
| { | |
| if (!map) { | |
| werrstr("get8: invalid map"); | |
| return -1; | |
| } | |
| if (map->nsegs == 1 && map->seg[0].fd < 0) { | |
| *x = addr; | |
| return 1; | |
| } | |
| if (mget(map, addr, x, 8) < 0) | |
| return -1; | |
| *x = machdata->swav(*x); | |
| return 1; | |
| } | |
| int | |
| get4(Map *map, uvlong addr, uint32 *x) | |
| { | |
| if (!map) { | |
| werrstr("get4: invalid map"); | |
| return -1; | |
| } | |
| if (map->nsegs == 1 && map->seg[0].fd < 0) { | |
| *x = addr; | |
| return 1; | |
| } | |
| if (mget(map, addr, x, 4) < 0) | |
| return -1; | |
| *x = machdata->swal(*x); | |
| return 1; | |
| } | |
| int | |
| get2(Map *map, uvlong addr, ushort *x) | |
| { | |
| if (!map) { | |
| werrstr("get2: invalid map"); | |
| return -1; | |
| } | |
| if (map->nsegs == 1 && map->seg[0].fd < 0) { | |
| *x = addr; | |
| return 1; | |
| } | |
| if (mget(map, addr, x, 2) < 0) | |
| return -1; | |
| *x = machdata->swab(*x); | |
| return 1; | |
| } | |
| int | |
| get1(Map *map, uvlong addr, uchar *x, int size) | |
| { | |
| uchar *cp; | |
| if (!map) { | |
| werrstr("get1: invalid map"); | |
| return -1; | |
| } | |
| if (map->nsegs == 1 && map->seg[0].fd < 0) { | |
| cp = (uchar*)&addr; | |
| while (cp < (uchar*)(&addr+1) && size-- > 0) | |
| *x++ = *cp++; | |
| while (size-- > 0) | |
| *x++ = 0; | |
| } else | |
| return mget(map, addr, x, size); | |
| return 1; | |
| } | |
| int | |
| puta(Map *map, uvlong addr, uvlong v) | |
| { | |
| if (mach->szaddr == 8) | |
| return put8(map, addr, v); | |
| return put4(map, addr, v); | |
| } | |
| int | |
| put8(Map *map, uvlong addr, uvlong v) | |
| { | |
| if (!map) { | |
| werrstr("put8: invalid map"); | |
| return -1; | |
| } | |
| v = machdata->swav(v); | |
| return mput(map, addr, &v, 8); | |
| } | |
| int | |
| put4(Map *map, uvlong addr, uint32 v) | |
| { | |
| if (!map) { | |
| werrstr("put4: invalid map"); | |
| return -1; | |
| } | |
| v = machdata->swal(v); | |
| return mput(map, addr, &v, 4); | |
| } | |
| int | |
| put2(Map *map, uvlong addr, ushort v) | |
| { | |
| if (!map) { | |
| werrstr("put2: invalid map"); | |
| return -1; | |
| } | |
| v = machdata->swab(v); | |
| return mput(map, addr, &v, 2); | |
| } | |
| int | |
| put1(Map *map, uvlong addr, uchar *v, int size) | |
| { | |
| if (!map) { | |
| werrstr("put1: invalid map"); | |
| return -1; | |
| } | |
| return mput(map, addr, v, size); | |
| } | |
| static int | |
| mget(Map *map, uvlong addr, void *buf, int size) | |
| { | |
| uvlong off; | |
| Seg *s; | |
| s = reloc(map, addr, (vlong*)&off); | |
| if (!s) | |
| return -1; | |
| if (s->rw == nil) { | |
| werrstr("unreadable map"); | |
| return -1; | |
| } | |
| return s->rw(map, s, off, buf, size, 1); | |
| } | |
| static int | |
| mput(Map *map, uvlong addr, void *buf, int size) | |
| { | |
| vlong off; | |
| Seg *s; | |
| s = reloc(map, addr, &off); | |
| if (!s) | |
| return -1; | |
| if (s->rw == nil) { | |
| werrstr("unwritable map"); | |
| return -1; | |
| } | |
| return s->rw(map, s, off, buf, size, 0); | |
| } | |
| /* | |
| * convert address to file offset; returns nonzero if ok | |
| */ | |
| static Seg* | |
| reloc(Map *map, uvlong addr, vlong *offp) | |
| { | |
| int i; | |
| for (i = 0; i < map->nsegs; i++) { | |
| if (map->seg[i].inuse) | |
| if (map->seg[i].b <= addr && addr < map->seg[i].e) { | |
| *offp = addr + map->seg[i].f - map->seg[i].b; | |
| return &map->seg[i]; | |
| } | |
| } | |
| werrstr("can't translate address %llux", addr); | |
| return 0; | |
| } |