/* 

   Unix SMB/CIFS implementation.

   ildap api - an api similar to the traditional ldap api

   Copyright (C) Andrew Tridgell  2005

   This program is free software; you can redistribute it and/or modify

   it under the terms of the GNU General Public License as published by

   the Free Software Foundation; either version 3 of the License, or

   (at your option) any later version.

   This program is distributed in the hope that it will be useful,

   but WITHOUT ANY WARRANTY; without even the implied warranty of

   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

   GNU General Public License for more details.

   You should have received a copy of the GNU General Public License

   along with this program.  If not, see <http://www.gnu.org/licenses/>.

*/

#include "includes.h"

#include "libcli/ldap/libcli_ldap.h"

#include "libcli/ldap/ldap_client.h"

/*

  count the returned search entries

*/

_PUBLIC_ int ildap_count_entries(struct ldap_connection *conn, struct ldap_message **res)

{

  int i;

  for (i=0;res && res[i];i++) /* noop */ ;

  return i;

}

/*

  perform a synchronous ldap search

*/

_PUBLIC_ NTSTATUS ildap_search_bytree(struct ldap_connection *conn, const char *basedn, 

           int scope, struct ldb_parse_tree *tree,

           const char * const *attrs, bool attributesonly, 

           struct ldb_control **control_req,

           struct ldb_control ***control_res,

           struct ldap_message ***results)

{

  struct ldap_message *msg;

  int n, i;

  NTSTATUS status;

  struct ldap_request *req;

  if (control_res)

    *control_res = NULL;

  *results = NULL;

  msg = new_ldap_message(conn);

  NT_STATUS_HAVE_NO_MEMORY(msg);

  for (n=0;attrs && attrs[n];n++) /* noop */ ;

  msg->type = LDAP_TAG_SearchRequest;

  msg->r.SearchRequest.basedn = basedn;

  msg->r.SearchRequest.scope  = scope;

  msg->r.SearchRequest.deref  = LDAP_DEREFERENCE_NEVER;

  msg->r.SearchRequest.timelimit = 0;

  msg->r.SearchRequest.sizelimit = 0;

  msg->r.SearchRequest.attributesonly = attributesonly;

  msg->r.SearchRequest.tree = tree;

  msg->r.SearchRequest.num_attributes = n;

  msg->r.SearchRequest.attributes = attrs;

  msg->controls = control_req;

  req = ldap_request_send(conn, msg);

  talloc_reparent(conn, msg, req);

  for (i=n=0;true;i++) {

    struct ldap_message *res;

    status = ldap_result_n(req, i, &res);

    if (!NT_STATUS_IS_OK(status)) break;

    if (res->type == LDAP_TAG_SearchResultDone) {

      status = ldap_check_response(conn, &res->r.GeneralResult);

      if (control_res) {

        *control_res = talloc_steal(conn, res->controls);

      }

      break;

    }

    if (res->type != LDAP_TAG_SearchResultEntry &&

        res->type != LDAP_TAG_SearchResultReference)

      continue;

    (*results) = talloc_realloc(conn, *results, struct ldap_message *, n+2);

    if (*results == NULL) {

      talloc_free(msg);

      return NT_STATUS_NO_MEMORY;

    }

    (*results)[n] = talloc_steal(*results, res);

    (*results)[n+1] = NULL;

    n++;

  }

  if (NT_STATUS_EQUAL(status, NT_STATUS_NO_MORE_ENTRIES)) {

    status = NT_STATUS_OK;

  }

  return status;

}

/*

  perform a ldap search

*/

_PUBLIC_ NTSTATUS ildap_search(struct ldap_connection *conn, const char *basedn, 

          int scope, const char *expression, 

          const char * const *attrs, bool attributesonly, 

          struct ldb_control **control_req,

          struct ldb_control ***control_res,

          struct ldap_message ***results)

{

  NTSTATUS status;

  struct ldb_parse_tree *tree = ldb_parse_tree(conn, expression);

  if (tree == NULL) {

    return NT_STATUS_INVALID_PARAMETER;

  }

  status = ildap_search_bytree(conn, basedn, scope, tree, attrs,

             attributesonly, control_req,

             control_res, results);

  talloc_free(tree);

  return status;

}