1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
|
#include <byte.h>
#include "ldap.h"
#include <stdlib.h>
/*
Filter ::= CHOICE {
and [0] SET OF Filter,
or [1] SET OF Filter,
not [2] Filter,
equalityMatch [3] AttributeValueAssertion,
substrings [4] SubstringFilter,
greaterOrEqual [5] AttributeValueAssertion,
lessOrEqual [6] AttributeValueAssertion,
present [7] AttributeDescription,
approxMatch [8] AttributeValueAssertion,
extensibleMatch [9] MatchingRuleAssertion }
*/
size_t fmt_ldapsubstring(char* dest,const struct Substring* s) {
size_t sum=0,tmp=0;
while (s) {
tmp=fmt_asn1string(dest,PRIVATE,PRIMITIVE,s->substrtype,s->s.s,s->s.l);
if (dest) dest+=tmp;
sum+=tmp;
s=s->next;
}
return sum;
}
size_t fmt_ldapsearchfilter(char* dest,const struct Filter* f) {
size_t sum=0,tmp,savesum;
if (!f)
return 0;
switch (f->type) {
case AND: case OR: case NOT:
sum=fmt_ldapsearchfilter(dest,f->x); break;
case EQUAL: case GREATEQUAL: case LESSEQUAL: case APPROX:
sum=fmt_ldapava(dest,&f->ava); break;
case SUBSTRING:
{
char* nd=dest;
size_t l,tmp;
tmp=fmt_ldapsubstring(0,f->substrings);
l=fmt_ldapstring(nd,&f->ava.desc);
sum+=l; if (nd) nd+=l;
l=fmt_asn1SEQUENCE(nd,tmp);
sum+=l; if (nd) nd+=l;
l=fmt_ldapsubstring(nd,f->substrings);
sum+=l;
}
break;
case PRESENT:
sum=fmt_asn1string(dest,PRIVATE,PRIMITIVE,(enum asn1_tag)f->type,f->ava.desc.s,f->ava.desc.l);
break;
default: return 0;
}
savesum=sum;
if(f->next) {
if (dest) sum+=fmt_ldapsearchfilter(dest+sum,f->next);
else sum+=fmt_ldapsearchfilter(dest,f->next);
}
if (f->type == PRESENT) return sum;
tmp=fmt_asn1length(0,savesum);
if (!dest) return sum+tmp+1;
if (dest) byte_copyr(dest+tmp+1,sum,dest);
fmt_asn1tag(dest,PRIVATE,CONSTRUCTED,f->type);
fmt_asn1length(dest+1,savesum);
return sum+tmp+1;
}
|
