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
|
/*
* Various utilities
* Copyright
* (C) 1992 Joseph H. Allen
* (C) 2001 Marek 'Marx' Grac
*
* This file is part of JOE (Joe's Own Editor)
*/
#include "config.h"
__RCSID("$MirOS: contrib/code/jupp/utils.c,v 1.11 2018/11/11 18:15:39 tg Exp $");
#include <errno.h>
#include <stdlib.h>
#include <unistd.h>
#include "charmap.h"
#include "blocks.h"
#include "utils.h"
/*
* return minimum/maximum of two numbers
*/
unsigned int uns_min(unsigned int a, unsigned int b)
{
return a < b ? a : b;
}
signed int int_min(signed int a, signed int b)
{
return a < b ? a : b;
}
signed long int long_max(signed long int a, signed long int b)
{
return a > b ? a : b;
}
signed long int long_min(signed long int a, signed long int b)
{
return a < b ? a : b;
}
/* Versions of 'read' and 'write' which automatically retry when interrupted */
ssize_t
joe_read(int fd, void *buf, size_t size)
{
ssize_t rt;
do {
rt = read(fd, buf, size);
} while (rt < 0 && errno == EINTR);
return rt;
}
ssize_t
joe_write(int fd, const void *buf, size_t size)
{
ssize_t rt;
do {
rt = write(fd, buf, size);
} while (rt < 0 && errno == EINTR);
return rt;
}
/* Similarily, read and write an exact amount (up to EOF) */
ssize_t
joe_readex(int fd, void *buf_, size_t size)
{
unsigned char *buf = buf_;
ssize_t rv = 0, z;
while (size) {
if ((z = read(fd, buf, size)) < 0) {
if (errno == EINTR)
continue;
return (rv ? /* fucked up since we got some */ -2 : -1);
}
if (z == 0)
break;
rv += z;
buf += z;
size -= z;
}
return (rv);
}
#if 0 /* unused */
ssize_t
joe_writex(int fd, const void *buf_, size_t size)
{
const unsigned char *buf = buf_;
ssize_t rv = 0, z;
while (size) {
if ((z = write(fd, buf, size)) < 0) {
if (errno == EINTR)
continue;
return (rv ? /* fucked up since we got some */ -2 : -1);
}
rv += z;
buf += z;
size -= z;
}
return (rv);
}
#endif
#ifndef SIG_ERR
#define SIG_ERR ((sighandler_t) -1)
#endif
/* wrapper to hide signal interface differrencies */
int joe_set_signal(int signum, sighandler_t handler)
{
int retval;
#ifdef HAVE_SIGACTION
struct sigaction sact;
mset(&sact, 0, sizeof(sact));
sact.sa_handler = handler;
#ifdef SA_INTERRUPT
sact.sa_flags = SA_INTERRUPT;
#endif
retval = sigaction(signum, &sact, NULL);
#elif defined(HAVE_SIGVEC)
struct sigvec svec;
mset(&svec, 0, sizeof(svec));
svec.sv_handler = handler;
#ifdef HAVE_SV_INTERRUPT
svec.sv_flags = SV_INTERRUPT;
#endif
retval = sigvec(signum, &svec, NULL);
#else
retval = (signal(signum, handler) != SIG_ERR) ? 0 : -1;
#ifdef HAVE_SIGINTERRUPT
siginterrupt(signum, 1);
#endif
#endif
return(retval);
}
/* Helpful little parsing utilities */
/* Skip whitespace and return first non-whitespace character */
int
parse_ws(unsigned char **pp, int cmt)
{
unsigned char *p = *pp;
while (*p==' ' || *p=='\t')
++p;
if (*p=='\r' || *p=='\n' || *p==cmt)
*p = 0;
*pp = p;
return *p;
}
/* Parse an identifier into a buffer. Identifier is truncated to a maximum of len chars. */
int
parse_ident(unsigned char **pp, unsigned char *buf, int len)
{
unsigned char *p = *pp;
if (joe_isalphx(locale_map,*p)) {
while(len && joe_isalnux(locale_map,*p))
*buf++= *p++, --len;
*buf=0;
while(joe_isalnux(locale_map,*p))
++p;
*pp = p;
return 0;
} else
return -1;
}
/* Parse to next whitespace */
int
parse_tows(unsigned char **pp, unsigned char *buf)
{
unsigned char *p = *pp;
while (*p && *p!=' ' && *p!='\t' && *p!='\n' && *p!='\r' && *p!='#')
*buf++ = *p++;
*pp = p;
*buf = 0;
return 0;
}
/* Parse a keyword */
int
parse_kw(unsigned char **pp, const unsigned char *kw)
{
unsigned char *p = *pp;
while(*kw && *kw==*p)
++kw, ++p;
if(!*kw && !joe_isalnux(locale_map,*p)) {
*pp = p;
return 0;
} else
return -1;
}
/* Parse a field */
int
parse_field(unsigned char **pp, const unsigned char *kw)
{
unsigned char *p = *pp;
while(*kw && *kw==*p)
++kw, ++p;
if(!*kw && (!*p || *p==' ' || *p=='\t' || *p=='#' || *p=='\n' || *p=='\r')) {
*pp = p;
return 0;
} else
return -1;
}
/* Parse a character */
int
parse_char(unsigned char **pp, unsigned char c)
{
unsigned char *p = *pp;
if (*p == c) {
*pp = p+1;
return 0;
} else
return -1;
}
/*
* Parse a string into a buffer. Returns 0 for success.
* Leaves escape sequences in string.
*/
int
parse_string(unsigned char **pp, unsigned char *buf, int len)
{
unsigned char *p = *pp;
if(*p=='\"') {
++p;
while(len && *p && *p!='\"')
if(*p=='\\' && p[1] && len>2) {
*buf++ = *p++;
*buf++ = *p++;
len-=2;
} else {
*buf++ = *p++;
--len;
}
*buf = 0;
while(*p && *p!='\"')
if(*p=='\\' && p[1])
p+=2;
else
p++;
if(*p=='\"') {
*pp= p+1;
return 0;
}
}
return -1;
}
/* Parse a character range: a-z */
int
parse_range(unsigned char **pp, int *first, int *second)
{
unsigned char *p = *pp;
int a, b;
if(!*p)
return -1;
if(*p=='\\' && p[1]) {
++p;
if(*p=='n')
a = '\n';
else if(*p=='t')
a = '\t';
else
a = *p;
++p;
} else
a = *p++;
if(*p=='-' && p[1]) {
++p;
if(*p=='\\' && p[1]) {
++p;
if(*p=='n')
b = '\n';
else if(*p=='t')
b = '\t';
else
b = *p;
++p;
} else
b = *p++;
} else
b = a;
*first = a;
*second = b;
*pp = p;
return 0;
}
|