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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
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
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
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
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
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
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
|
/* Copyright (c) 2000 Shlomi Fish
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limitation the rights to use,
* copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following
* conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*/
/*
* check_and_add_state.c - the various possible implementations of the function
* fc_solve_check_and_add_state().
*
*/
#ifndef FC_SOLVE__CAAS_C
#define FC_SOLVE__CAAS_C
#define BUILDING_DLL 1
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include "check_and_add_state.h"
#include "fcs_dm.h"
#include "instance.h"
#include "move_stack_compact_alloc.h"
#include "inline.h"
#include "likely.h"
#include "check_limits.h"
typedef unsigned long int ub4; /* unsigned 4-byte quantities */
typedef unsigned char ub1;
static GCC_INLINE ub4 perl_hash_function(
register ub1 *s_ptr, /* the key */
register ub4 length /* the length of the key */
)
{
register ub4 hash_value_int = 0;
register ub1 * s_end = s_ptr+length;
while (s_ptr < s_end)
{
hash_value_int += (hash_value_int << 5) + *(s_ptr++);
}
hash_value_int += (hash_value_int>>5);
return hash_value_int;
}
#ifdef INDIRECT_STACK_STATES
#define replace_with_cached(condition_expr) \
if (condition_expr) \
{ \
fcs_compact_alloc_release(stacks_allocator); \
new_state->s.stacks[i] = cached_stack; \
}
static void GCC_INLINE fc_solve_cache_stacks(
fc_solve_hard_thread_t * hard_thread,
fcs_state_keyval_pair_t * new_state
)
{
int i;
#if (FCS_STACK_STORAGE == FCS_STACK_STORAGE_INTERNAL_HASH)
#ifdef FCS_ENABLE_SECONDARY_HASH_VALUE
SFO_hash_value_t hash_value_int;
#endif
#elif (FCS_STACK_STORAGE == FCS_STACK_STORAGE_JUDY)
PWord_t * PValue;
#endif
void * cached_stack;
char * new_ptr;
fc_solve_instance_t * instance = hard_thread->instance;
#ifndef HARD_CODED_NUM_STACKS
DECLARE_AND_SET_GAME_PARAMS();
#endif
fcs_cards_column_t column;
register int col_len;
fcs_compact_allocator_t * stacks_allocator;
stacks_allocator = &(hard_thread->allocator);
for(i=0 ; i < LOCAL_STACKS_NUM ; i++)
{
/*
* If the stack is not a copy - it is already cached so skip
* to the next stack
* */
if (! (new_state->info.stacks_copy_on_write_flags & (1 << i)))
{
continue;
}
column = fcs_state_get_col(new_state->s, i);
col_len = (fcs_col_len(column)+1);
new_ptr = (char*)fcs_compact_alloc_ptr(stacks_allocator, col_len);
memcpy(new_ptr, column, col_len);
new_state->s.stacks[i] = new_ptr;
#if FCS_STACK_STORAGE == FCS_STACK_STORAGE_INTERNAL_HASH
#ifdef FCS_ENABLE_SECONDARY_HASH_VALUE
/* Calculate the hash value for the stack */
/* This hash function was ripped from the Perl source code.
* (It is not derived work however). */
{
const char * s_ptr = (char*)(new_state_key->stacks[i]);
const char * s_end = s_ptr+fcs_col_len(s_ptr)+1;
hash_value_int = 0;
while (s_ptr < s_end)
{
hash_value_int += (hash_value_int << 5) + *(s_ptr++);
}
hash_value_int += (hash_value_int >> 5);
}
if (hash_value_int < 0)
{
/*
* This is a bit mask that nullifies the sign bit of the
* number so it will always be positive
* */
hash_value_int &= (~(1<<((sizeof(hash_value_int)<<3)-1)));
}
#endif
{
column = fcs_state_get_col(new_state->s, i);
replace_with_cached(fc_solve_hash_insert(
&(instance->stacks_hash),
column,
&cached_stack,
perl_hash_function(
(ub1 *)new_state->s.stacks[i],
col_len
)
#ifdef FCS_ENABLE_SECONDARY_HASH_VALUE
, hash_value_int
#endif
)
);
}
#elif (FCS_STACK_STORAGE == FCS_STACK_STORAGE_GOOGLE_DENSE_HASH)
{
column = fcs_state_get_col(new_state->s, i);
replace_with_cached(
fc_solve_columns_google_hash_insert(
instance->stacks_hash,
column,
&cached_stack
)
);
}
#elif (FCS_STACK_STORAGE == FCS_STACK_STORAGE_LIBAVL2_TREE)
cached_stack =
fcs_libavl2_stacks_tree_insert(
instance->stacks_tree,
new_state_key->stacks[i]
);
replace_with_cached(cached_stack != NULL);
#elif (FCS_STACK_STORAGE == FCS_STACK_STORAGE_LIBREDBLACK_TREE)
cached_stack = (void *)rbsearch(
new_state_key->stacks[i],
instance->stacks_tree
);
replace_with_cached(cached_stack != new_state_key->stacks[i]);
#elif (FCS_STACK_STORAGE == FCS_STACK_STORAGE_GLIB_TREE)
cached_stack = g_tree_lookup(
instance->stacks_tree,
(gpointer)new_state_key->stacks[i]
);
/* replace_with_cached contains an if statement */
replace_with_cached(cached_stack != NULL)
else
{
g_tree_insert(
instance->stacks_tree,
(gpointer)new_state_key->stacks[i],
(gpointer)new_state_key->stacks[i]
);
}
#elif (FCS_STACK_STORAGE == FCS_STACK_STORAGE_GLIB_HASH)
cached_stack = g_hash_table_lookup(
instance->stacks_hash,
(gconstpointer)new_state_key->stacks[i]
);
replace_with_cached(cached_stack != NULL)
else
{
g_hash_table_insert(
instance->stacks_hash,
(gpointer)new_state_key->stacks[i],
(gpointer)new_state_key->stacks[i]
);
}
#elif (FCS_STACK_STORAGE == FCS_STACK_STORAGE_JUDY)
column = fcs_state_get_col(*new_state_key, i);
JHSI(
PValue,
instance->stacks_judy_array,
column,
(1+fcs_col_len(column))
);
/* later_todo : Handle out-of-memory. */
if (*PValue == 0)
{
/* A new stack */
*PValue = (PWord_t)column;
}
else
{
cached_stack = (void *)(*PValue);
replace_with_cached(1);
}
#else
#error FCS_STACK_STORAGE is not set to a good value.
#endif
}
}
#else /* #ifdef INDIRECT_STACK_STATES */
#define fc_solve_cache_stacks(hard_thread, new_state_key) \
{}
#endif
#ifdef FCS_WITH_TALONS
static GCC_INLINE void fc_solve_cache_talon(
fc_solve_instance_t * instance,
fcs_state_t * new_state_key,
fcs_state_extra_info_t * new_state_val
)
{
void * cached_talon;
int hash_value_int;
new_state_key->talon = realloc(new_state_key->talon, fcs_klondike_talon_len(new_state_key)+1);
hash_value_int = *(SFO_hash_value_t*)instance->hash_value;
if (hash_value_int < 0)
{
/*
* This is a bit mask that nullifies the sign bit of the
* number so it will always be positive
* */
hash_value_int &= (~(1<<((sizeof(hash_value_int)<<3)-1)));
}
cached_talon = (void *)fc_solve_hash_insert(
instance->talons_hash,
new_state_key->talon,
hash_value_int,
1
);
if (cached_talon != NULL)
{
free(new_state_key->talon);
new_state_key->talon = cached_talon;
}
}
#endif
#if (FCS_STATE_STORAGE == FCS_STATE_STORAGE_GLIB_HASH)
guint fc_solve_hash_function(gconstpointer key)
{
guint hash_value;
const char * s_ptr = (char*)key;
const char * s_end = s_ptr+sizeof(fcs_state_t);
hash_value = 0;
while (s_ptr < s_end)
{
hash_value += (hash_value << 5) + *(s_ptr++);
}
hash_value += (hash_value >> 5);
return hash_value;
}
#endif
/*
* check_and_add_state() does the following things:
*
* 1. Check if the number of iterations exceeded its maximum, and if so
* return FCS_STATE_EXCEEDS_MAX_NUM_TIMES in order to terminate the
* solving process.
* 2. Check if the maximal depth was reached and if so return
* FCS_STATE_EXCEEDS_MAX_DEPTH
* 3. Canonize the state.
* 4. Check if the state is already found in the collection of the states
* that were already checked.
* If it is:
*
* 5a. Return FALSE.
*
* If it isn't:
*
* 5b. Add the new state and return TRUE.
* */
static GCC_INLINE void on_state_new(
fc_solve_instance_t * instance,
fc_solve_hard_thread_t * hard_thread,
fcs_collectible_state_t * new_state
)
{
register fcs_collectible_state_t * parent_state;
/* The new state was not found in the cache, and it was already inserted */
if (likely(parent_state = FCS_S_PARENT(new_state)))
{
(FCS_S_NUM_ACTIVE_CHILDREN(parent_state))++;
/* If parent_val is defined, so is moves_to_parent */
FCS_S_MOVES_TO_PARENT(new_state) =
fc_solve_move_stack_compact_allocate(
hard_thread,
FCS_S_MOVES_TO_PARENT(new_state)
);
}
instance->active_num_states_in_collection++;
instance->num_states_in_collection++;
return;
}
#ifdef FCS_RCS_STATES
fcs_bool_t fc_solve_check_and_add_state(
fc_solve_hard_thread_t * hard_thread,
fcs_state_t * new_state_key,
fcs_collectible_state_t * new_state,
fcs_state_t * * existing_state_key,
fcs_collectible_state_t * * existing_state
)
#else
fcs_bool_t fc_solve_check_and_add_state(
fc_solve_hard_thread_t * hard_thread,
fcs_collectible_state_t * new_state,
fcs_collectible_state_t * * existing_state
)
#endif
{
#if (FCS_STATE_STORAGE == FCS_STATE_STORAGE_INTERNAL_HASH)
#ifdef FCS_ENABLE_SECONDARY_HASH_VALUE
SFO_hash_value_t hash_value_int;
#endif
#endif
#if (FCS_STATE_STORAGE == FCS_STATE_STORAGE_INDIRECT)
fcs_standalone_state_ptrs_t * pos_ptr;
fcs_bool_t found;
#endif
fc_solve_instance_t * instance = hard_thread->instance;
/* #if'ing out because it doesn't belong here. */
#if 0
if ((instance->max_depth >= 0) &&
(new_state_val->depth >= instance->max_depth))
{
return FCS_STATE_EXCEEDS_MAX_DEPTH;
}
#endif
fc_solve_cache_stacks(hard_thread, new_state);
fc_solve_canonize_state(
#ifdef FCS_RCS_STATES
new_state_key,
#endif
new_state,
INSTANCE_FREECELLS_NUM,
INSTANCE_STACKS_NUM
);
/*
The objective of this part of the code is:
1. To check if new_state_key / new_state_val is already in the prev_states
collection.
2. If not, to add it and to set check to true.
3. If so, to set check to false.
*/
#if (FCS_STATE_STORAGE == FCS_STATE_STORAGE_INTERNAL_HASH)
#ifdef FCS_ENABLE_SECONDARY_HASH_VALUE
{
const char * s_ptr = (char*)new_state_key;
const char * s_end = s_ptr+sizeof(*new_state_key);
hash_value_int = 0;
while (s_ptr < s_end)
{
hash_value_int += (hash_value_int << 5) + *(s_ptr++);
}
hash_value_int += (hash_value_int>>5);
}
if (hash_value_int < 0)
{
/*
* This is a bit mask that nullifies the sign bit of the
* number so it will always be positive
* */
hash_value_int &= (~(1<<((sizeof(hash_value_int)<<3)-1)));
}
#endif
{
void * existing_void;
if (fc_solve_hash_insert(
&(instance->hash),
new_state,
#ifdef FCS_RCS_STATES
new_state_key,
#endif
&existing_void,
perl_hash_function(
#ifdef FCS_RCS_STATES
(ub1 *)(new_state_key),
sizeof(*new_state_key)
#else
(ub1 *)&(new_state->s),
sizeof(new_state->s)
#endif
)
#ifdef FCS_ENABLE_SECONDARY_HASH_VALUE
, hash_value_int
#endif
))
{
*existing_state = existing_void;
return FALSE;
}
else
{
on_state_new(instance, hard_thread, new_state);
return TRUE;
}
}
#elif (FCS_STATE_STORAGE == FCS_STATE_STORAGE_GOOGLE_DENSE_HASH)
{
void * existing_void;
/* TODO : check if this condition should be negated. */
if (fc_solve_states_google_hash_insert(
instance->hash,
new_state,
&(existing_void)
)
)
{
*existing_state = existing_void;
return FALSE;
}
else
{
on_state_new(instance, hard_thread, new_state);
return TRUE;
}
}
#elif (FCS_STATE_STORAGE == FCS_STATE_STORAGE_INDIRECT)
/* Try to see if the state is found in indirect_prev_states */
if ((pos_ptr = (fcs_standalone_state_ptrs_t *)bsearch(&new_state_key,
instance->indirect_prev_states,
instance->num_indirect_prev_states,
sizeof(instance->indirect_prev_states[0]),
fc_solve_state_compare_indirect)) == NULL)
{
/* It isn't in prev_states, but maybe it's in the sort margin */
pos_ptr = (fcs_standalone_state_ptrs_t *)fc_solve_bsearch(
&new_state_key,
instance->indirect_prev_states_margin,
instance->num_prev_states_margin,
sizeof(instance->indirect_prev_states_margin[0]),
fc_solve_state_compare_indirect_with_context,
NULL,
&found);
if (found)
{
is_state_new = FALSE;
*existing_state_val = pos_ptr->val;
}
else
{
/* Insert the state into its corresponding place in the sort
* margin */
memmove((void*)(pos_ptr+1),
(void*)pos_ptr,
sizeof(*pos_ptr) *
(instance->num_prev_states_margin-
(pos_ptr-instance->indirect_prev_states_margin)
));
pos_ptr->key = new_state_key;
pos_ptr->val = new_state_val;
instance->num_prev_states_margin++;
if (instance->num_prev_states_margin >= PREV_STATES_SORT_MARGIN)
{
/* The sort margin is full, let's combine it with the main array */
instance->indirect_prev_states =
realloc(
instance->indirect_prev_states,
sizeof(instance->indirect_prev_states[0])
* (instance->num_indirect_prev_states
+ instance->num_prev_states_margin
)
);
fc_solve_merge_large_and_small_sorted_arrays(
instance->indirect_prev_states,
instance->num_indirect_prev_states,
instance->indirect_prev_states_margin,
instance->num_prev_states_margin,
sizeof(instance->indirect_prev_states[0]),
fc_solve_state_compare_indirect_with_context,
NULL
);
instance->num_indirect_prev_states += instance->num_prev_states_margin;
instance->num_prev_states_margin=0;
}
is_state_new = TRUE;
}
}
else
{
*existing_state_val = pos_ptr->val;
is_state_new = FALSE;
}
#elif (FCS_STATE_STORAGE == FCS_STATE_STORAGE_LIBREDBLACK_TREE)
*existing_state_val = (fcs_state_extra_info_t *)rbsearch(new_state_val,
instance->tree
);
is_state_new = ((*existing_state_val) == new_state_val);
#elif (FCS_STATE_STORAGE == FCS_STATE_STORAGE_LIBAVL2_TREE)
instance->tree_new_state_key = new_state_key;
instance->tree_new_state = new_state;
if ((*existing_state = (fcs_collectible_state_t *)
fcs_libavl2_states_tree_insert(instance->tree, new_state))
== NULL
)
{
on_state_new(instance, hard_thread, new_state);
return TRUE;
}
else
{
return FALSE;
}
#elif (FCS_STATE_STORAGE == FCS_STATE_STORAGE_GLIB_TREE)
*existing_state_val = g_tree_lookup(instance->tree, (gpointer)new_state_key);
if ((is_state_new = (*existing_state_val == NULL)))
{
/* The new state was not found. Let's insert it.
* The value must be the same as the key, so g_tree_lookup()
* will return it. */
g_tree_insert(
instance->tree,
(gpointer)new_state_key,
(gpointer)new_state_val
);
}
#elif (FCS_STATE_STORAGE == FCS_STATE_STORAGE_GLIB_HASH)
*existing_state_val = g_hash_table_lookup(instance->hash,
(gpointer)new_state_key);
if ((is_state_new = (*existing_state_val == NULL)))
{
/* The new state was not found. Let's insert it.
* The value must be the same as the key, so g_tree_lookup()
* will return it. */
g_hash_table_insert(
instance->hash,
(gpointer)new_state_key,
(gpointer)new_state_val
);
}
#elif (FCS_STATE_STORAGE == FCS_STATE_STORAGE_DB_FILE)
{
DBT key, value;
key.data = new_state;
key.size = sizeof(*new_state);
if ((is_state_new = (instance->db->get(
instance->db,
NULL,
&key,
&value,
0
) == 0)))
{
/* The new state was not found. Let's insert it.
* The value must be the same as the key, so g_tree_lookup()
* will return it. */
value.data = key.data;
value.size = key.size;
instance->db->put(
instance->db,
NULL,
&key,
&value,
0);
}
}
#elif (FCS_STATE_STORAGE == FCS_STATE_STORAGE_JUDY)
{
PWord_t * PValue;
JHSI(PValue, instance->judy_array, new_state_key, sizeof(*new_state_key));
/* later_todo : Handle out-of-memory. */
if ((is_state_new = (*PValue == 0)))
{
/* A new state. */
*PValue = (PWord_t)(*existing_state_val = new_state_val);
}
else
{
/* Already exists. */
*existing_state_val = (fcs_state_extra_info_t *)(*PValue);
}
}
#else
#error no define
#endif
}
#endif /* #ifndef FC_SOLVE__CAAS_C */
|