dpf-ir-print.c

来自「基于组件方式开发操作系统的OSKIT源代码」· C语言 代码 · 共 59 行

/*
 * Copyright (c) 1997 M.I.T.
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *      This product includes software developed by MIT.
 * 4. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */


#include <dpf-internal.h>

void dpf_printir(struct dpf_ir *ir) {
	int i, n, bits;
	struct eq *e;
	struct shift *s;

	printf("Dumping filter, has %d atoms:\n", ir->irn);
	for(i = 0, n = ir->irn; i < n; i++) {
		e = &ir->ir[i].u.eq;
		s = &ir->ir[i].u.shift;
		bits = e->nbits;

		if(e->op == DPF_OP_EQ) {
                	printf("\tmsg[%d:%d] & 0x%x == 0x%x",
					e->offset, bits, e->mask, e->val);
		} else {
  			printf("\tmsg + msg[%d:%d] & 0x%x << %d",
                		s->offset, bits, s->mask, s->shift);
		}
		if(n > 1 && i != (n - 1))
			printf("\t&&\n");
	}
	printf("\n");
}