/*									tab:4 * * * "Copyright (c) 2000-2002 The Regents of the University  of California.   * All rights reserved. * * Permission to use, copy, modify, and distribute this software and * its documentation for any purpose, without fee, and without written * agreement is hereby granted, provided that the above copyright * notice, the following two paragraphs and the author appear in all * copies of this software. *  * IN NO EVENT SHALL THE UNIVERSITY OF CALIFORNIA BE LIABLE TO ANY * PARTY FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL * DAMAGES ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS * DOCUMENTATION, EVEN IF THE UNIVERSITY OF CALIFORNIA HAS BEEN * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. *  * THE UNIVERSITY OF CALIFORNIA SPECIFICALLY DISCLAIMS ANY WARRANTIES, * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE SOFTWARE * PROVIDED HEREUNDER IS ON AN "AS IS" BASIS, AND THE UNIVERSITY OF * CALIFORNIA HAS NO OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, * UPDATES, ENHANCEMENTS, OR MODIFICATIONS." * *//*									tab:4 *									 *  IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING. *  By downloading, copying, installing or using the software you *  agree to this license.  If you do not agree to this license, do *  not download, install, copy or use the software. * *  Intel Open Source License  * *  Copyright (c) 2002 Intel Corporation  *  All rights reserved.  *  Redistribution and use in source and binary forms, with or without *  modification, are permitted provided that the following conditions are *  met: *  *	Redistributions of source code must retain the above copyright *  notice, this list of conditions and the following disclaimer. *	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. *      Neither the name of the Intel Corporation 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 COPYRIGHT HOLDERS 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 INTEL OR ITS *  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. *  *  *//* * Authors:   Philip Levis <pal@cs.berkeley.edu>              Neil Patel * History:   Apr 14, 2003         Inception. * *//** * @author Philip Levis <pal@cs.berkeley.edu> * @author Neil Patel */includes Bombilla;module OPeqM {  provides interface BombillaBytecode;  uses interface BombillaStacks as Stacks;}implementation {  bool areEqual(BombillaStackVariable* arg1, BombillaStackVariable* arg2) {    if (arg1->type != arg2->type) {return FALSE;}    if (arg1->type == BOMB_TYPE_SENSE) {      return ((arg1->sense.type == arg2->sense.type) &&	      (arg1->sense.var == arg2->sense.var));    }    else if (arg1->type == BOMB_TYPE_VALUE) {      return (arg1->value.var == arg2->value.var);    }    else if (arg1->type == BOMB_TYPE_BUFFER) {      return (arg1->buffer.var == arg2->buffer.var);    }    else {      return FALSE;    }  }  command result_t BombillaBytecode.execute(uint8_t instr,					    BombillaContext* context) {    BombillaStackVariable* arg1 = call Stacks.popOperand(context);    BombillaStackVariable* arg2 = call Stacks.popOperand(context);    if (instr & 0x1) {      dbg(DBG_USR1, "VM (%i): Executing eq.\n", (int)context->which);      call Stacks.pushValue(context, areEqual(arg1, arg2));    }    else {      dbg(DBG_USR1, "VM (%i): Executing neq.\n", (int)context->which);      call Stacks.pushValue(context, !areEqual(arg1, arg2));    }    return SUCCESS;  }  }