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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
/*
Unix SMB/CIFS implementation.
async seqnums
Copyright (C) Volker Lendecke 2009
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 "winbindd.h"
#include "librpc/gen_ndr/cli_wbint.h"
struct wb_seqnums_state {
int num_domains;
int num_received;
struct tevent_req **subreqs;
struct winbindd_domain **domains;
NTSTATUS *stati;
uint32_t *seqnums;
};
static void wb_seqnums_done(struct tevent_req *subreq);
struct tevent_req *wb_seqnums_send(TALLOC_CTX *mem_ctx,
struct tevent_context *ev)
{
struct tevent_req *req;
struct wb_seqnums_state *state;
struct winbindd_domain *domain;
int i;
req = tevent_req_create(mem_ctx, &state, struct wb_seqnums_state);
if (req == NULL) {
return NULL;
}
state->num_received = 0;
state->num_domains = 0;
for (domain = domain_list(); domain != NULL; domain = domain->next) {
state->num_domains += 1;
}
state->subreqs = talloc_array(state, struct tevent_req *,
state->num_domains);
state->domains = talloc_array(state, struct winbindd_domain *,
state->num_domains);
state->stati = talloc_array(state, NTSTATUS, state->num_domains);
state->seqnums = talloc_array(state, uint32_t, state->num_domains);
if ((state->subreqs == NULL) || (state->domains == NULL) ||
(state->stati == NULL) || (state->seqnums == NULL)) {
tevent_req_nterror(req, NT_STATUS_NO_MEMORY);
return tevent_req_post(req, ev);
}
i = 0;
for (domain = domain_list(); domain != NULL; domain = domain->next) {
state->domains[i] = domain;
state->subreqs[i] = wb_seqnum_send(state->subreqs, ev, domain);
if (tevent_req_nomem(state->subreqs[i], req)) {
/* Don't even start all the other requests */
TALLOC_FREE(state->subreqs);
return tevent_req_post(req, ev);
}
tevent_req_set_callback(state->subreqs[i], wb_seqnums_done,
req);
i += 1;
}
return req;
}
static void wb_seqnums_done(struct tevent_req *subreq)
{
struct tevent_req *req = tevent_req_callback_data(
subreq, struct tevent_req);
struct wb_seqnums_state *state = tevent_req_data(
req, struct wb_seqnums_state);
NTSTATUS status;
uint32_t seqnum;
int i;
status = wb_seqnum_recv(subreq, &seqnum);
for (i=0; i<state->num_domains; i++) {
if (subreq == state->subreqs[i]) {
state->subreqs[i] = NULL;
state->stati[i] = status;
if (NT_STATUS_IS_OK(status)) {
state->seqnums[i] = seqnum;
state->domains[i]->sequence_number = seqnum;
}
break;
}
}
TALLOC_FREE(subreq);
state->num_received += 1;
if (state->num_received >= state->num_domains) {
tevent_req_done(req);
}
}
NTSTATUS wb_seqnums_recv(struct tevent_req *req, TALLOC_CTX *mem_ctx,
int *num_domains, struct winbindd_domain ***domains,
NTSTATUS **stati, uint32_t **seqnums)
{
struct wb_seqnums_state *state = tevent_req_data(
req, struct wb_seqnums_state);
NTSTATUS status;
if (tevent_req_is_nterror(req, &status)) {
return status;
}
*num_domains = state->num_domains;
*domains = talloc_move(mem_ctx, &state->domains);
*stati = talloc_move(mem_ctx, &state->stati);
*seqnums = talloc_move(mem_ctx, &state->seqnums);
return NT_STATUS_OK;
}
|
