Annotation of parser3/src/main/pa_common.C, revision 1.53
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.16 paf 5:
1.8 paf 6: Author: Alexander Petrosyan <paf@design.ru>(http://design.ru/paf)
1.5 paf 7:
1.53 ! parser 8: $Id: pa_common.C,v 1.52 2001/04/26 14:55:28 paf Exp $
1.1 paf 9: */
10:
11: #include "pa_common.h"
1.2 paf 12: #include "pa_types.h"
1.4 paf 13: #include "pa_exception.h"
1.14 paf 14: #include "pa_pool.h"
15: #include "pa_globals.h"
16: #include "pa_value.h"
17: #include "pa_hash.h"
18: #include "pa_string.h"
1.1 paf 19:
1.47 paf 20: #ifndef WIN32
21: # ifndef _O_TEXT
22: # define _O_TEXT 0
23: # endif
24: # ifndef _O_BINARY
25: # define _O_BINARY 0
26: # endif
27: #endif
28:
1.22 paf 29: #if _MSC_VER
1.1 paf 30:
31: int __vsnprintf(char *b, size_t s, const char *f, va_list l) {
32: int r=_vsnprintf(b, --s, f, l);
33: b[s]=0;
34: return r;
35: }
36: int __snprintf(char *b, size_t s, const char *f, ...) {
37: va_list l;
38: va_start(l, f);
39: int r=__vsnprintf(b, s, f, l);
40: va_end(l);
41: return r;
42: }
43:
44: #endif
1.2 paf 45:
1.18 paf 46:
1.28 paf 47: char *file_read_text(Pool& pool, const String& file_spec, bool fail_on_read_problem) {
1.34 paf 48: void *result;
49: size_t size;
1.35 paf 50: return file_read(pool, file_spec, result, size, true,
51: fail_on_read_problem)?(char *)result:0;
1.34 paf 52: }
53: bool file_read(Pool& pool, const String& file_spec,
1.44 paf 54: void*& data, size_t& read_size, bool as_text,
55: bool fail_on_read_problem,
56: size_t offset, size_t limit) {
57: const char *fname=file_spec.cstr(String::UL_FILE_NAME);
1.33 paf 58: int f;
1.2 paf 59: struct stat finfo;
1.33 paf 60:
61: // first open, next stat:
1.45 paf 62: // directory update of NTFS hard links performed on open.
1.33 paf 63: // ex:
64: // a.html:^test[] and b.html hardlink to a.html
65: // user inserts ! before ^test in a.html
66: // directory entry of b.html in NTFS not updated at once,
1.35 paf 67: // they delay update till open, so we would receive "!^test[" string
68: // if would do stat, next open.
1.34 paf 69: if(
70: (f=open(fname, O_RDONLY|(as_text?_O_TEXT:_O_BINARY)))>=0 &&
71: stat(fname, &finfo)==0) {
1.2 paf 72: /*if(exclusive)
73: flock(f, LOCK_EX);*/
1.44 paf 74: size_t max_size=limit?min(offset+limit, finfo.st_size)-offset:finfo.st_size;
1.47 paf 75: if(!max_size) { // eof
76: data=0;
77: read_size=0;
78: return true;
79: }
1.44 paf 80: data=pool.malloc(max_size+(as_text?1:0));
1.45 paf 81: if(offset)
82: lseek(f, offset, SEEK_SET);
1.44 paf 83: read_size=read(f, data, max_size);
1.2 paf 84: /*if(exclusive)
85: flock(f, LOCK_UN);*/
86: close(f);
1.32 paf 87:
1.44 paf 88: if(read_size>=0 && read_size<=max_size) {
1.34 paf 89: if(as_text)
1.46 paf 90: ((char*&)data)[read_size]=0;
1.34 paf 91: } else
1.33 paf 92: PTHROW(0, 0,
93: &file_spec,
1.44 paf 94: "read failed: actually read %d bytes count not in [0..%lu] valid range",
95: read_size, (unsigned long)max_size); //never
1.32 paf 96:
1.34 paf 97: return true;//prepare_config(result, remove_empty_lines);
1.2 paf 98: }
1.4 paf 99: if(fail_on_read_problem)
1.33 paf 100: PTHROW(0, 0,
101: &file_spec,
1.45 paf 102: "read failed: %s (%d)", strerror(errno), errno);
1.34 paf 103: return false;
1.8 paf 104: }
105:
1.18 paf 106: void file_write(Pool& pool,
1.28 paf 107: const String& file_spec,
1.34 paf 108: const void *data, size_t size,
1.33 paf 109: bool as_text/*,
1.20 paf 110: bool exclusive*/) {
1.44 paf 111: const char *fname=file_spec.cstr(String::UL_FILE_NAME);
1.28 paf 112: int f;
1.50 paf 113: if(access(fname, W_OK)!=0) {/*no*/
114: size_t pos_after=1;
115: int pos_before;
116: while((pos_before=file_spec.pos("/", 1, pos_after))>=0) {
117: mkdir(file_spec.mid(0, pos_before).cstr(String::UL_FILE_NAME), 0775);
118: pos_after=pos_before+1;
119: }
120:
1.33 paf 121: if((f=open(fname, O_WRONLY|O_CREAT|_O_BINARY, 0666))>0)
1.28 paf 122: close(f);
123: }
124: if(access(fname, R_OK|W_OK)==0) {
1.34 paf 125: int mode=O_RDWR|(as_text?_O_TEXT:_O_BINARY)
1.18 paf 126: #ifdef WIN32
1.28 paf 127: |O_TRUNC
1.18 paf 128: #endif
1.28 paf 129: ;
1.33 paf 130: if((f=open(fname, mode, 0666))>=0) {
1.28 paf 131: /*if(exclusive)
132: flock(f, LOCK_EX);*/
133:
1.33 paf 134: if(size) write(f, data, size);
1.18 paf 135: #ifndef WIN32
1.33 paf 136: ftruncate(f, size);
1.18 paf 137: #endif
1.28 paf 138: /*if(exclusive)
139: flock(f, LOCK_UN);*/
140: close(f);
141: return;
1.18 paf 142: }
143: }
1.33 paf 144: PTHROW(0, 0,
145: &file_spec,
1.45 paf 146: "write failed: %s (%d)", strerror(errno), errno);
1.30 paf 147: }
148:
1.50 paf 149: static void rmdir(const String& file_spec, size_t pos_after) {
150: int pos_before;
151: if((pos_before=file_spec.pos("/", 1, pos_after))>=0)
152: rmdir(file_spec, pos_before+1);
153:
154: rmdir(file_spec.mid(0, pos_after-1/* / */).cstr(String::UL_FILE_NAME));
155: }
1.30 paf 156: void file_delete(Pool& pool, const String& file_spec) {
1.39 paf 157: if(unlink(file_spec.cstr(String::UL_FILE_NAME))!=0)
1.33 paf 158: PTHROW(0, 0,
159: &file_spec,
1.45 paf 160: "unlink failed: %s (%d)", strerror(errno), errno);
1.50 paf 161:
162: rmdir(file_spec, 1);
1.31 paf 163: }
164:
1.51 paf 165:
166: static bool entry_readable(const String& file_spec, bool need_dir) {
167: const char *fname=file_spec.cstr(String::UL_FILE_NAME);
168: struct stat finfo;
169: if(access(fname, R_OK)==0 && stat(fname, &finfo)==0) {
170: bool is_dir=(bool)(finfo.st_mode&S_IFDIR);
171: return is_dir==need_dir;
172: }
173: return false;
174: }
1.31 paf 175: bool file_readable(const String& file_spec) {
1.51 paf 176: return entry_readable(file_spec, false);
177: }
178: bool dir_readable(const String& file_spec) {
179: return entry_readable(file_spec, true);
1.43 paf 180: }
181: bool file_executable(const String& file_spec) {
182: return access(file_spec.cstr(String::UL_FILE_NAME), X_OK)==0;
1.44 paf 183: }
184:
185: size_t file_size(const String& file_spec) {
186: Pool& pool=file_spec.pool();
187: const char *fname=file_spec.cstr(String::UL_FILE_NAME);
188: struct stat finfo;
189: if(stat(fname, &finfo)!=0)
190: PTHROW(0, 0,
191: &file_spec,
1.45 paf 192: "write failed: %s (%d)", strerror(errno), errno);
1.44 paf 193: return finfo.st_size;
1.18 paf 194: }
195:
1.8 paf 196: char *getrow(char **row_ref, char delim) {
197: char *result=*row_ref;
198: if(result) {
199: *row_ref=strchr(result, delim);
200: if(*row_ref)
201: *((*row_ref)++)=0;
202: else if(!*result)
203: return 0;
204: }
205: return result;
206: }
207:
1.23 paf 208: char *lsplit(char *string, char delim) {
209: if(string) {
210: char *v=strchr(string, delim);
1.8 paf 211: if(v) {
212: *v=0;
213: return v+1;
214: }
215: }
216: return 0;
217: }
218:
219: char *lsplit(char **string_ref, char delim) {
220: char *result=*string_ref;
221: char *next=lsplit(*string_ref, delim);
222: *string_ref=next;
223: return result;
1.9 paf 224: }
225:
226: char *rsplit(char *string, char delim) {
1.18 paf 227: if(string) {
1.9 paf 228: char *v=strrchr(string, delim);
1.18 paf 229: if(v) {
1.9 paf 230: *v=0;
231: return v+1;
232: }
233: }
234: return NULL;
1.10 paf 235: }
236:
1.37 paf 237: /// @todo less stupid type detection
1.10 paf 238: char *format(Pool& pool, double value, char *fmt) {
239: char *result=(char *)pool.malloc(MAX_NUMBER);
240: if(fmt)
241: if(strpbrk(fmt, "diouxX"))
242: if(strpbrk(fmt, "ouxX"))
1.33 paf 243: snprintf(result, MAX_NUMBER, fmt, (uint)value );
1.10 paf 244: else
1.33 paf 245: snprintf(result, MAX_NUMBER, fmt, (int)value );
1.10 paf 246: else
247: snprintf(result, MAX_NUMBER, fmt, value);
248: else
1.33 paf 249: snprintf(result, MAX_NUMBER, "%d", (int)value);
1.10 paf 250:
251: return result;
1.12 paf 252: }
253:
1.36 paf 254: size_t stdout_write(const void *buf, size_t size) {
1.12 paf 255: #ifdef WIN32
256: do{
257: int chunk_written=fwrite(buf, 1, min(8*0x400, size), stdout);
258: if(chunk_written<=0)
259: break;
260: size-=chunk_written;
1.36 paf 261: buf=((const char*)buf)+chunk_written;
1.12 paf 262: } while(size>0);
263:
264: return size;
265: #else
1.13 paf 266: return fwrite(buf, 1, size, stdout);
1.12 paf 267: #endif
1.2 paf 268: }
1.14 paf 269:
270: const char *unescape_chars(Pool& pool, const char *cp, int len) {
271: char *s=(char *)pool.malloc(len + 1);
272: enum EscapeState {
1.33 paf 273: EscapeRest,
274: EscapeFirst,
1.14 paf 275: EscapeSecond
276: } escapeState=EscapeRest;
277: int escapedValue=0;
278: int srcPos=0;
279: int dstPos=0;
280: while(srcPos < len) {
281: int ch=cp[srcPos];
282: switch(escapeState) {
283: case EscapeRest:
284: if(ch=='%') {
285: escapeState=EscapeFirst;
286: } else if(ch=='+') {
287: s[dstPos++]=' ';
288: } else {
289: s[dstPos++]=ch;
290: }
291: break;
292: case EscapeFirst:
293: escapedValue=hex_value[ch] << 4;
294: escapeState=EscapeSecond;
295: break;
296: case EscapeSecond:
297: escapedValue +=hex_value[ch];
298: s[dstPos++]=escapedValue;
299: escapeState=EscapeRest;
300: break;
301: }
302: srcPos++;
303: }
304: s[dstPos]=0;
305: return s;
306: }
307:
1.52 paf 308: /// used by attributed_meaning_to_string / append_attribute_subattribute
1.40 paf 309: struct Attributed_meaning_info {
1.52 paf 310: String *header; // header line being constructed
311: String::Untaint_lang lang; // language in which to append to that line
1.40 paf 312: };
1.17 paf 313: static void append_attribute_subattribute(const Hash::Key& akey, Hash::Val *avalue,
1.14 paf 314: void *info) {
315: if(akey==VALUE_NAME)
316: return;
317:
1.40 paf 318: Attributed_meaning_info& ami=*static_cast<Attributed_meaning_info *>(info);
319:
1.14 paf 320: // ...; charset=windows1251
1.48 paf 321: *ami.header << "; ";
1.40 paf 322: ami.header->append(akey, ami.lang, true);
1.48 paf 323: *ami.header << "=";
324: ami.header->append(static_cast<Value *>(avalue)->as_string(), ami.lang, true);
1.14 paf 325: }
1.49 paf 326: const String& attributed_meaning_to_string(Value& meaning,
327: String::Untaint_lang lang) {
1.20 paf 328: String &result=*new(meaning.pool()) String(meaning.pool());
329: if(Hash *hash=meaning.get_hash()) {
1.14 paf 330: // $value(value) $subattribute(subattribute value)
331: if(Value *value=static_cast<Value *>(hash->get(*value_name)))
1.40 paf 332: result.append(value->as_string(), lang, true);
1.14 paf 333:
1.40 paf 334: Attributed_meaning_info attributed_meaning_info={
1.52 paf 335: &result,
336: lang
1.40 paf 337: };
338: hash->for_each(append_attribute_subattribute, &attributed_meaning_info);
1.14 paf 339: } else // result value
1.40 paf 340: result.append(meaning.as_string(), lang, true);
1.14 paf 341:
342: return result;
1.24 paf 343: }
344:
345: #ifdef WIN32
346: void back_slashes_to_slashes(char *s) {
347: if(s)
348: for(; *s; s++)
349: if(*s=='\\')
350: *s='/';
351: }
1.42 paf 352: /*
353: void slashes_to_back_slashes(char *s) {
354: if(s)
355: for(; *s; s++)
356: if(*s=='/')
357: *s='\\';
358: }
359: */
1.24 paf 360: #endif
1.41 paf 361:
362: bool StrEqNc(const char *s1, const char *s2, bool strict) {
363: while(true) {
364: if(!(*s1)) {
365: if(!(*s2))
366: return true;
367: else
368: return !strict;
369: } else if(!(*s2))
370: return !strict;
371: if(isalpha(*s1)) {
372: if(tolower(*s1) !=tolower(*s2))
373: return false;
374: } else if((*s1) !=(*s2))
375: return false;
376: s1++;
377: s2++;
378: }
1.48 paf 379: }
380:
381: char *unquote(char*& current, char stop_at) {
382: char *result=current;
383: char *dest=current;
384: // skip leading WS
385: while(*current==' ' || *current=='\t')
386: current++;
387: if(!*current)
388: return current=0;
389:
390: bool quoted=*current=='"';
391: if(quoted)
392: current++;
393:
394: for(; *current; ) {
395: if(quoted)
396: switch(*current) {
397: case '\\': // "...\c
398: if(current[1])
399: current++;
400: break;
401: case '"':
402: current++;
403: goto break2;
404: }
405: else
406: if(*current==stop_at)
407: break;
408:
409: *dest++=*current++;
410: }
411: break2:
412: if(*current)
413: current++; // skip 'stop_at'
414: *dest=0;
415: return result;
1.41 paf 416: }
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