Lines Matching refs:vec
158 * @vec: vector of profiles to compare (NOT NULL)
159 * @n: length of @vec
161 * Returns: <0 if a < vec
162 * ==0 if a == vec
163 * >0 if a > vec
186 static bool vec_is_stale(struct aa_profile **vec, int n)
190 AA_BUG(!vec);
193 if (profile_is_stale(vec[i]))
200 static bool vec_unconfined(struct aa_profile **vec, int n)
204 AA_BUG(!vec);
207 if (!profile_unconfined(vec[i]))
220 * assumes vec is sorted
221 * Assumes @vec has null terminator at vec[n], and will null terminate
222 * vec[n - dups]
224 static inline int unique(struct aa_profile **vec, int n)
229 AA_BUG(!vec);
233 int res = profile_cmp(vec[pos], vec[i]);
235 AA_BUG(res > 0, "vec not sorted");
238 aa_put_profile(vec[i]);
244 vec[pos] = vec[i];
255 * @vec: list of profiles to sort and merge
259 * If @flags & VEC_FLAG_TERMINATE @vec has null terminator at vec[n], and will
260 * null terminate vec[n - dups]
262 int aa_vec_unique(struct aa_profile **vec, int n, int flags)
267 AA_BUG(!vec);
271 sort(vec, n, sizeof(struct aa_profile *), sort_cmp, NULL);
272 dups = unique(vec, n);
278 struct aa_profile *tmp = vec[i];
282 int res = profile_cmp(vec[pos], tmp);
296 vec[j] = vec[j - 1];
297 vec[pos] = tmp;
306 vec[n - dups] = NULL;
324 label->vec[i.i] = (struct aa_profile *)
379 on_list_rcu(&label->vec[0]->base.profiles));
381 on_list_rcu(&label->vec[0]->base.list));
405 label->vec[size] = NULL; /* null terminate */
427 /* + 1 for null terminator entry on vec */
471 return vec_cmp(a->vec, a->size, b->vec, b->size);
481 if (!profile_unconfined(label->vec[i]))
510 int res = profile_cmp(sub->vec[I->j], set->vec[I->i]);
518 return sub->vec[(I->j)++];
522 return sub->vec[(I->j)++];
709 * __vec_find - find label that matches @vec in label set
710 * @vec: vec of profiles to find matching label for (NOT NULL)
711 * @n: length of @vec
713 * Requires: @vec_labelset(vec) lock held
718 * else NULL if @vec equiv is not in tree
720 static struct aa_label *__vec_find(struct aa_profile **vec, int n)
724 AA_BUG(!vec);
725 AA_BUG(!*vec);
728 node = vec_labelset(vec, n)->root.rb_node;
731 int result = vec_cmp(this->vec, this->size, vec, n);
759 return __vec_find(label->vec, label->size);
828 * @vec: array of profiles to find equiv label for (NOT NULL)
829 * @n: length of @vec
831 * Returns: refcounted label if @vec equiv is in tree
832 * else NULL if @vec equiv is not in tree
834 static struct aa_label *vec_find(struct aa_profile **vec, int n)
840 AA_BUG(!vec);
841 AA_BUG(!*vec);
844 ls = vec_labelset(vec, n);
846 label = __vec_find(vec, n);
853 static struct aa_label *vec_create_and_insert_label(struct aa_profile **vec,
862 AA_BUG(!vec);
865 return aa_get_label(&vec[0]->label);
867 ls = labels_set(&vec[len - 1]->label);
877 new->vec[i] = aa_get_profile(vec[i]);
887 struct aa_label *aa_vec_find_or_create_label(struct aa_profile **vec, int len,
890 struct aa_label *label = vec_find(vec, len);
895 return vec_create_and_insert_label(vec, len, gfp);
912 return vec_find(label->vec, label->size);
974 int res = profile_cmp(a->vec[I->i], b->vec[I->j]);
977 return b->vec[(I->j)++];
982 return a->vec[(I->i)++];
986 return b->vec[(I->j)++];
1017 int res = profile_cmp(p, z->vec[k]);
1069 new->vec[k] = aa_get_newest_profile(next);
1070 AA_BUG(!new->vec[k]->label.proxy);
1071 AA_BUG(!new->vec[k]->label.proxy->label);
1072 if (next->label.proxy != new->vec[k]->label.proxy)
1077 new->vec[k++] = aa_get_profile(next);
1081 new->vec[k] = NULL;
1084 new->size -= aa_vec_unique(&new->vec[0], new->size,
1088 label = aa_get_label(&new->vec[0]->label);
1101 if (vec_unconfined(new->vec, new->size))
1889 DEFINE_VEC(profile, vec);
1912 error = vec_setup(profile, vec, len, gfp);
1917 vec[i] = aa_get_profile(base->vec[i]);
1921 vec[i] = fqlookupn_profile(base, currbase, str, split - str);
1922 if (!vec[i])
1928 if (vec[i]->ns != labels_ns(currbase))
1929 currbase = &vec[i]->label;
1935 vec[i] = fqlookupn_profile(base, currbase, str, end - str);
1936 if (!vec[i])
1940 /* no need to free vec as len < LOCAL_VEC_ENTRIES */
1941 return &vec[0]->label;
1943 len -= aa_vec_unique(vec, len, VEC_FLAG_TERMINATE);
1946 label = aa_get_label(&vec[0]->label);
1951 label = aa_vec_find_or_create_label(vec, len, gfp);
1953 label = vec_find(vec, len);
1959 vec_cleanup(profile, vec, len);
2025 vec_is_stale(label->vec, label->size)) &&
2071 AA_BUG(!label->vec[i]);
2072 new->vec[i] = aa_get_newest_profile(label->vec[i]);
2073 AA_BUG(!new->vec[i]);
2074 AA_BUG(!new->vec[i]->label.proxy);
2075 AA_BUG(!new->vec[i]->label.proxy->label);
2076 if (new->vec[i]->label.proxy != label->vec[i]->label.proxy)
2082 new->size -= aa_vec_unique(&new->vec[0], new->size,
2086 tmp = aa_get_label(&new->vec[0]->label);