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
|
/*
SSSD
find_uid - Utilities tests
Authors:
Abhishek Singh <abhishekkumarsingh.cse@gmail.com>
Copyright (C) 2013 Red Hat
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <stdarg.h>
#include <stdlib.h>
#include <stddef.h>
#include <setjmp.h>
#include <unistd.h>
#include <sys/types.h>
#include <cmocka.h>
#include "util/find_uid.h"
#include "tests/common.h"
#include "dhash.h"
void test_check_if_uid_is_active_success(void **state)
{
int ret;
uid_t uid;
bool result;
uid = getuid();
ret = check_if_uid_is_active(uid, &result);
assert_true(ret == EOK);
assert_true(result);
}
void test_check_if_uid_is_active_fail(void **state)
{
int ret;
uid_t uid;
bool result;
uid = (uid_t) -7;
ret = check_if_uid_is_active(uid, &result);
assert_true(ret == EOK);
assert_true(!result);
}
void test_get_uid_table(void **state)
{
int ret;
uid_t uid;
TALLOC_CTX *tmp_ctx;
hash_table_t *table;
hash_key_t key;
hash_value_t value;
tmp_ctx = talloc_new(NULL);
assert_true(tmp_ctx != NULL);
ret = get_uid_table(tmp_ctx, &table);
assert_true(ret == EOK);
uid = getuid();
key.type = HASH_KEY_ULONG;
key.ul = (unsigned long) uid;
ret = hash_lookup(table, &key, &value);
assert_true(ret == HASH_SUCCESS);
assert_true(hash_delete(table, &key) == HASH_SUCCESS);
uid = (uid_t) -7;
key.type = HASH_KEY_ULONG;
key.ul = (unsigned long) uid;
ret = hash_lookup(table, &key, &value);
assert_true(ret == HASH_ERROR_KEY_NOT_FOUND);
talloc_free(tmp_ctx);
}
int main(void)
{
const UnitTest tests[] = {
unit_test(test_check_if_uid_is_active_success),
unit_test(test_check_if_uid_is_active_fail),
unit_test(test_get_uid_table)
};
return run_tests(tests);
}
|
