Lines Matching refs:l1
118 #define _MEQUAL(l1, l2) \
119 (LCLASS(l1) == LCLASS(l2) && \
120 (l1)->_comps.c1 == (l2)->_comps.c1 && \
121 (l1)->_comps.c2 == (l2)->_comps.c2 && \
122 (l1)->_comps.c3 == (l2)->_comps.c3 && \
123 (l1)->_comps.c4 == (l2)->_comps.c4 && \
124 (l1)->_comps.c5 == (l2)->_comps.c5 && \
125 (l1)->_comps.c6 == (l2)->_comps.c6 && \
126 (l1)->_comps.c7 == (l2)->_comps.c7 && \
127 (l1)->_comps.c8 == (l2)->_comps.c8)
207 #define BLEQUAL(l1, l2) \
208 _BLEQUAL((_mac_label_impl_t *)(l1), (_mac_label_impl_t *)(l2))
210 #define _BLEQUAL(l1, l2) \
211 (LCLASS(l1) == LCLASS(l2) && \
212 (l1)->_comps.c1 == (l2)->_comps.c1 && \
213 (l1)->_comps.c2 == (l2)->_comps.c2 && \
214 (l1)->_comps.c3 == (l2)->_comps.c3 && \
215 (l1)->_comps.c4 == (l2)->_comps.c4 && \
216 (l1)->_comps.c5 == (l2)->_comps.c5 && \
217 (l1)->_comps.c6 == (l2)->_comps.c6 && \
218 (l1)->_comps.c7 == (l2)->_comps.c7 && \
219 (l1)->_comps.c8 == (l2)->_comps.c8)
221 /* Does the level of l1 dominate that of l2? */
222 #define BLDOMINATES(l1, l2) \
223 _BLDOMINATES((_mac_label_impl_t *)(l1), (_mac_label_impl_t *)(l2))
225 #define _BLDOMINATES(l1, l2) (LCLASS(l1) >= LCLASS(l2) && \
226 (l2)->_comps.c1 == ((l1)->_comps.c1 & (l2)->_comps.c1) && \
227 (l2)->_comps.c2 == ((l1)->_comps.c2 & (l2)->_comps.c2) && \
228 (l2)->_comps.c3 == ((l1)->_comps.c3 & (l2)->_comps.c3) && \
229 (l2)->_comps.c4 == ((l1)->_comps.c4 & (l2)->_comps.c4) && \
230 (l2)->_comps.c5 == ((l1)->_comps.c5 & (l2)->_comps.c5) && \
231 (l2)->_comps.c6 == ((l1)->_comps.c6 & (l2)->_comps.c6) && \
232 (l2)->_comps.c7 == ((l1)->_comps.c7 & (l2)->_comps.c7) && \
233 (l2)->_comps.c8 == ((l1)->_comps.c8 & (l2)->_comps.c8))
235 /* Does the level of l1 strictly dominate that of l2? */
236 #define BLSTRICTDOM(l1, l2) (!BLEQUAL(l1, l2) && BLDOMINATES(l1, l2))
243 /* Least Upper Bound level l1 and l2 replacing l1 with the result. */
244 #define BLMAXIMUM(l1, l2) \
245 _BLMAXIMUM((_mac_label_impl_t *)(l1), (_mac_label_impl_t *)(l2))
247 #define _BLMAXIMUM(l1, l2)\
248 (((l1)->_lclass = (LCLASS(l1) < LCLASS(l2)) ? \
249 (l2)->_lclass : (l1)->_lclass), \
250 (l1)->_comps.c1 |= (l2)->_comps.c1, \
251 (l1)->_comps.c2 |= (l2)->_comps.c2, \
252 (l1)->_comps.c3 |= (l2)->_comps.c3, \
253 (l1)->_comps.c4 |= (l2)->_comps.c4, \
254 (l1)->_comps.c5 |= (l2)->_comps.c5, \
255 (l1)->_comps.c6 |= (l2)->_comps.c6, \
256 (l1)->_comps.c7 |= (l2)->_comps.c7, \
257 (l1)->_comps.c8 |= (l2)->_comps.c8)
259 /* Greatest Lower Bound level l1 and l2 replacing l1 with the result. */
260 #define BLMINIMUM(l1, l2) \
261 _BLMINIMUM((_mac_label_impl_t *)(l1), (_mac_label_impl_t *)(l2))
263 #define _BLMINIMUM(l1, l2)\
264 (((l1)->_lclass = (LCLASS(l1) > LCLASS(l2)) ? \
265 (l2)->_lclass : (l1)->_lclass), \
266 (l1)->_comps.c1 &= (l2)->_comps.c1, \
267 (l1)->_comps.c2 &= (l2)->_comps.c2, \
268 (l1)->_comps.c3 &= (l2)->_comps.c3, \
269 (l1)->_comps.c4 &= (l2)->_comps.c4, \
270 (l1)->_comps.c5 &= (l2)->_comps.c5, \
271 (l1)->_comps.c6 &= (l2)->_comps.c6, \
272 (l1)->_comps.c7 &= (l2)->_comps.c7, \
273 (l1)->_comps.c8 &= (l2)->_comps.c8)
345 #define GETCSL(l1, l2) \
346 (*((_bslabel_impl_t *)(l1)) = ((_bclabel_impl_t *)(l2))->_bcl_sl)
349 #define SETCSL(l1, l2) \
350 (((_bclabel_impl_t *)(l1))->_bcl_sl = *((_bslabel_impl_t *)(l2)))