Annotation of parser3/src/main/pa_common.C, revision 1.93
1.15 paf 1: /** @file
1.16 paf 2: Parser: commonly functions.
3:
1.8 paf 4: Copyright(c) 2001 ArtLebedev Group(http://www.artlebedev.com)
1.85 paf 5: Author: Alexander Petrosyan <paf@design.ru>(http://paf.design.ru)
1.16 paf 6:
1.93 ! paf 7: $Id: pa_common.C,v 1.91.4.1.2.2 2001/12/07 07:36:51 paf Exp $
1.1 paf 8: */
9:
10: #include "pa_common.h"
1.2 paf 11: #include "pa_types.h"
1.4 paf 12: #include "pa_exception.h"
1.14 paf 13: #include "pa_pool.h"
14: #include "pa_globals.h"
15: #include "pa_value.h"
16: #include "pa_hash.h"
17: #include "pa_string.h"
1.1 paf 18:
1.93 ! paf 19: // some maybe-undefined constants
! 20:
1.82 paf 21: #ifndef _O_TEXT
22: # define _O_TEXT 0
23: #endif
24: #ifndef _O_BINARY
25: # define _O_BINARY 0
1.47 paf 26: #endif
1.80 paf 27: #ifndef O_TRUNC
28: # define O_TRUNC 0
29: #endif
30:
1.93 ! paf 31: // locking constants
! 32:
! 33: #ifndef LOCK_EX
! 34: // win32
! 35: # ifdef _LK_LOCK
! 36: # define LOCK_EX _LK_LOCK
! 37: # else
! 38: // sun
! 39: # ifdef F_LOCK
! 40: # define LOCK_EX F_LOCK
! 41: # else
! 42: # error unable to define LOCK_EX
! 43: # endif
! 44: # endif
! 45: #endif
! 46:
! 47: #ifndef LOCK_SH
! 48: // win32
! 49: # ifdef _LK_RLCK
! 50: # define LOCK_SH _LK_RLCK
! 51: # else
! 52: // sun
! 53: /// @todo shared lock bit. forgot where to get those F_LOCK consts group
! 54: # ifdef F_LOCK
! 55: # define LOCK_SH F_LOCK
! 56: # else
! 57: # error unable to define LOCK_SH
! 58: # endif
! 59: # endif
! 60: #endif
! 61:
! 62: #ifndef LOCK_UN
! 63: // win32
! 64: # ifdef _LK_UNLCK
! 65: # define LOCK_UN _LK_UNLCK
! 66: # else
! 67: // sun
! 68: # ifdef F_ULOCK
! 69: # define LOCK_UN F_ULOCK
! 70: # else
! 71: # error unable to define LOCK_UN
! 72: # endif
! 73: # endif
! 74: #endif
! 75:
! 76: #ifndef HAVE_FLOCK
! 77: // win32
! 78: #ifdef HAVE__LOCKING
! 79: static void flock(int fd, int operation) {
! 80: lseek(fd, 0, SEEK_SET);
! 81: while(_locking(fd, operation, 1)!=0);
! 82: lseek(fd, 0, SEEK_SET);
! 83: }
! 84: #else
! 85: // sun
! 86: #ifdef HAVE_LOCKF
! 87: static void flock(int fd, int operation) {
! 88: lseek(fd, 0, SEEK_SET);
! 89: lockf(fd, operation, 1);
! 90: lseek(fd, 0, SEEK_SET);
! 91: }
! 92: #else
! 93: #error unable to find locking func
! 94: #endif
! 95: #endif
! 96: #endif
! 97:
1.86 paf 98: static char *strnchr(char *buf, size_t size, char c) {
99: for(; size-->0; buf++) {
100: if(*buf==c)
101: return buf;
102: }
103:
104: return 0;
105: }
106:
107: void fix_line_breaks(char *buf, size_t& size) {
1.87 paf 108: //_asm int 3;
1.86 paf 109: const char * const eob=buf+size;
1.87 paf 110: char *dest=buf;
1.72 parser 111: // fix DOS: \r\n -> \n
112: // fix Macintosh: \r -> \n
1.87 paf 113: char *bol=buf;
1.86 paf 114: while(char *eol=strnchr(bol, eob -bol, '\r')) {
1.72 parser 115: size_t len=eol-bol;
116: if(dest!=bol)
117: memcpy(dest, bol, len);
118: dest+=len;
119: *dest++='\n';
120:
1.87 paf 121: if(&eol[1]<eob && eol[1]=='\n') { // \r,\n = DOS
1.72 parser 122: bol=eol+2;
123: size--;
124: } else // \r,not \n = Macintosh
125: bol=eol+1;
126: }
127: // last piece without \r, including terminating 0
128: if(dest!=bol)
1.87 paf 129: memcpy(dest, bol, eob-bol);
1.72 parser 130: }
1.18 paf 131:
1.28 paf 132: char *file_read_text(Pool& pool, const String& file_spec, bool fail_on_read_problem) {
1.72 parser 133: void *result; size_t size;
134: return file_read(pool, file_spec, result, size, true, fail_on_read_problem)?(char *)result:0;
1.34 paf 135: }
136: bool file_read(Pool& pool, const String& file_spec,
1.87 paf 137: void*& data, size_t& data_size, bool as_text,
1.44 paf 138: bool fail_on_read_problem,
139: size_t offset, size_t limit) {
1.64 parser 140: const char *fname=file_spec.cstr(String::UL_FILE_SPEC);
1.62 parser 141: //printf("file_read(%s)\n", fname);
1.33 paf 142: int f;
1.2 paf 143: struct stat finfo;
1.33 paf 144:
145: // first open, next stat:
1.45 paf 146: // directory update of NTFS hard links performed on open.
1.33 paf 147: // ex:
148: // a.html:^test[] and b.html hardlink to a.html
149: // user inserts ! before ^test in a.html
150: // directory entry of b.html in NTFS not updated at once,
1.35 paf 151: // they delay update till open, so we would receive "!^test[" string
152: // if would do stat, next open.
1.34 paf 153: if(
1.72 parser 154: (f=open(fname, O_RDONLY|(as_text?_O_BINARY/*_O_TEXT*/:_O_BINARY)))>=0 &&
1.34 paf 155: stat(fname, &finfo)==0) {
1.93 ! paf 156: flock(f, LOCK_SH);
1.44 paf 157: size_t max_size=limit?min(offset+limit, finfo.st_size)-offset:finfo.st_size;
1.87 paf 158: int read_size;
1.47 paf 159: if(!max_size) { // eof
1.83 paf 160: if(as_text) {
161: data=pool.malloc(1);
162: *(char*)data=0;
163: } else
164: data=0;
1.47 paf 165: read_size=0;
1.59 parser 166: } else {
1.78 paf 167: data=pool.malloc(max_size+(as_text?1:0), 3);
1.59 parser 168: if(offset)
169: lseek(f, offset, SEEK_SET);
170: read_size=read(f, data, max_size);
1.47 paf 171: }
1.93 ! paf 172: flock(f, LOCK_UN);
1.2 paf 173: close(f);
1.59 parser 174: if(!max_size) // eof
175: return true;
1.32 paf 176:
1.87 paf 177: if(read_size<0 || read_size>max_size)
1.73 parser 178: throw Exception(0, 0,
1.33 paf 179: &file_spec,
1.44 paf 180: "read failed: actually read %d bytes count not in [0..%lu] valid range",
181: read_size, (unsigned long)max_size); //never
1.87 paf 182:
183: data_size=read_size;
184: if(as_text) {
185: fix_line_breaks((char *)data, data_size);
186: // note: after fixing
187: ((char*&)data)[data_size]=0;
188: }
1.72 parser 189: return true;
1.2 paf 190: }
1.4 paf 191: if(fail_on_read_problem)
1.73 parser 192: throw Exception(0, 0,
1.33 paf 193: &file_spec,
1.54 parser 194: "read failed: %s (%d), actual filename '%s'",
195: strerror(errno), errno, fname);
1.34 paf 196: return false;
1.8 paf 197: }
198:
1.63 parser 199: static void create_dir_for_file(const String& file_spec) {
200: size_t pos_after=1;
201: int pos_before;
202: while((pos_before=file_spec.pos("/", 1, pos_after))>=0) {
1.64 parser 203: mkdir(file_spec.mid(0, pos_before).cstr(String::UL_FILE_SPEC), 0775);
1.63 parser 204: pos_after=pos_before+1;
205: }
206: }
207:
1.18 paf 208: void file_write(Pool& pool,
1.28 paf 209: const String& file_spec,
1.34 paf 210: const void *data, size_t size,
1.80 paf 211: bool as_text,
1.93 ! paf 212: bool do_append) {
1.64 parser 213: const char *fname=file_spec.cstr(String::UL_FILE_SPEC);
1.28 paf 214: int f;
1.80 paf 215: if(access(fname, W_OK)!=0) // no
1.63 parser 216: create_dir_for_file(file_spec);
1.50 paf 217:
1.80 paf 218: if((f=open(fname,
219: O_CREAT|O_RDWR
220: |(as_text?_O_TEXT:_O_BINARY)
1.92 paf 221: |(do_append?O_APPEND:O_TRUNC), 0664))>=0) {
1.93 ! paf 222: flock(f, LOCK_EX);
1.80 paf 223:
224: if(size) write(f, data, size);
225: #if O_TRUNC==0
226: ftruncate(f, size);
1.18 paf 227: #endif
1.93 ! paf 228: flock(f, LOCK_UN);
1.80 paf 229: close(f);
230: } else
231: throw Exception(0, 0,
232: &file_spec,
233: "write failed: %s (%d), actual filename '%s'",
234: strerror(errno), errno, fname);
1.30 paf 235: }
236:
1.63 parser 237: // throws nothing! [this is required in file_move & file_delete]
1.50 paf 238: static void rmdir(const String& file_spec, size_t pos_after) {
239: int pos_before;
240: if((pos_before=file_spec.pos("/", 1, pos_after))>=0)
241: rmdir(file_spec, pos_before+1);
242:
1.64 parser 243: rmdir(file_spec.mid(0, pos_after-1/* / */).cstr(String::UL_FILE_SPEC));
1.50 paf 244: }
1.93 ! paf 245: bool file_delete(Pool& pool, const String& file_spec, bool fail_on_read_problem) {
1.64 parser 246: const char *fname=file_spec.cstr(String::UL_FILE_SPEC);
1.54 parser 247: if(unlink(fname)!=0)
1.93 ! paf 248: if(fail_on_read_problem)
! 249: throw Exception(0, 0,
! 250: &file_spec,
! 251: "unlink failed: %s (%d), actual filename '%s'",
! 252: strerror(errno), errno, fname);
! 253: else
! 254: return false;
1.50 paf 255:
256: rmdir(file_spec, 1);
1.93 ! paf 257: return true;
1.60 parser 258: }
259: void file_move(Pool& pool, const String& old_spec, const String& new_spec) {
1.64 parser 260: const char *old_spec_cstr=old_spec.cstr(String::UL_FILE_SPEC);
261: const char *new_spec_cstr=new_spec.cstr(String::UL_FILE_SPEC);
1.63 parser 262:
263: create_dir_for_file(new_spec);
264:
1.60 parser 265: if(rename(old_spec_cstr, new_spec_cstr)!=0)
1.73 parser 266: throw Exception(0, 0,
1.60 parser 267: &old_spec,
268: "rename failed: %s (%d), actual filename '%s' to '%s'",
269: strerror(errno), errno, old_spec_cstr, new_spec_cstr);
1.63 parser 270:
271: rmdir(old_spec, 1);
1.31 paf 272: }
273:
1.51 paf 274:
275: static bool entry_readable(const String& file_spec, bool need_dir) {
1.64 parser 276: const char *fname=file_spec.cstr(String::UL_FILE_SPEC);
1.51 paf 277: struct stat finfo;
278: if(access(fname, R_OK)==0 && stat(fname, &finfo)==0) {
1.73 parser 279: bool is_dir=finfo.st_mode&S_IFDIR != 0;
1.51 paf 280: return is_dir==need_dir;
281: }
282: return false;
283: }
1.31 paf 284: bool file_readable(const String& file_spec) {
1.51 paf 285: return entry_readable(file_spec, false);
286: }
287: bool dir_readable(const String& file_spec) {
288: return entry_readable(file_spec, true);
1.65 parser 289: }
290: String *file_readable(const String& path, const String& name) {
291: String *result=new(path.pool()) String(path);
292: *result << "/";
293: *result << name;
294: return file_readable(*result)?result:0;
1.43 paf 295: }
296: bool file_executable(const String& file_spec) {
1.64 parser 297: return access(file_spec.cstr(String::UL_FILE_SPEC), X_OK)==0;
1.44 paf 298: }
299:
1.64 parser 300: bool file_stat(const String& file_spec,
1.58 parser 301: size_t& rsize,
302: time_t& ratime,
303: time_t& rmtime,
1.64 parser 304: time_t& rctime,
305: bool fail_on_read_problem) {
1.44 paf 306: Pool& pool=file_spec.pool();
1.64 parser 307: const char *fname=file_spec.cstr(String::UL_FILE_SPEC);
1.44 paf 308: struct stat finfo;
309: if(stat(fname, &finfo)!=0)
1.64 parser 310: if(fail_on_read_problem)
1.73 parser 311: throw Exception(0, 0,
1.67 parser 312: &file_spec,
313: "getting file size failed: %s (%d), real filename '%s'",
314: strerror(errno), errno, fname);
1.64 parser 315: else
316: return false;
1.58 parser 317: rsize=finfo.st_size;
318: ratime=finfo.st_atime;
319: rmtime=finfo.st_mtime;
320: rctime=finfo.st_ctime;
1.64 parser 321: return true;
1.18 paf 322: }
323:
1.8 paf 324: char *getrow(char **row_ref, char delim) {
325: char *result=*row_ref;
326: if(result) {
327: *row_ref=strchr(result, delim);
328: if(*row_ref)
329: *((*row_ref)++)=0;
330: else if(!*result)
331: return 0;
332: }
333: return result;
334: }
335:
1.23 paf 336: char *lsplit(char *string, char delim) {
337: if(string) {
338: char *v=strchr(string, delim);
1.8 paf 339: if(v) {
340: *v=0;
341: return v+1;
342: }
343: }
344: return 0;
345: }
346:
347: char *lsplit(char **string_ref, char delim) {
348: char *result=*string_ref;
349: char *next=lsplit(*string_ref, delim);
350: *string_ref=next;
351: return result;
1.9 paf 352: }
353:
354: char *rsplit(char *string, char delim) {
1.18 paf 355: if(string) {
1.9 paf 356: char *v=strrchr(string, delim);
1.18 paf 357: if(v) {
1.9 paf 358: *v=0;
359: return v+1;
360: }
361: }
362: return NULL;
1.10 paf 363: }
364:
1.37 paf 365: /// @todo less stupid type detection
1.10 paf 366: char *format(Pool& pool, double value, char *fmt) {
1.78 paf 367: char *result=(char *)pool.malloc(MAX_NUMBER, 4);
1.10 paf 368: if(fmt)
369: if(strpbrk(fmt, "diouxX"))
370: if(strpbrk(fmt, "ouxX"))
1.33 paf 371: snprintf(result, MAX_NUMBER, fmt, (uint)value );
1.10 paf 372: else
1.33 paf 373: snprintf(result, MAX_NUMBER, fmt, (int)value );
1.10 paf 374: else
375: snprintf(result, MAX_NUMBER, fmt, value);
376: else
1.33 paf 377: snprintf(result, MAX_NUMBER, "%d", (int)value);
1.10 paf 378:
379: return result;
1.12 paf 380: }
381:
1.36 paf 382: size_t stdout_write(const void *buf, size_t size) {
1.12 paf 383: #ifdef WIN32
384: do{
385: int chunk_written=fwrite(buf, 1, min(8*0x400, size), stdout);
386: if(chunk_written<=0)
387: break;
388: size-=chunk_written;
1.36 paf 389: buf=((const char*)buf)+chunk_written;
1.12 paf 390: } while(size>0);
391:
392: return size;
393: #else
1.13 paf 394: return fwrite(buf, 1, size, stdout);
1.12 paf 395: #endif
1.2 paf 396: }
1.14 paf 397:
1.77 parser 398: char *unescape_chars(Pool& pool, const char *cp, int len) {
1.78 paf 399: char *s=(char *)pool.malloc(len + 1, 5);
1.14 paf 400: enum EscapeState {
1.33 paf 401: EscapeRest,
402: EscapeFirst,
1.14 paf 403: EscapeSecond
404: } escapeState=EscapeRest;
405: int escapedValue=0;
406: int srcPos=0;
407: int dstPos=0;
408: while(srcPos < len) {
409: int ch=cp[srcPos];
410: switch(escapeState) {
411: case EscapeRest:
412: if(ch=='%') {
413: escapeState=EscapeFirst;
414: } else if(ch=='+') {
415: s[dstPos++]=' ';
416: } else {
417: s[dstPos++]=ch;
418: }
419: break;
420: case EscapeFirst:
421: escapedValue=hex_value[ch] << 4;
422: escapeState=EscapeSecond;
423: break;
424: case EscapeSecond:
425: escapedValue +=hex_value[ch];
426: s[dstPos++]=escapedValue;
427: escapeState=EscapeRest;
428: break;
429: }
430: srcPos++;
431: }
432: s[dstPos]=0;
433: return s;
434: }
435:
1.52 paf 436: /// used by attributed_meaning_to_string / append_attribute_subattribute
1.40 paf 437: struct Attributed_meaning_info {
1.52 paf 438: String *header; // header line being constructed
439: String::Untaint_lang lang; // language in which to append to that line
1.40 paf 440: };
1.17 paf 441: static void append_attribute_subattribute(const Hash::Key& akey, Hash::Val *avalue,
1.14 paf 442: void *info) {
443: if(akey==VALUE_NAME)
444: return;
445:
1.40 paf 446: Attributed_meaning_info& ami=*static_cast<Attributed_meaning_info *>(info);
447:
1.14 paf 448: // ...; charset=windows1251
1.48 paf 449: *ami.header << "; ";
1.70 parser 450: ami.header->append(akey, ami.lang);
1.48 paf 451: *ami.header << "=";
1.70 parser 452: ami.header->append(static_cast<Value *>(avalue)->as_string(), ami.lang);
1.14 paf 453: }
1.49 paf 454: const String& attributed_meaning_to_string(Value& meaning,
455: String::Untaint_lang lang) {
1.20 paf 456: String &result=*new(meaning.pool()) String(meaning.pool());
1.75 parser 457: if(Hash *hash=meaning.get_hash(0)) {
1.14 paf 458: // $value(value) $subattribute(subattribute value)
459: if(Value *value=static_cast<Value *>(hash->get(*value_name)))
1.40 paf 460: result.append(value->as_string(), lang, true);
1.14 paf 461:
1.40 paf 462: Attributed_meaning_info attributed_meaning_info={
1.52 paf 463: &result,
464: lang
1.40 paf 465: };
466: hash->for_each(append_attribute_subattribute, &attributed_meaning_info);
1.14 paf 467: } else // result value
1.40 paf 468: result.append(meaning.as_string(), lang, true);
1.14 paf 469:
470: return result;
1.24 paf 471: }
472:
473: #ifdef WIN32
474: void back_slashes_to_slashes(char *s) {
475: if(s)
476: for(; *s; s++)
477: if(*s=='\\')
478: *s='/';
479: }
1.42 paf 480: /*
481: void slashes_to_back_slashes(char *s) {
482: if(s)
483: for(; *s; s++)
484: if(*s=='/')
485: *s='\\';
486: }
487: */
1.24 paf 488: #endif
1.41 paf 489:
490: bool StrEqNc(const char *s1, const char *s2, bool strict) {
491: while(true) {
492: if(!(*s1)) {
493: if(!(*s2))
494: return true;
495: else
496: return !strict;
497: } else if(!(*s2))
498: return !strict;
499: if(isalpha(*s1)) {
500: if(tolower(*s1) !=tolower(*s2))
501: return false;
502: } else if((*s1) !=(*s2))
503: return false;
504: s1++;
505: s2++;
506: }
1.57 parser 507: }
508:
1.84 paf 509: static bool isLeap(int year) {
1.57 parser 510: return !(
511: (year % 4) || ((year % 400) && !(year % 100))
512: );
513: }
514:
515: int getMonthDays(int year, int month) {
516: int monthDays[]={
517: 31,
518: isLeap(year) ? 29 : 28,
519: 31,
520: 30,
521: 31,
522: 30,
523: 31,
524: 31,
525: 30,
526: 31,
527: 30,
528: 31
529: };
530: return monthDays[month];
1.41 paf 531: }
1.69 parser 532:
533: void remove_crlf(char *start, char *end) {
534: for(char *p=start; p<end; p++)
535: switch(*p) {
536: case '\n': *p='|'; break;
537: case '\r': *p=' '; break;
538: }
1.91 paf 539: }
540:
541:
542: /// must be last in this file
543: #undef vsnprintf
544: int __vsnprintf(char *b, size_t s, const char *f, va_list l) {
545: if(!s)
546: return 0;
547:
548: int r;
549: // note: on win32& maybe somewhere else
550: // vsnprintf do not writes terminating 0 in 'buffer full' case, reducing
551: --s;
552: #if _MSC_VER
553: /*
554: win32:
555: mk:@MSITStore:C:\Program%20Files\Microsoft%20Visual%20Studio\MSDN\2001APR\1033\vccore.chm::/html/_crt__vsnprintf.2c_._vsnwprintf.htm
556:
557: if the number of bytes to write exceeds buffer, then count bytes are written and –1 is returned
558: */
559: r=_vsnprintf(b, s, f, l);
560: if(r<0)
561: r=s;
562: #else
563: r=vsnprintf(b, s, f, l);
564: /*
565: solaris:
566: man vsnprintf
567:
568: The snprintf() function returns the number of characters
569: formatted, that is, the number of characters that would have
570: been written to the buffer if it were large enough. If the
571: value of n is 0 on a call to snprintf(), an unspecified
572: value less than 1 is returned.
573: */
574:
575: if(r<0)
576: r=0;
577: else if(r>s)
578: r=s;
579: #endif
580: b[r]=0;
581: return r;
582: }
583:
584: int __snprintf(char *b, size_t s, const char *f, ...) {
585: va_list l;
586: va_start(l, f);
587: int r=__vsnprintf(b, s, f, l);
588: va_end(l);
589: return r;
1.74 parser 590: }
E-mail:
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to pa_common.C CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [parser3project] / parser3 / src / main