1 /*- 2 * Copyright (c) 2006 Alexander Motin <mav@alkar.net> 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice unmodified, this list of conditions, and the following 10 * disclaimer. 11 * 2. Redistributions in binary form must reproduce the above copyright 12 * notice, this list of conditions and the following disclaimer in the 13 * documentation and/or other materials provided with the distribution. 14 * 15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 16 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 18 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 19 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 20 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 21 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 22 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 23 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 24 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 25 * SUCH DAMAGE. 26 * 27 * $FreeBSD: src/sys/netgraph/ng_pred1.c,v 1.3 2008/01/27 02:04:12 mav Exp $ 28 * $DragonFly: src/sys/netgraph7/ng_pred1.c,v 1.2 2008/06/26 23:05:35 dillon Exp $ 29 */ 30 31 /* 32 * Predictor-1 PPP compression netgraph node type. 33 */ 34 35 #include <sys/param.h> 36 #include <sys/systm.h> 37 #include <sys/kernel.h> 38 #include <sys/mbuf.h> 39 #include <sys/malloc.h> 40 #include <sys/errno.h> 41 #include <sys/syslog.h> 42 43 #include "ng_message.h" 44 #include "netgraph.h" 45 #include "ng_parse.h" 46 #include "ng_pred1.h" 47 48 #include "opt_netgraph.h" 49 50 MALLOC_DEFINE(M_NETGRAPH_PRED1, "netgraph_pred1", "netgraph pred1 node "); 51 52 /* PRED1 header length */ 53 #define PRED1_HDRLEN 2 54 55 #define PRED1_TABLE_SIZE 0x10000 56 #define PRED1_BUF_SIZE 4096 57 #define PPP_INITFCS 0xffff /* Initial FCS value */ 58 #define PPP_GOODFCS 0xf0b8 /* Good final FCS value */ 59 60 /* 61 * The following hash code is the heart of the algorithm: 62 * it builds a sliding hash sum of the previous 3-and-a-bit 63 * characters which will be used to index the guess table. 64 * A better hash function would result in additional compression, 65 * at the expense of time. 66 */ 67 68 #define HASH(x) priv->Hash = (priv->Hash << 4) ^ (x) 69 70 /* Node private data */ 71 struct ng_pred1_private { 72 struct ng_pred1_config cfg; /* configuration */ 73 u_char GuessTable[PRED1_TABLE_SIZE]; /* dictionary */ 74 u_char inbuf[PRED1_BUF_SIZE]; /* input buffer */ 75 u_char outbuf[PRED1_BUF_SIZE]; /* output buffer */ 76 struct ng_pred1_stats stats; /* statistics */ 77 uint16_t Hash; 78 ng_ID_t ctrlnode; /* path to controlling node */ 79 uint16_t seqnum; /* sequence number */ 80 u_char compress; /* compress/decompress flag */ 81 }; 82 typedef struct ng_pred1_private *priv_p; 83 84 /* Netgraph node methods */ 85 static ng_constructor_t ng_pred1_constructor; 86 static ng_rcvmsg_t ng_pred1_rcvmsg; 87 static ng_shutdown_t ng_pred1_shutdown; 88 static ng_newhook_t ng_pred1_newhook; 89 static ng_rcvdata_t ng_pred1_rcvdata; 90 static ng_disconnect_t ng_pred1_disconnect; 91 92 /* Helper functions */ 93 static int ng_pred1_compress(node_p node, struct mbuf *m, 94 struct mbuf **resultp); 95 static int ng_pred1_decompress(node_p node, struct mbuf *m, 96 struct mbuf **resultp); 97 static void Pred1Init(node_p node); 98 static int Pred1Compress(node_p node, u_char *source, u_char *dest, 99 int len); 100 static int Pred1Decompress(node_p node, u_char *source, u_char *dest, 101 int slen, int dlen); 102 static void Pred1SyncTable(node_p node, u_char *source, int len); 103 static uint16_t Crc16(uint16_t fcs, u_char *cp, int len); 104 105 static const uint16_t Crc16Table[]; 106 107 /* Parse type for struct ng_pred1_config. */ 108 static const struct ng_parse_struct_field ng_pred1_config_type_fields[] 109 = NG_PRED1_CONFIG_INFO; 110 static const struct ng_parse_type ng_pred1_config_type = { 111 &ng_parse_struct_type, 112 ng_pred1_config_type_fields 113 }; 114 115 /* Parse type for struct ng_pred1_stat. */ 116 static const struct ng_parse_struct_field ng_pred1_stats_type_fields[] 117 = NG_PRED1_STATS_INFO; 118 static const struct ng_parse_type ng_pred1_stat_type = { 119 &ng_parse_struct_type, 120 ng_pred1_stats_type_fields 121 }; 122 123 /* List of commands and how to convert arguments to/from ASCII. */ 124 static const struct ng_cmdlist ng_pred1_cmds[] = { 125 { 126 NGM_PRED1_COOKIE, 127 NGM_PRED1_CONFIG, 128 "config", 129 &ng_pred1_config_type, 130 NULL 131 }, 132 { 133 NGM_PRED1_COOKIE, 134 NGM_PRED1_RESETREQ, 135 "resetreq", 136 NULL, 137 NULL 138 }, 139 { 140 NGM_PRED1_COOKIE, 141 NGM_PRED1_GET_STATS, 142 "getstats", 143 NULL, 144 &ng_pred1_stat_type 145 }, 146 { 147 NGM_PRED1_COOKIE, 148 NGM_PRED1_CLR_STATS, 149 "clrstats", 150 NULL, 151 NULL 152 }, 153 { 154 NGM_PRED1_COOKIE, 155 NGM_PRED1_GETCLR_STATS, 156 "getclrstats", 157 NULL, 158 &ng_pred1_stat_type 159 }, 160 { 0 } 161 }; 162 163 /* Node type descriptor */ 164 static struct ng_type ng_pred1_typestruct = { 165 .version = NG_ABI_VERSION, 166 .name = NG_PRED1_NODE_TYPE, 167 .constructor = ng_pred1_constructor, 168 .rcvmsg = ng_pred1_rcvmsg, 169 .shutdown = ng_pred1_shutdown, 170 .newhook = ng_pred1_newhook, 171 .rcvdata = ng_pred1_rcvdata, 172 .disconnect = ng_pred1_disconnect, 173 .cmdlist = ng_pred1_cmds, 174 }; 175 NETGRAPH_INIT(pred1, &ng_pred1_typestruct); 176 177 #define ERROUT(x) do { error = (x); goto done; } while (0) 178 179 /************************************************************************ 180 NETGRAPH NODE STUFF 181 ************************************************************************/ 182 183 /* 184 * Node type constructor 185 */ 186 static int 187 ng_pred1_constructor(node_p node) 188 { 189 priv_p priv; 190 191 /* Allocate private structure. */ 192 priv = kmalloc(sizeof(*priv), M_NETGRAPH_PRED1, M_WAITOK | M_ZERO); 193 194 NG_NODE_SET_PRIVATE(node, priv); 195 196 /* This node is not thread safe. */ 197 NG_NODE_FORCE_WRITER(node); 198 199 /* Done */ 200 return (0); 201 } 202 203 /* 204 * Give our OK for a hook to be added. 205 */ 206 static int 207 ng_pred1_newhook(node_p node, hook_p hook, const char *name) 208 { 209 const priv_p priv = NG_NODE_PRIVATE(node); 210 211 if (NG_NODE_NUMHOOKS(node) > 0) 212 return (EINVAL); 213 214 if (strcmp(name, NG_PRED1_HOOK_COMP) == 0) 215 priv->compress = 1; 216 else if (strcmp(name, NG_PRED1_HOOK_DECOMP) == 0) 217 priv->compress = 0; 218 else 219 return (EINVAL); 220 221 return (0); 222 } 223 224 /* 225 * Receive a control message. 226 */ 227 static int 228 ng_pred1_rcvmsg(node_p node, item_p item, hook_p lasthook) 229 { 230 const priv_p priv = NG_NODE_PRIVATE(node); 231 struct ng_mesg *resp = NULL; 232 int error = 0; 233 struct ng_mesg *msg; 234 235 NGI_GET_MSG(item, msg); 236 237 if (msg->header.typecookie != NGM_PRED1_COOKIE) 238 ERROUT(EINVAL); 239 240 switch (msg->header.cmd) { 241 case NGM_PRED1_CONFIG: 242 { 243 struct ng_pred1_config *const cfg = 244 (struct ng_pred1_config *)msg->data; 245 246 /* Check configuration. */ 247 if (msg->header.arglen != sizeof(*cfg)) 248 ERROUT(EINVAL); 249 250 /* Configuration is OK, reset to it. */ 251 priv->cfg = *cfg; 252 253 /* Save return address so we can send reset-req's. */ 254 priv->ctrlnode = NGI_RETADDR(item); 255 256 /* Clear our state. */ 257 Pred1Init(node); 258 259 break; 260 } 261 case NGM_PRED1_RESETREQ: 262 Pred1Init(node); 263 break; 264 265 case NGM_PRED1_GET_STATS: 266 case NGM_PRED1_CLR_STATS: 267 case NGM_PRED1_GETCLR_STATS: 268 { 269 /* Create response. */ 270 if (msg->header.cmd != NGM_PRED1_CLR_STATS) { 271 NG_MKRESPONSE(resp, msg, 272 sizeof(struct ng_pred1_stats), M_WAITOK | M_NULLOK); 273 if (resp == NULL) 274 ERROUT(ENOMEM); 275 bcopy(&priv->stats, resp->data, 276 sizeof(struct ng_pred1_stats)); 277 } 278 279 if (msg->header.cmd != NGM_PRED1_GET_STATS) 280 bzero(&priv->stats, sizeof(struct ng_pred1_stats)); 281 break; 282 } 283 284 default: 285 error = EINVAL; 286 break; 287 } 288 done: 289 NG_RESPOND_MSG(error, node, item, resp); 290 NG_FREE_MSG(msg); 291 return (error); 292 } 293 294 /* 295 * Receive incoming data on our hook. 296 */ 297 static int 298 ng_pred1_rcvdata(hook_p hook, item_p item) 299 { 300 const node_p node = NG_HOOK_NODE(hook); 301 const priv_p priv = NG_NODE_PRIVATE(node); 302 struct mbuf *m, *out; 303 int error; 304 305 if (!priv->cfg.enable) { 306 NG_FREE_ITEM(item); 307 return (ENXIO); 308 } 309 310 NGI_GET_M(item, m); 311 /* Compress. */ 312 if (priv->compress) { 313 if ((error = ng_pred1_compress(node, m, &out)) != 0) { 314 NG_FREE_ITEM(item); 315 log(LOG_NOTICE, "%s: error: %d\n", __func__, error); 316 return (error); 317 } 318 319 } else { /* Decompress. */ 320 if ((error = ng_pred1_decompress(node, m, &out)) != 0) { 321 NG_FREE_ITEM(item); 322 log(LOG_NOTICE, "%s: error: %d\n", __func__, error); 323 if (priv->ctrlnode != 0) { 324 struct ng_mesg *msg; 325 326 /* Need to send a reset-request. */ 327 NG_MKMESSAGE(msg, NGM_PRED1_COOKIE, 328 NGM_PRED1_RESETREQ, 0, M_WAITOK | M_NULLOK); 329 if (msg == NULL) 330 return (error); 331 NG_SEND_MSG_ID(error, node, msg, 332 priv->ctrlnode, 0); 333 } 334 return (error); 335 } 336 } 337 338 NG_FWD_NEW_DATA(error, item, hook, out); 339 return (error); 340 } 341 342 /* 343 * Destroy node. 344 */ 345 static int 346 ng_pred1_shutdown(node_p node) 347 { 348 const priv_p priv = NG_NODE_PRIVATE(node); 349 350 kfree(priv, M_NETGRAPH_PRED1); 351 NG_NODE_SET_PRIVATE(node, NULL); 352 NG_NODE_UNREF(node); /* Let the node escape. */ 353 return (0); 354 } 355 356 /* 357 * Hook disconnection 358 */ 359 static int 360 ng_pred1_disconnect(hook_p hook) 361 { 362 const node_p node = NG_HOOK_NODE(hook); 363 364 Pred1Init(node); 365 366 /* Go away if no longer connected. */ 367 if ((NG_NODE_NUMHOOKS(node) == 0) && NG_NODE_IS_VALID(node)) 368 ng_rmnode_self(node); 369 return (0); 370 } 371 372 /************************************************************************ 373 HELPER STUFF 374 ************************************************************************/ 375 376 /* 377 * Compress/encrypt a packet and put the result in a new mbuf at *resultp. 378 * The original mbuf is not free'd. 379 */ 380 static int 381 ng_pred1_compress(node_p node, struct mbuf *m, struct mbuf **resultp) 382 { 383 const priv_p priv = NG_NODE_PRIVATE(node); 384 int outlen, inlen; 385 u_char *out; 386 uint16_t fcs, lenn; 387 int len; 388 389 /* Initialize. */ 390 *resultp = NULL; 391 392 inlen = m->m_pkthdr.len; 393 394 priv->stats.FramesPlain++; 395 priv->stats.InOctets += inlen; 396 397 /* Reserve space for expansion. */ 398 if (inlen > (PRED1_BUF_SIZE*8/9 + 1 + 4)) { 399 priv->stats.Errors++; 400 NG_FREE_M(m); 401 return (ENOMEM); 402 } 403 404 /* Work with contiguous regions of memory. */ 405 m_copydata(m, 0, inlen, (caddr_t)(priv->inbuf + 2)); 406 407 NG_FREE_M(m); 408 409 lenn = htons(inlen & 0x7FFF); 410 411 /* Compute FCS. */ 412 fcs = Crc16(PPP_INITFCS, (u_char *)&lenn, 2); 413 fcs = Crc16(fcs, priv->inbuf + 2, inlen); 414 fcs = ~fcs; 415 416 /* Compress data. */ 417 len = Pred1Compress(node, priv->inbuf + 2, priv->outbuf + 2, inlen); 418 419 /* What happened? */ 420 if (len < inlen) { 421 out = priv->outbuf; 422 outlen = 2 + len; 423 *(uint16_t *)out = lenn; 424 *out |= 0x80; 425 priv->stats.FramesComp++; 426 } else { 427 out = priv->inbuf; 428 outlen = 2 + inlen; 429 *(uint16_t *)out = lenn; 430 priv->stats.FramesUncomp++; 431 } 432 433 /* Add FCS. */ 434 (out + outlen)[0] = fcs & 0xFF; 435 (out + outlen)[1] = fcs >> 8; 436 437 /* Calculate resulting size. */ 438 outlen += 2; 439 440 /* Return packet in an mbuf. */ 441 *resultp = m_devget((caddr_t)out, outlen, 0, NULL, NULL); 442 if (*resultp == NULL) { 443 priv->stats.Errors++; 444 return (ENOMEM); 445 }; 446 447 priv->stats.OutOctets += outlen; 448 449 return (0); 450 } 451 452 /* 453 * Decompress/decrypt packet and put the result in a new mbuf at *resultp. 454 * The original mbuf is not free'd. 455 */ 456 static int 457 ng_pred1_decompress(node_p node, struct mbuf *m, struct mbuf **resultp) 458 { 459 const priv_p priv = NG_NODE_PRIVATE(node); 460 int inlen; 461 uint16_t len, len1, cf, lenn; 462 uint16_t fcs; 463 464 /* Initialize. */ 465 *resultp = NULL; 466 467 inlen = m->m_pkthdr.len; 468 469 if (inlen > PRED1_BUF_SIZE) { 470 priv->stats.Errors++; 471 NG_FREE_M(m); 472 return (ENOMEM); 473 } 474 475 /* Work with contiguous regions of memory. */ 476 m_copydata(m, 0, inlen, (caddr_t)priv->inbuf); 477 478 priv->stats.InOctets += inlen; 479 480 /* Get initial length value. */ 481 len = priv->inbuf[0] << 8; 482 len += priv->inbuf[1]; 483 484 cf = (len & 0x8000); 485 len &= 0x7fff; 486 487 /* Is data compressed or not really? */ 488 if (cf) { 489 NG_FREE_M(m); 490 491 priv->stats.FramesComp++; 492 len1 = Pred1Decompress(node, priv->inbuf + 2, priv->outbuf, 493 inlen - 4, PRED1_BUF_SIZE); 494 if (len != len1) { 495 /* Error is detected. Send reset request */ 496 priv->stats.Errors++; 497 log(LOG_NOTICE, "ng_pred1: Comp length error (%d) " 498 "--> len (%d)\n", len, len1); 499 return (EIO); 500 } 501 502 /* 503 * CRC check on receive is defined in RFC. It is surely required 504 * for compressed frames to signal dictionary corruption, 505 * but it is actually useless for uncompressed frames because 506 * the same check has already done by HDLC and/or other layer. 507 */ 508 lenn = htons(len); 509 fcs = Crc16(PPP_INITFCS, (u_char *)&lenn, 2); 510 fcs = Crc16(fcs, priv->outbuf, len); 511 fcs = Crc16(fcs, priv->inbuf + inlen - 2, 2); 512 513 if (fcs != PPP_GOODFCS) { 514 priv->stats.Errors++; 515 log(LOG_NOTICE, "ng_pred1: Pred1: Bad CRC-16\n"); 516 return (EIO); 517 } 518 519 /* Return packet in an mbuf. */ 520 *resultp = m_devget((caddr_t)priv->outbuf, len, 0, NULL, NULL); 521 if (*resultp == NULL) { 522 priv->stats.Errors++; 523 return (ENOMEM); 524 }; 525 526 } else { 527 priv->stats.FramesUncomp++; 528 if (len != (inlen - 4)) { 529 /* Wrong length. Send reset request */ 530 priv->stats.Errors++; 531 log(LOG_NOTICE, "ng_pred1: Uncomp length error (%d) " 532 "--> len (%d)\n", len, inlen - 4); 533 NG_FREE_M(m); 534 return (EIO); 535 } 536 Pred1SyncTable(node, priv->inbuf + 2, len); 537 m_adj(m, 2); /* Strip length. */ 538 m_adj(m, -2); /* Strip fcs. */ 539 *resultp = m; 540 } 541 542 priv->stats.FramesPlain++; 543 priv->stats.OutOctets += len; 544 545 return (0); 546 } 547 548 /* 549 * Pred1Init() 550 */ 551 552 static void 553 Pred1Init(node_p node) 554 { 555 const priv_p priv = NG_NODE_PRIVATE(node); 556 557 priv->Hash = 0; 558 memset(priv->GuessTable, 0, PRED1_TABLE_SIZE); 559 } 560 561 /* 562 * Pred1Compress() 563 */ 564 565 static int 566 Pred1Compress(node_p node, u_char *source, u_char *dest, int len) 567 { 568 const priv_p priv = NG_NODE_PRIVATE(node); 569 int i; 570 u_char flags; 571 u_char *flagdest, *orgdest; 572 573 orgdest = dest; 574 while (len) { 575 flagdest = dest++; 576 flags = 0; /* All guesses are wrong initially. */ 577 for (i = 0; i < 8 && len; i++) { 578 if (priv->GuessTable[priv->Hash] == *source) 579 /* Guess was right - don't output. */ 580 flags |= (1 << i); 581 else { 582 /* Guess wrong, output char. */ 583 priv->GuessTable[priv->Hash] = *source; 584 *dest++ = *source; 585 } 586 HASH(*source++); 587 len--; 588 } 589 *flagdest = flags; 590 } 591 return (dest - orgdest); 592 } 593 594 /* 595 * Pred1Decompress() 596 * 597 * Returns decompressed size, or -1 if we ran out of space. 598 */ 599 600 static int 601 Pred1Decompress(node_p node, u_char *source, u_char *dest, int slen, int dlen) 602 { 603 const priv_p priv = NG_NODE_PRIVATE(node); 604 int i; 605 u_char flags, *orgdest; 606 607 orgdest = dest; 608 while (slen) { 609 flags = *source++; 610 slen--; 611 for (i = 0; i < 8; i++, flags >>= 1) { 612 if (dlen <= 0) 613 return(-1); 614 if (flags & 0x01) 615 /* Guess correct */ 616 *dest = priv->GuessTable[priv->Hash]; 617 else { 618 if (!slen) 619 /* We seem to be really done -- cabo. */ 620 break; 621 622 /* Guess wrong. */ 623 priv->GuessTable[priv->Hash] = *source; 624 /* Read from source. */ 625 *dest = *source++; 626 slen--; 627 } 628 HASH(*dest++); 629 dlen--; 630 } 631 } 632 return (dest - orgdest); 633 } 634 635 /* 636 * Pred1SyncTable() 637 */ 638 639 static void 640 Pred1SyncTable(node_p node, u_char *source, int len) 641 { 642 const priv_p priv = NG_NODE_PRIVATE(node); 643 644 while (len--) { 645 priv->GuessTable[priv->Hash] = *source; 646 HASH(*source++); 647 } 648 } 649 650 /* 651 * Crc16() 652 * 653 * Compute the 16 bit frame check value, per RFC 1171 Appendix B, 654 * on an array of bytes. 655 */ 656 657 static uint16_t 658 Crc16(uint16_t crc, u_char *cp, int len) 659 { 660 while (len--) 661 crc = (crc >> 8) ^ Crc16Table[(crc ^ *cp++) & 0xff]; 662 return (crc); 663 } 664 665 static const uint16_t Crc16Table[256] = { 666 /* 00 */ 0x0000, 0x1189, 0x2312, 0x329b, 0x4624, 0x57ad, 0x6536, 0x74bf, 667 /* 08 */ 0x8c48, 0x9dc1, 0xaf5a, 0xbed3, 0xca6c, 0xdbe5, 0xe97e, 0xf8f7, 668 /* 10 */ 0x1081, 0x0108, 0x3393, 0x221a, 0x56a5, 0x472c, 0x75b7, 0x643e, 669 /* 18 */ 0x9cc9, 0x8d40, 0xbfdb, 0xae52, 0xdaed, 0xcb64, 0xf9ff, 0xe876, 670 /* 20 */ 0x2102, 0x308b, 0x0210, 0x1399, 0x6726, 0x76af, 0x4434, 0x55bd, 671 /* 28 */ 0xad4a, 0xbcc3, 0x8e58, 0x9fd1, 0xeb6e, 0xfae7, 0xc87c, 0xd9f5, 672 /* 30 */ 0x3183, 0x200a, 0x1291, 0x0318, 0x77a7, 0x662e, 0x54b5, 0x453c, 673 /* 38 */ 0xbdcb, 0xac42, 0x9ed9, 0x8f50, 0xfbef, 0xea66, 0xd8fd, 0xc974, 674 /* 40 */ 0x4204, 0x538d, 0x6116, 0x709f, 0x0420, 0x15a9, 0x2732, 0x36bb, 675 /* 48 */ 0xce4c, 0xdfc5, 0xed5e, 0xfcd7, 0x8868, 0x99e1, 0xab7a, 0xbaf3, 676 /* 50 */ 0x5285, 0x430c, 0x7197, 0x601e, 0x14a1, 0x0528, 0x37b3, 0x263a, 677 /* 58 */ 0xdecd, 0xcf44, 0xfddf, 0xec56, 0x98e9, 0x8960, 0xbbfb, 0xaa72, 678 /* 60 */ 0x6306, 0x728f, 0x4014, 0x519d, 0x2522, 0x34ab, 0x0630, 0x17b9, 679 /* 68 */ 0xef4e, 0xfec7, 0xcc5c, 0xddd5, 0xa96a, 0xb8e3, 0x8a78, 0x9bf1, 680 /* 70 */ 0x7387, 0x620e, 0x5095, 0x411c, 0x35a3, 0x242a, 0x16b1, 0x0738, 681 /* 78 */ 0xffcf, 0xee46, 0xdcdd, 0xcd54, 0xb9eb, 0xa862, 0x9af9, 0x8b70, 682 /* 80 */ 0x8408, 0x9581, 0xa71a, 0xb693, 0xc22c, 0xd3a5, 0xe13e, 0xf0b7, 683 /* 88 */ 0x0840, 0x19c9, 0x2b52, 0x3adb, 0x4e64, 0x5fed, 0x6d76, 0x7cff, 684 /* 90 */ 0x9489, 0x8500, 0xb79b, 0xa612, 0xd2ad, 0xc324, 0xf1bf, 0xe036, 685 /* 98 */ 0x18c1, 0x0948, 0x3bd3, 0x2a5a, 0x5ee5, 0x4f6c, 0x7df7, 0x6c7e, 686 /* a0 */ 0xa50a, 0xb483, 0x8618, 0x9791, 0xe32e, 0xf2a7, 0xc03c, 0xd1b5, 687 /* a8 */ 0x2942, 0x38cb, 0x0a50, 0x1bd9, 0x6f66, 0x7eef, 0x4c74, 0x5dfd, 688 /* b0 */ 0xb58b, 0xa402, 0x9699, 0x8710, 0xf3af, 0xe226, 0xd0bd, 0xc134, 689 /* b8 */ 0x39c3, 0x284a, 0x1ad1, 0x0b58, 0x7fe7, 0x6e6e, 0x5cf5, 0x4d7c, 690 /* c0 */ 0xc60c, 0xd785, 0xe51e, 0xf497, 0x8028, 0x91a1, 0xa33a, 0xb2b3, 691 /* c8 */ 0x4a44, 0x5bcd, 0x6956, 0x78df, 0x0c60, 0x1de9, 0x2f72, 0x3efb, 692 /* d0 */ 0xd68d, 0xc704, 0xf59f, 0xe416, 0x90a9, 0x8120, 0xb3bb, 0xa232, 693 /* d8 */ 0x5ac5, 0x4b4c, 0x79d7, 0x685e, 0x1ce1, 0x0d68, 0x3ff3, 0x2e7a, 694 /* e0 */ 0xe70e, 0xf687, 0xc41c, 0xd595, 0xa12a, 0xb0a3, 0x8238, 0x93b1, 695 /* e8 */ 0x6b46, 0x7acf, 0x4854, 0x59dd, 0x2d62, 0x3ceb, 0x0e70, 0x1ff9, 696 /* f0 */ 0xf78f, 0xe606, 0xd49d, 0xc514, 0xb1ab, 0xa022, 0x92b9, 0x8330, 697 /* f8 */ 0x7bc7, 0x6a4e, 0x58d5, 0x495c, 0x3de3, 0x2c6a, 0x1ef1, 0x0f78 698 }; 699 700