At each loop, the program works in the range ADDRESS_START to * ADDRESS_END then ADDRESS_START + 1 to ADDRESS_END and so on. */

Tests based on PI-MBUS-300 documentation */

----------------------------------------------------------------------------- Main function - All the magic happens here. ----------------------------

returns true if compatible function/FB invocation, otherwise returns false */ Assumes that the candidate_datatype lists of all the parameters being pa

returns true if compatible function/FB invocation, otherwise returns false */ Assumes that the candidate_datatype lists of all the parameters being pa

Get the timeout interval between two consecutive bytes of a message */

DEPRECATED - Get a float from 4 bytes in sort of Modbus format */

Sets many bits from a single byte value (all 8 bits of the byte value are set) */

Sets many bits from a single byte value (all 8 bits of the byte value are set) */

DEPRECATED - Set a float to 4 bytes in a sort of Modbus format! */

allow_enums is FALSE by default!! * deprecated_operation is NULL by default!! * if (allow_enums) then consider that we are ectually processing an eq

Narrow IL operators whose execution is conditional on the boolean value in the accumulator. * Basically, narrow the JMPC, JMPCN, RETC, RETCN, CALC, a

typedef struct { symbol_c *function_name, symbol_c *nonformal_operand_list, symbol_c * formal_operand_list, std::vector <symbol_c *> &candi

narrow implicit FB call in IL. * e.g. CLK ton_var * CU counter_var * * The algorithm will be to build a fake il_fb_call_c equivalent to th

* All parameters being passed to the called function MUST be in the parameter list to which f_call points to! * This means that, for non formal funct

/ B 1.3.3 - Derived data types */ /

When handling the declaration of variables the fill/narrow algorithm will simply visit the objects * in the abstract syntax tree defining the desired

Skip to the next parameter. After object creation, * the object references on parameter _before_ the first, so * this function must be called once t

Skip to the next subrange. After object creation, * the object references on subrange _before_ the first, so * this function must be called once to

Skip to the next case element of type chosen. After object creation, * the object references on case element _before_ the first, so * this function

Skip to the next function call. After object creation, * the object references _before_ the first, so * this function must be called once to get the

comparison operator */

comparison operator */

----------------------------------------------------------------------------- Main function for the thread. Should create a buffer for the persistent

* printEnumToInteger function print conversion function from <ENUM> to <INTEGER>: * ST Output: * FUNCTION <ENUM>_TO_<INTEGER> : <INTEGER> VAR_IN

* printEnumToString function print conversion function from <ENUM> to STRING: * ST Output: * FUNCTION <ENUM>_TO_STRING : STRING VAR_INPUT IN:

* printIntegerToEnum function print conversion function from <INTEGER> to <ENUM>: * ST Output: * FUNCTION <INTEGER>_TO_<ENUM> : <ENUM> VAR_INPUT

* printStringToEnum function print conversion function from STRING to <ENUM>: * ST Output: * FUNCTION STRING_TO_<ENUM> : <ENUM> VAR_INPUT IN:

/ B 2.2 Operators */ /

Tell the user that the source code contains a circular dependency */

Call a standard library function that does a comparison (GT, NE, EQ, LT, ...) * NOTE: Typically, the function will have the following parameters: