s3:smb2_server: prepare smbd_smb2_request_verify_sizes() for the optimized recvfile...
[Samba.git] / source4 / dsdb / repl / drepl_periodic.c
blobd6b94679e0e7f548f8f0e4183c8e50a720720d9e
1 /*
2 Unix SMB/CIFS mplementation.
3 DSDB replication service periodic handling
5 Copyright (C) Stefan Metzmacher 2007
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>.
22 #include "includes.h"
23 #include "lib/events/events.h"
24 #include "dsdb/samdb/samdb.h"
25 #include "auth/auth.h"
26 #include "smbd/service.h"
27 #include "dsdb/repl/drepl_service.h"
28 #include <ldb_errors.h>
29 #include "../lib/util/dlinklist.h"
30 #include "librpc/gen_ndr/ndr_misc.h"
31 #include "librpc/gen_ndr/ndr_drsuapi.h"
32 #include "librpc/gen_ndr/ndr_drsblobs.h"
34 static void dreplsrv_periodic_run(struct dreplsrv_service *service);
36 static void dreplsrv_periodic_handler_te(struct tevent_context *ev, struct tevent_timer *te,
37 struct timeval t, void *ptr)
39 struct dreplsrv_service *service = talloc_get_type(ptr, struct dreplsrv_service);
40 WERROR status;
42 service->periodic.te = NULL;
44 dreplsrv_periodic_run(service);
46 status = dreplsrv_periodic_schedule(service, service->periodic.interval);
47 if (!W_ERROR_IS_OK(status)) {
48 task_server_terminate(service->task, win_errstr(status), false);
49 return;
53 WERROR dreplsrv_periodic_schedule(struct dreplsrv_service *service, uint32_t next_interval)
55 TALLOC_CTX *tmp_mem;
56 struct tevent_timer *new_te;
57 struct timeval next_time;
59 /* prevent looping */
60 if (next_interval == 0) next_interval = 1;
62 next_time = timeval_current_ofs(next_interval, 50);
64 if (service->periodic.te) {
66 * if the timestamp of the new event is higher,
67 * as current next we don't need to reschedule
69 if (timeval_compare(&next_time, &service->periodic.next_event) > 0) {
70 return WERR_OK;
74 /* reset the next scheduled timestamp */
75 service->periodic.next_event = next_time;
77 new_te = tevent_add_timer(service->task->event_ctx, service,
78 service->periodic.next_event,
79 dreplsrv_periodic_handler_te, service);
80 W_ERROR_HAVE_NO_MEMORY(new_te);
82 tmp_mem = talloc_new(service);
83 DEBUG(4,("dreplsrv_periodic_schedule(%u) %sscheduled for: %s\n",
84 next_interval,
85 (service->periodic.te?"re":""),
86 nt_time_string(tmp_mem, timeval_to_nttime(&next_time))));
87 talloc_free(tmp_mem);
89 talloc_free(service->periodic.te);
90 service->periodic.te = new_te;
92 return WERR_OK;
95 static void dreplsrv_periodic_run(struct dreplsrv_service *service)
97 TALLOC_CTX *mem_ctx;
99 DEBUG(4,("dreplsrv_periodic_run(): schedule pull replication\n"));
102 * KCC or some administrative tool
103 * might have changed Topology graph
104 * i.e. repsFrom/repsTo
106 dreplsrv_refresh_partitions(service);
108 mem_ctx = talloc_new(service);
109 dreplsrv_schedule_pull_replication(service, mem_ctx);
110 talloc_free(mem_ctx);
112 DEBUG(4,("dreplsrv_periodic_run(): run pending_ops memory=%u\n",
113 (unsigned)talloc_total_blocks(service)));
115 dreplsrv_ridalloc_check_rid_pool(service);
117 dreplsrv_run_pending_ops(service);
121 run the next pending op, either a notify or a pull
123 void dreplsrv_run_pending_ops(struct dreplsrv_service *s)
125 if (!s->ops.notifies && !s->ops.pending) {
126 return;
128 if (!s->ops.notifies ||
129 (s->ops.pending &&
130 s->ops.notifies->schedule_time > s->ops.pending->schedule_time)) {
131 dreplsrv_run_pull_ops(s);
132 } else {
133 dreplsrv_notify_run_ops(s);
137 static void dreplsrv_pending_run(struct dreplsrv_service *service);
139 static void dreplsrv_pending_handler_te(struct tevent_context *ev, struct tevent_timer *te,
140 struct timeval t, void *ptr)
142 struct dreplsrv_service *service = talloc_get_type(ptr, struct dreplsrv_service);
144 service->pending.te = NULL;
146 dreplsrv_pending_run(service);
149 WERROR dreplsrv_pendingops_schedule(struct dreplsrv_service *service, uint32_t next_interval)
151 TALLOC_CTX *tmp_mem;
152 struct tevent_timer *new_te;
153 struct timeval next_time;
155 /* prevent looping */
156 if (next_interval == 0) {
157 next_interval = 1;
160 next_time = timeval_current_ofs(next_interval, 50);
162 if (service->pending.te) {
164 * if the timestamp of the new event is higher,
165 * as current next we don't need to reschedule
167 if (timeval_compare(&next_time, &service->pending.next_event) > 0) {
168 return WERR_OK;
172 /* reset the next scheduled timestamp */
173 service->pending.next_event = next_time;
175 new_te = tevent_add_timer(service->task->event_ctx, service,
176 service->pending.next_event,
177 dreplsrv_pending_handler_te, service);
178 W_ERROR_HAVE_NO_MEMORY(new_te);
180 tmp_mem = talloc_new(service);
181 DEBUG(4,("dreplsrv_pending_schedule(%u) %sscheduled for: %s\n",
182 next_interval,
183 (service->pending.te?"re":""),
184 nt_time_string(tmp_mem, timeval_to_nttime(&next_time))));
185 talloc_free(tmp_mem);
187 talloc_free(service->pending.te);
188 service->pending.te = new_te;
190 return WERR_OK;
193 static void dreplsrv_pending_run(struct dreplsrv_service *service)
195 dreplsrv_run_pending_ops(service);