Blame view

Debug/src/constraints/at_most_one.c 17.2 KB
0c8ce2b0   Pedro Roque   missing files
1
2
3
4
/*
 * at_most_one.c
 *
 *  Created on: 26/03/2017
4d26a735   Pedro Roque   Increased recogni...
5
 *      Author: Pedro
0c8ce2b0   Pedro Roque   missing files
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
 */

#ifndef __OPENCL_VERSION__

#include <stddef.h>
#include <stdio.h>

#include "at_most_one.h"

#include "../bitmaps.h"
#include "../config.h"
#include "../variables.h"

#endif

#include "../kernels/cl_aux_functions.h"
#if CL_D_TYPE == CL_BITMAP
#include "../kernels/cl_bitmaps.h"
#elif CL_D_TYPE == CL_INTERVAL
#include  "../kernels/cl_intervals.h"
#endif
#include "../kernels/cl_constraints.h"
#include "../kernels/cl_variables.h"
#include "../kernels/cl_ttl.h"

#ifndef __OPENCL_VERSION__

/*
 * Creates a new constraint of the at_most_one type and return the constraint ID
 * ∀i∈[1,n]:|si|=ci ; ∀i,j∈[1,n](i<j):∣si⋂sj|≤1
 * S_ids - vector with the ID of the variables of all the sets, ordered by set
 * N_vs - number of variables on each set, per set order (c)
 * n_sets - number of sets
 */
4d26a735   Pedro Roque   Increased recogni...
40
unsigned int c_at_most_one(unsigned int *S_ids, int *N_vs, unsigned int n_sets) {
0c8ce2b0   Pedro Roque   missing files
41
42
43
44
45
46
47
48
	unsigned int n_vs, i;

	// set to include in kernel compilation
	USE_CS[AT_MOST_ONE] = 1;
	USE_NON_CS_REIFI[AT_MOST_ONE] = 1;

	n_vs = 0;
	for (i = 0; i < n_sets; i++) {
4d26a735   Pedro Roque   Increased recogni...
49
		n_vs += (unsigned int) N_vs[i];
0c8ce2b0   Pedro Roque   missing files
50
51
	}

4d26a735   Pedro Roque   Increased recogni...
52
	unsigned int *c_vs = malloc(n_vs * sizeof(unsigned int));
0c8ce2b0   Pedro Roque   missing files
53
54
55
56
57
58
59
60
61
62
63

	for (i = 0; i < n_vs; i++) {
		c_vs[i] = S_ids[i];
	}

	// creates a new generic constraint
	unsigned int c_id = c_new(c_vs, n_vs, N_vs, n_sets, -1);

	// pointers to this type of constraint functions
	CS[c_id].kind = AT_MOST_ONE;
	CS[c_id].check_sol_f = &at_most_one_check;
4d26a735   Pedro Roque   Increased recogni...
64
	CS[c_id].constant_val = (int) n_sets;
0c8ce2b0   Pedro Roque   missing files
65
66
67
68
69
70
71
72
73
74
75
76
77
78

	free(c_vs);

	return c_id;
}

/*
 * Creates a new reified constraint of the at_most_one type and return the constraint ID
 * ∀i∈[1,n]:|si|=ci ; ∀i,j∈[1,n](i<j):∣si⋂sj|≤1
 * S_ids - vector with the ID of the variables of all the sets, ordered by set
 * N_vs - number of variables on each set, per set order (c)
 * n_sets - number of sets
 * reif_v_id - ID of the reification variable
 */
4d26a735   Pedro Roque   Increased recogni...
79
unsigned int c_at_most_one_reif(unsigned int *S_ids, int *N_vs, unsigned int n_sets, int reif_v_id) {
0c8ce2b0   Pedro Roque   missing files
80
81
82
83
84
85
	unsigned int n_vs, i;

	if (VS[reif_v_id].max > 1) {
		v_del_gt(&VS[reif_v_id], 1);

		if (VS[reif_v_id].n_vals == 0) {
4d26a735   Pedro Roque   Increased recogni...
86
87
88
89
90
91
92
93
			printf("\nConstraint AT_MOST_ONE_REIF makes model inconsistent at creation. No solution found.\n");

#if defined(WIN32) || defined(_WIN32) || defined(__WIN32) && !defined(__CYGWIN__)
			printf("\nPress any key to exit\n");
			int a = getchar();
#endif

			exit(0);
0c8ce2b0   Pedro Roque   missing files
94
95
96
97
98
99
100
101
102
		}
	}

	// set to include in kernel compilation
	USE_CS[AT_MOST_ONE] = 1;
	USE_CS_REIFI[AT_MOST_ONE] = 1;

	n_vs = 0;
	for (i = 0; i < n_sets; i++) {
4d26a735   Pedro Roque   Increased recogni...
103
		n_vs += (unsigned int) N_vs[i];
0c8ce2b0   Pedro Roque   missing files
104
105
	}

4d26a735   Pedro Roque   Increased recogni...
106
	unsigned int *c_vs = malloc(n_vs * sizeof(unsigned int));
0c8ce2b0   Pedro Roque   missing files
107
108
109
110
111
112
113
114
115
116
117

	for (i = 0; i < n_vs; i++) {
		c_vs[i] = S_ids[i];
	}

	// creates a new generic constraint
	unsigned int c_id = c_new(c_vs, n_vs, N_vs, n_sets, reif_v_id);

	// pointers to this type of constraint functions
	CS[c_id].kind = AT_MOST_ONE;
	CS[c_id].check_sol_f = &at_most_one_check;
4d26a735   Pedro Roque   Increased recogni...
118
	CS[c_id].constant_val = (int) n_sets;
0c8ce2b0   Pedro Roque   missing files
119
120
121
122
123
124
125
126
127
128
129
130

	free(c_vs);

	return c_id;
}

/*
 * Return true if the at_most_one constraint is respected or false if not
 * ∀i∈[1,n]:|si|=ci ; ∀i,j∈[1,n](i<j):∣si⋂sj|≤1
 * c - constraint to check if is respected
 * explored - if the CSP was already explored, which mean that all the variables must already be singletons
 * */
4d26a735   Pedro Roque   Increased recogni...
131
132
133
134
bool at_most_one_check(constr *c, bool explored) {

	int *cards = c->c_consts;
	var **sets = c->c_vs;
0c8ce2b0   Pedro Roque   missing files
135
136
137
138
139
140
	int n_sets = c->constant_val;
	unsigned int v_iter1;
	unsigned int v_iter2;
	unsigned int vals_eq;
	int i, j, k, l;

4d26a735   Pedro Roque   Increased recogni...
141
142
143
144
	if (!explored) {
		for (i = 0; i < c->n_c_vs; i++) {
			if (c->c_vs[i]->n_vals > 1) {
				return false;
0c8ce2b0   Pedro Roque   missing files
145
			}
4d26a735   Pedro Roque   Increased recogni...
146
147
148
149
150
151
		}
	}

	if (c->reified && VS[c->reif_v_id].n_vals > 1) {
		if (explored) {
			fprintf(stderr, "\nError: Reification variable of constraint AT_MOST_ONE_REIF (%d) has 2 values.\n", c->c_id);
0c8ce2b0   Pedro Roque   missing files
152
153
154
			return false;
		}
	}
0c8ce2b0   Pedro Roque   missing files
155
156
157

	// if any two sets share more than one value
	v_iter1 = 0;
4d26a735   Pedro Roque   Increased recogni...
158
	v_iter2 = (unsigned int) cards[0];
0c8ce2b0   Pedro Roque   missing files
159
160
161
162
163
164
165
166
167
	for (i = 0; i < n_sets; i++) {
		for (j = 0; j < cards[i]; j++) {
			for (k = i + 1; k < n_sets; k++) {
				vals_eq = 0;
				for (l = 0; l < cards[k]; l++) {

					if (sets[v_iter1]->min == sets[v_iter2]->min) {
						vals_eq++;

4d26a735   Pedro Roque   Increased recogni...
168
169
						if (((!c->reified || (c->reified && VS[c->reif_v_id].min == 1)) && vals_eq > 1)
								|| (c->reified && VS[c->reif_v_id].min == 0 && vals_eq <= 1)) {
0c8ce2b0   Pedro Roque   missing files
170
171

							if (explored) {
4d26a735   Pedro Roque   Increased recogni...
172
173
174
175
176
177
178
179
180
181

								if (c->reified) {
									fprintf(stderr, "\nError: Constraint AT_MOST_ONE_REIF (%d) not respected:\n", c->c_id);
									fprintf(stderr, "Reif ID=%u -> minimum=%u, maximum=%u, number of values=%u\n\n", c->reif_v_id,
											b_get_min_val(&VS[c->reif_v_id].domain_b), b_get_max_val(&VS[c->reif_v_id].domain_b),
											b_cnt_vals(&VS[c->reif_v_id].domain_b));

								} else {
									fprintf(stderr, "\nError: Constraint AT_MOST_ONE (%d) not respected:\n", c->c_id);
								}
0c8ce2b0   Pedro Roque   missing files
182
183
184

								for (i = 0; i < c->n_c_vs; i++) {
									fprintf(stderr, "Variable ID=%u -> minimum=%u, maximum=%u, number of values=%u\n\n", c->c_vs[i]->v_id,
4d26a735   Pedro Roque   Increased recogni...
185
											b_get_min_val(&c->c_vs[i]->domain_b), b_get_max_val(&c->c_vs[i]->domain_b), b_cnt_vals(&c->c_vs[i]->domain_b));
0c8ce2b0   Pedro Roque   missing files
186
187
188
189
190
191
192
								}
							}
							return false;
						}
					}
					v_iter2++;
				}
4d26a735   Pedro Roque   Increased recogni...
193
				v_iter2 -= (unsigned int) cards[k];
0c8ce2b0   Pedro Roque   missing files
194
			}
4d26a735   Pedro Roque   Increased recogni...
195
			v_iter2 += (unsigned int) cards[k];
0c8ce2b0   Pedro Roque   missing files
196
197
198
199
200
201
202
203
204
205
206
207
			v_iter1++;
		}
	}
	return true;
}

#endif

#if CS_AT_MOST_ONE == 1
/*
 * Propagate the domain of the variable with the ID prop_v_id through all the other variables on the same c_numb ID at_most_one constraint
 * ∀i∈[1,n]:|si|=ci ; ∀i,j∈[1,n](i<j):∣si⋂sj|≤1
0c8ce2b0   Pedro Roque   missing files
208
 * vs_per_c_idx - vector with all constrained variables ID per constraint, per constraint ID order
4d26a735   Pedro Roque   Increased recogni...
209
 * c_consts - constant values used by this constraint
0c8ce2b0   Pedro Roque   missing files
210
 * vs_prop_ - all CSP variables with current step values
4d26a735   Pedro Roque   Increased recogni...
211
 * prop_v_id - ID of the variable to propagate
0c8ce2b0   Pedro Roque   missing files
212
213
 * current_cs - constraint that should be propagated for the variable with prop_v_id ID
 * vs_id_to_prop_ - circular vector with the ids of the variables to propagate
4d26a735   Pedro Roque   Increased recogni...
214
 * prop_ok - will be set to 1 or 0 if the constraint is respected or not
0c8ce2b0   Pedro Roque   missing files
215
 */
4d26a735   Pedro Roque   Increased recogni...
216
217
218
219
220
221
222
223
CUDA_FUNC void at_most_one_prop( CL_INTS_MEM int *vs_per_c_idx, CL_INTS_MEM int *c_consts, CL_MEMORY VARS_PROP *vs_prop_,
		unsigned int prop_v_id, CL_CS_MEM cl_constr *current_cs, CL_MEMORY unsigned short *vs_id_to_prop_, bool *prop_ok TTL_CTR) {

#if CS_R_ALL_DIFFERENT == 1
	if (current_cs->reified == 1 && prop_v_id == current_cs->reif_var_id) {
		return;
	}
#endif
0c8ce2b0   Pedro Roque   missing files
224

4d26a735   Pedro Roque   Increased recogni...
225
	CL_INTS_MEM int *cards = c_consts;
0c8ce2b0   Pedro Roque   missing files
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
	int n_sets = current_cs->constant_val;
	int set_to_prop_idx;	// set with the variables to propagate
	int set_to_prun_idx;	// Iterator for the other sets to prune
	int set_to_prop_n = -1;
	int v_to_prop_id;
	int v_to_prun_id;
	int v_iter = 0;
	int val;
	int vals_repeat_ctr;
	bool changed = 0;
	int i, j, k;

	// if the variable to propagate is singleton, propagate all the variables already singleton on that set to all the other sets
	if (V_N_VALS(vs_prop_[prop_v_id]) == 1) {

		// get the number of the set where the variable to propagate belong and initialize set_to_prop
		v_iter = 0;
		for (i = 0; i < n_sets; i++) {
			CHECK_TTL(ttl_ctr, 43)
			set_to_prop_idx = v_iter;
			for (j = 0; j < cards[i]; j++) {
				CHECK_TTL(ttl_ctr, 44)
4d26a735   Pedro Roque   Increased recogni...
248
				if (prop_v_id == (unsigned int) vs_per_c_idx[v_iter]) {
0c8ce2b0   Pedro Roque   missing files
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
					set_to_prop_n = i;
					break;
				}
				v_iter++;
			}
			if (set_to_prop_n != -1) {
				break;
			}
		}

		// iterate over all the sets
		set_to_prun_idx = 0;
		for (i = 0; i < n_sets; i++) {
			CHECK_TTL(ttl_ctr, 45)
			if (i > 0) {
				set_to_prun_idx += cards[i - 1];
			}
			// if this set is not the one being propagated
			if (i != set_to_prop_n) {

				// iterate all the variables on the set to propagate and propagate all the singleton variables on that set
				vals_repeat_ctr = 0;
				for (j = 0; j < cards[set_to_prop_n]; j++) {
					CHECK_TTL(ttl_ctr, 46)

					v_to_prop_id = vs_per_c_idx[set_to_prop_idx + j];
					if (V_N_VALS(vs_prop_[v_to_prop_id]) == 1) {
						val = V_MIN(vs_prop_[v_to_prop_id]);

						for (k = 0; k < cards[i]; k++) {
							CHECK_TTL(ttl_ctr, 47)
							v_to_prun_id = vs_per_c_idx[set_to_prun_idx + k];
							// count number of singleton variable values repeated on both sets
							if (V_N_VALS(vs_prop_[v_to_prun_id]) == 1 && V_MIN(vs_prop_[v_to_prun_id]) == val) {
								vals_repeat_ctr++;

								if (vals_repeat_ctr > 1) {
									*prop_ok = 0;
									return;
								}
							}
							// if only one singleton variable value is repeated on both sets remove that value from the other variables
							if (vals_repeat_ctr == 1 && V_N_VALS(vs_prop_[v_to_prun_id]) > 1) {

								cl_v_del_val_m(&changed, &vs_prop_[v_to_prun_id], val TTL_CTR_V);
								if (changed) {
									if (V_N_VALS(vs_prop_[v_to_prun_id]) == 0) {
										*prop_ok = 0;
										return;
									}
									v_add_to_prop(vs_id_to_prop_, vs_prop_, v_to_prun_id);
								}
							}
						}
					}
				}
			}
		}
	}
}

#if CS_R_AT_MOST_ONE == 1
/*
 * Validate at_most_one constraint to be normally propagated, when reified
 * ∀i∈[1,n]:|si|=ci ; ∀i,j∈[1,n](i<j):∣si⋂sj|≤1
 * vs_per_c_idx - vector with all constrained variables ID per constraint, per constraint ID order
4d26a735   Pedro Roque   Increased recogni...
315
 * c_consts - constant values used by this constraint
0c8ce2b0   Pedro Roque   missing files
316
 * vs_prop_ - all CSP variables with current step values
4d26a735   Pedro Roque   Increased recogni...
317
 * prop_v_id - ID of the variable to propagate
0c8ce2b0   Pedro Roque   missing files
318
319
320
 * current_cs - constraint that should be propagated for the variable with prop_v_id ID
 * vs_id_to_prop_ - circular vector with the ids of the variables to propagate
 */
4d26a735   Pedro Roque   Increased recogni...
321
322
CUDA_FUNC void at_most_one_reif( CL_INTS_MEM int *vs_per_c_idx, CL_INTS_MEM int *c_consts, CL_MEMORY VARS_PROP *vs_prop_,
		unsigned int prop_v_id, CL_CS_MEM cl_constr *current_cs, CL_MEMORY unsigned short *vs_id_to_prop_ TTL_CTR) {
0c8ce2b0   Pedro Roque   missing files
323

4d26a735   Pedro Roque   Increased recogni...
324
325
326
327
328
329
330
#if CS_R_ALL_DIFFERENT == 1
	if (current_cs->reified == 1 && prop_v_id == current_cs->reif_var_id) {
		return;
	}
#endif

	CL_INTS_MEM int *cards = c_consts;
0c8ce2b0   Pedro Roque   missing files
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
	int n_sets = current_cs->constant_val;
	int set_to_prop_idx;	// set with the variables to propagate
	int set_to_prun_idx;	// Iterator for the other sets to prune
	int set_to_prop_n = -1;
	int v_to_prop_id;
	VARS_PROP v_to_prun;
	int v_iter = 0;
	int val;
	int vals_repeat_ctr;
	bool changed = 0;
	int i, j, k;

	// if the variable to propagate is singleton, propagate all the variables already singleton on that set to all the other sets
	if (V_N_VALS(vs_prop_[prop_v_id]) == 1) {

		// get the number of the set where the variable to propagate belong and initialize set_to_prop
		v_iter = 0;
		for (i = 0; i < n_sets; i++) {
			CHECK_TTL(ttl_ctr, 48)
			set_to_prop_idx = v_iter;
			for (j = 0; j < cards[i]; j++) {
				CHECK_TTL(ttl_ctr, 49)
4d26a735   Pedro Roque   Increased recogni...
353
				if (prop_v_id == (unsigned int) vs_per_c_idx[v_iter]) {
0c8ce2b0   Pedro Roque   missing files
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
					set_to_prop_n = i;
					break;
				}
				v_iter++;
			}
			if (set_to_prop_n != -1) {
				break;
			}
		}

		// iterate over all the sets
		set_to_prun_idx = 0;
		for (i = 0; i < n_sets; i++) {
			CHECK_TTL(ttl_ctr, 50)
			if (i > 0) {
				set_to_prun_idx += cards[i - 1];
			}
			// if this set is not the one being propagated
			if (i != set_to_prop_n) {

				// iterate all the variables on the set to propagate and propagate all the singleton variables on that set
				vals_repeat_ctr = 0;
				for (j = 0; j < cards[set_to_prop_n]; j++) {
					CHECK_TTL(ttl_ctr, 51)

					v_to_prop_id = vs_per_c_idx[set_to_prop_idx + j];
					if (V_N_VALS(vs_prop_[v_to_prop_id]) == 1) {
						val = V_MIN(vs_prop_[v_to_prop_id]);

						for (k = 0; k < cards[i]; k++) {
							CHECK_TTL(ttl_ctr, 52)

							cl_v_copy_pm(&v_to_prun, &vs_prop_[vs_per_c_idx[set_to_prun_idx + k]] TTL_CTR_V);

							// count number of singleton variable values repeated on both sets
							if (V_N_VALS(v_to_prun) == 1 && V_MIN(v_to_prun) == val) {
								vals_repeat_ctr++;

								if (vals_repeat_ctr > 1) {
									cl_v_bool_del_val_m(&vs_prop_[current_cs->reif_var_id], 1 TTL_CTR_V);

4d26a735   Pedro Roque   Increased recogni...
395
									v_add_to_prop(vs_id_to_prop_, vs_prop_, convert_int (current_cs->reif_var_id));
0c8ce2b0   Pedro Roque   missing files
396
397
398
399
400
401
402
403
404
									return;
								}
							}
							// if only one singleton variable value is repeated on both sets remove that value from the other variables
							if (vals_repeat_ctr == 1 && V_N_VALS(v_to_prun) > 1) {

								cl_v_del_val_n(&changed, &v_to_prun, val TTL_CTR_V);
								if (V_N_VALS(v_to_prun) == 0) {
									cl_v_bool_del_val_m(&vs_prop_[current_cs->reif_var_id], 1 TTL_CTR_V);
4d26a735   Pedro Roque   Increased recogni...
405
									v_add_to_prop(vs_id_to_prop_, vs_prop_, convert_int (current_cs->reif_var_id));
0c8ce2b0   Pedro Roque   missing files
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
									return;
								}
							}
						}
					}
				}
			}
		}

		// check if constraint is already fixed
		v_iter = 0;
		for (i = 0; i < current_cs->n_c_vs; i++) {
			CHECK_TTL(ttl_ctr, 187)

			if (V_N_VALS(vs_prop_[vs_per_c_idx[v_iter]]) != 1) {
				return;
			}
		}
		cl_v_bool_del_val_m(&vs_prop_[current_cs->reif_var_id], 0 TTL_CTR_V);
4d26a735   Pedro Roque   Increased recogni...
425
		v_add_to_prop(vs_id_to_prop_, vs_prop_, convert_int (current_cs->reif_var_id));
0c8ce2b0   Pedro Roque   missing files
426
427
428
429
430
431
432
	}
}

/*
 * Propagate the domain of the variable with the ID prop_v_id through all the other variables on the same c_numb ID at_most_one opposite constraint
 * ∀i∈[1,n]:|si|=ci ; ∀i,j∈[1,n](i<j):∣si⋂sj|>1
 * vs_per_c_idx - vector with all constrained variables ID per constraint, per constraint ID order
4d26a735   Pedro Roque   Increased recogni...
433
 * c_consts - constant values used by this constraint
0c8ce2b0   Pedro Roque   missing files
434
 * vs_prop_ - all CSP variables with current step values
4d26a735   Pedro Roque   Increased recogni...
435
 * prop_v_id - ID of the variable to propagate
0c8ce2b0   Pedro Roque   missing files
436
 * current_cs - constraint that should be propagated for the variable with prop_v_id ID
0c8ce2b0   Pedro Roque   missing files
437
 */
4d26a735   Pedro Roque   Increased recogni...
438
439
CUDA_FUNC void at_most_one_prop_opposite( CL_INTS_MEM int *vs_per_c_idx, CL_INTS_MEM int *c_consts, CL_MEMORY VARS_PROP *vs_prop_,
		unsigned int prop_v_id, CL_CS_MEM cl_constr *current_cs TTL_CTR) {
0c8ce2b0   Pedro Roque   missing files
440

4d26a735   Pedro Roque   Increased recogni...
441
442
443
444
445
446
447
#if CS_R_ALL_DIFFERENT == 1
	if (current_cs->reified == 1 && prop_v_id == current_cs->reif_var_id) {
		return;
	}
#endif

	CL_INTS_MEM int *cards = c_consts;
0c8ce2b0   Pedro Roque   missing files
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
	int n_sets = current_cs->constant_val;
	int set_to_prop_idx;	// set with the variables to propagate
	int set_to_prun_idx;	// Iterator for the other sets to prune
	int set_to_prop_n = -1;
	int v_to_prop_id;
	int v_to_prun_id;
	int v_iter = 0;
	int val;
	int vals_repeat_ctr;
	bool contains;
	int i, j, k;

	// if the variable to propagate is singleton, propagate all the variables already singleton on that set to all the other sets
	if (V_N_VALS(vs_prop_[prop_v_id]) == 1) {

		// get the number of the set where the variable to propagate belong and initialize set_to_prop
		v_iter = 0;
		for (i = 0; i < n_sets; i++) {
			CHECK_TTL(ttl_ctr, 200)
			set_to_prop_idx = v_iter;
			for (j = 0; j < cards[i]; j++) {
				CHECK_TTL(ttl_ctr, 201)
4d26a735   Pedro Roque   Increased recogni...
470
				if (prop_v_id == (unsigned int) vs_per_c_idx[v_iter]) {
0c8ce2b0   Pedro Roque   missing files
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
					set_to_prop_n = i;
					break;
				}
				v_iter++;
			}
			if (set_to_prop_n != -1) {
				break;
			}
		}

		// iterate over all the sets
		set_to_prun_idx = 0;
		for (i = 0; i < n_sets; i++) {
			CHECK_TTL(ttl_ctr, 202)
			if (i > 0) {
				set_to_prun_idx += cards[i - 1];
			}
			// if this set is not the one being propagated
			if (i != set_to_prop_n) {

				// iterate all the variables on the set to propagate and propagate all the singleton variables on that set
				vals_repeat_ctr = 0;
				for (j = 0; j < cards[set_to_prop_n]; j++) {
					CHECK_TTL(ttl_ctr, 203)

					v_to_prop_id = vs_per_c_idx[set_to_prop_idx + j];
					if (V_N_VALS(vs_prop_[v_to_prop_id]) == 1) {
						val = V_MIN(vs_prop_[v_to_prop_id]);

						for (k = 0; k < cards[i]; k++) {
							CHECK_TTL(ttl_ctr, 204)
							v_to_prun_id = vs_per_c_idx[set_to_prun_idx + k];

							// count number of variable values repeated on both sets
							cl_v_contains_val_m(&contains, &vs_prop_[v_to_prun_id], val TTL_CTR_V);
							if (contains) {

								if (++vals_repeat_ctr > 1) {
									return;
								}
							}
						}
					}
				}
			}
		}
	}
}

#endif

4d26a735   Pedro Roque   Increased recogni...
522
523
524
525
526
527
528
529
530
531
532
533
/*
 * Decides the propagator to call for this constraint
 * vs_per_c_idx - vector with all constrained variables ID per constraint, per constraint ID order
 * c_consts - constant values used by this constraint
 * vs_prop_ - all CSP variables with current step values
 * prop_v_id - ID of the variable to propagate
 * current_cs - constraint that should be propagated for the variable with prop_v_id ID
 * vs_id_to_prop_ - circular vector with the ids of the variables to propagate
 * prop_ok - will be set to 1 or 0 if the constraint is respected or not
 */
CUDA_FUNC void at_most_one_propagate( CL_INTS_MEM int *vs_per_c_idx, CL_INTS_MEM int *c_consts, CL_MEMORY VARS_PROP *vs_prop_, unsigned int prop_v_id,
		CL_CS_MEM cl_constr *current_cs, CL_MEMORY unsigned short *vs_id_to_prop_, bool *prop_ok PROPAGATED_FUNC TTL_CTR) {
0c8ce2b0   Pedro Roque   missing files
534
535
536
537
538
539

#if CS_R_AT_MOST_ONE == 0
	at_most_one_prop(vs_per_c_idx, c_consts, vs_prop_, prop_v_id, current_cs, vs_id_to_prop_, prop_ok TTL_CTR_V);
#if CL_STATS == 1
	*propagated = true;
#endif
4d26a735   Pedro Roque   Increased recogni...
540

0c8ce2b0   Pedro Roque   missing files
541
542
#elif CS_R_AT_MOST_ONE == 1
	if (current_cs->reified == 1) {
4d26a735   Pedro Roque   Increased recogni...
543
544
		if (V_N_VALS(vs_prop_[current_cs->reif_var_id]) > 1) {
			at_most_one_reif(vs_per_c_idx, c_consts, vs_prop_, prop_v_id, current_cs, vs_id_to_prop_ TTL_CTR_V);
0c8ce2b0   Pedro Roque   missing files
545

4d26a735   Pedro Roque   Increased recogni...
546
547
548
		} else {
			if (V_MIN(vs_prop_[current_cs->reif_var_id]) == 1) {
				at_most_one_prop(vs_per_c_idx, c_consts, vs_prop_, prop_v_id, current_cs, vs_id_to_prop_, prop_ok TTL_CTR_V);
0c8ce2b0   Pedro Roque   missing files
549
			} else {
4d26a735   Pedro Roque   Increased recogni...
550
551
				at_most_one_prop_opposite(vs_per_c_idx, c_consts, vs_prop_, prop_v_id, current_cs TTL_CTR_V);
			}
0c8ce2b0   Pedro Roque   missing files
552
#if CL_STATS == 1
4d26a735   Pedro Roque   Increased recogni...
553
			*propagated = true;
0c8ce2b0   Pedro Roque   missing files
554
#endif
0c8ce2b0   Pedro Roque   missing files
555
556
557
558
559
560
561
562
563
564
565
		}
	} else {
		at_most_one_prop(vs_per_c_idx, c_consts, vs_prop_, prop_v_id, current_cs, vs_id_to_prop_, prop_ok TTL_CTR_V);
#if CL_STATS == 1
		*propagated = true;
#endif
	}
#endif
}

#endif