iterator.c File Reference

Detailed Description

Contains the implementation of the qpol_iterator API, both public and private, for returning lists of components and rules from the policy database.

Author:

Kevin Carr kcarr@tresys.com

Jeremy A. Mowery jmowery@tresys.com

Jason Tang jtang@tresys.com

This library 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.

This library 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 this library; if not, write to the Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA

Definition in file iterator.c.

#include <config.h>
#include <qpol/iterator.h>
#include <qpol/policy.h>
#include <qpol/mls_query.h>
#include <stdlib.h>
#include <errno.h>
#include <string.h>
#include <sepol/policydb/policydb.h>
#include <sepol/policydb/util.h>
#include <sepol/policydb.h>
#include "qpol_internal.h"
#include "iterator_internal.h"

Go to the source code of this file.


Classes
struct	qpol_iterator
	Declaration of qpol_iterator, an arbitrary valued policy component iterator used to return lists of components. More...
Functions
uint32_t	iterator_get_avtab_size (const avtab_t *avtab)
	The number of buckets in sepol's av tables was statically set in libsepol < 2.0.20.
int	qpol_iterator_create (const qpol_policy_t policy, void state, void (get_cur)(const qpol_iterator_t iter), int(next)(qpol_iterator_t iter), int(end)(const qpol_iterator_t iter), size_t(size)(const qpol_iterator_t iter), void(free_fn)(void x), qpol_iterator_t *iter)
void *	qpol_iterator_state (const qpol_iterator_t *iter)
const policydb_t *	qpol_iterator_policy (const qpol_iterator_t *iter)
void *	hash_state_get_cur (const qpol_iterator_t *iter)
void *	hash_state_get_cur_key (const qpol_iterator_t *iter)
void *	ocon_state_get_cur (const qpol_iterator_t *iter)
void *	avtab_state_get_cur (const qpol_iterator_t *iter)
int	hash_state_next (qpol_iterator_t *iter)
int	ebitmap_state_next (qpol_iterator_t *iter)
int	ocon_state_next (qpol_iterator_t *iter)
int	avtab_state_next (qpol_iterator_t *iter)
int	hash_state_end (const qpol_iterator_t *iter)
int	ebitmap_state_end (const qpol_iterator_t *iter)
int	ocon_state_end (const qpol_iterator_t *iter)
int	avtab_state_end (const qpol_iterator_t *iter)
size_t	hash_state_size (const qpol_iterator_t *iter)
size_t	ebitmap_state_size (const qpol_iterator_t *iter)
size_t	ocon_state_size (const qpol_iterator_t *iter)
size_t	avtab_state_size (const qpol_iterator_t *iter)
void	qpol_iterator_destroy (qpol_iterator_t **iter)
	Free memory used by the iterator.
int	qpol_iterator_get_item (const qpol_iterator_t iter, void *item)
	Get the item at the current position of the iterator.
int	qpol_iterator_next (qpol_iterator_t *iter)
	Advance the iterator to the next item.
int	qpol_iterator_end (const qpol_iterator_t *iter)
	Determine if an iterator is at the end.
int	qpol_iterator_get_size (const qpol_iterator_t iter, size_t size)
	Get the total number of items in the list traversed by the iterator.
void *	ebitmap_state_get_cur_type (const qpol_iterator_t *iter)
void *	ebitmap_state_get_cur_role (const qpol_iterator_t *iter)
void *	ebitmap_state_get_cur_cat (const qpol_iterator_t *iter)
void	ebitmap_state_destroy (void *es)
int	perm_state_end (const qpol_iterator_t *iter)
void *	perm_state_get_cur (const qpol_iterator_t *iter)
int	perm_state_next (qpol_iterator_t *iter)
size_t	perm_state_size (const qpol_iterator_t *iter)

Function Documentation

uint32_t iterator_get_avtab_size ( const avtab_t * avtab ) [static]

The number of buckets in sepol's av tables was statically set in libsepol < 2.0.20.

With libsepol 2.0.20, this size was dynamically calculated based upon the number of rules.

Definition at line 66 of file iterator.c.

Referenced by avtab_state_end(), avtab_state_next(), and avtab_state_size().

00067 {
00068 #ifdef SEPOL_DYNAMIC_AVTAB
00069         return avtab->nslot;
00070 #else
00071         return AVTAB_SIZE;
00072 #endif
00073 }

int qpol_iterator_create	(	const qpol_policy_t *	policy,
		void *	state,
		void ()(const qpol_iterator_t *iter)	get_cur,
		int()(qpol_iterator_t iter)	next,
		int()(const qpol_iterator_t iter)	end,
		size_t()(const qpol_iterator_t iter)	size,
		void()(void x)	free_fn,
		qpol_iterator_t **	iter
	)

Definition at line 75 of file iterator.c.

References ERR, qpol_policy::p, qpol_iterator::policy, qpol_iterator_t, and qpol_policy_t.

00080 {
00081         int error = 0;
00082 
00083         if (iter != NULL)
00084                 *iter = NULL;
00085 
00086         if (policy == NULL || state == NULL || iter == NULL || get_cur == NULL || next == NULL || end == NULL || size == NULL) {
00087                 ERR(policy, "%s", strerror(EINVAL));
00088                 errno = EINVAL;
00089                 return STATUS_ERR;
00090         }
00091 
00092         *iter = calloc(1, sizeof(struct qpol_iterator));
00093         if (*iter == NULL) {
00094                 error = errno;
00095                 ERR(policy, "%s", strerror(ENOMEM));
00096                 errno = error;
00097                 return STATUS_ERR;
00098         }
00099 
00100         (*iter)->policy = &policy->p->p;
00101         (*iter)->state = state;
00102         (*iter)->get_cur = get_cur;
00103         (*iter)->next = next;
00104         (*iter)->end = end;
00105         (*iter)->size = size;
00106         (*iter)->free_fn = free_fn;
00107 
00108         return STATUS_SUCCESS;
00109 }

void* qpol_iterator_state

(

iterator.c File Reference

Detailed Description

Classes

Functions

Function Documentation