UBOOL8 cmsNet_isHostInSameSubnet(const char *addrHost, const char *addrPrefix)
{
char address[INET6_ADDRSTRLEN];
char prefix1[INET6_ADDRSTRLEN];
char prefix2[INET6_ADDRSTRLEN];
UINT32 plen = 0;
CmsRet ret;
*address = '\0';
*prefix1 = '\0';
*prefix2 = '\0';
if (IS_EMPTY_STRING(addrHost) && IS_EMPTY_STRING(addrPrefix))
{
return TRUE;
}
if (addrHost == NULL || addrPrefix == NULL)
{
return FALSE;
}
if (strchr(addrHost, '/') != NULL)
{
cmsLog_error("Invalid host address %s", addrHost);
return FALSE;
}
if (strchr(addrPrefix, '/') == NULL)
{
cmsLog_error("Invalid address prefix %s", addrPrefix);
return FALSE;
}
if ((ret = cmsUtl_parsePrefixAddress(addrPrefix, address, &plen)) != CMSRET_SUCCESS)
{
cmsLog_error("cmsUtl_parsePrefixAddress returns error. ret=%d", ret);
return FALSE;
}
if ((ret = cmsUtl_getAddrPrefix(addrHost, plen, prefix1)) != CMSRET_SUCCESS)
{
cmsLog_error("cmsUtl_getAddrPrefix returns error. ret=%d", ret);
return FALSE;
}
if ((ret = cmsUtl_getAddrPrefix(address, plen, prefix2)) != CMSRET_SUCCESS)
{
cmsLog_error("cmsUtl_getAddrPrefix returns error. ret=%d", ret);
return FALSE;
}
return (cmsNet_areIp6AddrEqual(prefix1, prefix2));
} /* cmsNet_isHostInSameSubnet() */
UBOOL8 cmsNet_areIp6AddrEqual(const char *ip6Addr1, const char *ip6Addr2)
{
char address1[CMS_IPADDR_LENGTH];
char address2[CMS_IPADDR_LENGTH];
UINT32 plen1 = 0;
UINT32 plen2 = 0;
struct in6_addr in6Addr1, in6Addr2;
CmsRet ret;
if (IS_EMPTY_STRING(ip6Addr1) && IS_EMPTY_STRING(ip6Addr2))
{
return TRUE;
}
if (ip6Addr1 == NULL || ip6Addr2 == NULL)
{
return FALSE;
}
if ((ret = cmsUtl_parsePrefixAddress(ip6Addr1, address1, &plen1)) != CMSRET_SUCCESS)
{
cmsLog_error("cmsUtl_parsePrefixAddress returns error. ret=%d", ret);
return FALSE;
}
if ((ret = cmsUtl_parsePrefixAddress(ip6Addr2, address2, &plen2)) != CMSRET_SUCCESS)
{
cmsLog_error("cmsUtl_parsePrefixAddress returns error. ret=%d", ret);
return FALSE;
}
if (inet_pton(AF_INET6, address1, &in6Addr1) <= 0)
{
cmsLog_error("Invalid address1=%s", address1);
return FALSE;
}
if (inet_pton(AF_INET6, address2, &in6Addr2) <= 0)
{
cmsLog_error("Invalid address2=%s", address2);
return FALSE;
}
return ((memcmp(&in6Addr1, &in6Addr2, sizeof(struct in6_addr)) == 0) && (plen1 == plen2));
} /* cmsNet_areIp6AddrEqual() */
UBOOL8 cmsNet_areIp6DnsEqual(const char *dnsServers1, const char *dnsServers2)
{
char dnsPri1[CMS_IPADDR_LENGTH];
char dnsSec1[CMS_IPADDR_LENGTH];
char dnsPri2[CMS_IPADDR_LENGTH];
char dnsSec2[CMS_IPADDR_LENGTH];
CmsRet ret;
*dnsPri1 = '\0';
*dnsSec1 = '\0';
*dnsPri2 = '\0';
*dnsSec2 = '\0';
if (IS_EMPTY_STRING(dnsServers1) && IS_EMPTY_STRING(dnsServers2))
{
return TRUE;
}
if (dnsServers1 == NULL || dnsServers2 == NULL)
{
return FALSE;
}
if ((ret = cmsUtl_parseDNS(dnsServers1, dnsPri1, dnsSec1, FALSE)) != CMSRET_SUCCESS)
{
cmsLog_error("cmsUtl_parseDNS returns error. ret=%d", ret);
return FALSE;
}
if ((ret = cmsUtl_parseDNS(dnsServers2, dnsPri2, dnsSec2, FALSE)) != CMSRET_SUCCESS)
{
cmsLog_error("cmsUtl_parseDNS returns error. ret=%d", ret);
return FALSE;
}
if (!cmsNet_areIp6AddrEqual(dnsPri1, dnsPri2) ||
!cmsNet_areIp6AddrEqual(dnsSec2, dnsSec2))
{
return FALSE;
}
return TRUE;
} /* cmsNet_areIp6DnsEqual() */
LPTSTR apxStrCharRemove(LPTSTR szString, TCHAR chSkip)
{
LPTSTR p = szString;
LPTSTR q = szString;
if (IS_EMPTY_STRING(szString))
return szString;
while (*p) {
if(*p != chSkip)
*q++ = *p;
++p;
}
*q = TEXT('\0');
return szString;
}
void
apxStrCharReplaceW(LPWSTR szString, WCHAR chReplace, WCHAR chReplaceWith)
{
LPWSTR p = szString;
LPWSTR q = szString;
if (IS_EMPTY_STRING(szString))
return;
while (*p) {
if(*p == chReplace)
*q++ = chReplaceWith;
else
*q++ = *p;
++p;
}
*q = L'\0';
}
DWORD apxStrCharRemoveW(LPWSTR szString, WCHAR chSkip)
{
LPWSTR p = szString;
LPWSTR q = szString;
DWORD c = 0;
if (IS_EMPTY_STRING(szString))
return c;
while (*p) {
if(*p != chSkip)
*q++ = *p;
else
++c;
++p;
}
*q = L'\0';
return c;
}
int main(int argc, char** argv)
{
bool32 FlagActivated = 0;
for(int i=0;
i < argc;
i++)
{
char Flag[MAX_FLAG_CHAR];
// NOTE: '-' Indicate that a flag name is what comes next
if(argv[i][0] == '-')
{
int IndexArray = 0;
for(argv[i][1];
*argv[i];
argv[i]++)
{
if (IndexArray < (MAX_FLAG_CHAR - 1))
{
Flag[IndexArray] = *argv[i];
IndexArray++;
}
}
if (CompareStrings(Flag, "-h", 2) == 0)
{
FlagActivated = FlagActivated|HELP_FLAG; //0x00
ShowHelpPage();
}
else if (CompareStrings(Flag, "-cc", 3) == 0)
{
FlagActivated = FlagActivated|CHANGE_TARGET_DIRECTORY_FLAG; // 0x01
}
else if (CompareStrings(Flag, "-s", 2) == 0)
{
FlagActivated = FlagActivated|SOURCE_FILE_FLAG; // 0x02
}
else
{
// logging
}
}
// NOTE: '@' represents char that indicates that what comes next is an diretory
else if(argv[i][0] == '@')
{
}
else
{
// logging
}
}
bool Running = true;
bool ProjectAssigned = false;
tree_directory *TreeRootDirectory;
tree_directory *TreeActualDirectory;
char PathToPrepend[MAX_PATH_SIZE];
WelcomeMessage();
while(Running)
{
char CommandLine[MAX_LINE_SIZE];
char CLineLowerCase[MAX_LINE_SIZE];
char CommandName[MAX_LINE_SIZE];
char CommandAction[MAX_LINE_SIZE];
printf("\nC-environment Shell> ");
// TODO: Make space before first world do not count for the string comparisons
gets_s(CommandLine, MAX_LINE_SIZE);
IgnoreSpaces(CommandLine, CharArrayCount(CommandLine));
printf("CommandLine without spaces before: '%s'", CommandLine);
BreakString(CommandLine, CharArrayCount(CLineLowerCase), CommandName,
CommandAction, SPACE_CHAR);
ToLowerCase(CommandName, CLineLowerCase, MAX_LINE_SIZE);
#if 0
// NOTE: Debug Lines
printf("CommandLine: %s\tCLineLowerCase: %s\nCommandAction: %s",CommandLine,
CLineLowerCase, CommandAction);
#endif
// TODO: Program still have some problems with parsing the input with spaces before command
if(CompareStrings(CLineLowerCase, "setprojectname", sizeof("setprojectname")) == 0)
{
if (IS_EMPTY_STRING(CommandAction))
{
printf("\nAction for command '%s' not found\n Usage:\t'%s [Project Name]'\n",
CLineLowerCase, CLineLowerCase);
}
TreeRootDirectory = TreeDirectoryCreate(CommandAction);
TreeActualDirectory = TreeRootDirectory;
StringCopy(PathToPrepend, CommandAction, CharArrayCount(CommandAction));
AppendString(PathToPrepend, "/");
ProjectAssigned = true;
}
else if(CompareStrings(CLineLowerCase, "createdir", sizeof("createdir")) == 0)
{
char ActualPath[MAX_PATH_SIZE];
StringCopy(ActualPath, PathToPrepend, CharArrayCount(PathToPrepend));
if (ProjectAssigned && !IS_EMPTY_STRING(CommandAction))
{
// TODO: Parse if the directory name is valid
// TODO: Prevent PathToPrepend to grow
AppendString(PathToPrepend, CommandAction);
AppendString(PathToPrepend, "/");
// TODO: Virtual file system structured in a tree
tree_directory *TreeDirectory = TreeDirectoryCreate(ActualPath);
// NOTE: More debug lines
printf("Path: %s", ActualPath);
printf("Path2: %s", TreeDirectory->PathName);
TreeDirectoryAddNode(TreeActualDirectory, TreeDirectory);
}
else if (!ProjectAssigned)
{
// TODO: logging system
}
else if (IS_EMPTY_STRING(CommandAction))
{
// TODO: Logging system
}
StringCopy(PathToPrepend, ActualPath, CharArrayCount(ActualPath));
}
// TODO: Not sure how to do pathfinder right now!
else if(CompareStrings(CLineLowerCase, "setdir", sizeof("setdir")) == 0)
{
char *DirName = CommandAction;
if (!IS_EMPTY_STRING(CommandAction))
{
if (TreeDirSearchBrother(TreeActualDirectory, DirName))
{
AppendString(PathToPrepend, CommandAction);
AppendString(PathToPrepend, "/");
TreeDirGoToDirectory(TreeActualDirectory, DirName);
}
}
}
else if(CompareStrings(CLineLowerCase, "saveconfig", sizeof("saveconfig")) == 0)
{
// TODO: Save settings to a file, that can be evoked lately, or in any other
// instance of the program
}
else if(CompareStrings(CLineLowerCase, "exit", sizeof("exit")) == 0)
{
Running = false;
}
else
{
printf("\nCommand not found. Type '-h' for help. Command 'exit' is self explanatory.\n");
}
}
return 0;
}
BOOL
apxJavaLoadMainClass(APXHANDLE hJava, LPCSTR szClassName,
LPCSTR szMethodName,
LPCVOID lpArguments)
{
LPWSTR *lpArgs = NULL;
DWORD nArgs;
LPAPXJAVAVM lpJava;
jclass jClazz;
LPCSTR szSignature = "([Ljava/lang/String;)V";
if (hJava->dwType != APXHANDLE_TYPE_JVM)
return FALSE;
lpJava = APXHANDLE_DATA(hJava);
if (!lpJava)
return FALSE;
if (IS_EMPTY_STRING(szMethodName))
szMethodName = "main";
if (lstrcmpA(szClassName, "java/lang/System") == 0) {
/* Usable only for exit method, so force */
szSignature = "(I)V";
szMethodName = "exit";
}
lstrlcpyA(lpJava->clWorker.sClazz, 1024, szClassName);
lstrlcpyA(lpJava->clWorker.sMethod, 512, szMethodName);
jClazz = JNICALL_1(FindClass, JAVA_CLASSSTRING);
if (!jClazz) {
JVM_EXCEPTION_CLEAR(lpJava);
apxLogWrite(APXLOG_MARK_ERROR "FindClass " JAVA_CLASSSTRING " failed");
return FALSE;
}
lpJava->clString.jClazz = JNICALL_1(NewGlobalRef, jClazz);
JNI_LOCAL_UNREF(jClazz);
/* Find the class */
jClazz = JNICALL_1(FindClass, szClassName);
if (!jClazz) {
JVM_EXCEPTION_CLEAR(lpJava);
apxLogWrite(APXLOG_MARK_ERROR "FindClass %s failed", szClassName);
return FALSE;
}
/* Make the class global so that worker thread can attach */
lpJava->clWorker.jClazz = JNICALL_1(NewGlobalRef, jClazz);
JNI_LOCAL_UNREF(jClazz);
lpJava->clWorker.jMethod = JNICALL_3(GetStaticMethodID,
lpJava->clWorker.jClazz,
szMethodName, szSignature);
if (!lpJava->clWorker.jMethod) {
JVM_EXCEPTION_CLEAR(lpJava);
apxLogWrite(APXLOG_MARK_ERROR "Method 'static void %s(String[])' not found in Class %s",
szMethodName, szClassName);
return FALSE;
}
if (lstrcmpA(szClassName, "java/lang/System")) {
nArgs = apxMultiSzToArrayW(hJava->hPool, lpArguments, &lpArgs);
lpJava->clWorker.jArgs = JNICALL_3(NewObjectArray, nArgs,
lpJava->clString.jClazz, NULL);
if (nArgs) {
DWORD i;
for (i = 0; i < nArgs; i++) {
jstring arg = JNICALL_2(NewString, lpArgs[i], lstrlenW(lpArgs[i]));
JNICALL_3(SetObjectArrayElement, lpJava->clWorker.jArgs, i, arg);
apxLogWrite(APXLOG_MARK_DEBUG "argv[%d] = %S", i, lpArgs[i]);
}
}
apxFree(lpArgs);
}
return TRUE;
}
void process_data(Logfile *logfilep, Hashtable **hash,
Arraydata **arraydata, choice *count, choice *code2type,
choice datacols[ITEM_NUMBER][OUTCOME_NUMBER][DATACOLS_NUMBER][2],
choice data2cols[ITEM_NUMBER][DATA_NUMBER],
unsigned int *no_cols, Include **wanthead,
Include *ispagehead, Alias **aliashead, Include *argshead,
Include *refargshead, Dateman *dman, Tree **tree,
Derv **derv, choice *alltrees, choice *alldervs,
choice *lowmem, logical case_insensitive,
logical usercase_insensitive, unsigned char convfloor,
logical multibyte, char *dirsuffix,
unsigned int dirsufflength, unsigned int granularity) {
extern unsigned int year, month, date, hour, minute, code;
extern unsigned long unixtime, proctime;
extern char am;
extern double bytes;
extern Memman mm[], mmq, mms, *amemman;
extern choice *rep2type;
extern Hashentry *unwanted_entry, *blank_entry;
extern Hashindex *dummy_item;
static Hashindex *gp[ITEM_NUMBER];
unsigned long data[DATA2_NUMBER];
Hashentry *item[ITEM_NUMBER];
logical wanttree[ITEM_NUMBER];
logical isitpage, last7;
choice ispage = UNSET;
choice wanted = TRUE, rc, outcome;
timecode_t timecode = FIRST_TIME;
char *name, *namestart, *nameend;
size_t len;
choice i, j, k;
/*** check whether this line is wanted ***/
if (count[INP_CODE] != 0) {
if (code == IGNORE_CODE) {
for (j = 0; j < ITEM_NUMBER; j++) { /* reset strings */
if (count[j] != 0)
mm[j].next_pos = mm[j].curr_pos;
}
mmq.next_pos = mmq.curr_pos;
mms.next_pos = mms.curr_pos;
logfilep->data[LOGDATA_UNKNOWN]++;
return;
}
else if (code2type[code] == UNWANTED)
wanted = FALSE;
}
if (wanted && count[INP_DATE] > 0) {
if (count[INP_UNIXTIME])
wanted = wantunixtime(&timecode, dman, unixtime, logfilep->tz);
else {
if (count[INP_AM]) {
if (hour > 12) {
corrupt_line(logfilep, "Hour greater than 12", -1);
return;
}
else if (hour == 12)
hour = 0;
if (am == 'p')
hour += 12;
}
wanted = wantdate(&timecode, dman, hour, minute, date, month, year,
logfilep->tz);
}
if (wanted == ERR) { /* corrupt date */
corrupt_line(logfilep, "Corrupt date or time", -1);
return;
}
} /* end count[INP_DATE] > 0 */
for (i = 0; i < ITEM_NUMBER; i++) {
wanttree[i] = FALSE;
if (!wanted) {
for (j = i; j < ITEM_NUMBER; j++) { /* reset not-yet-hashed strings */
if (count[j] != 0) /* NB i is now (unwanted i) + 1 */
mm[j].next_pos = mm[j].curr_pos;
}
mmq.next_pos = mmq.curr_pos;
mms.next_pos = mms.curr_pos;
logfilep->data[LOGDATA_UNWANTED]++;
return;
}
if (i == ITEM_HOST)
prealiasS(&(mm[ITEM_HOST]), &mms);
name = (char *)(mm[i].curr_pos);
if (count[i] == 0 || IS_EMPTY_STRING(name) ||
(name[0] == '-' && name[1] == '\0')) {
item[i] = blank_entry; /* or unwanted_; but we get wanted right anyway */
wanted = (wanthead[i] == NULL || included("", FALSE, wanthead[i]));
/* wanthead[i] == NULL is tested again in included() but it often saves
a call to that function, because blankness is common. */
}
else {
if (i == ITEM_FILE || i == ITEM_REFERRER) {
if ((j = prealias(&(mm[i]), &(mm[ITEM_VHOST]), item[ITEM_VHOST], &mmq,
(logical)((i == ITEM_FILE)?case_insensitive:FALSE),
(i == ITEM_FILE)?(logfilep->prefix):NULL,
logfilep->prefixlen, logfilep->pvpos,
(i == ITEM_FILE)?argshead:refargshead)) < 0) {
if (j == -1)
corrupt_line(logfilep,
"%v in file prefix but no VHOST in line", -1);
else
corrupt_line(logfilep, "Filename too long", -1);
return;
}
}
if (lowmem[i] == 0) {
if (gp[i] == NULL || !STREQ(name, gp[i]->name)) {
gp[i] = hashfind(&mm[i], &(hash[i]), no_cols[i], wanthead[i], UNSET,
ispagehead, aliashead[i], dirsuffix, dirsufflength,
usercase_insensitive, 0, FALSE, i, FALSE);
} /* if name the same as last time, don't need */
else /* to hashfind again, or save the name */
mm[i].next_pos = mm[i].curr_pos;
item[i] = (Hashentry *)(gp[i]->other);
wanted = (choice)(ENTRY_WANTED(item[i]));
}
else if (lowmem[i] == 1) {
if ((rc = do_alias(name, amemman, aliashead[i], dirsuffix,
dirsufflength, usercase_insensitive, 0, FALSE, i))
== FALSE) {
item[i] = hashfind(&mm[i], &(hash[i]), no_cols[i], wanthead[i],
UNSET, ispagehead, NULL, dirsuffix, dirsufflength,
usercase_insensitive, 0, FALSE, i, TRUE)->own;
}
else if (rc == TRUE) {
mm[i].next_pos = mm[i].curr_pos; /* don't save string */
item[i] = hashfind(amemman, &(hash[i]), no_cols[i], wanthead[i],
UNSET, ispagehead, NULL, dirsuffix, dirsufflength,
usercase_insensitive, 0, FALSE, i, TRUE)->own;
}
else { /* rc == ERR */
mm[i].next_pos = mm[i].curr_pos;
if (included("", FALSE, wanthead[i]))
item[i] = blank_entry;
else
item[i] = unwanted_entry;
}
wanted = (choice)(ENTRY_WANTED(item[i]));
}
else { /* lowmem[i] >= 2 */
if ((rc = do_alias(name, amemman, aliashead[i], dirsuffix,
dirsufflength, usercase_insensitive, 0, FALSE, i))
== TRUE) {
mm[i].next_pos = mm[i].curr_pos; /* don't save old string */
len = strlen((char *)(amemman->curr_pos));
memcpy(submalloc(&(mm[i]), len + 1), amemman->curr_pos, len + 1);
name = (char *)(mm[i].curr_pos); /* which might have changed */
amemman->next_pos = amemman->curr_pos;
}
if (rc == ERR) {
if (included("", FALSE, wanthead[i])) {
item[i] = blank_entry;
if (i == ITEM_FILE)
ispage = FALSE;
}
else
wanted = FALSE;
mm[i].next_pos = mm[i].curr_pos;
}
else {
isitpage = pageq(name, ispagehead, i);
if (i == ITEM_FILE)
ispage = (choice)isitpage;
if (included(name, isitpage, wanthead[i])) {
if (lowmem[i] == 2) {
item[i] = hashfind(&(mm[i]), &(hash[i]), no_cols[i], wanthead[i],
isitpage, ispagehead, NULL, dirsuffix,
dirsufflength, usercase_insensitive, 0, FALSE,
i, TRUE)->own;
}
else {
item[i] = blank_entry;
wanttree[i] = TRUE;
mm[i].next_pos = mm[i].curr_pos;
}
}
else {
wanted = FALSE;
mm[i].next_pos = mm[i].curr_pos;
}
}
} /* end lowmem[i] >= 2 */
}
} /* end for i */
if (!wanted) {
logfilep->data[LOGDATA_UNWANTED]++;
return;
}
/*** now add it to the hash tables ***/
/* add to logfile from and to if wanted, whatever status code */
if (timecode != FIRST_TIME)
logfilep->from = MIN(logfilep->from, timecode);
logfilep->to = MAX(logfilep->to, timecode);
last7 = (timecode > dman->last7from && timecode <= dman->last7to);
if (ispage == UNSET) /* NB blank_entry has ispage FALSE */
ispage = (choice)(item[ITEM_FILE]->ispage);
if (count[INP_BYTES] == 0)
bytes = 0;
if (count[INP_CODE] == 0) {
outcome = SUCCESS;
if (count[ITEM_FILE] == 2) {
logfilep->data[LOGDATA_SUCC]++;
logfilep->data[LOGDATA_SUCC7] += (unsigned long)last7;
logfilep->data[LOGDATA_PAGES] += (unsigned long)ispage;
logfilep->data[LOGDATA_PAGES7] +=
(unsigned long)((logical)ispage && last7);
}
else {
logfilep->data[LOGDATA_UNKNOWN]++;
logfilep->data[LOGDATA_UNKNOWN7] += (unsigned long)last7;
}
}
else if (code <= 199) {
outcome = INFO;
logfilep->data[LOGDATA_INFO]++;
logfilep->data[LOGDATA_INFO7] += (unsigned long)last7;
}
else switch (outcome = code2type[code]) {
case SUCCESS:
logfilep->data[LOGDATA_SUCC]++;
logfilep->data[LOGDATA_SUCC7] += (unsigned long)last7;
logfilep->data[LOGDATA_PAGES] += (unsigned long)ispage;
logfilep->data[LOGDATA_PAGES7] +=
(unsigned long)((logical)ispage && last7);
break;
case FAILURE:
logfilep->data[LOGDATA_FAIL]++;
logfilep->data[LOGDATA_FAIL7] += (unsigned long)last7;
break;
case REDIRECT:
logfilep->data[LOGDATA_REDIR]++;
logfilep->data[LOGDATA_REDIR7] += (unsigned long)last7;
break;
case INFO:
logfilep->data[LOGDATA_INFO]++;
logfilep->data[LOGDATA_INFO7] += (unsigned long)last7;
break;
}
/* NB any change in what to count when will require corresponding change to
end of strtoinfmt() and to fmt munching in correct() */
if (count[INP_CODE] == 2)
arrayscore(arraydata[REP_CODE - FIRST_ARRAYREP], code, 1,
(unsigned long)last7, 0, 0, 0., 0., timecode);
if (outcome != INFO) {
if (outcome == SUCCESS) {
if (count[INP_DATE] == 2) /* only if file present: see strtoinfmt() */
datehash(timecode, dman, 1, (unsigned long)ispage, bytes, granularity);
if (count[INP_BYTES] == 2) {
arrayscore(arraydata[REP_SIZE - FIRST_ARRAYREP], bytes, 1,
(unsigned long)last7, (unsigned long)ispage,
(unsigned long)((logical)ispage && last7), bytes,
last7?bytes:0., timecode);
logfilep->bytes += bytes;
if (last7)
logfilep->bytes7 += bytes;
}
if (count[INP_PROCTIME] == 2)
arrayscore(arraydata[REP_PROCTIME - FIRST_ARRAYREP], proctime, 1,
(unsigned long)last7, (unsigned long)ispage,
(unsigned long)((logical)ispage && last7), bytes,
last7?bytes:0., timecode);
if (alltrees[0] != REP_NUMBER || alldervs[0] != REP_NUMBER) {
/* for LOWMEM 3, run through alltrees then alldervs */
/* NB these (POSSTREE/POSSDERV in init.c) only count successes */
for (k = 0; k <= 1; k++) {
for (i = 0; (k?(alldervs[i]):(alltrees[i])) != REP_NUMBER; i++) {
j = rep2type[k?(alldervs[i]):(alltrees[i])];
if (wanttree[j]) {
dummy_item->name = mm[j].curr_pos;
/* mm.curr_pos is marked for deletion, but still intact at
present */
dummy_item->own->data[data2cols[j][REQUESTS]] = 1;
if (data2cols[j][REQUESTS7] >= 0) /* see comment in genrep() */
dummy_item->own->data[data2cols[j][REQUESTS7]] =
(unsigned long)last7;
if (data2cols[j][PAGES] >= 0)
dummy_item->own->data[data2cols[j][PAGES]] =
(unsigned long)ispage;
if (data2cols[j][PAGES7] >= 0)
dummy_item->own->data[data2cols[j][PAGES7]] =
(unsigned long)((logical)ispage && last7);
if (data2cols[j][SUCCDATE] >= 0)
dummy_item->own->data[data2cols[j][SUCCDATE]] = timecode;
if (data2cols[j][SUCCFIRSTD] >= 0)
dummy_item->own->data[data2cols[j][SUCCFIRSTD]] = timecode;
dummy_item->own->bytes = bytes;
dummy_item->own->bytes7 = last7?bytes:0.;
if (k)
makederived(derv[alldervs[i] - FIRST_DERVREP], dummy_item,
NULL, convfloor, multibyte, alldervs[i],
datacols[j], no_cols[j]);
else {
namestart = NULL;
tree[G(alltrees[i])]->cutfn(&namestart, &nameend,
dummy_item->name, FALSE);
(void)treefind(namestart, nameend,
&(tree[G(alltrees[i])]->tree), dummy_item,
tree[G(alltrees[i])]->cutfn, FALSE, TRUE, FALSE,
tree[G(alltrees[i])]->space, datacols[j],
no_cols[j]);
}
}
}
}
} /* there are trees or dervs */
} /* outcome == SUCCESS */
data[REQUESTS2] = 1;
data[REQUESTS72] = (unsigned long)last7;
data[PAGES2] = (unsigned long)ispage;
data[PAGES72] = (unsigned long)((logical)ispage && last7);
data[DATE2] = timecode;
data[FIRSTD2] = timecode;
for (i = 0; i < ITEM_NUMBER; i++) {
if (count[i] == 2 && !ENTRY_BLANK(item[i]))
hashscore(item[i], data, datacols[i][outcome], outcome, bytes);
}
} /* end if outcome != INFO */
}
CmsRet cmsNet_subnetIp6SitePrefix(const char *sp, UINT8 subnetId, UINT32 snPlen, char *snPrefix)
{
char prefix[CMS_IPADDR_LENGTH];
char address[CMS_IPADDR_LENGTH];
UINT32 plen;
struct in6_addr in6Addr;
CmsRet ret;
if (snPrefix == NULL)
{
cmsLog_error("snPrefix is NULL.");
return CMSRET_INVALID_ARGUMENTS;
}
*snPrefix = '\0';
if (IS_EMPTY_STRING(sp))
{
cmsLog_error("sp is empty. do nothing.");
return CMSRET_SUCCESS;
}
//<< [CTFN-IPV6-001] Sheng-Bo: Support IPv6 prefix length up to 64 and IPv6 prefix length relay, 2011/05/05
#if 0
/* set a limitation to subnet prefix length to be at 8 bit boundary */
if (snPlen % 8)
{
cmsLog_error("snPlen is not at 8 bit boundary. snPlen=%d", snPlen);
return CMSRET_INVALID_ARGUMENTS;
}
#endif
//>> [CTFN-IPV6-001] End
if ((ret = cmsUtl_parsePrefixAddress(sp, address, &plen)) != CMSRET_SUCCESS)
{
cmsLog_error("cmsUtl_parsePrefixAddress returns error. ret=%d", ret);
return CMSRET_INVALID_ARGUMENTS;
}
//<< [CTFN-IPV6-001] Sheng-Bo: Support IPv6 prefix length up to 64 and IPv6 prefix length relay, 2011/05/05
printf("@@@ plen=%d snPlen=%d subnetId=%d address=%s\n", plen, snPlen, subnetId, address);//jojopo
fflush(stdout);
#if 0
if ((snPlen < plen) || (subnetId >= (1<<(snPlen-plen))))
{
cmsLog_error("plen=%d snPlen=%d subnetId=%d", plen, snPlen, subnetId);
return CMSRET_INVALID_ARGUMENTS;
}
#endif
//>> [CTFN-IPV6-001] End
if ((ret = cmsUtl_getAddrPrefix(address, plen, prefix)) != CMSRET_SUCCESS)
{
cmsLog_error("cmsUtl_getAddrPrefix returns error. ret=%d", ret);
return ret;
}
if (inet_pton(AF_INET6, prefix, &in6Addr) <= 0)
{
cmsLog_error("inet_pton returns error");
return CMSRET_INVALID_ARGUMENTS;
}
/* subnet the site prefix */
in6Addr.s6_addr[(snPlen-1)/8] |= subnetId;
if (inet_ntop(AF_INET6, &in6Addr, snPrefix, CMS_IPADDR_LENGTH) == NULL)
{
cmsLog_error("inet_ntop returns error");
return CMSRET_INTERNAL_ERROR;
}
return CMSRET_SUCCESS;
} /* cmsNet_subnetIp6SitePrefix() */
