src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
120
rules *next;
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
154
typedef rules ValueType;
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
166
bool Compare(KeyType key, ValueType* rules) const
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
168
return strcmp(rules->name, key) == 0;
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
216
team_rules *rules = (team_rules *)_rules;
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
219
sTeamHash->Remove(rules);
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
222
delete rules;
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
257
static inline rules *
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
272
struct rules *rules = find_rules(name);
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
273
if (rules == NULL) {
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
275
rules = new ::rules;
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
276
if (rules == NULL)
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
279
strlcpy(rules->name, name, B_FILE_NAME_LENGTH);
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
280
rules->first = NULL;
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
281
sRulesHash->Insert(rules);
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
286
Rule *rule = rules->first;
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
298
rule->Next() = rules->first;
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
299
rules->first = rule;
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
599
struct rules *rules = sRulesHash->Lookup(name);
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
600
if (rules == NULL) {
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
607
for (Rule *rule = rules->first; rule != NULL; rule = rule->Next()) {
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
612
TRACE(("found rule %p for \"%s\"\n", rule, rules->name));
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
729
struct rules *rules = sRulesHash->Clear(true);
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
730
while (rules != NULL) {
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
731
Rule *rule = rules->first;
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
735
dprintf("Rule %p \"%s\"\n", rule, rules->name);
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
742
struct rules *next = rules->next;
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
743
delete rules;
src/add-ons/kernel/file_cache/rule_based_prefetcher.cpp
744
rules = next;
src/apps/expander/ExpanderRules.cpp
211
RuleRefFilter::RuleRefFilter(ExpanderRules& rules)
src/apps/expander/ExpanderRules.cpp
214
fRules(rules)
src/apps/expander/ExpanderRules.h
66
RuleRefFilter(ExpanderRules& rules);
src/libs/libsolv/solv/problems.c
100
Id name = pool->solvables[-solv->rules[v].p].name;
src/libs/libsolv/solv/problems.c
1004
findallproblemrules_internal(solv, solv->learnt_why.elements[rid - solv->learntrules], rules, rseen);
src/libs/libsolv/solv/problems.c
1007
queue_pushunique(rules, rid);
src/libs/libsolv/solv/problems.c
101
while (v > solv->infarchrules && pool->solvables[-solv->rules[v - 1].p].name == name)
src/libs/libsolv/solv/problems.c
1020
solver_findallproblemrules(Solver *solv, Id problem, Queue *rules)
src/libs/libsolv/solv/problems.c
1023
queue_empty(rules);
src/libs/libsolv/solv/problems.c
1025
findallproblemrules_internal(solv, solv->problems.elements[2 * problem - 2], rules, &rseen);
src/libs/libsolv/solv/problems.c
103
for (; v < solv->infarchrules_end && pool->solvables[-solv->rules[v].p].name == name; v++)
src/libs/libsolv/solv/problems.c
104
solver_enablerule(solv, solv->rules + v);
src/libs/libsolv/solv/problems.c
110
Id name = pool->solvables[-solv->rules[v].p].name;
src/libs/libsolv/solv/problems.c
111
while (v > solv->duprules && pool->solvables[-solv->rules[v - 1].p].name == name)
src/libs/libsolv/solv/problems.c
113
for (; v < solv->duprules_end && pool->solvables[-solv->rules[v].p].name == name; v++)
src/libs/libsolv/solv/problems.c
114
solver_enablerule(solv, solv->rules + v);
src/libs/libsolv/solv/problems.c
120
r = solv->rules + (v - solv->featurerules + solv->updaterules);
src/libs/libsolv/solv/problems.c
124
solver_enablerule(solv, solv->rules + v);
src/libs/libsolv/solv/problems.c
128
r = solv->rules + (v - solv->updaterules + solv->featurerules);
src/libs/libsolv/solv/problems.c
136
for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++, jp++)
src/libs/libsolv/solv/problems.c
155
for (i = 1, r = solv->rules + i; i < solv->learntrules; i++, r++)
src/libs/libsolv/solv/problems.c
214
Rule *r = solv->rules + solv->featurerules + (sug - solv->updaterules);
src/libs/libsolv/solv/problems.c
301
Rule *r = solv->rules + (v - solv->updaterules + solv->featurerules);
src/libs/libsolv/solv/problems.c
326
Rule *r = solv->rules + (v - solv->updaterules + solv->featurerules);
src/libs/libsolv/solv/problems.c
402
assert(solv->rules[why].p < 0);
src/libs/libsolv/solv/problems.c
403
name = pool->solvables[-solv->rules[why].p].name;
src/libs/libsolv/solv/problems.c
404
while (why > solv->infarchrules && pool->solvables[-solv->rules[why - 1].p].name == name)
src/libs/libsolv/solv/problems.c
407
for (; why < solv->infarchrules_end && pool->solvables[-solv->rules[why].p].name == name; why++)
src/libs/libsolv/solv/problems.c
408
if (solv->decisionmap[-solv->rules[why].p] > 0)
src/libs/libsolv/solv/problems.c
410
p = -solv->rules[why].p;
src/libs/libsolv/solv/problems.c
423
assert(solv->rules[why].p < 0);
src/libs/libsolv/solv/problems.c
424
name = pool->solvables[-solv->rules[why].p].name;
src/libs/libsolv/solv/problems.c
425
while (why > solv->duprules && pool->solvables[-solv->rules[why - 1].p].name == name)
src/libs/libsolv/solv/problems.c
428
for (; why < solv->duprules_end && pool->solvables[-solv->rules[why].p].name == name; why++)
src/libs/libsolv/solv/problems.c
429
if (solv->decisionmap[-solv->rules[why].p] > 0)
src/libs/libsolv/solv/problems.c
431
p = -solv->rules[why].p;
src/libs/libsolv/solv/problems.c
447
rr = solv->rules + why;
src/libs/libsolv/solv/problems.c
453
if (solv->dupmap_all && solv->rules[why].p != p && solv->decisionmap[p] > 0)
src/libs/libsolv/solv/problems.c
462
rr = solv->rules + solv->featurerules + (why - solv->updaterules);
src/libs/libsolv/solv/problems.c
464
rr = solv->rules + why;
src/libs/libsolv/solv/problems.c
47
Id name = pool->solvables[-solv->rules[v].p].name;
src/libs/libsolv/solv/problems.c
48
while (v > solv->infarchrules && pool->solvables[-solv->rules[v - 1].p].name == name)
src/libs/libsolv/solv/problems.c
495
rr = solv->rules + why;
src/libs/libsolv/solv/problems.c
50
for (; v < solv->infarchrules_end && pool->solvables[-solv->rules[v].p].name == name; v++)
src/libs/libsolv/solv/problems.c
51
solver_disablerule(solv, solv->rules + v);
src/libs/libsolv/solv/problems.c
515
rr = solv->rules + solv->featurerules + (p - solv->installed->start);
src/libs/libsolv/solv/problems.c
517
rr = solv->rules + solv->updaterules + (p - solv->installed->start);
src/libs/libsolv/solv/problems.c
57
Id name = pool->solvables[-solv->rules[v].p].name;
src/libs/libsolv/solv/problems.c
58
while (v > solv->duprules && pool->solvables[-solv->rules[v - 1].p].name == name)
src/libs/libsolv/solv/problems.c
60
for (; v < solv->duprules_end && pool->solvables[-solv->rules[v].p].name == name; v++)
src/libs/libsolv/solv/problems.c
61
solver_disablerule(solv, solv->rules + v);
src/libs/libsolv/solv/problems.c
64
solver_disablerule(solv, solv->rules + v);
src/libs/libsolv/solv/problems.c
70
r = solv->rules + (v - solv->updaterules + solv->featurerules);
src/libs/libsolv/solv/problems.c
79
for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++, jp++)
src/libs/libsolv/solv/problems.c
877
r = solv->rules + rid;
src/libs/libsolv/solv/problems.c
912
r = solv->rules + rid;
src/libs/libsolv/solv/problems.c
925
Id op = -solv->rules[*reqrp].p;
src/libs/libsolv/solv/problems.c
994
findallproblemrules_internal(Solver *solv, Id idx, Queue *rules, Map *rseen)
src/libs/libsolv/solv/problems.h
46
void solver_findallproblemrules(struct _Solver *solv, Id problem, Queue *rules);
src/libs/libsolv/solv/rules.c
1004
solver_disablerule(solv, solv->rules + solv->bestrules + i);
src/libs/libsolv/solv/rules.c
1015
r = solv->rules + solv->updaterules + (p - solv->installed->start);
src/libs/libsolv/solv/rules.c
1030
r = solv->rules + solv->featurerules + (p - solv->installed->start);
src/libs/libsolv/solv/rules.c
1047
solver_enablerule(solv, solv->rules + solv->bestrules + i);
src/libs/libsolv/solv/rules.c
1155
for (i = solv->infarchrules, r = solv->rules + i; i < solv->infarchrules_end; i++, r++)
src/libs/libsolv/solv/rules.c
1168
for (i = solv->infarchrules, r = solv->rules + i; i < solv->infarchrules_end; i++, r++)
src/libs/libsolv/solv/rules.c
1426
for (i = solv->duprules, r = solv->rules + i; i < solv->duprules_end; i++, r++)
src/libs/libsolv/solv/rules.c
1439
for (i = solv->duprules, r = solv->rules + i; i < solv->duprules_end; i++, r++)
src/libs/libsolv/solv/rules.c
148
solv_sort(solv->rules + 1, solv->nrules - 1, sizeof(Rule), unifyrules_sortcmp, solv->pool);
src/libs/libsolv/solv/rules.c
155
for (i = j = 1, ir = solv->rules + i; i < solv->nrules; i++, ir++)
src/libs/libsolv/solv/rules.c
159
jr = solv->rules + j++; /* keep! */
src/libs/libsolv/solv/rules.c
169
solv->rules = solv_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
src/libs/libsolv/solv/rules.c
1786
r = solv->rules + i;
src/libs/libsolv/solv/rules.c
183
r = solv->rules + i;
src/libs/libsolv/solv/rules.c
1872
r = solv->rules + i;
src/libs/libsolv/solv/rules.c
1940
r = solv->rules + i;
src/libs/libsolv/solv/rules.c
1972
r = solv->rules + solv->ruleinfoq->elements[0];
src/libs/libsolv/solv/rules.c
2070
Rule *r = solv->rules + rid;
src/libs/libsolv/solv/rules.c
2122
Rule *r = solv->rules + rid;
src/libs/libsolv/solv/rules.c
2269
r = solv->rules + rid;
src/libs/libsolv/solv/rules.c
2311
ur = solv->rules + solv->updaterules + (pi - pool->installed->start);
src/libs/libsolv/solv/rules.c
2313
ur = solv->rules + solv->featurerules + (pi - pool->installed->start);
src/libs/libsolv/solv/rules.c
2375
for (rid = solv->infarchrules, r = solv->rules + rid; rid < solv->infarchrules_end; rid++, r++)
src/libs/libsolv/solv/rules.c
2378
for (rid = solv->duprules, r = solv->rules + rid; rid < solv->duprules_end; rid++, r++)
src/libs/libsolv/solv/rules.c
2386
r = solv->rules + rid;
src/libs/libsolv/solv/rules.c
2515
ur = solv->rules + solv->updaterules + (qi.elements[i] - pool->installed->start);
src/libs/libsolv/solv/rules.c
2517
ur = solv->rules + solv->featurerules + (qi.elements[i] - pool->installed->start);
src/libs/libsolv/solv/rules.c
2537
solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + rid);
src/libs/libsolv/solv/rules.c
2562
solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + rid);
src/libs/libsolv/solv/rules.c
2564
solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + solv->nrules - 1);
src/libs/libsolv/solv/rules.c
2588
or = solv->rules + solv->choicerules_ref[(r - solv->rules) - solv->choicerules];
src/libs/libsolv/solv/rules.c
2598
r = solv->rules + rid;
src/libs/libsolv/solv/rules.c
2601
or = solv->rules + solv->choicerules_ref[(r - solv->rules) - solv->choicerules];
src/libs/libsolv/solv/rules.c
2676
r = solv->rules + solv->jobrules + j;
src/libs/libsolv/solv/rules.c
2706
r = solv->rules + solv->updaterules + (p - installed->start);
src/libs/libsolv/solv/rules.c
2709
r = solv->rules + solv->featurerules + (p - installed->start);
src/libs/libsolv/solv/rules.c
2711
r = solv->rules + solv->updaterules + (p - installed->start);
src/libs/libsolv/solv/rules.c
2713
if (solv->multiversionupdaters && (d = solv->multiversionupdaters[p - installed->start]) != 0 && r == solv->rules + solv->updaterules + (p - installed->start))
src/libs/libsolv/solv/rules.c
2738
r = solv->rules + solv->featurerules + (p - installed->start);
src/libs/libsolv/solv/rules.c
279
r = solv->rules + solv->nrules - 1; /* get the last added rule */
src/libs/libsolv/solv/rules.c
3030
r = solv->rules + rid;
src/libs/libsolv/solv/rules.c
3044
r = solv->rules + rid;
src/libs/libsolv/solv/rules.c
3274
r = solv->rules + rid;
src/libs/libsolv/solv/rules.c
3288
r = solv->rules + rid;
src/libs/libsolv/solv/rules.c
340
solv->rules = solv_extend(solv->rules, solv->nrules, 1, sizeof(Rule), RULES_BLOCK);
src/libs/libsolv/solv/rules.c
341
r = solv->rules + solv->nrules++; /* point to rule space */
src/libs/libsolv/solv/rules.c
384
solv->rules = solv_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
src/libs/libsolv/solv/rules.c
992
r = solv->rules + solv->updaterules + (p - solv->installed->start);
src/libs/libsolv/solv/rules.c
995
r = solv->rules + solv->featurerules + (p - solv->installed->start);
src/libs/libsolv/solv/solver.c
1007
analyze_unsolvable_rule(solv, solv->rules + solv->learnt_pool.elements[i], lastweakp, rseen);
src/libs/libsolv/solv/solver.c
1022
Id name = pool->solvables[-solv->rules[why].p].name;
src/libs/libsolv/solv/solver.c
1023
while (why > solv->infarchrules && pool->solvables[-solv->rules[why - 1].p].name == name)
src/libs/libsolv/solv/solver.c
1028
Id name = pool->solvables[-solv->rules[why].p].name;
src/libs/libsolv/solv/solver.c
1029
while (why > solv->duprules && pool->solvables[-solv->rules[why - 1].p].name == name)
src/libs/libsolv/solv/solver.c
1095
queue_push(&solv->learnt_pool, r - solv->rules);
src/libs/libsolv/solv/solver.c
1129
r = solv->rules + why;
src/libs/libsolv/solv/solver.c
1166
solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + lastweak);
src/libs/libsolv/solv/solver.c
1168
solver_disablechoicerules(solv, solv->rules + lastweak);
src/libs/libsolv/solv/solver.c
1312
POOL_DEBUG(SOLV_DEBUG_ANALYZE, "conflict with rule #%d\n", (int)(r - solv->rules));
src/libs/libsolv/solv/solver.c
1320
assert(solv->learnt_why.count == (r - solv->rules) - solv->learntrules);
src/libs/libsolv/solv/solver.c
1331
queue_push(&solv->ruleassertions, r - solv->rules);
src/libs/libsolv/solv/solver.c
1336
queue_push(&solv->decisionq_why, r - solv->rules);
src/libs/libsolv/solv/solver.c
1451
solv->rules = solv_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
src/libs/libsolv/solv/solver.c
1452
memset(solv->rules, 0, sizeof(Rule));
src/libs/libsolv/solv/solver.c
1515
solv_free(solv->rules);
src/libs/libsolv/solv/solver.c
1629
r = solv->rules + solv->featurerules + (i - solv->installed->start);
src/libs/libsolv/solv/solver.c
1638
r = solv->rules + solv->updaterules + (i - solv->installed->start);
src/libs/libsolv/solv/solver.c
1649
solver_printruleclass(solv, SOLV_DEBUG_SOLVER, solv->rules + solv->featurerules + (i - solv->installed->start));
src/libs/libsolv/solv/solver.c
1710
solver_printruleclass(solv, SOLV_DEBUG_RULE_CREATION, solv->rules + i);
src/libs/libsolv/solv/solver.c
1759
for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++)
src/libs/libsolv/solv/solver.c
184
Id p = solv->rules[v].p;
src/libs/libsolv/solv/solver.c
1851
r = solv->rules + solv->updaterules + (i - installed->start);
src/libs/libsolv/solv/solver.c
188
r = solv->rules + solv->featurerules + (p - solv->installed->start);
src/libs/libsolv/solv/solver.c
1883
rr = solv->rules + solv->featurerules + (i - solv->installed->start);
src/libs/libsolv/solv/solver.c
1913
level = selectandinstall(solv, level, &dq, disablerules, rr - solv->rules);
src/libs/libsolv/solv/solver.c
1947
level = setpropagatelearn(solv, level, i, disablerules, r - solv->rules);
src/libs/libsolv/solv/solver.c
1989
r = solv->rules + i;
src/libs/libsolv/solv/solver.c
204
solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + v);
src/libs/libsolv/solv/solver.c
2067
level = selectandinstall(solv, level, &dq, disablerules, r - solv->rules);
src/libs/libsolv/solv/solver.c
210
Id p = solv->rules[v].p;
src/libs/libsolv/solv/solver.c
245
for (i = solv->learntrules, r = solv->rules + i; i < solv->nrules; i++, r++)
src/libs/libsolv/solv/solver.c
251
if (solv->rules[why].d < 0)
src/libs/libsolv/solv/solver.c
2558
r = solv->rules + why;
src/libs/libsolv/solv/solver.c
2573
for (i = n = 1, r = solv->rules + i; n < solv->nrules; i++, r++, n++)
src/libs/libsolv/solv/solver.c
2578
r = solv->rules + i;
src/libs/libsolv/solv/solver.c
2653
for (i = 1, r = solv->rules + i; i < solv->rpmrules_end; i++, r++)
src/libs/libsolv/solv/solver.c
2857
r = solv->rules + j;
src/libs/libsolv/solv/solver.c
2893
r = solv->rules + j;
src/libs/libsolv/solv/solver.c
318
r = solv->rules + ri;
src/libs/libsolv/solv/solver.c
3320
r = solv->rules + solv->nrules - 1; /* r: update rule */
src/libs/libsolv/solv/solver.c
341
queue_push(&solv->decisionq_why, r - solv->rules);
src/libs/libsolv/solv/solver.c
3448
if (solv->rules[j].p == -p)
src/libs/libsolv/solv/solver.c
3526
solver_printrule(solv, SOLV_DEBUG_JOB, solv->rules + j);
src/libs/libsolv/solv/solver.c
3569
solver_printruleclass(solv, SOLV_DEBUG_RESULT, solv->rules + i);
src/libs/libsolv/solv/solver.c
3610
for (i = 1, r = solv->rules + i; i < solv->nrules; i++, r++)
src/libs/libsolv/solv/solver.c
3692
for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++)
src/libs/libsolv/solv/solver.c
3861
solver_enablerule(solv, solv->rules + disabledq.elements[i]);
src/libs/libsolv/solv/solver.c
466
for (i = solv->featurerules, rr = solv->rules + i; i < solv->learntrules; i++, rr++)
src/libs/libsolv/solv/solver.c
478
solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + i);
src/libs/libsolv/solv/solver.c
504
r = solv->rules + ri;
src/libs/libsolv/solv/solver.c
515
queue_push(&solv->decisionq_why, r - solv->rules);
src/libs/libsolv/solv/solver.c
574
for (i = 1, r = solv->rules + solv->nrules - 1; i < solv->nrules; i++, r--)
src/libs/libsolv/solv/solver.c
576
for (i = 1, r = solv->rules + 1; i < solv->nrules; i++, r++)
src/libs/libsolv/solv/solver.c
584
solv->watches[nsolvables + r->w1] = r - solv->rules;
src/libs/libsolv/solv/solver.c
587
solv->watches[nsolvables + r->w2] = r - solv->rules;
src/libs/libsolv/solv/solver.c
606
solv->watches[nsolvables + r->w1] = r - solv->rules;
src/libs/libsolv/solv/solver.c
609
solv->watches[nsolvables + r->w2] = r - solv->rules;
src/libs/libsolv/solv/solver.c
671
r = solv->rules + *rp;
src/libs/libsolv/solv/solver.c
772
watches[p] = r - solv->rules;
src/libs/libsolv/solv/solver.c
798
queue_push(&solv->decisionq_why, r - solv->rules);
src/libs/libsolv/solv/solver.c
850
queue_push(&solv->learnt_pool, c - solv->rules);
src/libs/libsolv/solv/solver.c
921
c = solv->rules + why;
src/libs/libsolv/solv/solver.c
996
Id why = r - solv->rules;
src/libs/libsolv/solv/solver.h
45
Rule *rules; /* all rules */
src/libs/libsolv/solv/solverdebug.c
168
if (r >= solv->rules && r < solv->rules + solv->nrules) /* r is a solver rule */
src/libs/libsolv/solv/solverdebug.c
169
POOL_DEBUG(type, "Rule #%d:", (int)(r - solv->rules));
src/libs/libsolv/solv/solverdebug.c
202
Id p = r - solv->rules;
src/libs/libsolv/solv/solverdebug.c
235
solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, solv->rules + v);
src/libs/libsolv/solv/solverdebug.c
241
for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++, jp++)
src/libs/libsolv/solv/solverdebug.c
281
solver_printruleclass(solv, type, solv->rules + why);
src/libs/libsolv/solv/solverdebug.c
286
solver_printruleclass(solv, type, solv->rules - why);
src/tests/kits/storage/MimeSnifferTest.cpp
1111
const char *rules[] = {
src/tests/kits/storage/MimeSnifferTest.cpp
1141
const int ruleCount = sizeof(rules)/sizeof(char*);
src/tests/kits/storage/MimeSnifferTest.cpp
1371
status_t err = parse(rules[j], &rule, &errorMsg);
src/tests/kits/storage/MimeSnifferTest.cpp
1387
CPPUNIT_ASSERT_EQUAL_MESSAGE(rules[j],