Home
last modified time | relevance | path

Searched refs:match_multi_entry (Results 1 – 3 of 3) sorted by relevance

/system/vold/tests/
Dcryptfs_test.cpp31 ASSERT_NE(0, match_multi_entry("foo", "foo", 0)); in TEST_F()
32 ASSERT_NE(0, match_multi_entry("foo_0", "foo", 0)); in TEST_F()
33 ASSERT_NE(0, match_multi_entry("foo_1", "foo", 0)); in TEST_F()
34 ASSERT_NE(0, match_multi_entry("foo_2", "foo", 0)); in TEST_F()
36 ASSERT_EQ(0, match_multi_entry("foo", "foo", 1)); in TEST_F()
37 ASSERT_EQ(0, match_multi_entry("foo_0", "foo", 1)); in TEST_F()
38 ASSERT_NE(0, match_multi_entry("foo_1", "foo", 1)); in TEST_F()
39 ASSERT_NE(0, match_multi_entry("foo_2", "foo", 1)); in TEST_F()
41 ASSERT_EQ(0, match_multi_entry("foo", "foo", 2)); in TEST_F()
42 ASSERT_EQ(0, match_multi_entry("foo_0", "foo", 2)); in TEST_F()
[all …]
/system/vold/
Dcryptfs.h59 int match_multi_entry(const char* key, const char* field, unsigned index);
Dcryptfs.cpp2554 int match_multi_entry(const char* key, const char* field, unsigned index) { in match_multi_entry() function
2595 if (!match_multi_entry(persist_data->persist_entry[i].key, fieldname, index)) { in persist_del_keys()
2622 if (match_multi_entry(persist_data->persist_entry[i].key, fieldname, 0)) { in persist_count_keys()