version 1.1.1.1.8.2, 2010/09/10 12:38:26
|
version 1.6, 2011/06/07 11:49:39
|
Line 1
|
Line 1
|
/************************************************************************* |
/************************************************************************* |
* (C) 2010 AITNET ltd - Sofia/Bulgaria - <misho@aitbg.com> | * (C) 2010 AITNET ltd - Sofia/Bulgaria - <misho@aitnet.org> |
* by Michael Pounov <misho@openbsd-bg.org> | * by Michael Pounov <misho@elwix.org> |
* |
* |
* $Author$ |
* $Author$ |
* $Id$ |
* $Id$ |
* |
* |
*************************************************************************/ | ************************************************************************** |
| The ELWIX and AITNET software is distributed under the following |
| terms: |
| |
| All of the documentation and software included in the ELWIX and AITNET |
| Releases is copyrighted by ELWIX - Sofia/Bulgaria <info@elwix.org> |
| |
| Copyright 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 |
| by Michael Pounov <misho@elwix.org>. All rights reserved. |
| |
| Redistribution and use in source and binary forms, with or without |
| modification, are permitted provided that the following conditions |
| are met: |
| 1. Redistributions of source code must retain the above copyright |
| notice, this list of conditions and the following disclaimer. |
| 2. Redistributions in binary form must reproduce the above copyright |
| notice, this list of conditions and the following disclaimer in the |
| documentation and/or other materials provided with the distribution. |
| 3. All advertising materials mentioning features or use of this software |
| must display the following acknowledgement: |
| This product includes software developed by Michael Pounov <misho@elwix.org> |
| ELWIX - Embedded LightWeight unIX and its contributors. |
| 4. Neither the name of AITNET nor the names of its contributors |
| may be used to endorse or promote products derived from this software |
| without specific prior written permission. |
| |
| THIS SOFTWARE IS PROVIDED BY AITNET AND CONTRIBUTORS ``AS IS'' AND |
| ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
| FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| SUCH DAMAGE. |
| */ |
#include "global.h" |
#include "global.h" |
|
|
|
|
Line 21 char io_Error[STRSIZ];
|
Line 58 char io_Error[STRSIZ];
|
|
|
|
|
// io_GetErrno() Get error code of last operation |
// io_GetErrno() Get error code of last operation |
inline int io_GetErrno() | inline int |
| io_GetErrno() |
{ |
{ |
return io_Errno; |
return io_Errno; |
} |
} |
|
|
// io_GetError() Get error text of last operation |
// io_GetError() Get error text of last operation |
inline const char *io_GetError() | inline const char * |
| io_GetError() |
{ |
{ |
return io_Error; |
return io_Error; |
} |
} |
|
|
// io_SetErr() Set error to variables for internal use!!! |
// io_SetErr() Set error to variables for internal use!!! |
inline void io_SetErr(int eno, char *estr, ...) | inline void |
| io_SetErr(int eno, char *estr, ...) |
{ |
{ |
va_list lst; |
va_list lst; |
|
|
Line 53 inline void io_SetErr(int eno, char *estr, ...)
|
Line 93 inline void io_SetErr(int eno, char *estr, ...)
|
* @dataLen = Length of data |
* @dataLen = Length of data |
* return: 0 EOF; -1 error:: can`t read; >0 count of readed chars |
* return: 0 EOF; -1 error:: can`t read; >0 count of readed chars |
*/ |
*/ |
int ioPromptRead(int *h, const char *csPrompt, char * __restrict psData, int dataLen) | int |
| ioPromptRead(int *h, const char *csPrompt, char * __restrict psData, int dataLen) |
{ |
{ |
int ok = 0; |
int ok = 0; |
FILE *inp, *out; |
FILE *inp, *out; |
Line 106 int ioPromptRead(int *h, const char *csPrompt, char *
|
Line 147 int ioPromptRead(int *h, const char *csPrompt, char *
|
* @confirm = Confirm password, 0 - get password, !=0 Ask for confirmation |
* @confirm = Confirm password, 0 - get password, !=0 Ask for confirmation |
* return: 0 EOF; -1 error:: can`t read; >0 count of readed chars |
* return: 0 EOF; -1 error:: can`t read; >0 count of readed chars |
*/ |
*/ |
int ioPromptPassword(int *h, const char *csPrompt, char * __restrict psPass, int passLen, int confirm) | int |
| ioPromptPassword(int *h, const char *csPrompt, char * __restrict psPass, int passLen, int confirm) |
{ |
{ |
int ret, ok = 0; |
int ret, ok = 0; |
FILE *inp, *out; |
FILE *inp, *out; |
Line 190 next:
|
Line 232 next:
|
* @endPos = Return end positions |
* @endPos = Return end positions |
* return: NULL not match or error; !=NULL begin of matched data |
* return: NULL not match or error; !=NULL begin of matched data |
*/ |
*/ |
const char *ioRegexVerify(const char *csRegex, const char *csData, int *startPos, int *endPos) | const char * |
| ioRegexVerify(const char *csRegex, const char *csData, int *startPos, int *endPos) |
{ |
{ |
regex_t re; |
regex_t re; |
regmatch_t match; |
regmatch_t match; |
Line 237 const char *ioRegexVerify(const char *csRegex, const c
|
Line 280 const char *ioRegexVerify(const char *csRegex, const c
|
* @strLen = Length of string |
* @strLen = Length of string |
* return: 0 not match; >0 count of returned chars |
* return: 0 not match; >0 count of returned chars |
*/ |
*/ |
int ioRegexGet(const char *csRegex, const char *csData, char * __restrict psString, int strLen) | int |
| ioRegexGet(const char *csRegex, const char *csData, char * __restrict psString, int strLen) |
{ |
{ |
int sp, ep, len; |
int sp, ep, len; |
const char *str; |
const char *str; |
Line 265 int ioRegexGet(const char *csRegex, const char *csData
|
Line 309 int ioRegexGet(const char *csRegex, const char *csData
|
* @csNew = Data for replace |
* @csNew = Data for replace |
* return: NULL not match or error; !=NULL allocated new string, must be free after use! |
* return: NULL not match or error; !=NULL allocated new string, must be free after use! |
*/ |
*/ |
char *ioRegexReplace(const char *csRegex, const char *csData, const char *csNew) | char * |
| ioRegexReplace(const char *csRegex, const char *csData, const char *csNew) |
{ |
{ |
int sp, ep, len; |
int sp, ep, len; |
char *str = NULL; |
char *str = NULL; |
Line 306 char *ioRegexReplace(const char *csRegex, const char *
|
Line 351 char *ioRegexReplace(const char *csRegex, const char *
|
return str; |
return str; |
} |
} |
|
|
|
/* |
|
* ioVarAst() Function for evaluate string like asterisk variable "{text[:[-]#[:#]]}" |
|
* @csString = Input string |
|
* return: NULL error, !=NULL Allocated new string evaluated from input string, must be free() |
|
*/ |
|
char * |
|
ioVarAst(const char *csString) |
|
{ |
|
char *ext, *str, *out = NULL; |
|
int e[2] = { 0 }; |
|
|
|
if (!csString) |
|
return NULL; |
|
|
|
if (!strchr(csString, '{') || !strrchr(csString, '}')) { |
|
memset(io_Error, 0, STRSIZ); |
|
snprintf(io_Error, STRSIZ, "Error:: Invalid input string format ... " |
|
"must be like {text[:[-]#[:#]]}"); |
|
io_Errno = EINVAL; |
|
return NULL; |
|
} else { |
|
str = strdup(strchr(csString, '{') + 1); |
|
*strrchr(str, '}') = 0; |
|
} |
|
|
|
if ((ext = strchr(str, ':'))) { |
|
*ext++ = 0; |
|
e[0] = strtol(ext, NULL, 0); |
|
if ((ext = strchr(ext, ':'))) |
|
e[1] = strtol(++ext, NULL, 0); |
|
|
|
/* make cut prefix */ |
|
if (e[0] >= 0) |
|
ext = str + e[0]; |
|
else |
|
ext = str + strlen(str) + e[0]; |
|
/* make cut suffix */ |
|
if (e[1] > 0) |
|
*(ext + e[1]) = 0; |
|
} else |
|
/* ok, clear show */ |
|
ext = str; |
|
|
|
out = strdup(ext); |
|
free(str); |
|
|
|
return out; |
|
} |
|
|
|
|
/* |
/* |
* ioMkDir() Function for racursive directory creation and validation |
* ioMkDir() Function for racursive directory creation and validation |
* @csDir = Full directory path |
* @csDir = Full directory path |
Line 354 end:
|
Line 448 end:
|
return cx; |
return cx; |
} |
} |
|
|
|
/* |
|
* ioWatchDirLoop() Function for watching changes in directory and fire callback |
|
* @csDir = Full directory path |
|
* @callback = Callback if raise event! nOp -1 delete, 0 change/move, 1 create |
|
* return: -1 error, !=-1 ok, number of total signaled events |
|
*/ |
|
int |
|
ioWatchDirLoop(const char *csDir, int (*callback)(const char *csName, int nOp)) |
|
{ |
|
glob_t g[2] = {{ 0 }, { 0 }}; |
|
int d, kq, n = 0; |
|
register int j, i; |
|
struct kevent req, chg; |
|
char wrk[MAXPATHLEN * 2], str[MAXPATHLEN] = { 0 }; |
|
|
|
if (!csDir || !callback) |
|
return 0; |
|
|
|
strlcpy(str, csDir, MAXPATHLEN); |
|
strlcat(str, "/*", MAXPATHLEN); |
|
|
|
kq = kqueue(); |
|
if (kq == -1) { |
|
LOGERR; |
|
return -1; |
|
} |
|
d = open(csDir, O_RDONLY); |
|
if (d == -1) { |
|
LOGERR; |
|
close(kq); |
|
return -1; |
|
} |
|
|
|
EV_SET(&req, d, EVFILT_VNODE, EV_ADD | EV_CLEAR, NOTE_WRITE, 0, 0); |
|
|
|
if ((n = glob(str, GLOB_NOCHECK, NULL, &g[0]))) { |
|
LOGERR; |
|
close(d); |
|
close(kq); |
|
return -1; |
|
} /*else |
|
ioDEBUG(3, "Start files %d in %s\n", g[0].gl_matchc, str);*/ |
|
|
|
while (kevent(kq, &req, 1, &chg, 1, NULL) > 0) { |
|
/*ioDEBUG(1, "Event:: req=0x%x -> chg=0x%x data=%x\n", req.fflags, chg.fflags, chg.data);*/ |
|
|
|
if (!glob(str, GLOB_NOCHECK, NULL, &g[1])) { |
|
/*ioDEBUG(3, "Diffs %d <> %d\n", g[0].gl_matchc, g[1].gl_matchc);*/ |
|
|
|
if (g[0].gl_matchc != g[1].gl_matchc) { |
|
/* find new items */ |
|
for (j = 0; j < g[1].gl_matchc; j++) { |
|
for (i = 0; i < g[0].gl_matchc; i++) |
|
if (!strcmp(g[0].gl_pathv[i], g[1].gl_pathv[j])) |
|
break; |
|
if (i == g[0].gl_matchc) { |
|
if (callback(g[1].gl_pathv[j], 1) < 0) |
|
break; |
|
else |
|
n++; |
|
} |
|
} |
|
/* find del items */ |
|
for (j = 0; j < g[0].gl_matchc; j++) { |
|
for (i = 0; i < g[1].gl_matchc; i++) |
|
if (!strcmp(g[1].gl_pathv[i], g[0].gl_pathv[j])) |
|
break; |
|
if (i == g[1].gl_matchc) { |
|
if (callback(g[0].gl_pathv[j], -1) < 0) |
|
break; |
|
else |
|
n++; |
|
} |
|
} |
|
} else { |
|
/* find chg from items */ |
|
for (j = 0; j < g[0].gl_matchc; j++) { |
|
for (i = 0; i < g[1].gl_matchc; i++) |
|
if (!strcmp(g[1].gl_pathv[i], g[0].gl_pathv[j])) |
|
break; |
|
if (i == g[1].gl_matchc) { |
|
strlcpy(wrk, g[0].gl_pathv[j], sizeof wrk); |
|
strlcat(wrk, ":", sizeof wrk); |
|
} |
|
} |
|
/* find chg to items */ |
|
for (j = 0; j < g[1].gl_matchc; j++) { |
|
for (i = 0; i < g[0].gl_matchc; i++) |
|
if (!strcmp(g[0].gl_pathv[i], g[1].gl_pathv[j])) |
|
break; |
|
if (i == g[0].gl_matchc) { |
|
strlcat(wrk, g[1].gl_pathv[j], sizeof wrk); |
|
if (callback(wrk, 0) < 0) |
|
break; |
|
else |
|
n++; |
|
} |
|
} |
|
} |
|
|
|
globfree(&g[0]); |
|
g[0] = g[1]; |
|
} |
|
} |
|
|
|
globfree(&g[0]); |
|
close(d); |
|
close(kq); |
|
return n; |
|
} |