2008-03-06 02:52:37 +03:00
/*
Unix SMB / CIFS implementation .
Map SIDs to unixids .
Copyright ( C ) 2008 Kai Blin
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/composite/composite.h"
# include "winbind/wb_server.h"
# include "smbd/service_task.h"
struct sids2xids_state {
struct composite_context * ctx ;
struct wbsrv_service * service ;
2009-04-23 18:37:11 +04:00
struct id_map * ids ;
2008-03-06 02:52:37 +03:00
int count ;
} ;
struct composite_context * wb_sids2xids_send ( TALLOC_CTX * mem_ctx ,
struct wbsrv_service * service ,
2010-05-24 08:58:07 +04:00
unsigned int count , struct id_map * ids )
2008-03-06 02:52:37 +03:00
{
struct composite_context * result ;
struct sids2xids_state * state ;
2010-05-24 08:58:07 +04:00
struct id_map * * pointer_array ;
unsigned int i ;
2008-03-06 02:52:37 +03:00
DEBUG ( 5 , ( " wb_sids2xids_send called \n " ) ) ;
result = composite_create ( mem_ctx , service - > task - > event_ctx ) ;
if ( ! result ) return NULL ;
state = talloc ( result , struct sids2xids_state ) ;
if ( composite_nomem ( state , result ) ) return result ;
state - > ctx = result ;
result - > private_data = state ;
state - > service = service ;
state - > count = count ;
state - > ids = ids ;
2010-05-24 08:58:07 +04:00
/* We need to convert between calling conventions here - the
* values are filled in by reference , so we just need to
* provide pointers to them */
pointer_array = talloc_array ( state , struct id_map * , count + 1 ) ;
if ( composite_nomem ( pointer_array , result ) ) return result ;
for ( i = 0 ; i < count ; i + + ) {
pointer_array [ i ] = & ids [ i ] ;
}
pointer_array [ i ] = NULL ;
2008-03-06 02:52:37 +03:00
state - > ctx - > status = idmap_sids_to_xids ( service - > idmap_ctx , mem_ctx ,
2010-05-24 08:58:07 +04:00
pointer_array ) ;
2008-03-06 02:52:37 +03:00
if ( ! composite_is_ok ( state - > ctx ) ) return result ;
composite_done ( state - > ctx ) ;
return result ;
}
NTSTATUS wb_sids2xids_recv ( struct composite_context * ctx ,
2011-07-26 04:50:22 +04:00
struct id_map * * ids , unsigned * count )
2008-03-06 02:52:37 +03:00
{
NTSTATUS status = composite_wait ( ctx ) ;
2008-04-11 08:12:34 +04:00
struct sids2xids_state * state = talloc_get_type ( ctx - > private_data ,
struct sids2xids_state ) ;
2008-03-06 02:52:37 +03:00
DEBUG ( 5 , ( " wb_sids2xids_recv called \n " ) ) ;
2010-05-24 08:58:07 +04:00
/* We don't have to mess with pointer_array on the way out, as
* the results are filled into the pointers the caller
* supplied */
2008-04-11 08:12:34 +04:00
* ids = state - > ids ;
2011-07-26 04:50:22 +04:00
if ( count ! = NULL ) {
* count = state - > count ;
}
2008-04-11 08:12:34 +04:00
2008-03-06 02:52:37 +03:00
talloc_free ( ctx ) ;
return status ;
}