/*=========================================================================*/
int SLPDDatabaseFindSrv(SLPSrvRqst* srvrqst,
SLPDDatabaseSrvUrl* result,
int count)
/* Find services in the database */
/* */
/* srvrqst (IN) the request to find. */
/* */
/* result (OUT) pointer to an array of result structures that receives */
/* results */
/* */
/* count (IN) number of elements in the result array */
/* */
/* Returns - The number of services found or < 0 on error. If the number */
/* of services found is exactly equal to the number of elements */
/* in the array, the call may be repeated with a larger array. */
/*=========================================================================*/
{
SLPDDatabaseEntry* entry;
int found;
#ifdef USE_PREDICATES
/* Tricky: perform an in place null termination of the predicate string */
/* Remember this squishes the high byte of spilistlen which is */
/* not a problem because it was already copied */
if(srvrqst->predicate)
{
((char*)srvrqst->predicate)[srvrqst->predicatelen] = 0;
}
#endif
/*---------------*/
/* Test services */
/*---------------*/
found = 0;
entry = (SLPDDatabaseEntry*)G_DatabaseList.head;
while(entry)
{
if(SLPCompareSrvType(srvrqst->srvtypelen,
srvrqst->srvtype,
entry->srvtypelen,
entry->srvtype) == 0)
{
if(SLPIntersectStringList(srvrqst->scopelistlen,
srvrqst->scopelist,
entry->scopelistlen,
entry->scopelist))
{
#ifdef USE_PREDICATES
if(srvrqst->predicate &&
entry->attr &&
SLPDPredicateTest(srvrqst->predicatever,
srvrqst->predicate, entry->attr) == 0)
#endif
{
result[found].lifetime = entry->lifetime;
result[found].urllen = entry->urllen;
result[found].url = entry->url;
found ++;
if(found >= count)
{
break;
}
}
}
}
entry = (SLPDDatabaseEntry*)entry->listitem.next;
}
return found;
}
void test_predicate() {
char *str;
int ierr;
SLPAttributes slp_attr;
SLPError err;
/******************** Test int stuff. *********************/
err = SLPAttrAlloc("en", NULL, SLP_FALSE, &slp_attr);
assert(err == SLP_OK);
SLPAttrSet_int(slp_attr, "int", (int)23, SLP_ADD);
SLPAttrSet_int(slp_attr, "int", (int)25, SLP_ADD);
SLPAttrSet_int(slp_attr, "int", (int)27, SLP_ADD);
/* Test equals. */
str = "(&(&(int=23)(int=25))(int=26))";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0); /* False. */
str = "(&(&(int=24)(int=25))(int=26))";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0); /* False. */
str = "(&(&(int=24)(int=28))(int=26))";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0); /* False. */
str = "(&(&(int=23)(int=25))(int=27))";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* True. */
/* Test greater. */
str = "(int>=29)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0); /* f. */
str = "(int>=26)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* T. */
str = "(int>=24)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t. */
str = "(int>=22)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t. */
/* Test lesser. */
str = "(int<=22)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0); /* f */
str = "(int<=23)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
SLPAttrFree(slp_attr);
/* Simple equality. */
err = SLPAttrAllocStr("en", NULL, SLP_FALSE, &slp_attr, "(a=1)");
assert(err == SLP_OK);
str = "(a=1)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
SLPAttrFree(slp_attr);
/******************** Test opaque stuff. *********************/
err = SLPAttrAlloc("en", NULL, SLP_FALSE, &slp_attr);
assert(err == SLP_OK);
err = SLPAttrSet_str(slp_attr, "op", "\\00\\12\\24\\36", SLP_REPLACE);
assert(err == SLP_OK);
/* Test less (single-valued). */
str = "(op<=\\00\\12\\10\\43)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0); /* f */
str = "(op<=\\00\\12\\24\\36)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
str = "(op<=\\00\\12\\24\\36\\12)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
str = "(op>=\\00\\12\\24\\36)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
SLPAttrFree(slp_attr);
/******************** Test string stuff. *********************/
err = SLPAttrAlloc("en", NULL, SLP_FALSE, &slp_attr);
assert(err == SLP_OK);
err = SLPAttrSet_str(slp_attr, "str", "string", SLP_REPLACE);
assert(err == SLP_OK);
/* Test less (single-valued). */
str = "(str<=a)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0); /* f */
str = "(str<=string)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
str = "(str<=strinx)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
/* Test greater (single-valued). */
str = "(str>=a)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
str = "(str>=string)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
str = "(str>=strinx)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0); /* f */
/* Test equal (single valued). */
str = "(str=a)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0); /* f */
str = "(str=*ing)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
str = "(str=stri*)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
str = "(str=*tri*)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
str = "(str=\\73*)"; /* s* */
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
str = "(str=\\73\\74\\72\\69*)"; /* stri* */
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
str = "(str=*\\73\\74\\72\\69*)"; /* *stri* */
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
str = "(str=s*t*r*i*n*g)"; /* s*t*r*i* */
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
str = "(str=s*t*r*i*ng)"; /* s*t*r*i* */
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
str = "(str=\\73\\74\\72\\69ng)"; /* s*t*r*i* */
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
str = "(str=s*tring)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
str = "(str=\\73*\\74ring)"; /* s*t*r*i* */
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
/* TODO Test escaped '*'s. */
/* TODO Test multivalued. */
SLPAttrFree(slp_attr);
/******************** Test boolean stuff. *********************/
err = SLPAttrAlloc("en", NULL, SLP_FALSE, &slp_attr);
assert(err == SLP_OK);
err = SLPAttrSet_bool(slp_attr, "bool", SLP_TRUE);
assert(err == SLP_OK);
/* Test equal. */
str = "(bool=true)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
str = "(bool=false)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0); /* f */
/* Test bad strings. */
str = "(bool=falsew)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0); /* f */
str = "(bool=*false)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0); /* f */
str = "(bool=truee)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0); /* f */
str = "(bool= true)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0); /* f */
SLPAttrFree(slp_attr);
/******************** Test keyword stuff. *********************/
err = SLPAttrAlloc("en", NULL, SLP_FALSE, &slp_attr);
assert(err == SLP_OK);
err = SLPAttrSet_keyw(slp_attr, "keyw");
assert(err == SLP_OK);
/* Test present. */
str = "(keyw=*)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
str = "(keyw=sd)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0); /* f */
str = "(keyw<=adf)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0); /* f */
SLPAttrFree(slp_attr);
/********************* Test boolean operators. *********************/
err = SLPAttrAlloc("en", NULL, SLP_FALSE, &slp_attr);
assert(err == SLP_OK);
err = SLPAttrSet_keyw(slp_attr, "keyw");
assert(err == SLP_OK);
str = "(keyw=*)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
/* Test not. */
str = "(!(keyw=*))";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0); /* f */
str = "(!(!(keyw=*)))";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
str = "(!(!(!(keyw=*))))";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0); /* f */
str = "(!(!(!(!(keyw=*)))))";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
/* Build up to testing binary ops. */
err = SLPAttrSet_bool(slp_attr, "bool", SLP_TRUE);
assert(err == SLP_OK);
/* Test and. */
str = "(&(keyw=*)(bool=true))";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
str = "(&(keyw=*)(bool=false))";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0); /* f */
str = "(&(keyw=*)(!(bool=false)))";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
str = "(&(keywx=*)(bool=true))";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0); /* f */
str = "(&(!(keywx=*))(bool=true))";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
str = "(&(lkeyw=*)(bool=false))";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0); /* f */
str = "(&(!(lkeyw=*))(!(bool=false)))";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
str = "(&(&(keyw=*)(bool=true))(&(keyw=*)(bool=true)))";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
str = "(&(&(!(keyw=*))(bool=true))(&(keyw=*)(bool=true)))";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0); /* f */
str = "(!(&(&(!(keyw=*))(bool=true))(&(keyw=*)(bool=true))))";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr == 0); /* t */
/* Test sytax errors. */
/* No preceeding bracket. */
str = "asdf=log";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr < 0);
/* No trailing bracket. */
str = "(asdf=log";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr < 0);
/* Unbalanced brackets. */
str = "(asdf=log))";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr < 0);
str = "((asdf=log)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr < 0);
/* Missing operators. */
str = "(asdflog)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr < 0);
/* Check that the leaf operator isn't causing the problem. */
str = "(asdflog=q)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0);
/* Missing logical unary. */
str = "((asdflog=q))";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr < 0);
/* Missing logical binary. */
str = "((asdflog=q)(asdflog=q))";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr < 0);
/* Missing operands and operator. */
str = "()";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr < 0);
/* Missing unary operands. */
str = "(!)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr < 0);
/* Missing binary operands. */
str = "(&)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr < 0);
/* Missing binary operands. */
str = "(=)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr < 0);
/* Missing binary operands. I _guess_ this is legal... */
str = "(thingy=)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > -1);
/* Trailing trash. */
str = "(&(a=b)(c=d))";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > -1);
/* Check that the following test will not be short circuited. */
str = "(a=b)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr > 0); /* f */
str = "(|(a=b)(c=d)w)";
ierr = SLPDPredicateTest( str, slp_attr);
assert(ierr < 0);
SLPAttrFree(slp_attr);
/* Check multiple (more than two) subexpressions. */
err = SLPAttrAlloc("en", NULL, SLP_FALSE, &slp_attr);
assert(err == SLP_OK);
err = SLPAttrSet_int(slp_attr, "x", 1, SLP_ADD);
assert(err == SLP_OK);
str = "(&(x=1)(!(x=1)))";
ierr = SLPDPredicateTest((SLPDPredicate)str, slp_attr);
assert(ierr > 0); /* f */
str = "(&(x=1))";
ierr = SLPDPredicateTest((SLPDPredicate)str, slp_attr);
assert(ierr == 0); /* t */
str = "(&(x=1)(x=1)(x=1))";
ierr = SLPDPredicateTest((SLPDPredicate)str, slp_attr);
assert(ierr == 0); /* t */
SLPAttrFree(slp_attr);
}
/*=========================================================================*/
int SLPDDatabaseSrvRqstStart(SLPMessage msg,
SLPDDatabaseSrvRqstResult** result)
/* Find services in the database */
/* */
/* msg (IN) the SrvRqst to find. */
/* */
/* result (OUT) pointer result structure */
/* */
/* Returns - Zero on success. Non-zero on failure */
/* */
/* Note: Caller must pass *result to SLPDDatabaseSrvRqstEnd() to free */
/*=========================================================================*/
{
SLPDatabaseHandle dh;
SLPDatabaseEntry* entry;
SLPSrvReg* entryreg;
SLPSrvRqst* srvrqst;
#ifdef ENABLE_SLPv2_SECURITY
int i;
#endif
/* start with the result set to NULL just to be safe */
*result = NULL;
dh = SLPDatabaseOpen(&G_SlpdDatabase.database);
if ( dh )
{
/* srvrqst is the SrvRqst being made */
srvrqst = &(msg->body.srvrqst);
while ( 1 )
{
/*-----------------------------------------------------------*/
/* Allocate result with generous array of url entry pointers */
/*-----------------------------------------------------------*/
*result = (SLPDDatabaseSrvRqstResult*) xrealloc(*result, sizeof(SLPDDatabaseSrvRqstResult) + (sizeof(SLPUrlEntry*) * G_SlpdDatabase.urlcount));
if ( *result == NULL )
{
/* out of memory */
SLPDatabaseClose(dh);
return SLP_ERROR_INTERNAL_ERROR;
}
(*result)->urlarray = (SLPUrlEntry**)((*result) + 1);
(*result)->urlcount = 0;
(*result)->reserved = dh;
/*-------------------------------------------------*/
/* Rewind enumeration in case we had to reallocate */
/*-------------------------------------------------*/
SLPDatabaseRewind(dh);
/*-----------------------------------------*/
/* Check to see if there is matching entry */
/*-----------------------------------------*/
while ( 1 )
{
entry = SLPDatabaseEnum(dh);
if ( entry == NULL )
{
/* This is the only successful way out */
return 0;
}
/* entry reg is the SrvReg message from the database */
entryreg = &(entry->msg->body.srvreg);
/* check the service type */
if ( SLPCompareSrvType(srvrqst->srvtypelen,
srvrqst->srvtype,
entryreg->srvtypelen,
entryreg->srvtype) == 0 &&
SLPIntersectStringList(entryreg->scopelistlen,
entryreg->scopelist,
srvrqst->scopelistlen,
srvrqst->scopelist) > 0 )
{
#ifdef ENABLE_PREDICATES
if ( SLPDPredicateTest(msg->header.version,
entryreg->attrlistlen,
entryreg->attrlist,
srvrqst->predicatelen,
srvrqst->predicate) )
#endif
{
#ifdef ENABLE_SLPv2_SECURITY
if ( srvrqst->spistrlen )
{
for ( i=0; i< entryreg->urlentry.authcount;i++ )
{
if ( SLPCompareString(srvrqst->spistrlen,
srvrqst->spistr,
entryreg->urlentry.autharray[i].spistrlen,
entryreg->urlentry.autharray[i].spistr) == 0 )
{
break;
}
}
if ( i == entryreg->urlentry.authcount )
{
continue;
}
}
#endif
if ( (*result)->urlcount + 1 > G_SlpdDatabase.urlcount )
{
/* Oops we did not allocate a big enough result */
G_SlpdDatabase.urlcount *= 2;
break;
}
(*result)->urlarray[(*result)->urlcount] = &(entryreg->urlentry);
(*result)->urlcount ++;
}
}
}
}
}
return 0;
}
