Lines Matching defs:hats
588 * @hats: vector of hat names to try changing into (MAYBE NULL if @count == 0)
589 * @count: number of hat names in @hats
593 * Change to the first profile specified in @hats that exists, and store
600 int aa_change_hat(const char *hats[], int count, u64 token, bool permtest)
631 hat = aa_find_child(root, hats[i]);
642 * In complain mode and failed to match any hats.
647 * TODO: Add logging of all failed hats
651 name = new_compound_name(root->base.hname, hats[0]);
682 /* reset error for learning of new hats */
717 * Change to new profile @name. Unlike with hats, there is no way