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 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307
|
/*
* maskmap - Tcl extension for address mask map data structures
* Copyright 2006-2012 Ian Jackson
*
* 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 library; if not, see <http://www.gnu.org/licenses/>.
*/
#include "chiark_tcl_hbytes.h"
/*---------- operations on AddrMap_Entry ----------*/
static void ame_free(AddrMap_Entry *ame) {
TFREE(ame->start); ame->start=0;
if (ame->data) { Tcl_DecrRefCount(ame->data); ame->data=0; }
}
static const Byte *ame_parsecheck_addr(Tcl_Interp *ip, const AddrMap_Value *am,
const HBytes_Value *hb) {
int hbl= cht_hb_len(hb);
if (hbl < am->byl) {
cht_staticerr(ip,"addr-map address too short","HBYTES ADDRMAP UNDERRUN");
return 0;
}
if (hbl > am->byl) {
cht_staticerr(ip,"addr-map address too long","HBYTES ADDRMAP OVERRUN");
return 0;
}
return cht_hb_data(hb);
}
static int ame_parsecheck_range(Tcl_Interp *ip, const AddrMap_Value *am,
const HBytes_Value *starthb,
const HBytes_Value *endhb,
const Byte *p_r[2]) {
p_r[0]= ame_parsecheck_addr(ip,am,starthb); if (!p_r[0]) return TCL_ERROR;
p_r[1]= ame_parsecheck_addr(ip,am,endhb); if (!p_r[0]) return TCL_ERROR;
if (memcmp(p_r[0],p_r[1],am->byl) > 0)
return cht_staticerr(ip, "addr-map range start is after end",
"HBYTES ADDRMAP BADRANGE");
return TCL_OK;
}
static int ame_ba_addsubtractone(Byte *out, const Byte *in, int byl,
unsigned signum, unsigned onoverflow) {
/* On entry:
* *in is an array of byl bytes
* signum is 0xff or 0x01
* onoverflow is what counts as overflowed value,
* ie (for unsigned arith) 0x00 for add and 0xff for subtract
* On exit:
* *out is the resulting value (subject to overflow truncation)
* return value is TCL_OK, or TCL_ERROR if overflow happened
* (but interpreter result is not set on overflow)
*/
int j;
for (j= byl, in += byl, out += byl;
in--, out--, j>0;
j--) {
*out = (*out) + signum;
if (*out != onoverflow)
return TCL_OK;
}
return TCL_ERROR;
}
/*---------- useful operations on AddrMap_Value etc. ----------*/
static void am_init0(AddrMap_Value *am, int byl) {
am->byl= byl;
am->used= 0;
am->space= 0;
am->entries= 0;
}
static void am_reallocentries(AddrMap_Value *am, int len) {
AddrMap_Entry *newentries;
assert(len >= am->space);
if (!len) return;
assert(len < INT_MAX/sizeof(*newentries));
newentries= TREALLOC(am->entries, sizeof(*newentries)*len);
assert(newentries);
am->space= len;
am->entries= newentries;
}
static void am_free(AddrMap_Value *am) {
AddrMap_Entry *ame;
int i;
if (!am) return;
for (i=0, ame=am->entries; i<am->used; i++, ame++)
ame_free(ame);
TFREE(am->entries);
TFREE(am);
}
/*---------- Tcl type and arg parsing functions ----------*/
int cht_pat_addrmapv(Tcl_Interp *ip, Tcl_Obj *var, AddrMap_Var *agg) {
int rc;
rc= cht_pat_somethingv(ip,var,&agg->sth,&cht_addrmap_type);
if (rc) return rc;
agg->am= agg->sth.obj->internalRep.otherValuePtr;
return TCL_OK;
}
static void addrmap_t_free(Tcl_Obj *o) {
AddrMap_Value *am= o->internalRep.otherValuePtr;
am_free(am);
}
static void addrmap_t_dup(Tcl_Obj *sob, Tcl_Obj *dob) {
AddrMap_Value *sm= sob->internalRep.otherValuePtr;
AddrMap_Value *dm;
AddrMap_Entry *sme, *dme;
int i;
assert(sob->typePtr == &cht_addrmap_type);
cht_objfreeir(dob);
dm= TALLOC(sizeof(*dm));
am_init0(dm,sm->byl);
am_reallocentries(dm,sm->used);
dm->used= sm->used;
for (i=0, sme=sm->entries, dme=dm->entries;
i < dm->used;
i++, sme++, dme++) {
*dme= *sme;
dme->start= TALLOC(sm->byl); assert(dme->start);
memcpy(dme->start, sme->start, sm->byl);
Tcl_IncrRefCount(dme->data);
}
dob->internalRep.otherValuePtr= dm;
dob->typePtr= &cht_addrmap_type;
}
static void addrmap_t_ustr(Tcl_Obj *so) {
AddrMap_Value *sm= so->internalRep.otherValuePtr;
Tcl_Obj **mainlobjsl, *surrogate;
AddrMap_Entry *sme;
int entnum, listlength;
assert(so->typePtr == &cht_addrmap_type);
mainlobjsl= TALLOC(sizeof(*mainlobjsl) * (sm->used+1)); assert(mainlobjsl);
mainlobjsl[0]= Tcl_NewIntObj(sm->byl * 8);
listlength= 1;
for (entnum=0, sme=sm->entries; entnum<sm->used; entnum++, sme++) {
HBytes_Value hb;
Tcl_Obj *subl[3], *sublo;
if (!sme->data) continue;
cht_hb_array(&hb, sme->start, sm->byl);
subl[0]= cht_ret_hb(0, hb); assert(subl[0]);
if (entnum+1 < sm->used) {
ame_ba_addsubtractone(cht_hb_arrayspace(&hb, sm->byl),
(sme+1)->start, sm->byl,
/*subtract:*/ 0x0ffu, 0x0ffu);
} else {
memset(cht_hb_arrayspace(&hb, sm->byl),
0x0ffu, sm->byl);
}
subl[1]= cht_ret_hb(0, hb); assert(subl[1]);
subl[2]= sme->data;
sublo= Tcl_NewListObj(3,subl); assert(sublo);
mainlobjsl[listlength++]= sublo;
}
assert(listlength <= sm->used+1);
surrogate= Tcl_NewListObj(listlength,mainlobjsl); assert(surrogate);
assert(surrogate);
so->bytes= Tcl_GetStringFromObj(surrogate, &so->length); assert(so->bytes);
surrogate->bytes= 0; surrogate->length= 0; /* we stole it */
}
static AddrMap_Entry *ame_sfa_alloc(AddrMap_Value *am) {
AddrMap_Entry *ame;
ame= am->entries + am->used;
am->used++;
assert(am->used <= am->space);
ame->start= TALLOC(am->byl); assert(ame->start);
ame->data= 0;
return ame;
}
static int addrmap_t_sfa(Tcl_Interp *ip, Tcl_Obj *o) {
int rc, inlen, eol, innum, bitlen, cmp;
Tcl_Obj *eo, *starto, *endo;
HBytes_Value starthb, endhb;
const Byte *rangeptrs[2];
AddrMap_Value *am;
AddrMap_Entry *ame;
am= TALLOC(sizeof(*am)); assert(am);
am_init0(am,0);
rc= Tcl_ListObjLength(ip,o,&inlen); if (rc) goto x_badvalue_rc;
if (inlen<0) {
rc= cht_staticerr(ip, "addr-map overall length < 1", 0);
goto x_badvalue_rc;
}
rc= Tcl_ListObjIndex(ip,o,0,&eo); if (rc) goto x_badvalue_rc;
rc= Tcl_GetIntFromObj(ip,eo,&bitlen); if (rc) goto x_badvalue_rc;
if (bitlen<0 || bitlen % 8) {
rc= cht_staticerr(ip, "addr-map overall length < 1", 0);
goto x_badvalue_rc;
}
am->byl= bitlen/8;
assert(inlen < INT_MAX/2);
am_reallocentries(am, (inlen-1)*2+1);
ame= ame_sfa_alloc(am);
memset(ame->start,0,am->byl);
for (innum=1; innum < inlen; innum++) {
rc= Tcl_ListObjIndex(ip,o,innum,&eo); if (rc) goto x_badvalue_rc;
rc= Tcl_ListObjLength(ip,eo,&eol); if (rc) goto x_badvalue_rc;
if (eol != 3) {
rc= cht_staticerr(ip, "addr-map entry length != 3", 0);
goto x_badvalue_rc;
}
rc= Tcl_ListObjIndex(ip,eo,0,&starto); if (rc) goto x_badvalue_rc;
rc= Tcl_ListObjIndex(ip,eo,1,&endo); if (rc) goto x_badvalue_rc;
rc= cht_pat_hb(ip,starto,&starthb); if (rc) goto x_badvalue_rc;
rc= cht_pat_hb(ip,endo,&endhb); if (rc) goto x_badvalue_rc;
rc= ame_parsecheck_range(ip,am,&starthb,&endhb,rangeptrs);
if (rc) goto x_badvalue_rc;
cmp= memcmp(ame->start, rangeptrs[0], am->byl);
if (cmp < 0) {
rc= cht_staticerr(ip, "addr-map entries out of order", 0);
goto x_badvalue_rc;
}
if (cmp > 0) {
ame= ame_sfa_alloc(am);
memcpy(ame->start, rangeptrs[0], am->byl);
}
assert(!ame->data);
rc= Tcl_ListObjIndex(ip,eo,2,&ame->data); if (rc) goto x_badvalue_rc;
Tcl_IncrRefCount(ame->data);
ame= ame_sfa_alloc(am);
rc= ame_ba_addsubtractone(ame->start, rangeptrs[1], am->byl,
/*add:*/ 0x01u, 0x00u);
if (rc) {
/* we've overflowed. it must have been ffffffff.... */
if (innum != inlen-1) {
rc= cht_staticerr(ip, "addr-map non-last entry end is all-bits-1", 0);
goto x_badvalue_rc;
}
TFREE(ame->start);
am->used--;
break;
}
}
/* we commit now */
cht_objfreeir(o);
o->internalRep.otherValuePtr= am;
o->typePtr= &cht_addrmap_type;
return TCL_OK;
x_badvalue_rc:
if (rc == TCL_ERROR)
Tcl_SetObjErrorCode(ip, Tcl_NewStringObj("HBYTES ADDRMAP VALUE", -1));
am_free(am);
return rc;
}
Tcl_ObjType cht_addrmap_type = {
"addr-map",
addrmap_t_free, addrmap_t_dup, addrmap_t_ustr, addrmap_t_sfa
};
|