-///////////////////////////////////////////////////////////////////////////////
-// Copyright (c) 2000-2014 Ericsson Telecom AB
-// All rights reserved. This program and the accompanying materials
-// are made available under the terms of the Eclipse Public License v1.0
-// which accompanies this distribution, and is available at
-// http://www.eclipse.org/legal/epl-v10.html
-///////////////////////////////////////////////////////////////////////////////
+/******************************************************************************
+ * Copyright (c) 2000-2016 Ericsson Telecom AB
+ * All rights reserved. This program and the accompanying materials
+ * are made available under the terms of the Eclipse Public License v1.0
+ * which accompanies this distribution, and is available at
+ * http://www.eclipse.org/legal/epl-v10.html
+ *
+ * Contributors:
+ * Balasko, Jeno
+ * Baranyi, Botond
+ * Raduly, Csaba
+ * Szabo, Janos Zoltan – initial implementation
+ * Szalai, Gabor
+ *
+ ******************************************************************************/
#include "../../common/memory.h"
#include "RawAST.hh"
#include <stdio.h>
topleveleind=other->topleveleind;
toplevel.bitorder=other->toplevel.bitorder;
length_restrition=other->length_restrition;
+ intx = other->intx;
}
else init_rawast(int_type);
}
presence.nElements=0;
presence.keyList=NULL;
topleveleind=0;
-
+ intx = false;
}
RawAST::~RawAST(){
printf("\n\r");
}
}
-
+ printf("%sIntX encoding\n\r", intx ? "" : "not ");
}
void copy_rawAST_to_struct(RawAST *from, raw_attrib_struct *to){
a->padding!=b->padding ||
a->ptroffset!=b->ptroffset ||
a->repeatable!=b->repeatable ||
- a->unit!=b->unit;
+ a->unit!=b->unit ||
+ a->intx != b->intx;
}