HomeSort by: relevance | last modified time | path
    Searched refs:acl_int (Results 1 - 5 of 5) sorted by relevancy

  /src/lib/libc/posix1e/
acl_entry.c 50 struct acl *acl_int; local
57 acl_int = &(*acl_p)->ats_acl;
63 if (acl_int->acl_cnt + 1 >= ACL_MAX_ENTRIES) {
68 *entry_p = &acl_int->acl_entry[acl_int->acl_cnt++];
85 struct acl *acl_int; local
92 acl_int = &(*acl_p)->ats_acl;
94 if (acl_int->acl_cnt + 1 >= ACL_MAX_ENTRIES) {
99 if (offset < 0 || (size_t)offset > acl_int->acl_cnt) {
105 for (i = acl_int->acl_cnt; i > offset; i--
130 struct acl *acl_int; local
    [all...]
acl_calc_mask.c 55 struct acl *acl_int, *acl_int_new; local
78 acl_int = &(*acl_p)->ats_acl;
79 if ((acl_int->acl_cnt < 3) || (acl_int->acl_cnt > ACL_MAX_ENTRIES)) {
acl_support.c 140 struct acl *acl_int; local
142 acl_int = &acl->ats_acl;
144 qsort(&acl_int->acl_entry[0], acl_int->acl_cnt,
180 struct acl *acl_int; local
188 acl_int = &acl->ats_acl;
192 while (i < acl_int->acl_cnt) {
193 entry = &acl_int->acl_entry[i];
354 struct acl *acl_int; local
357 acl_int = &acl->ats_acl
    [all...]
acl_to_text.c 63 struct acl *acl_int; local
78 acl_int = &acl->ats_acl;
81 for (i = 0; i < acl_int->acl_cnt; i++)
82 if (acl_int->acl_entry[i].ae_tag == ACL_MASK)
83 mask_perm = acl_int->acl_entry[i].ae_perm;
85 for (i = 0; i < acl_int->acl_cnt; i++) {
86 ae_tag = acl_int->acl_entry[i].ae_tag;
87 ae_id = acl_int->acl_entry[i].ae_id;
88 ae_perm = acl_int->acl_entry[i].ae_perm;
acl_delete_entry.c 133 struct acl *acl_int; local
141 acl_int = &acl->ats_acl;
143 if (offset < 0 || (size_t)offset >= acl_int->acl_cnt) {

Completed in 21 milliseconds