Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
O
OpenLDAP
Manage
Activity
Members
Labels
Plan
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Locked files
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package registry
Container registry
Model registry
Operate
Environments
Terraform modules
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Code review analytics
Insights
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Christopher Ng
OpenLDAP
Commits
19c1c6d6
Commit
19c1c6d6
authored
19 years ago
by
Pierangelo Masarati
Browse files
Options
Downloads
Patches
Plain Diff
some (stupid) editors complain because 'new' is a reserved word in C++
parent
5e84975a
Branches
Branches containing commit
Tags
Tags containing commit
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
libraries/libldap/result.c
+32
-29
32 additions, 29 deletions
libraries/libldap/result.c
with
32 additions
and
29 deletions
libraries/libldap/result.c
+
32
−
29
View file @
19c1c6d6
...
...
@@ -386,7 +386,7 @@ try_read1msg(
LDAPMessage
**
result
)
{
BerElement
*
ber
;
LDAPMessage
*
new
,
*
l
,
*
prev
;
LDAPMessage
*
new
msg
,
*
l
,
*
prev
;
ber_int_t
id
;
ber_tag_t
tag
;
ber_len_t
len
;
...
...
@@ -396,10 +396,12 @@ try_read1msg(
BerElement
tmpber
;
int
rc
,
refer_cnt
,
hadref
,
simple_request
;
ber_int_t
lderr
;
#ifdef LDAP_CONNECTIONLESS
LDAPMessage
*
tmp
,
*
chain_head
;
LDAPMessage
*
tmp
=
NULL
,
*
chain_head
=
NULL
;
int
firstmsg
=
1
,
moremsgs
=
0
,
isv2
=
0
;
#endif
/*
* v3ref = flag for V3 referral / search reference
* 0 = not a ref, 1 = sucessfully chased ref, -1 = pass ref to application
...
...
@@ -725,14 +727,14 @@ lr->lr_res_matched ? lr->lr_res_matched : "" );
}
/* make a new ldap message */
if
(
(
new
=
(
LDAPMessage
*
)
LDAP_CALLOC
(
1
,
sizeof
(
LDAPMessage
)
)
)
==
NULL
)
{
new
msg
=
(
LDAPMessage
*
)
LDAP_CALLOC
(
1
,
sizeof
(
LDAPMessage
)
)
;
if
(
newmsg
==
NULL
)
{
ld
->
ld_errno
=
LDAP_NO_MEMORY
;
return
(
-
1
);
}
new
->
lm_msgid
=
(
int
)
id
;
new
->
lm_msgtype
=
tag
;
new
->
lm_ber
=
ber
;
new
msg
->
lm_msgid
=
(
int
)
id
;
new
msg
->
lm_msgtype
=
tag
;
new
msg
->
lm_ber
=
ber
;
#ifdef LDAP_CONNECTIONLESS
/* CLDAP replies all fit in a single datagram. In LDAPv2 RFC1798
...
...
@@ -781,15 +783,16 @@ lr->lr_res_matched ? lr->lr_res_matched : "" );
/* set up response chain */
if
(
firstmsg
)
{
firstmsg
=
0
;
new
->
lm_next
=
ld
->
ld_responses
;
ld
->
ld_responses
=
new
;
new
->
lm_chain_tail
=
new
;
chain_head
=
new
;
new
msg
->
lm_next
=
ld
->
ld_responses
;
ld
->
ld_responses
=
new
msg
;
new
msg
->
lm_chain_tail
=
new
msg
;
chain_head
=
new
msg
;
}
else
{
tmp
->
lm_chain
=
new
;
assert
(
tmp
!=
NULL
);
tmp
->
lm_chain
=
newmsg
;
chain_head
->
lm_chain_tail
=
tmp
;
}
tmp
=
new
;
tmp
=
new
msg
;
/* "ok" means there's more to parse */
if
(
ok
)
{
if
(
isv2
)
goto
nextresp2
;
...
...
@@ -808,25 +811,25 @@ lr->lr_res_matched ? lr->lr_res_matched : "" );
* stick the result onto the end of the chain, and then pull the
* first response off the head of the chain.
*/
tmp
->
lm_chain
=
new
;
tmp
->
lm_chain
=
new
msg
;
chain_head
->
lm_chain_tail
=
tmp
;
*
result
=
chkResponseList
(
ld
,
msgid
,
all
);
ld
->
ld_errno
=
LDAP_SUCCESS
;
return
(
(
*
result
)
->
lm_msgtype
);
}
}
#endif
#endif
/* LDAP_CONNECTIONLESS */
/* is this the one we're looking for? */
if
(
msgid
==
LDAP_RES_ANY
||
id
==
msgid
)
{
if
(
all
==
LDAP_MSG_ONE
||
(
new
->
lm_msgtype
!=
LDAP_RES_SEARCH_RESULT
&&
new
->
lm_msgtype
!=
LDAP_RES_SEARCH_ENTRY
&&
new
->
lm_msgtype
!=
LDAP_RES_SEARCH_REFERENCE
)
)
{
*
result
=
new
;
||
(
new
msg
->
lm_msgtype
!=
LDAP_RES_SEARCH_RESULT
&&
new
msg
->
lm_msgtype
!=
LDAP_RES_SEARCH_ENTRY
&&
new
msg
->
lm_msgtype
!=
LDAP_RES_SEARCH_REFERENCE
)
)
{
*
result
=
new
msg
;
ld
->
ld_errno
=
LDAP_SUCCESS
;
return
(
tag
);
}
else
if
(
new
->
lm_msgtype
==
LDAP_RES_SEARCH_RESULT
)
{
}
else
if
(
new
msg
->
lm_msgtype
==
LDAP_RES_SEARCH_RESULT
)
{
foundit
=
1
;
/* return the chain later */
}
}
...
...
@@ -839,7 +842,7 @@ lr->lr_res_matched ? lr->lr_res_matched : "" );
prev
=
NULL
;
for
(
l
=
ld
->
ld_responses
;
l
!=
NULL
;
l
=
l
->
lm_next
)
{
if
(
l
->
lm_msgid
==
new
->
lm_msgid
)
if
(
l
->
lm_msgid
==
new
msg
->
lm_msgid
)
break
;
prev
=
l
;
}
...
...
@@ -847,23 +850,23 @@ lr->lr_res_matched ? lr->lr_res_matched : "" );
/* not part of an existing search response */
if
(
l
==
NULL
)
{
if
(
foundit
)
{
*
result
=
new
;
*
result
=
new
msg
;
goto
exit
;
}
new
->
lm_next
=
ld
->
ld_responses
;
ld
->
ld_responses
=
new
;
new
->
lm_chain_tail
=
new
;
new
msg
->
lm_next
=
ld
->
ld_responses
;
ld
->
ld_responses
=
new
msg
;
new
msg
->
lm_chain_tail
=
new
msg
;
goto
exit
;
}
Debug
(
LDAP_DEBUG_TRACE
,
"adding response id %ld type %ld:
\n
"
,
(
long
)
new
->
lm_msgid
,
(
long
)
new
->
lm_msgtype
,
0
);
(
long
)
new
msg
->
lm_msgid
,
(
long
)
new
msg
->
lm_msgtype
,
0
);
/* part of a search response - add to end of list of entries */
if
(
l
->
lm_chain
==
NULL
)
{
assert
(
l
->
lm_chain_tail
==
l
);
l
->
lm_chain
=
new
;
l
->
lm_chain
=
new
msg
;
}
else
{
assert
(
l
->
lm_chain_tail
);
assert
(
l
->
lm_chain_tail
->
lm_chain
);
...
...
@@ -873,11 +876,11 @@ lr->lr_res_matched ? lr->lr_res_matched : "" );
==
LDAP_RES_SEARCH_REFERENCE
)
||
(
l
->
lm_chain_tail
->
lm_chain
->
lm_msgtype
==
LDAP_RES_INTERMEDIATE
))
{
l
->
lm_chain_tail
->
lm_chain
->
lm_chain
=
new
;
l
->
lm_chain_tail
->
lm_chain
->
lm_chain
=
new
msg
;
l
->
lm_chain_tail
=
l
->
lm_chain_tail
->
lm_chain
;
}
else
{
/*FIXME: ldap_msgfree( l->lm_chain_tail->lm_chain );*/
l
->
lm_chain_tail
->
lm_chain
=
new
;
l
->
lm_chain_tail
->
lm_chain
=
new
msg
;
}
}
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment