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
|
/* 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.
*/
/*
* move_funcs_order.c - contains the fc_solve_apply_tests_order function.
*
*/
#define BUILDING_DLL 1
#include "move_funcs_order.h"
#include "bool.h"
int fc_solve_apply_tests_order(
fcs_tests_order_t * tests_order,
const char * string,
char * * error_string
)
{
int a;
int len;
int test_index;
fcs_bool_t is_group, is_start_group;
char test_name[2] = {0};
if (tests_order->tests)
{
free(tests_order->tests);
tests_order->num = 0;
tests_order->tests = malloc(sizeof(tests_order->tests[0])*TESTS_ORDER_GROW_BY);
}
len = strlen(string);
test_index = 0;
is_group = FALSE;
is_start_group = FALSE;
for(a=0;(a<len) ;a++)
{
if ((string[a] == '(') || (string[a] == '['))
{
if (is_group)
{
*error_string = strdup("There's a nested random group.");
return 1;
}
is_group = TRUE;
is_start_group = TRUE;
continue;
}
if ((string[a] == ')') || (string[a] == ']'))
{
if (is_start_group)
{
*error_string = strdup("There's an empty group.");
return 2;
}
if (! is_group)
{
*error_string = strdup("There's a renegade right parenthesis or bracket.");
return 3;
}
is_group = FALSE;
is_start_group = FALSE;
continue;
}
if (! ((test_index) & (TESTS_ORDER_GROW_BY - 1)))
{
tests_order->tests =
realloc(
tests_order->tests,
sizeof(tests_order->tests[0]) * (test_index+TESTS_ORDER_GROW_BY)
);
}
test_name[0] = string[a];
tests_order->tests[test_index++] =
(
(fc_solve_string_to_test_num(test_name)%FCS_TESTS_NUM)
| (is_group ? FCS_TEST_ORDER_FLAG_RANDOM : 0)
| (is_start_group ? FCS_TEST_ORDER_FLAG_START_RANDOM_GROUP : 0)
);
is_start_group = FALSE;
}
if (a != len)
{
*error_string = strdup("The Input string is too long.");
return 4;
}
tests_order->num = test_index;
*error_string = NULL;
return 0;
}
|
