FM / setools

/usr/lib64/python3.6/site-packages/setools/

/usr/lib64/python3.6/site-packages/setools

Name	Size	Mode	Actions
diff/	-	0755	rm
__pycache__/	-	0755	rm
boolquery.py	2239	0644	edit dl rm
boundsquery.py	2406	0644	edit dl rm
categoryquery.py	1922	0644	edit dl rm
commonquery.py	2164	0644	edit dl rm
constraintquery.py	5634	0644	edit dl rm
defaultquery.py	2865	0644	edit dl rm
descriptors.py	7650	0644	edit dl rm
devicetreeconquery.py	2788	0644	edit dl rm
dta.py	21918	0644	edit dl rm
exception.py	6109	0644	edit dl rm
fsusequery.py	3437	0644	edit dl rm
genfsconquery.py	3770	0644	edit dl rm
ibendportconquery.py	3608	0644	edit dl rm
ibpkeyconquery.py	5346	0644	edit dl rm
infoflow.py	14939	0644	edit dl rm
initsidquery.py	2860	0644	edit dl rm
iomemconquery.py	4544	0644	edit dl rm
ioportconquery.py	4567	0644	edit dl rm
mixins.py	7312	0644	edit dl rm
mlsrulequery.py	4703	0644	edit dl rm
netifconquery.py	3003	0644	edit dl rm
nodeconquery.py	4261	0644	edit dl rm
objclassquery.py	3871	0644	edit dl rm
pcideviceconquery.py	3116	0644	edit dl rm
permmap.py	16490	0644	edit dl rm
perm_map	89255	0644	edit dl rm
pirqconquery.py	3022	0644	edit dl rm
polcapquery.py	1675	0644	edit dl rm
policyrep.cpython-36m-x86_64-linux-gnu.so	1963568	0755	edit dl rm
portconquery.py	5166	0644	edit dl rm
query.py	1734	0644	edit dl rm
rbacrulequery.py	5748	0644	edit dl rm
rolequery.py	2540	0644	edit dl rm
sensitivityquery.py	2718	0644	edit dl rm
terulequery.py	9324	0644	edit dl rm
typeattrquery.py	2682	0644	edit dl rm
typequery.py	3512	0644	edit dl rm
userquery.py	4791	0644	edit dl rm
util.py	5444	0644	edit dl rm
__init__.py	2856	0644	edit dl rm

Edit: /usr/lib64/python3.6/site-packages/setools/util.py (5444B)

# Copyright 2016, Tresys Technology, LLC
#
# This file is part of SETools.
#
# SETools is free software: you can redistribute it and/or modify
# it under the terms of the GNU Lesser General Public License as
# published by the Free Software Foundation, either version 2.1 of
# the License, or (at your option) any later version.
#
# SETools 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 Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with SETools.  If not, see
# <http://www.gnu.org/licenses/>.
#

def match_regex(obj, criteria, regex):
    """
    Match the object with optional regular expression.

Parameters:
    obj         The object to match.
    criteria    The criteria to match.
    regex       If regular expression matching should be used.
    """

if regex:
        return bool(criteria.search(str(obj)))
    else:
        return obj == criteria

def match_set(obj, criteria, equal):
    """
    Match the object (a set) with optional set equality.

Parameters:
    obj         The object to match. (a set)
    criteria    The criteria to match. (a set)
    equal       If set equality should be used. Otherwise
                any set intersection will match.
    """

if equal:
        return obj == criteria
    else:
        return bool(obj.intersection(criteria))

def match_in_set(obj, criteria, regex):
    """
    Match if the criteria is in the list, with optional
    regular expression matching.

Parameters:
    obj         The object to match.
    criteria    The criteria to match.
    regex       If regular expression matching should be used.
    """

if regex:
        return [m for m in obj if criteria.search(str(m))]
    else:
        return criteria in obj

def match_indirect_regex(obj, criteria, indirect, regex):
    """
    Match the object with optional regular expression and indirection.

Parameters:
    obj         The object to match.
    criteria    The criteria to match.
    regex       If regular expression matching should be used.
    indirect    If object indirection should be used, e.g.
                expanding an attribute.
    """

if indirect:
        if regex:
            return [o for o in obj.expand() if criteria.search(str(o))]
        else:
            return set(criteria.expand()).intersection(obj.expand())
    else:
        return match_regex(obj, criteria, regex)

def match_regex_or_set(obj, criteria, equal, regex):
    """
    Match the object (a set) with either set comparisons
    (equality or intersection) or by regex matching of the
    set members.  Regular expression matching will override
    the set equality option.

Parameters:
    obj         The object to match. (a set)
    criteria    The criteria to match.
    equal       If set equality should be used.  Otherwise
                any set intersection will match. Ignored
                if regular expression matching is used.
    regex       If regular expression matching should be used.
    """

if regex:
        return [m for m in obj if criteria.search(str(m))]
    else:
        return match_set(obj, set(criteria), equal)

def match_range(obj, criteria, subset, overlap, superset, proper):
    """
    Match ranges of objects.

obj         An object with attributes named "low" and "high", representing the range.
    criteria    An object with attributes named "low" and "high", representing the criteria.
    subset      If true, the criteria will match if it is a subset obj's range.
    overlap     If true, the criteria will match if it overlaps any of the obj's range.
    superset    If true, the criteria will match if it is a superset of the obj's range.
    proper      If true, use proper superset/subset operations.
                No effect if not using set operations.
    """

if overlap:
        return ((obj.low <= criteria.low <= obj.high) or (
            obj.low <= criteria.high <= obj.high) or (
            criteria.low <= obj.low and obj.high <= criteria.high))
    elif subset:
        if proper:
            return ((obj.low < criteria.low and criteria.high <= obj.high) or (
                obj.low <= criteria.low and criteria.high < obj.high))
        else:
            return obj.low <= criteria.low and criteria.high <= obj.high
    elif superset:
        if proper:
            return ((criteria.low < obj.low and obj.high <= criteria.high) or (
                criteria.low <= obj.low and obj.high < criteria.high))
        else:
            return (criteria.low <= obj.low and obj.high <= criteria.high)
    else:
        return criteria.low == obj.low and obj.high == criteria.high

def match_level(obj, criteria, dom, domby, incomp):
    """
    Match the an MLS level.

obj         The level to match.
    criteria    The criteria to match. (a level)
    dom         If true, the criteria will match if it dominates obj.
    domby       If true, the criteria will match if it is dominated by obj.
    incomp      If true, the criteria will match if it is incomparable to obj.
    """

if dom:
        return (criteria >= obj)
    elif domby:
        return (criteria <= obj)
    elif incomp:
        return (criteria ^ obj)
    else:
        return (criteria == obj)

cmd: