Home | History | Annotate | Download | only in src
      1 /*
      2  * Copyright 2011 Tresys Technology, LLC. All rights reserved.
      3  *
      4  * Redistribution and use in source and binary forms, with or without
      5  * modification, are permitted provided that the following conditions are met:
      6  *
      7  *    1. Redistributions of source code must retain the above copyright notice,
      8  *       this list of conditions and the following disclaimer.
      9  *
     10  *    2. Redistributions in binary form must reproduce the above copyright notice,
     11  *       this list of conditions and the following disclaimer in the documentation
     12  *       and/or other materials provided with the distribution.
     13  *
     14  * THIS SOFTWARE IS PROVIDED BY TRESYS TECHNOLOGY, LLC ``AS IS'' AND ANY EXPRESS
     15  * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
     16  * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
     17  * EVENT SHALL TRESYS TECHNOLOGY, LLC OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
     18  * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
     19  * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     20  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
     21  * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
     22  * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
     23  * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     24  *
     25  * The views and conclusions contained in the software and documentation are those
     26  * of the authors and should not be interpreted as representing official policies,
     27  * either expressed or implied, of Tresys Technology, LLC.
     28  */
     29 
     30 #ifndef CIL_STACK_H_
     31 #define CIL_STACK_H_
     32 
     33 struct cil_stack {
     34 	struct cil_stack_item *stack;
     35 	int size;
     36 	int pos;
     37 };
     38 
     39 struct cil_stack_item {
     40 	enum cil_flavor flavor;
     41 	void *data;
     42 };
     43 
     44 #define cil_stack_for_each_starting_at(stack, start, pos, item) \
     45 	for (pos = start, item = cil_stack_peek_at(stack, pos); item != NULL; pos++, item = cil_stack_peek_at(stack, pos))
     46 
     47 #define cil_stack_for_each(stack, pos, item) cil_stack_for_each_starting_at(stack, 0, pos, item)
     48 
     49 
     50 void cil_stack_init(struct cil_stack **stack);
     51 void cil_stack_destroy(struct cil_stack **stack);
     52 
     53 void cil_stack_empty(struct cil_stack *stack);
     54 int cil_stack_is_empty(struct cil_stack *stack);
     55 
     56 void cil_stack_push(struct cil_stack *stack, enum cil_flavor flavor, void *data);
     57 struct cil_stack_item *cil_stack_pop(struct cil_stack *stack);
     58 struct cil_stack_item *cil_stack_peek(struct cil_stack *stack);
     59 struct cil_stack_item *cil_stack_peek_at(struct cil_stack *stack, int pos);
     60 
     61 
     62 #endif
     63