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 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500
|
/*
* util.c --
*
* Implements helper procedures used by 3->4 encoders (uu, base64)
* and other useful things.
*
*
* Copyright (c) 1996 Andreas Kupries (andreas_kupries@users.sourceforge.net)
* All rights reserved.
*
* Permission is hereby granted, without written agreement and without
* license or royalty fees, to use, copy, modify, and distribute this
* software and its documentation for any purpose, provided that the
* above copyright notice and the following two paragraphs appear in
* all copies of this software.
*
* IN NO EVENT SHALL I LIABLE TO ANY PARTY FOR DIRECT, INDIRECT, SPECIAL,
* INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OF THIS
* SOFTWARE AND ITS DOCUMENTATION, EVEN IF I HAVE BEEN ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*
* I SPECIFICALLY DISCLAIM ANY WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS ON AN "AS IS" BASIS, AND
* I HAVE NO OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES,
* ENHANCEMENTS, OR MODIFICATIONS.
*
* CVS: $Id: util.c,v 1.9 2007/10/05 23:12:24 andreas_kupries Exp $
*/
#include "transformInt.h"
static void
Split _ANSI_ARGS_ ((CONST char* in, char* out));
/*
*------------------------------------------------------*
*
* TrfSplit3to4 --
*
* ------------------------------------------------*
* Splits every 3 bytes of input into 4 bytes,
* actually 6-bit values and places them in the
* target. Padding at the end is done with a value
* of '64' (6 bit -> values in range 0..63).
* This feature is used by 'TrfApplyEncoding'.
* 'length' must be in the range 1, ..., 3.
* ------------------------------------------------*
*
* Sideeffects:
* 'out' is changed.
*
* Result:
* See above.
*
*
*------------------------------------------------------*
*/
void
TrfSplit3to4 (in, out, length)
CONST unsigned char* in;
unsigned char* out;
int length;
{
if (length == 3) {
Split ((char*) in, (char*) out);
} else {
char buf [3];
/* expand incomplete sequence with with '\0' */
memset (buf, '\0', 3);
memcpy (buf, in, length);
Split (buf, (char*) out);
switch (length) {
case 1:
out [2] = 64;
out [3] = 64;
break;
case 2:
out [3] = 64;
break;
case 0:
default:
/* should not happen */
Tcl_Panic ("illegal length given to TrfSplit3to4");
}
}
}
/*
*------------------------------------------------------*
*
* TrfMerge4to3 --
*
* ------------------------------------------------*
* takes 4 bytes from 'in' (6-bit values) and
* merges them into 3 bytes (8-bit values).
* ------------------------------------------------*
*
* Sideeffects:
* The generated bytes are written to 'out'.
*
* Results:
* See above.
*
*------------------------------------------------------*
*/
void
TrfMerge4to3 (in, out)
CONST unsigned char* in;
unsigned char* out;
{
#define TRF_MASK(i,by,mask) ((in [i] by) & mask)
/*
* use temp storage to prevent problems in case of
* 'in', 'out' overlapping each other.
*/
unsigned char o1, o2, o3;
o1 = TRF_MASK (0, << 2, 0374) | TRF_MASK (1, >> 4, 003);
o2 = TRF_MASK (1, << 4, 0360) | TRF_MASK (2, >> 2, 017);
o3 = TRF_MASK (2, << 6, 0300) | TRF_MASK (3, >> 0, 077);
out [0] = o1;
out [1] = o2;
out [2] = o3;
#undef TRF_MASK
}
/*
*------------------------------------------------------*
*
* --
*
* ------------------------------------------------*
* transform 6-bit values into real characters
* according to the specified character-mapping.
* The map HAS TO contain at least 65 characters,
* the last one being the PAD character to use.
* ------------------------------------------------*
*
* Sideeffects:
* The characters are read from and written
* to 'buf'.
*
* Results:
* See above.
*
*------------------------------------------------------*
*/
void
TrfApplyEncoding (buf, length, map)
unsigned char* buf;
int length;
CONST char* map;
{
int i;
for (i=0; i < length; i++) {
buf [i] = map [buf [i]];
}
}
/*
*------------------------------------------------------*
*
* TrfReverseEncoding --
*
* ------------------------------------------------*
* The given string is converted in place into its
* equivalent binary representation. The procedure
* assummes the string to be encoded with a 3->4
* byte scheme (such as uuencding, base64).
*
* The map HAS TO contain at least 256 characters.
* It is indexed by an 8 bit value to get the 6-bit
* binary field corresponding to that value. Any
* illegal characters must have the high bit set.
* ------------------------------------------------*
*
* Sideeffects:
* The characters are read from and written
* to 'buf'.
*
* Result:
* A standard TCL error code
* 'hasPadding' returns the number unused
* bytes in buf (0..3).
*
*------------------------------------------------------*
*/
int
TrfReverseEncoding (buf, length, reverseMap, padChar, hasPadding)
unsigned char* buf;
int length;
CONST char* reverseMap;
unsigned int padChar;
int* hasPadding;
{
/*
* length has to be in the range 1..4.
*/
int i, pad, maplen;
if ((length < 1) || (length > 4)) {
Tcl_Panic ("illegal length given to TrfReverseEncoding");
}
pad = 4 - length;
/* check for more pad chars */
for (i=length-1;
(i >= 0) && (padChar == buf [i]);
pad++, i--) {
buf [i] = '\0';
}
if (pad > 2)
/*
* Only xxxx, xxx= and xx== allowed
* (with x as legal character and = as pad-char.
*/
return TCL_ERROR;
*hasPadding = pad;
maplen = i+1;
/* convert characters to 6-bit values */
for (i=0; i < maplen; i++) {
char tmp = reverseMap [buf [i]];
if (tmp & 0x80)
/* high-bit set? => illegal character */
return TCL_ERROR;
buf [i] = tmp;
}
return TCL_OK;
}
/*
*------------------------------------------------------*
*
* Split --
*
* ------------------------------------------------*
* takes 3 bytes from 'in', splits them into
* 4 6-bit values and places them then into 'out'.
* ------------------------------------------------*
*
* Sideeffects:
* The generated characters are written to
* 'out'.
*
* Results:
* See above.
*
*------------------------------------------------------*
*/
static void
Split (in, out)
CONST char* in;
char* out;
{
out [0] = (077 & (in [0] >> 2));
out [1] = (077 & (((in [0] << 4) & 060) | ((in [1] >> 4) & 017)));
out [2] = (077 & (((in [1] << 2) & 074) | ((in [2] >> 6) & 03)));
out [3] = (077 & (in [2] & 077));
}
/*
*------------------------------------------------------*
*
* Trf_XorBuffer --
*
* ------------------------------------------------*
* Do an 'exclusive or' of all 'length' bytes in
* 'buffer' with the corresponding bytes in 'mask'.
* ------------------------------------------------*
*
* Sideeffects:
* See above.
*
* Result:
* None.
*
*------------------------------------------------------*
*/
void
Trf_XorBuffer (buffer, mask, length)
VOID* buffer;
VOID* mask;
int length;
{
unsigned char* b = (unsigned char*) buffer;
unsigned char* m = (unsigned char*) mask;
while (length > 0) {
*b++ ^= *m++;
length --;
}
}
/*
*------------------------------------------------------*
*
* Trf_ShiftRegister --
*
* ------------------------------------------------*
* Take the 'shift' leftmost bytes of 'mask' and
* shift them into the rightmost bytes of 'buffer'.
* The leftmost bytes of 'buffer' are lost. Both
* buffers are assumed to be of size 'length'.
* ------------------------------------------------*
*
* Sideeffects:
* See above.
*
* Result:
* none.
*
*------------------------------------------------------*
*/
void
Trf_ShiftRegister (buffer, mask, shift, length)
VOID* buffer;
VOID* mask;
int shift;
int length;
{
assert (shift > 0);
if (shift == length) {
/*
* Special case: Drop the whole old register.
*/
memcpy (buffer, mask, length);
} else {
unsigned char* b = (unsigned char*) buffer;
unsigned char* m = (unsigned char*) mask;
int retained;
/* number bytes in 'buffer' to retain */
retained = length - shift;
/* left-shift retained bytes of 'buffer' over by
* 'shift' bytes to create space for new bytes
*/
while (retained --) {
*b = *(b + shift);
b ++;
}
/* now copy 'shift' bytes from 'input' to shifted tail of 'buffer' */
do {
*b++ = *m++;
} while (--shift);
}
}
/*
*------------------------------------------------------*
*
* Trf_FlipRegisterShort --
*
* ------------------------------------------------*
* Swap the bytes for all 2-Byte words contained in
* the register.
* ------------------------------------------------*
*
* Sideeffects:
* See above.
*
* Result:
* none.
*
*------------------------------------------------------*
*/
void
Trf_FlipRegisterShort (buffer, length)
VOID* buffer;
int length;
{
unsigned char tmp;
unsigned char* b = (unsigned char*) buffer;
int n_shorts = length / 2;
int i;
for (i=0; i < n_shorts; i++, b+= 2) {
tmp = b [0]; b [0] = b [1]; b [1] = tmp;
}
}
/*
*------------------------------------------------------*
*
* Trf_FlipRegisterLong --
*
* ------------------------------------------------*
* Swap the bytes for all 4-Byte words contained in
* the register.
* ------------------------------------------------*
*
* Sideeffects:
* See above.
*
* Result:
* none.
*
*------------------------------------------------------*
*/
void
Trf_FlipRegisterLong (buffer, length)
VOID* buffer;
int length;
{
unsigned char tmp;
unsigned char* b = (unsigned char*) buffer;
int n_longs = length / 4;
int i;
/*
* 0 -> 3
* 1 -> 2
* 2 -> 1
* 3 -> 0
*/
for (i=0; i < n_longs; i++, b+= 4) {
tmp = b [0]; b [0] = b [3]; b [3] = tmp;
tmp = b [1]; b [1] = b [2]; b [2] = tmp;
}
}
/*
*------------------------------------------------------*
*/
/* internal procedures, for testing */
void
TrfDumpHex (f, buffer, length, next)
FILE* f;
VOID* buffer;
int length;
int next;
{
short i;
unsigned char* b = (unsigned char*) buffer;
for (i=0; i < length; i++) fprintf (f, "%02x", (unsigned int) (b [i]));
switch (next) {
case 0: break;
case 1: fprintf (f, " "); break;
case 2: fprintf (f, "\n"); break;
}
}
void
TrfDumpShort (f, buffer, length, next)
FILE* f;
VOID* buffer;
int length;
int next;
{
short i;
unsigned short* b = (unsigned short*) buffer;
for (i=0; i < (length/2); i++) fprintf (f, "%06d ", (unsigned int) (b [i]));
switch (next) {
case 0: break;
case 1: fprintf (f, " "); break;
case 2: fprintf (f, "\n"); break;
}
}
|