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