Category : Recently Uploaded Files
Archive : RSXWDK2S.ZIP
Filename : READ.C
Output of file : READ.C contained in archive : RSXWDK2S.ZIP
/* modified by Rainer Schnitker */
#include
#include
#include
#include
#include
#include
#include
#include "djio.h"
/* Read nbyte characters, use lookahead, if available. This is simple unless */
/* O_NDELAY is in effect. */
static int _crlf(char *buf, size_t size, size_t * new_size)
{
size_t src, dst;
char *p;
p = memchr(buf, '\r', size); /* Avoid copying until CR reached */
if (p == NULL) { /* This is the trivial case */
*new_size = size;
return (0);
}
src = dst = p - buf; /* Start copying here */
while (src < size) {
if (buf[src] == '\r') { /* CR? */
++src; /* Skip the CR */
if (src >= size) { /* Is it the final char? */
*new_size = dst;/* Yes -> don't include in new_size, */
return (1); /* notify caller */
}
if (buf[src] != '\n') /* CR not followed by LF? */
--src; /* Yes -> copy the CR */
}
buf[dst++] = buf[src++];/* Copy a character */
}
*new_size = dst;
return (0);
}
static long do_filelength(int handle)
{
long cur, n;
cur = dos_lseek(handle, 0L, SEEK_CUR);
if (cur == -1L)
return (-1L);
n = dos_lseek(handle, 0L, SEEK_END);
dos_lseek(handle, cur, SEEK_SET);
return (n);
}
static int eof(int handle)
{
long cur, len;
if (handle < 0 || handle >= _nfiles) {
errno = EBADF;
return (-1);
}
if (_files[handle] & F_EOF) /* Ctrl-Z reached */
return (1);
cur = tell(handle);
if (cur < 0)
return (-1);
len = do_filelength(handle);
if (len < 0)
return (-1);
return (cur == len);
}
static int read_lookahead (int handle, void *buf, size_t nbyte)
{
int i, n, saved_errno;
char *dst;
i = 0; dst = buf; saved_errno = errno;
if (nbyte > 0 && _lookahead[handle] != -1)
{
*dst = (char)_lookahead[handle];
_lookahead[handle] = -1;
++i; --nbyte;
}
n = _read (handle, dst+i, nbyte);
if (n == -1)
{
if (errno == EAGAIN && i > 0) /* lookahead and O_NDELAY */
{
errno = saved_errno; /* hide EAGAIN */
return (i); /* and be successful */
}
return (-1);
}
return (i + n);
}
int read (int handle, void *buf, unsigned nbyte)
{
int n;
size_t j, k;
char *dst, c;
if (handle < 0 || handle >= _nfiles)
{
errno = EBADF;
return (-1);
}
if (nbyte > 0 && (_files[handle] & F_EOF))
return (0);
dst = buf;
n = read_lookahead (handle, dst, nbyte);
if (n == -1)
return (-1);
if ((_files[handle] & O_TEXT) && !(_files[handle] & F_TERMIO) && n > 0)
{
/* special processing for text mode */
if (!(_files[handle] & (F_NPIPE|F_DEV)) && dst[n-1] == 0x1a &&
eof (handle))
{
/* remove last Ctrl-Z in text files */
--n;
_files[handle] |= F_EOF;
if (n == 0)
return (0);
}
if (n == 1 && dst[0] == '\r')
{
/* This is the tricky case as we are not allowed to decrement n */
/* by one as 0 indicates end of file. We have to use look ahead. */
int saved_errno = errno;
j = read_lookahead (handle, &c, 1); /* look ahead */
if (j == -1 && errno == EAGAIN)
{
_lookahead[handle] = dst[0];
return (-1);
}
errno = saved_errno; /* hide error */
if (j == 1 && c == '\n') /* CR/LF ? */
dst[0] = '\n'; /* yes -> replace with LF */
else
_lookahead[handle] = c; /* no -> save the 2nd char */
}
else
{
if (_crlf (dst, n, &k)) /* CR/LF conversion */
_lookahead[handle] = '\r'; /* buffer ends with CR */
n = k;
}
}
return (n);
}
#include
#include
#include
#include
READFUNC _console_read = 0;
int __read (int handle, void *buf, size_t nbyte)
{
int count, ret_bytes, dos_bytes;
if (_files[handle] & F_DEV) { /* DEV_CON (also DEV_CLK, DEV_NUL) */
if (_console_read)
return _console_read (handle, buf, nbyte);
else {
errno = EINVAL;
return -1;
}
}
/* dos/windows can't read more than 64K */
count = nbyte;
while (count > 0) {
dos_bytes = (count <= 0xFFF0) ? count : 0xFFF0;
ret_bytes = dos_read (handle, buf, dos_bytes);
count -= ret_bytes;
if (ret_bytes < dos_bytes)
break;
buf += ret_bytes;
}
return (nbyte - count);
}
Very nice! Thank you for this wonderful archive. I wonder why I found it only now. Long live the BBS file archives!
This is so awesome! 😀 I’d be cool if you could download an entire archive of this at once, though.
But one thing that puzzles me is the “mtswslnkmcjklsdlsbdmMICROSOFT” string. There is an article about it here. It is definitely worth a read: http://www.os2museum.com/wp/mtswslnk/