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 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680
|
/*
* ircaux.c: some extra routines... not specific to irc... that I needed
*
* Written By Michael Sandrof
*
* Copyright (c) 1990, 1991 Michael Sandrof.
* Copyright (c) 1991, 1992 Troy Rollo.
* Copyright (c) 1992-2003 Matthew R. Green.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* $Id: ircaux.c,v 1.19 2006-10-31 12:31:27 f Exp $
*/
#include "irc.h"
#if defined(ESIX) || defined(MIPS_SYSV)
# define _TERMIOS_INCLUDED
# define _INCLUDE_TERMIO
# include <sys/termio.h>
#endif
#ifdef HAVE_SYS_UN_H
#include <sys/un.h>
#endif /* HAVE_SYS_UN_H */
#include <pwd.h>
#include "ircaux.h"
#include "output.h"
#include "ircterm.h"
#include "newio.h"
/**************************** PATCHED by Flier ******************************/
int DCCLowPort;
int DCCHighPort;
/****************************************************************************/
#ifdef INET6
extern char MyHostName[];
static int bind_local_addr _((char *, char *, int, int));
#else
extern struct in_addr MyHostAddr;
#endif
extern char *source_host;
#ifdef ALLOC_DEBUG
# ifdef _IBMR2
struct HeapDesc
{
u_long Link;
u_long Size;
};
# endif
#define ALLOC_LIST 2048
static u_char *MemList[ALLOC_LIST];
static long MemSize[ALLOC_LIST];
static int Init = 0;
static void dump_mem _((void));
static void
dump_mem()
{
int i;
FILE *fp;
#ifdef _IBMR2
struct HeapDesc *HeapElement;
char *lowest;
char *highest;
long size;
#endif
int fits;
fp = fopen("debug.log", "w");
fprintf(fp, "ircII failed because of a segmentation violation\nKnown allocations follow:\n\n");
for (i = 0; i < ALLOC_LIST; i++)
if (MemList[i])
{
#ifdef _IBMR2
/*
* The following determines if the size shown for this element of
* memory matches the size we have recorded in the allocation list.
* this is very much machine dependant, and could even vary between
* SysV and BSD on the same machine.
*/
size = (0x08 << (*((long *) MemList[i] - 1)));
if (size - 0x08 >= MemSize[i] && (size >> 1) - 0x08<MemSize[i])
fits = 1;
else
fits = 0;
#else
fits = 1;
#endif
fprintf(fp, " %08lx %08lx %08lx %08lx %s\n",
(long) MemList[i], MemSize[i],
(long) *((long *) MemList[i]-2),
*((long *) MemList[i]-1), fits ? "" : "SUSPICIOUS");
}
#ifdef _IBMR2
/*
* Now we'll walk the heap. We do this by finding the lowest and
* highest elements in our list, and use the HeapDesc structure
* to find our way around.
*/
highest = NULL;
lowest = NULL;
for (i = 0; i < ALLOC_LIST; i++)
{
if (!MemList[i])
continue;
if (!lowest)
lowest = MemList[i];
if ((u_long) MemList[i] < (u_long) lowest)
lowest = MemList[i];
if ((u_long) MemList[i] > (u_long) highest)
highest = MemList[i];
}
fprintf(fp, "\nKnown allocations start at %08x and end at %08x\n",
lowest, highest);
fprintf(fp, "\nHeap walks as follows:\n\n");
for (HeapElement = lowest-0x08; HeapElement<highest;
HeapElement = (HeapElement->Link == 0xefL || !HeapElement->Link)?
(HeapElement+(0x01<<HeapElement->Size)):
((struct HeapDesc *) HeapElement->Link))
{
fprintf(fp, " %08x %08x %08x\n",
HeapElement + 1,
HeapElement->Link,
HeapElement->Size);
}
#endif
fclose(fp);
fprintf(stderr, "Segmentation violation. Debug information saved to debug.log\n");
/*
* If we resume on a segmentation violation, hopefully it repeats the
* violation and we get both our log and the core dump from the point
* at which things fail.
*/
(void) MY_SIGNAL(SIGSEGV, (sigfunc *)SIG_DFL, 0);
return;
}
#endif
/*
* new_free: Why do this? Why not? Saves me a bit of trouble here and
* there
*/
void
new_free(iptr)
void *iptr;
{
void **ptr = (void **) iptr;
#ifdef ALLOC_DEBUG
FILE *fp;
int i;
#endif
/**************************** PATCHED by Flier ******************************/
/*#ifdef DO_USER2
int oldmask;
#endif*/ /* DO_USER2 */
/****************************************************************************/
if (*ptr == empty_string)
*ptr = (void *) 0;
else if (*ptr)
{
/**************************** PATCHED by Flier ******************************/
/*#ifdef DO_USER2
oldmask = sigblock(sigmask(SIGUSR2));
#endif*/ /* DO_USER2 */
/****************************************************************************/
#ifdef FREE_DEBUG
if (free(*ptr) < 0)
put_it("*debug* free failed '%s'", (char *) ptr);
#else
free(*ptr);
#endif
/**************************** PATCHED by Flier ******************************/
/*#ifdef DO_USER2
sigblock(oldmask);
#endif*/ /* DO_USER2 */
/****************************************************************************/
#ifdef ALLOC_DEBUG
for (i = 0; i < ALLOC_LIST; i++)
{
if ((void *) MemList[i] == *ptr)
break;
}
if (i == ALLOC_LIST)
{
fprintf(stderr,
"Memory freed that was never allocated\n");
fp=fopen("debug.log", "w");
fprintf(fp, "failed by freeing %08lx\n", (long) *ptr);
fprintf(fp, "List is as follows:\n");
for (i = 0; i < ALLOC_LIST; i++)
if (MemList[i])
fprintf(fp, " %08lx %08lx\n",
(long) MemList[i], MemSize[i]);
fclose(fp);
abort();
}
MemList[i] = (void *) 0;
MemSize[i] = 0L;
#endif
*ptr = (void *) 0;
}
}
#define WAIT_BUFFER 2048
static char * wait_pointers[WAIT_BUFFER] = {0}, **current_wait_ptr = wait_pointers;
/*
* wait_new_free: same as new_free() except that free() is postponed.
*/
void
wait_new_free(ptr)
char **ptr;
{
if (*current_wait_ptr)
new_free(current_wait_ptr);
*current_wait_ptr++ = *ptr;
if (current_wait_ptr >= wait_pointers + WAIT_BUFFER)
current_wait_ptr = wait_pointers;
*ptr = (char *) 0;
}
/*
* reall_free: really free the data if level == 0
*/
void
really_free(level)
int level;
{
if (level != 0)
return;
for (current_wait_ptr = wait_pointers; current_wait_ptr < wait_pointers + WAIT_BUFFER; current_wait_ptr++)
if (*current_wait_ptr)
new_free(current_wait_ptr);
current_wait_ptr = wait_pointers;
}
char *
new_realloc(ptr, size)
char *ptr;
size_t size;
{
char *new_ptr;
#ifdef ALLOC_DEBUG
int i;
#endif
if ((new_ptr = (char *) realloc(ptr, size)) == (char *) 0)
{
fprintf(stderr, "realloc failed (%d): %s\nIrc Aborted!\n",
(int)size, strerror(errno));
exit(1);
}
#ifdef ALLOC_DEBUG
for (i = 0;i < ALLOC_LIST; i++)
if ((char *) MemList[i] == ptr)
break;
if (i == ALLOC_LIST)
{
fprintf(stderr, "Memory freed that was never allocated");
abort();
}
MemList[i] = new_ptr;
MemSize[i] = size;
#endif
return (new_ptr);
}
char *
new_malloc(size)
size_t size;
{
char *ptr;
#ifdef ALLOC_DEBUG
int i;
if (!Init)
{
Init = 1;
for (i = 0; i < ALLOC_LIST; i++)
{
MemList[i] = (void *) 0;
MemSize[i] = 0L;
}
if (getenv("DEBUG"))
(void) MY_SIGNAL(SIGSEGV, dump_mem, 0);
}
#endif
if ((ptr = (char *) malloc(size)) == (char *) 0)
{
static char error[] = "Malloc failed: \nIrc Aborted!\n";
write(2, error, strlen(error));
write(2, strerror(errno), strlen(strerror(errno)));
term_reset();
exit(1);
}
#ifdef ALLOC_DEBUG
for (i = 0; i < ALLOC_LIST && MemList[i]; i++)
;
if (i == ALLOC_LIST)
{
FILE *fp;
int j;
fprintf(stderr,
"Out of space in memory record. Probable memory leak\n");
fp = fopen("debug.log", "w");
for (i = 0; i < ALLOC_LIST; i++)
{
fprintf(fp, " %08lx %08lx \"",
(long) MemList[i], MemSize[i]);
for (j = 0; j < MemSize[i] && j < 45; j++)
{
if (MemList[i][j] < 32 || MemList[i][j] > 127)
putc('.', fp);
else
putc(MemList[i][j], fp);
}
fprintf(fp, "\"\n");
}
fclose(fp);
abort();
}
MemList[i]=ptr;
MemSize[i]=size;
#endif
return (ptr);
}
#ifdef ALLOC_DEBUG
void
alloc_cmd(command, args, subargs)
char *command,
*args,
*subargs;
{
char *arg;
int f_count = 0,
f_dump = 0;
int i, j;
int count;
long size;
FILE *fp;
while ((arg = next_arg(args, &args)))
{
while (*arg)
{
switch(*arg++)
{
case 'c':
case 'C':
f_count = 1;
break;
case 'd':
case 'D':
f_dump = 1;
break;
}
}
}
if (f_dump)
fp = fopen("debug.log", "w");
else
fp = NULL;
for (size = count = i = 0; i < ALLOC_LIST; i++)
{
if (fp && MemList[i])
{
fprintf(fp, " %08lx %08lx \"",
(long) MemList[i], MemSize[i]);
for (j = 0; j < MemSize[i] && j < 45; j++)
{
if (MemList[i][j] < 32 || MemList[i][j] > 127)
putc('.', fp);
else
putc(MemList[i][j], fp);
}
fprintf(fp, "\"\n");
}
if (MemList[i])
{
count++;
size += MemSize[i];
}
}
if (fp)
fclose(fp);
if (f_count)
{
say("%d blocks allocated out of %d", count, ALLOC_LIST);
say("%ld bytes allocated, an average of %ld per block",
size, size/count);
}
}
#endif
/*
* malloc_strcpy: Mallocs enough space for src to be copied in to where
* ptr points to.
*
* Never call this with ptr pointing to an uninitialised string, as the
* call to new_free() might crash the client... - phone, jan, 1993.
*/
void
malloc_strcpy(ptr, src)
char **ptr;
char *src;
{
/* no point doing anything else */
if (src == *ptr)
return;
new_free(ptr);
if (src)
{
*ptr = new_malloc(strlen(src) + 1);
strcpy(*ptr, src);
}
else
*ptr = (char *) 0;
}
/* malloc_strcat: Yeah, right */
void
malloc_strcat(ptr, src)
char **ptr;
char *src;
{
char *new;
if (*ptr)
{
new = (char *) new_malloc(strlen(*ptr) + strlen(src) + 1);
strcpy(new, *ptr);
strcat(new, src);
new_free(ptr);
*ptr = new;
}
else
malloc_strcpy(ptr, src);
}
void
malloc_strcat_ue(ptr, src)
char **ptr;
char *src;
{
char *new;
if (*ptr)
{
size_t len = strlen(*ptr) + strlen(src) + 1;
new = (char *) new_malloc(len);
strcpy(new, *ptr);
strmcat_ue(new, src, len);
new_free(ptr);
*ptr = new;
}
else
malloc_strcpy(ptr, src);
}
char *
upper(s)
char *s;
{
/**************************** PATCHED by Flier ******************************/
/*char *t = (char *) 0;*/
register char *t = (char *) 0;
/****************************************************************************/
if (s)
for (t = s; *s; s++)
if (islower(*s))
*s = toupper(*s);
return (t);
}
char *
lower(s)
char * s;
{
char * t = (char *) 0;
if (s)
for (t = s; *s; s++)
if (isupper(*s))
*s = tolower(*s);
return t;
}
/**************************** PATCHED by Flier ******************************/
/* try to find unused port in port range given in /set dcc_ports */
int BindPort(s,slisten,localaddr)
int s;
int slisten;
struct sockaddr_in *localaddr;
{
int sal=sizeof(struct sockaddr_in);
int locport;
for (locport=DCCLowPort;locport<=DCCHighPort;locport++) {
localaddr->sin_port=htons(locport);
if (bind(s,(struct sockaddr *) localaddr,sal)==0) {
if (slisten && (listen(s,1)==0)) break;
else if (!slisten) break;
}
}
if (!(locport>=DCCLowPort && locport<=DCCHighPort)) {
new_close(s);
say("Could not allocate DCC port in range %d - %d",
DCCLowPort,DCCHighPort);
return(-4);
}
return(s);
}
/****************************************************************************/
/*
* Connect_By_Number Performs a connecting to socket 'service' on host
* 'host'. Host can be a hostname or ip-address. If 'host' is null, the
* local host is assumed. The parameter full_hostname will, on return,
* contain the expanded hostname (if possible). Note that full_hostname is a
* pointer to a char *, and is allocated by connect_by_numbers()
*
* The following special values for service exist:
*
* 0 Create a socket for accepting connections
*
* -1 Create a UDP socket
*
* -2 Connect to the address passed in place of the hostname parameter
*
* Errors:
*
* -1 get service failed
*
* -2 get host failed
*
* -3 socket call failed
*
* -4 connect call failed
*/
int
/**************************** PATCHED by Flier ******************************/
/*connect_by_number(service, host, nonblocking)*/
connect_by_number(service,host,nonblocking,dccget)
/****************************************************************************/
int service;
char *host;
int nonblocking;
/**************************** PATCHED by Flier ******************************/
int dccget;
/****************************************************************************/
{
int s = -1;
char buf[100];
int err = -1;
#ifndef INET6
struct sockaddr_in server;
struct hostent *hp;
#else
char strhost[1025], strservice[32];
struct sockaddr_storage server;
struct addrinfo hints, *res, *res0;
strncpy(strhost, host, sizeof(strhost) - 1);
strhost[sizeof(strhost) - 1] = 0;
snprintf(strservice, sizeof strservice, "%d", service);
strservice[sizeof(strservice) - 1] = 0;
#endif
if (service == -2)
{
#ifdef INET6
#ifndef SA_LEN
# ifdef HAVE_SOCKADDR_SA_LEN
# define SA_LEN(x) (x)->sa_len
# else
# ifdef SIN6_LEN
# define SA_LEN(x) SIN6_LEN(x)
# else
# ifdef SIN_LEN
# define SA_LEN(x) SIN_LEN(x)
# else
# define SA_LEN(x) sizeof(*x)
# endif
# endif
# endif
#endif
server = (*(struct sockaddr_storage *) host);
getnameinfo((struct sockaddr *)&server, SA_LEN((struct sockaddr *)&server),
strhost, sizeof(strhost), strservice, sizeof(strservice),
NI_NUMERICHOST|NI_NUMERICSERV);
#else
server = (*(struct sockaddr_in *) host);
#endif
}
else if (service > 0)
{
if (host == (char *) 0)
{
gethostname(buf, sizeof(buf));
host = buf;
}
#ifndef INET6
if ((server.sin_addr.s_addr = inet_addr(host)) == -1)
{
if ((hp = gethostbyname(host)) != NULL)
{
bzero((char *) &server, sizeof(server));
bcopy(hp->h_addr, (char *) &server.sin_addr,
(size_t)hp->h_length);
server.sin_family = hp->h_addrtype;
}
else
return (-2);
}
else
server.sin_family = AF_INET;
server.sin_port = (unsigned short) htons(service);
#endif
}
#ifdef INET6
memset(&hints, 0, sizeof(hints));
if (service == -1)
hints.ai_socktype = SOCK_DGRAM;
else
hints.ai_socktype = SOCK_STREAM;
/* If strhost is empty then probably DCC connection was requested.
* In this case we must use AF_INET */
errno = 0;
if (strlen(strhost) == 0)
{
hints.ai_family = AF_INET;
err = getaddrinfo(NULL, strservice, &hints, &res0);
}
else
{
hints.ai_family = AF_UNSPEC;
err = getaddrinfo(strhost, strservice, &hints, &res0);
}
if (err != 0)
{
#if 0
/* zero errno to get "unknown host" error message */
errno = 0;
#endif
return (-2);
}
err = -1;
for (res = res0; res; res = res->ai_next) {
if ((s = socket(res->ai_family, res->ai_socktype, res->ai_protocol)) < 0)
continue;
if (service != -1)
set_socket_options(s);
#else
if (((service == -1) && ((s = socket(AF_INET, SOCK_DGRAM, 0)) < 0)) ||
((service != -1) && ((s = socket(AF_INET, SOCK_STREAM, 0)) < 0)))
return (-3);
if (service != -1)
set_socket_options(s);
#endif
if (service <= 0 && service != -2)
{
#ifdef INET6
if (bind_local_addr(NULL, "0", s, res->ai_family) < 0)
return -2;
freeaddrinfo(res0);
if (listen(s, 1) == -1)
{
new_close(s);
return -4;
}
#else
/**************************** PATCHED by Flier ******************************/
int newsock;
/****************************************************************************/
struct sockaddr_in localaddr;
bzero(&localaddr, sizeof(struct sockaddr_in));
localaddr.sin_family = AF_INET;
if (!service)
localaddr.sin_addr.s_addr = INADDR_ANY;
else
localaddr.sin_addr = MyHostAddr;
localaddr.sin_port = 0;
/**************************** PATCHED by Flier ******************************/
/*if (bind(s, (struct sockaddr *) &localaddr,
sizeof(localaddr)) == -1 ||
(!service && listen(s, 1) == -1))
{
new_close(s);
return -4;
}*/
if (DCCLowPort>1023 && DCCHighPort<65500 && !service) {
if ((newsock=BindPort(s,1,&localaddr))<0) return(newsock);
}
else {
if (bind(s,(struct sockaddr *) &localaddr,sizeof(localaddr))==-1 ||
(!service && listen(s,1)==-1)) {
new_close(s);
return(-4);
}
}
/****************************************************************************/
service = sizeof(localaddr);
getsockname(s, (struct sockaddr *) &localaddr, &service);
#endif
return (s);
}
/**************************** PATCHED by Flier ******************************/
#ifndef INET6
if (DCCLowPort>1023 && DCCHighPort<65500 && dccget) {
int newsock;
struct sockaddr_in localaddr;
bzero(&localaddr,sizeof(struct sockaddr_in));
localaddr.sin_family=AF_INET;
localaddr.sin_addr = MyHostAddr;
if ((newsock=BindPort(s,0,&localaddr))<0) return(newsock);
}
#endif
/****************************************************************************/
if (source_host)
{
#ifdef INET6
int retcode;
if ((retcode = bind_local_addr(MyHostName, "0", s, res->ai_family)) < 0)
{
/* this fail must be ignored because maybe
* res->ai_family != MyHostName's family (ie. hapens in DCC req) */
if (retcode != -10)
{
freeaddrinfo(res0);
return -3;
}
}
#else
struct sockaddr_in localaddr;
bzero(&localaddr, sizeof localaddr);
localaddr.sin_family = AF_INET;
localaddr.sin_addr = MyHostAddr;
if (bind(s, (struct sockaddr *)&localaddr, sizeof localaddr) == -1)
return -3;
#endif
}
#ifdef NON_BLOCKING_CONNECTS
if (nonblocking && set_non_blocking(s) < 0)
{
#ifdef INET6
freeaddrinfo(res0);
#endif
#ifdef ESIX
t_close(s);
unmark_socket(s);
#endif /* ESIX */
new_close(s);
return -4;
}
#endif /* NON_BLOCKING_CONNECTS */
#ifdef INET6
err = connect(s, res->ai_addr, res->ai_addrlen);
#else
err = connect(s, (struct sockaddr *) &server, sizeof(server));
#endif
if (err < 0)
{
if (!(errno == EINPROGRESS && nonblocking))
{
#ifdef INET6
continue;
#endif
#ifdef ESIX
t_close(s);
unmark_socket(s);
#endif /* ESIX */
new_close(s);
return -4;
}
#ifdef INET6
err = 0;
break;
#endif
}
#ifdef INET6
} /* for () */
if (err < 0) {
#ifdef ESIX
t_close(s);
unmark_socket(s);
#endif /* ESIX */
new_close(s);
return -4;
}
#endif
return s;
}
#ifdef INET6
/*
* Binds to specified socket, host, port using specified family.
* Returns:
* 0 if everythins is OK
* -2 if host wasn't found
* -10 if family type wasn't supported for specified host
*/
static int
bind_local_addr(localhost, localport, fd, family)
char *localhost;
char *localport;
int fd;
int family;
{
struct addrinfo hintsx, *resx, *res0x;
int err = -1;
memset(&hintsx, 0, sizeof(hintsx));
hintsx.ai_family = family;
hintsx.ai_socktype = SOCK_STREAM;
hintsx.ai_flags = AI_PASSIVE;
err = getaddrinfo(localhost, localport, &hintsx, &res0x);
if (err != 0)
{
/* Dirty little hack here, brought to us by ircII-20030709 damm@yazzy.org */
#ifndef EAI_ADDRFAMILY
# ifdef EAI_FAMILY
# define EAI_ADDRFAMILY EAI_FAMILY
# else
# error "no EAI_ADDRFAMILY or EAI_FAMILY"
# endif
#endif
if (err == EAI_ADDRFAMILY)
return -10;
else
return -2;
}
err = -1;
for (resx = res0x; resx; resx = resx->ai_next)
{
if (bind(fd, resx->ai_addr, resx->ai_addrlen) == 0)
{
err = 0;
break;
}
}
freeaddrinfo(res0x);
if (err < 0)
return -2;
return 0;
}
#endif
char *
next_arg(str, new_ptr)
char *str,
**new_ptr;
{
char *ptr;
if ((ptr = sindex(str, "^ ")) != NULL)
{
if ((str = index(ptr, ' ')) != NULL)
*str++ = (char) 0;
else
str = empty_string;
}
else
str = empty_string;
if (new_ptr)
*new_ptr = str;
return ptr;
}
char *
new_next_arg(str, new_ptr)
char *str,
**new_ptr;
{
char *ptr,
*start;
if ((ptr = sindex(str, "^ \t")) != NULL)
{
if (*ptr == '"')
{
start = ++ptr;
while ((str = sindex(ptr, "\"\\")) != NULL)
{
switch (*str)
{
case '"':
*str++ = '\0';
if (*str == ' ')
str++;
if (new_ptr)
*new_ptr = str;
return (start);
case '\\':
if (*(str + 1) == '"')
strcpy(str, str + 1);
ptr = str + 1;
}
}
str = empty_string;
}
else
{
if ((str = sindex(ptr, " \t")) != NULL)
*str++ = '\0';
else
str = empty_string;
}
}
else
str = empty_string;
if (new_ptr)
*new_ptr = str;
return ptr;
}
/* my_stricmp: case insensitive version of strcmp */
int
my_stricmp(str1, str2)
/**************************** PATCHED by Flier ******************************/
/*char *str1,
*str2;*/
register char *str1,
*str2;
/****************************************************************************/
{
int xor;
if (!str1)
return -1;
if (!str2)
return 1;
for (; *str1 || *str2 ; str1++, str2++)
{
if (!*str1 || !*str2)
return (*str1 - *str2);
if (isalpha(*str1) && isalpha(*str2))
{
xor = *str1 ^ *str2;
if (xor != 32 && xor != 0)
return (*str1 - *str2);
}
else
{
if (*str1 != *str2)
return (*str1 - *str2);
}
}
return 0;
}
/* my_strnicmp: case insensitive version of strncmp */
int
my_strnicmp(str1, str2, n)
/**************************** PATCHED by Flier ******************************/
/*char *str1,
*str2;*/
register char *str1,
*str2;
/****************************************************************************/
size_t n;
{
size_t i;
int xor;
for (i = 0; i < n; i++, str1++, str2++)
{
if (isalpha(*str1) && isalpha(*str2))
{
xor = *str1 ^ *str2;
if (xor != 32 && xor != 0)
return (*str1 - *str2);
}
else
{
if (*str1 != *str2)
return (*str1 - *str2);
}
}
return 0;
}
/*
* strmcpy: Well, it's like this, strncpy doesn't append a trailing null if
* strlen(str) == maxlen. strmcpy always makes sure there is a trailing null
*/
void
strmcpy(dest, src, maxlen)
char *dest,
*src;
size_t maxlen;
{
strncpy(dest, src, maxlen);
dest[maxlen - 1] = '\0';
}
/*
* strmcat: like strcat, but truncs the dest string to maxlen (thus the dest
* should be able to handle maxlen+1 (for the null))
*/
void
strmcat(dest, src, maxlen)
char *dest,
*src;
size_t maxlen;
{
size_t srclen,
len;
srclen = strlen(src);
if ((len = strlen(dest) + srclen) > maxlen)
strncat(dest, src, srclen - (len - maxlen));
else
strcat(dest, src);
}
/*
* strmcat_ue: like strcat, but truncs the dest string to maxlen (thus the dest
* should be able to handle maxlen + 1 (for the null)). Also unescapes
* backslashes.
*/
void
strmcat_ue(dest, src, maxlen)
char *dest,
*src;
size_t maxlen;
{
size_t dstlen;
dstlen = strlen(dest);
dest += dstlen;
maxlen -= dstlen;
while (*src && maxlen > 0)
{
if (*src == '\\')
{
if (index("npr0", src[1]))
*dest++ = '\020';
else if (*(src + 1))
*dest++ = *++src;
else
*dest++ = '\\';
}
else
*dest++ = *src;
src++;
}
*dest = '\0';
}
/*
* scanstr: looks for an occurrence of str in source. If not found, returns
* 0. If it is found, returns the position in source (1 being the first
* position). Not the best way to handle this, but what the hell
*/
extern int
scanstr(source, str)
char *str,
*source;
{
int i,
max;
size_t len;
len = strlen(str);
max = strlen(source) - len;
for (i = 0; i <= max; i++, source++)
{
if (!my_strnicmp(source, str, len))
return (i + 1);
}
return (0);
}
/* expand_twiddle: expands ~ in pathnames. */
char *
expand_twiddle(str)
char *str;
{
char lbuf[BIG_BUFFER_SIZE + 1];
if (*str == '~')
{
str++;
if (*str == '/' || *str == '\0')
{
strmcpy(lbuf, my_path, BIG_BUFFER_SIZE);
strmcat(lbuf, str, BIG_BUFFER_SIZE);
}
else
{
char *rest;
struct passwd *entry;
if ((rest = index(str, '/')) != NULL)
*rest++ = '\0';
if ((entry = getpwnam(str)) != NULL)
{
strmcpy(lbuf, entry->pw_dir, BIG_BUFFER_SIZE);
if (rest)
{
strmcat(lbuf, "/", BIG_BUFFER_SIZE);
strmcat(lbuf, rest, BIG_BUFFER_SIZE);
}
}
else
return (char *) NULL;
}
}
else
strmcpy(lbuf, str, BIG_BUFFER_SIZE);
str = '\0';
malloc_strcpy(&str, lbuf);
return (str);
}
/* blundernet increased the size ... */
#if 0
/* islegal: true if c is a legal nickname char anywhere but first char */
#define islegal(c) ((((c) >= 'A') && ((c) <= '}')) || \
(((c) >= '0') && ((c) <= '9')) || \
((c) == '-') || ((c) == '_'))
/*
* check_nickname: checks is a nickname is legal. If the first character is
* bad new, null is returned. If the first character is bad, the string is
* truncd down to only legal characters and returned
*
* rewritten, with help from do_nick_name() from the server code (2.8.5),
* phone, april 1993.
*/
char *
check_nickname(nick)
char *nick;
{
char *s;
if (!nick || *nick == '-' || isdigit(*nick))
return NULL;
for (s = nick; *s && (s - nick) < NICKNAME_LEN; s++)
if (!islegal(*s) || isspace(*s))
break;
*s = '\0';
return *nick ? nick : NULL;
}
#endif
/**************************** PATCHED by Flier ******************************/
/* islegal: true if c is a legal nickname char anywhere but first char */
#define islegal(c) ((((c) >= 'A') && ((c) <= '}')) || \
(((c) >= '0') && ((c) <= '9')) || \
((c) == '-') || ((c) == '_'))
/*
* We need this function otherwise bad things happen if you /nick erroneous_nick
*/
char *check_nickname(nick)
char *nick;
{
char *s;
if (!nick || *nick=='-' || *nick<'A' || *nick>'}' || isdigit(*nick))
return(NULL);
for (s=nick;*s;s++)
if (!islegal(*s) || isspace(*s)) break;
*s='\0';
return(*nick?nick:NULL);
}
/****************************************************************************/
/*
* sindex: much like index(), but it looks for a match of any character in
* the group, and returns that position. If the first character is a ^, then
* this will match the first occurence not in that group.
*/
char *
sindex(string, group)
/**************************** PATCHED by Flier ******************************/
/*char *string,
*group;*/
register char *string,
*group;
/****************************************************************************/
{
char *ptr;
if (!string || !group)
return (char *) NULL;
if (*group == '^')
{
group++;
for (; *string; string++)
{
for (ptr = group; *ptr; ptr++)
{
if (*ptr == *string)
break;
}
if (*ptr == '\0')
return string;
}
}
else
{
for (; *string; string++)
{
for (ptr = group; *ptr; ptr++)
{
if (*ptr == *string)
return string;
}
}
}
return (char *) NULL;
}
/*
* srindex: much like rindex(), but it looks for a match of any character in
* the group, and returns that position. If the first character is a ^, then
* this will match the first occurence not in that group.
*/
char *
srindex(string, group)
/**************************** PATCHED by Flier ******************************/
/*char *string,
*group;*/
register char *string,
*group;
/****************************************************************************/
{
char *ptr, *str;
if (!string || !group)
return (char *) NULL;
str = string + strlen(string);
if (*group == '^')
{
group++;
for (; str != (string-1); str--)
{
for (ptr = group; *ptr; ptr++)
{
if (*ptr == *str)
break;
}
if (*ptr == '\0')
return str;
}
}
else
{
for (; str != (string-1); str--)
{
for (ptr = group; *ptr; ptr++)
{
if (*ptr == *str)
return str;
}
}
}
return (char *) NULL;
}
/* is_number: returns true if the given string is a number, false otherwise */
int
is_number(str)
/**************************** PATCHED by Flier ******************************/
/*char *str;*/
register char *str;
/****************************************************************************/
{
while (*str == ' ')
str++;
if (*str == '-')
str++;
if (*str)
{
for (; *str; str++)
{
if (!isdigit((*str)))
return (0);
}
return 1;
}
else
return 0;
}
/* rfgets: exactly like fgets, cept it works backwards through a file! */
char *
rfgets(lbuf, size, file)
char *lbuf;
int size;
FILE *file;
{
char *ptr;
off_t pos;
if (fseek(file, -2L, 1))
return NULL;
do
{
switch (fgetc(file))
{
case EOF:
return NULL;
case '\n':
pos = ftell(file);
ptr = fgets(lbuf, size, file);
fseek(file, (long)pos, 0);
return ptr;
}
}
while (fseek(file, -2L, 1) == 0);
rewind(file);
pos = 0L;
ptr = fgets(lbuf, size, file);
fseek(file, (long)pos, 0);
return ptr;
}
/*
* path_search: given a file called name, this will search each element of
* the given path to locate the file. If found in an element of path, the
* full path name of the file is returned in a static string. If not, null
* is returned. Path is a colon separated list of directories
*/
char *
path_search(name, path)
char *name;
char *path;
{
static char lbuf[BIG_BUFFER_SIZE + 1] = "";
char *ptr,
*free_path = (char *) 0;
malloc_strcpy(&free_path, path);
path = free_path;
while (path)
{
if ((ptr = index(path, ':')) != NULL)
*(ptr++) = '\0';
/**************************** PATCHED by Flier ******************************/
/*strcpy(lbuf, empty_string);*/
*lbuf='\0';
/****************************************************************************/
if (path[0] == '~')
{
strmcat(lbuf, my_path, BIG_BUFFER_SIZE);
path++;
}
strmcat(lbuf, path, BIG_BUFFER_SIZE);
strmcat(lbuf, "/", BIG_BUFFER_SIZE);
strmcat(lbuf, name, BIG_BUFFER_SIZE);
if (access(lbuf, F_OK) == 0)
break;
path = ptr;
}
new_free(&free_path);
return (path) ? lbuf : (char *) 0;
}
/*
* double_quote: Given a str of text, this will quote any character in the
* set stuff with the QUOTE_CHAR. It returns a malloced quoted, null
* terminated string
*/
char *
double_quote(str, stuff)
char *str;
char *stuff;
{
char lbuf[BIG_BUFFER_SIZE + 1];
char *ptr = NULL;
char c;
int pos;
if (str && stuff)
{
for (pos = 0; (c = *str); str++)
{
if (index(stuff, c))
{
if (c == '$')
lbuf[pos++] = '$';
else
lbuf[pos++] = '\\';
}
lbuf[pos++] = c;
}
lbuf[pos] = '\0';
malloc_strcpy(&ptr, lbuf);
}
else
malloc_strcpy(&ptr, str);
return ptr;
}
/*
* new_stty: given a string of stty commands sets the tty
* via ioctls TCGETA/TCSETA.
*
* WARNING: if someone of the architectures specified in
* #if statement don't work ... please comment out
* the relative statement and send a report to
*
* mez002@cdc835.cdc.polimi.it or
* rfac@ghost.unimi.it
*
* or talk with me on IRC ... (i think is better)
*
* - Allanon -
*
*/
void
new_stty(option)
char *option;
{
#if defined(ESIX) || defined(MIPS_SYSV)
struct termio ttyset;
ioctl(0, TCGETA, &ttyset);
if (strstr(option, "opost"))
ttyset.c_oflag |= OPOST;
if (strstr(option, "sane"))
{
ttyset.c_iflag &= ~(IGNBRK | PARMRK | INPCK | INLCR | IGNCR |
IUCLC | IXOFF);
ttyset.c_lflag &= ~(XCASE | ECHOE | ECHONL | NOFLSH);
ttyset.c_oflag &= ~(OLCUC | OCRNL | ONOCR | ONLRET | OFILL |
OFDEL | NLDLY | CRDLY | TABDLY | BSDLY | VTDLY | FFDLY);
ttyset.c_iflag |= (BRKINT | IGNPAR | ISTRIP | ICRNL | IXON);
ttyset.c_lflag |= (ISIG | ICANON | ECHO | ECHOK);
ttyset.c_oflag |= (OPOST | ONLCR);
ttyset.c_cc[VERASE] = CERASE;
ttyset.c_cc[VKILL] = CKILL;
ttyset.c_cc[VQUIT] = CQUIT;
ttyset.c_cc[VINTR] = CINTR;
ttyset.c_cc[VEOF] = CEOF;
ttyset.c_cc[VEOL] = CNUL;
ttyset.c_cc[VSWTCH] = CNUL;
}
if (strstr(option, "cooked")) /* cooked == -raw */
{
ttyset.c_cflag &= ~CSIZE;
ttyset.c_cflag |= PARENB;
ttyset.c_iflag |= (BRKINT | IGNPAR | ISTRIP | IXON);
ttyset.c_oflag |= OPOST;
ttyset.c_lflag |= (ICANON | ISIG);
ttyset.c_cc[VEOF] = CEOF;
ttyset.c_cc[VEOL] = CNUL;
}
if (strstr(option, "raw"))
{
ttyset.c_cflag &= ~(CSIZE | PARENB);
ttyset.c_iflag &= ~(-1);
ttyset.c_lflag &= ~(ISIG | ICANON | XCASE);
ttyset.c_oflag &= ~OPOST;
ttyset.c_cflag |= CS8;
ttyset.c_cc[VMIN] = 1;
ttyset.c_cc[VTIME] = 1;
}
if (strstr(option, "-echo"))
ttyset.c_lflag &= ~ECHO;
ioctl(0, TCSETAW, &ttyset);
#endif
}
#ifdef ZCAT
/* Here another interesting stuff:
* it handle zcat of compressed files
* You can manage compressed files in this way:
*
* IN: char *name, the compressed file FILENAME
* OUT: a FILE *, from which read the expanded file
*
*/
FILE *
zcat(name)
char *name;
{
FILE *fp;
int in[2];
in[0] = -1;
in[1] = -1;
if (pipe(in))
{
say("Unable to start decompression process: %s", strerror(errno));
if(in[0] != -1)
{
new_close(in[0]);
new_close(in[1]);
}
return(NULL);
}
switch(fork())
{
case -1:
say("Unable to start decompression process: %s", strerror(errno));
return(NULL);
case 0:
(void) MY_SIGNAL(SIGINT, (sigfunc *) SIG_IGN, 0);
dup2(in[1], 1);
new_close(in[0]);
setuid(getuid());
setgid(getgid());
#ifdef ZARGS
execlp(ZCAT, ZCAT, ZARGS, name, NULL);
#else
execlp(ZCAT, ZCAT, name, NULL);
#endif
exit(0);
default:
new_close(in[1]);
if ((fp = fdopen(in[0], "r")) == (FILE *) 0)
{
say("Cannot open pipe file descriptor: %s", strerror(errno));
return(NULL);
}
break;
}
return(fp);
}
#endif /*ZCAT*/
#ifdef NEED_INDEX
extern char *
index(s, c)
char *s;
char c;
{
# ifdef HAVE_STRSTR
return strstr(s, c);
# else
int len = strlen(s);
for (; len > 0 && c != *s; s++, len--)
;
return (len) ? s : (char *) NULL;
# endif /* HAVE_STRSTD */
}
#endif /* NEED_INDEX */
#ifdef NEED_RINDEX
extern char *
rindex(s, c)
char *s;
char c;
{
# ifdef HAVE_STRRSTR
return strrstr(s, c);
# else
int len = strlen(s);
char *t = s;
s += len;
for (; s >= t && c != *s; s--)
;
return (s < t) ? (char *) NULL : s;
# endif /* HAVE_STRRSTR */
}
#endif /* NEED_RINDEX */
#ifdef NON_BLOCKING_CONNECTS
int
set_non_blocking(fd)
int fd;
{
int res, nonb = 0;
#if defined(NBLOCK_POSIX)
nonb |= O_NONBLOCK;
#else
# if defined(NBLOCK_BSD)
nonb |= O_NDELAY;
# else
# if defined(NBLOCK_SYSV)
res = 1;
if (ioctl (fd, FIONBIO, &res) < 0)
return -1;
# else
no idea how to set an fd to non-blocking
# endif
# endif
#endif
#if (defined(NBLOCK_POSIX) || defined(NBLOCK_BSD)) && !defined(NBLOCK_SYSV)
if ((res = fcntl(fd, F_GETFL, 0)) == -1)
return -1;
else if (fcntl(fd, F_SETFL, res | nonb) == -1)
return -1;
#endif
return 0;
}
int
set_blocking(fd)
int fd;
{
int res, nonb = 0;
#if defined(NBLOCK_POSIX)
nonb |= O_NONBLOCK;
#else
# if defined(NBLOCK_BSD)
nonb |= O_NDELAY;
# else
# if defined(NBLOCK_SYSV)
res = 0;
if (ioctl (fd, FIONBIO, &res) < 0)
return -1;
# else
no idea how to return an fd blocking
# endif
# endif
#endif
#if (defined(NBLOCK_POSIX) || defined(NBLOCK_BSD)) && !defined(NBLOCK_SYSV)
if ((res = fcntl(fd, F_GETFL, 0)) == -1)
return -1;
else if (fcntl(fd, F_SETFL, res &~ nonb) == -1)
return -1;
#endif
return 0;
}
#endif
|