ua_types.h 26 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656
  1. /*
  2. * Copyright (C) 2014 the contributors as stated in the AUTHORS file
  3. *
  4. * This file is part of open62541. open62541 is free software: you can
  5. * redistribute it and/or modify it under the terms of the GNU Lesser General
  6. * Public License, version 3 (as published by the Free Software Foundation) with
  7. * a static linking exception as stated in the LICENSE file provided with
  8. * open62541.
  9. *
  10. * open62541 is distributed in the hope that it will be useful, but WITHOUT ANY
  11. * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
  12. * A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more
  13. * details.
  14. */
  15. #ifndef UA_TYPES_H_
  16. #define UA_TYPES_H_
  17. #ifdef __cplusplus
  18. extern "C" {
  19. #endif
  20. #include <stdint.h>
  21. #include <stdbool.h>
  22. #include <stddef.h>
  23. #include "ua_config.h"
  24. /**
  25. * @defgroup types Datatypes
  26. *
  27. * @brief The built-in datatypes. The remaining datatypes are autogenerated from
  28. * XML descriptions as they are all enums or structures made up of the built-in
  29. * datatypes.
  30. *
  31. * All datatypes have similar functions with a common postfix. DO NOT CALL THESE
  32. * FUNCTIONS WITH NULL-POINTERS IF IT IS NOT EXPLICITLY PERMITTED.
  33. *
  34. * - _new: Allocates the memory for the type and runs _init on the returned
  35. * variable. Returns null if no memory could be allocated.
  36. *
  37. * - _init: Sets all members to a "safe" standard, usually zero. Arrays (e.g.
  38. * for strings) are set to a length of -1.
  39. *
  40. * - _copy: Copies a datatype. This performs a deep copy that iterates over the
  41. * members. Copying into variants with an external data source is not
  42. * permitted. If copying fails, a deleteMembers is performed and an error
  43. * code returned.
  44. *
  45. * - _delete: Frees the memory where the datatype was stored. This performs an
  46. * _deleteMembers internally if required.
  47. *
  48. * - _deleteMembers: Frees the memory of dynamically sized members (e.g. a
  49. * string) of a datatype. This is useful when the datatype was allocated on
  50. * the stack, whereas the dynamically sized members is heap-allocated. To
  51. * reuse the variable, the remaining members (not dynamically allocated) need
  52. * to be cleaned up with an _init.
  53. *
  54. * @{
  55. */
  56. /** @brief A two-state logical value (true or false). */
  57. typedef bool UA_Boolean;
  58. #define UA_TRUE true
  59. #define UA_FALSE false
  60. /** @brief An integer value between -129 and 127. */
  61. typedef int8_t UA_SByte;
  62. #define UA_SBYTE_MAX 127
  63. #define UA_SBYTE_MIN -128
  64. /** @brief An integer value between 0 and 256. */
  65. typedef uint8_t UA_Byte;
  66. #define UA_BYTE_MAX 256
  67. #define UA_BYTE_MIN 0
  68. /** @brief An integer value between -32 768 and 32 767. */
  69. typedef int16_t UA_Int16;
  70. #define UA_INT16_MAX 32767
  71. #define UA_INT16_MIN -32768
  72. /** @brief An integer value between 0 and 65 535. */
  73. typedef uint16_t UA_UInt16;
  74. #define UA_UINT16_MAX 65535
  75. #define UA_UINT16_MIN 0
  76. /** @brief An integer value between -2 147 483 648 and 2 147 483 647. */
  77. typedef int32_t UA_Int32;
  78. #define UA_INT32_MAX 2147483647
  79. #define UA_INT32_MIN -2147483648
  80. /** @brief An integer value between 0 and 429 4967 295. */
  81. typedef uint32_t UA_UInt32;
  82. #define UA_UINT32_MAX 4294967295
  83. #define UA_UINT32_MIN 0
  84. /** @brief An integer value between -10 223 372 036 854 775 808 and 9 223 372 036 854 775 807 */
  85. typedef int64_t UA_Int64;
  86. #define UA_INT64_MAX 9223372036854775807
  87. #define UA_INT64_MIN -9223372036854775808
  88. /** @brief An integer value between 0 and 18 446 744 073 709 551 615. */
  89. typedef uint64_t UA_UInt64;
  90. #define UA_UINT64_MAX = 18446744073709551615
  91. #define UA_UINT64_MIN = 0
  92. /** @brief An IEEE single precision (32 bit) floating point value. */
  93. typedef float UA_Float;
  94. /** @brief An IEEE double precision (64 bit) floating point value. */
  95. typedef double UA_Double;
  96. /** @brief A sequence of Unicode characters. */
  97. typedef struct {
  98. UA_Int32 length; ///< The length of the string
  99. UA_Byte *data; ///< The string's content (not null-terminated)
  100. } UA_String;
  101. /** @brief An instance in time.
  102. * A DateTime value is encoded as a 64-bit signed integer which represents the
  103. * number of 100 nanosecond intervals since January 1, 1601 (UTC).
  104. */
  105. typedef UA_Int64 UA_DateTime; // 100 nanosecond resolution
  106. /** @brief A 16 byte value that can be used as a globally unique identifier. */
  107. typedef struct {
  108. UA_UInt32 data1;
  109. UA_UInt16 data2;
  110. UA_UInt16 data3;
  111. UA_Byte data4[8];
  112. } UA_Guid;
  113. /** @brief A sequence of octets. */
  114. typedef UA_String UA_ByteString;
  115. /** @brief An XML element. */
  116. typedef UA_String UA_XmlElement;
  117. /** @brief An identifier for a node in the address space of an OPC UA Server. */
  118. /* The shortened numeric types are introduced during encoding. */
  119. typedef struct {
  120. UA_UInt16 namespaceIndex; ///< The namespace index of the node
  121. enum UA_NodeIdType {
  122. UA_NODEIDTYPE_NUMERIC = 2,
  123. UA_NODEIDTYPE_STRING = 3,
  124. UA_NODEIDTYPE_GUID = 4,
  125. UA_NODEIDTYPE_BYTESTRING = 5
  126. } identifierType; ///< The type of the node identifier
  127. union {
  128. UA_UInt32 numeric;
  129. UA_String string;
  130. UA_Guid guid;
  131. UA_ByteString byteString;
  132. } identifier; ///< The node identifier
  133. } UA_NodeId;
  134. /** @brief A NodeId that allows the namespace URI to be specified instead of an index. */
  135. typedef struct {
  136. UA_NodeId nodeId; ///< The nodeid without extensions
  137. UA_String namespaceUri; ///< The Uri of the namespace (tindex in the nodeId is ignored)
  138. UA_UInt32 serverIndex; ///< The index of the server
  139. } UA_ExpandedNodeId;
  140. #include "ua_statuscodes.h"
  141. /** @brief A numeric identifier for a error or condition that is associated with a value or an operation. */
  142. typedef enum UA_StatusCode UA_StatusCode; // StatusCodes aren't an enum(=int) since 32 unsigned bits are needed. See also ua_statuscodes.h */
  143. /** @brief A name qualified by a namespace. */
  144. typedef struct {
  145. UA_UInt16 namespaceIndex; ///< The namespace index
  146. UA_String name; ///< The actual name
  147. } UA_QualifiedName;
  148. /** @brief Human readable text with an optional locale identifier. */
  149. typedef struct {
  150. UA_String locale; ///< The locale (e.g. "en-US")
  151. UA_String text; ///< The actual text
  152. } UA_LocalizedText;
  153. /** @brief A structure that contains an application specific data type that may
  154. not be recognized by the receiver. */
  155. typedef struct {
  156. UA_NodeId typeId; ///< The nodeid of the datatype
  157. enum {
  158. UA_EXTENSIONOBJECT_ENCODINGMASK_NOBODYISENCODED = 0,
  159. UA_EXTENSIONOBJECT_ENCODINGMASK_BODYISBYTESTRING = 1,
  160. UA_EXTENSIONOBJECT_ENCODINGMASK_BODYISXML = 2
  161. } encoding; ///< The encoding of the contained data
  162. UA_ByteString body; ///< The bytestring of the encoded data
  163. } UA_ExtensionObject;
  164. struct UA_DataType;
  165. typedef struct UA_DataType UA_DataType;
  166. /** @brief Variants store (arrays of) any data type. Either they provide a pointer to the data in
  167. * memory, or functions from which the data can be accessed. Variants are replaced together with
  168. * the data they store (exception: use a data source).
  169. *
  170. * Variant semantics:
  171. * - arrayLength = -1 && data == NULL: empty variant
  172. * - arrayLength = -1 && data == !NULL: variant holds a single element (a scalar)
  173. * - arrayLength >= 0: variant holds an array of the appropriate length
  174. * data can be NULL if arrayLength == 0
  175. */
  176. typedef struct {
  177. const UA_DataType *type; ///< The nodeid of the datatype
  178. enum {
  179. UA_VARIANT_DATA, ///< The data is "owned" by this variant (copied and deleted together)
  180. UA_VARIANT_DATA_NODELETE, /**< The data is "borrowed" by the variant and shall not be
  181. deleted at the end of this variant's lifecycle. It is not
  182. possible to overwrite borrowed data due to concurrent access.
  183. Use a custom datasource with a mutex. */
  184. } storageType; ///< Shall the data be deleted together with the variant
  185. UA_Int32 arrayLength; ///< the number of elements in the data-pointer
  186. void *data; ///< points to the scalar or array data
  187. UA_Int32 arrayDimensionsSize; ///< the number of dimensions the data-array has
  188. UA_Int32 *arrayDimensions; ///< the length of each dimension of the data-array
  189. } UA_Variant;
  190. /** @brief A data value with an associated status code and timestamps. */
  191. typedef struct {
  192. UA_Boolean hasValue : 1;
  193. UA_Boolean hasStatus : 1;
  194. UA_Boolean hasSourceTimestamp : 1;
  195. UA_Boolean hasServerTimestamp : 1;
  196. UA_Boolean hasSourcePicoseconds : 1;
  197. UA_Boolean hasServerPicoseconds : 1;
  198. UA_Variant value;
  199. UA_StatusCode status;
  200. UA_DateTime sourceTimestamp;
  201. UA_Int16 sourcePicoseconds;
  202. UA_DateTime serverTimestamp;
  203. UA_Int16 serverPicoseconds;
  204. } UA_DataValue;
  205. /** @brief A structure that contains detailed error and diagnostic information associated with a StatusCode. */
  206. typedef struct UA_DiagnosticInfo {
  207. UA_Boolean hasSymbolicId : 1;
  208. UA_Boolean hasNamespaceUri : 1;
  209. UA_Boolean hasLocalizedText : 1;
  210. UA_Boolean hasLocale : 1;
  211. UA_Boolean hasAdditionalInfo : 1;
  212. UA_Boolean hasInnerStatusCode : 1;
  213. UA_Boolean hasInnerDiagnosticInfo : 1;
  214. UA_Int32 symbolicId;
  215. UA_Int32 namespaceUri;
  216. UA_Int32 localizedText;
  217. UA_Int32 locale;
  218. UA_String additionalInfo;
  219. UA_StatusCode innerStatusCode;
  220. struct UA_DiagnosticInfo *innerDiagnosticInfo;
  221. } UA_DiagnosticInfo;
  222. #define UA_TYPE_HANDLING_FUNCTIONS(TYPE) \
  223. TYPE UA_EXPORT * TYPE##_new(void); \
  224. void UA_EXPORT TYPE##_init(TYPE * p); \
  225. void UA_EXPORT TYPE##_delete(TYPE * p); \
  226. void UA_EXPORT TYPE##_deleteMembers(TYPE * p); \
  227. UA_StatusCode UA_EXPORT TYPE##_copy(const TYPE *src, TYPE *dst);
  228. /* Functions for all types */
  229. UA_TYPE_HANDLING_FUNCTIONS(UA_Boolean)
  230. UA_TYPE_HANDLING_FUNCTIONS(UA_SByte)
  231. UA_TYPE_HANDLING_FUNCTIONS(UA_Byte)
  232. UA_TYPE_HANDLING_FUNCTIONS(UA_Int16)
  233. UA_TYPE_HANDLING_FUNCTIONS(UA_UInt16)
  234. UA_TYPE_HANDLING_FUNCTIONS(UA_Int32)
  235. UA_TYPE_HANDLING_FUNCTIONS(UA_UInt32)
  236. UA_TYPE_HANDLING_FUNCTIONS(UA_Int64)
  237. UA_TYPE_HANDLING_FUNCTIONS(UA_UInt64)
  238. UA_TYPE_HANDLING_FUNCTIONS(UA_Float)
  239. UA_TYPE_HANDLING_FUNCTIONS(UA_Double)
  240. UA_TYPE_HANDLING_FUNCTIONS(UA_String)
  241. #define UA_DateTime_new UA_Int64_new
  242. #define UA_DateTime_init UA_Int64_init
  243. #define UA_DateTime_delete UA_Int64_delete
  244. #define UA_DateTime_deleteMembers UA_Int64_deleteMembers
  245. #define UA_DateTime_copy UA_Int64_copy
  246. UA_TYPE_HANDLING_FUNCTIONS(UA_Guid)
  247. #define UA_ByteString_new UA_String_new
  248. #define UA_ByteString_init UA_String_init
  249. #define UA_ByteString_delete UA_String_delete
  250. #define UA_ByteString_deleteMembers UA_String_deleteMembers
  251. #define UA_ByteString_copy UA_String_copy
  252. #define UA_XmlElement_new UA_String_new
  253. #define UA_XmlElement_init UA_String_init
  254. #define UA_XmlElement_delete UA_String_delete
  255. #define UA_XmlElement_deleteMembers UA_String_deleteMembers
  256. #define UA_XmlElement_copy UA_String_copy
  257. UA_TYPE_HANDLING_FUNCTIONS(UA_NodeId)
  258. UA_TYPE_HANDLING_FUNCTIONS(UA_ExpandedNodeId)
  259. #define UA_StatusCode_new(p) UA_Int32_new((UA_Int32*)p)
  260. #define UA_StatusCode_init(p) UA_Int32_init((UA_Int32*)p)
  261. #define UA_StatusCode_delete(p) UA_Int32_delete((UA_Int32*)p)
  262. #define UA_StatusCode_deleteMembers(p) UA_Int32_deleteMembers((UA_Int32*)p)
  263. #define UA_StatusCode_copy(p) UA_Int32_copy((UA_Int32*)p)
  264. UA_TYPE_HANDLING_FUNCTIONS(UA_QualifiedName)
  265. UA_TYPE_HANDLING_FUNCTIONS(UA_LocalizedText)
  266. UA_TYPE_HANDLING_FUNCTIONS(UA_ExtensionObject)
  267. UA_TYPE_HANDLING_FUNCTIONS(UA_DataValue)
  268. UA_TYPE_HANDLING_FUNCTIONS(UA_Variant)
  269. UA_TYPE_HANDLING_FUNCTIONS(UA_DiagnosticInfo)
  270. /**********************************************/
  271. /* Custom functions for the builtin datatypes */
  272. /**********************************************/
  273. /* String */
  274. /** Copy a (zero terminated) char-array into a UA_String. Memory for the string data is
  275. allocated. If the memory cannot be allocated, a null-string is returned. */
  276. UA_String UA_EXPORT UA_String_fromChars(char const src[]);
  277. #define UA_STRING_NULL (UA_String) {-1, (UA_Byte*)0 }
  278. #define UA_STRING(CHARS) (UA_String) {strlen(CHARS), (UA_Byte*)CHARS }
  279. #define UA_STRING_ALLOC(CHARS) UA_String_fromChars(CHARS)
  280. /** Compares two strings */
  281. UA_Boolean UA_EXPORT UA_String_equal(const UA_String *string1, const UA_String *string2);
  282. /** Printf a char-array into a UA_String. Memory for the string data is allocated. */
  283. UA_StatusCode UA_EXPORT UA_String_copyprintf(char const fmt[], UA_String *dst, ...);
  284. /* DateTime */
  285. /** Returns the current time */
  286. UA_DateTime UA_EXPORT UA_DateTime_now(void);
  287. typedef struct UA_DateTimeStruct {
  288. UA_Int16 nanoSec;
  289. UA_Int16 microSec;
  290. UA_Int16 milliSec;
  291. UA_Int16 sec;
  292. UA_Int16 min;
  293. UA_Int16 hour;
  294. UA_Int16 day;
  295. UA_Int16 month;
  296. UA_Int16 year;
  297. } UA_DateTimeStruct;
  298. UA_DateTimeStruct UA_EXPORT UA_DateTime_toStruct(UA_DateTime time);
  299. UA_StatusCode UA_EXPORT UA_DateTime_toString(UA_DateTime time, UA_String *timeString);
  300. /* Guid */
  301. /** Compares two guids */
  302. UA_Boolean UA_EXPORT UA_Guid_equal(const UA_Guid *g1, const UA_Guid *g2);
  303. /** Returns a randomly generated guid. Do not use for security-critical entropy! */
  304. UA_Guid UA_EXPORT UA_Guid_random(UA_UInt32 *seed);
  305. /* ByteString */
  306. #define UA_BYTESTRING_NULL (UA_ByteString) {-1, (UA_Byte*)0 }
  307. #define UA_ByteString_equal(string1, string2) \
  308. UA_String_equal((const UA_String*) string1, (const UA_String*)string2)
  309. /** Allocates memory of size length for the bytestring. The content is not set to zero. */
  310. UA_StatusCode UA_EXPORT UA_ByteString_newMembers(UA_ByteString *p, UA_Int32 length);
  311. /* NodeId */
  312. /** Compares two nodeids */
  313. UA_Boolean UA_EXPORT UA_NodeId_equal(const UA_NodeId *n1, const UA_NodeId *n2);
  314. /** Is the nodeid a null-nodeid? */
  315. UA_Boolean UA_EXPORT UA_NodeId_isNull(const UA_NodeId *p);
  316. UA_NodeId UA_EXPORT UA_NodeId_fromInteger(UA_UInt16 nsIndex, UA_Int32 identifier);
  317. UA_NodeId UA_EXPORT UA_NodeId_fromCharString(UA_UInt16 nsIndex, char identifier[]);
  318. UA_NodeId UA_EXPORT UA_NodeId_fromCharStringCopy(UA_UInt16 nsIndex, char const identifier[]);
  319. UA_NodeId UA_EXPORT UA_NodeId_fromString(UA_UInt16 nsIndex, UA_String identifier);
  320. UA_NodeId UA_EXPORT UA_NodeId_fromStringCopy(UA_UInt16 nsIndex, UA_String identifier);
  321. UA_NodeId UA_EXPORT UA_NodeId_fromGuid(UA_UInt16 nsIndex, UA_Guid identifier);
  322. UA_NodeId UA_EXPORT UA_NodeId_fromCharByteString(UA_UInt16 nsIndex, char identifier[]);
  323. UA_NodeId UA_EXPORT UA_NodeId_fromCharByteStringCopy(UA_UInt16 nsIndex, char const identifier[]);
  324. UA_NodeId UA_EXPORT UA_NodeId_fromByteString(UA_UInt16 nsIndex, UA_ByteString identifier);
  325. UA_NodeId UA_EXPORT UA_NodeId_fromByteStringCopy(UA_UInt16 nsIndex, UA_ByteString identifier);
  326. #define UA_NODEID_NUMERIC(NS_INDEX, NUMERICID) UA_NodeId_fromInteger(NS_INDEX, NUMERICID)
  327. #define UA_NODEID_STRING(NS_INDEX, CHARS) UA_NodeId_fromCharString(NS_INDEX, CHARS)
  328. #define UA_NODEID_STRING_ALLOC(NS_INDEX, CHARS) UA_NodeId_fromCharStringCopy(NS_INDEX, CHARS)
  329. #define UA_NODEID_GUID(NS_INDEX, GUID) UA_NodeId_fromGuid(NS_INDEX, GUID)
  330. #define UA_NODEID_BYTESTRING(NS_INDEX, CHARS) UA_NodeId_fromCharByteString(NS_INDEX, CHARS)
  331. #define UA_NODEID_BYTESTRING_ALLOC(NS_INDEX, CHARS) UA_NodeId_fromCharStringCopy(NS_INDEX, CHARS)
  332. #define UA_NODEID_NULL UA_NODEID_NUMERIC(0,0)
  333. /* ExpandedNodeId */
  334. UA_Boolean UA_EXPORT UA_ExpandedNodeId_isNull(const UA_ExpandedNodeId *p);
  335. #define UA_EXPANDEDNODEID_NUMERIC(NS_INDEX, NUMERICID) (UA_ExpandedNodeId) { \
  336. .nodeId = {.namespaceIndex = NS_INDEX, .identifierType = UA_NODEIDTYPE_NUMERIC, \
  337. .identifier.numeric = NUMERICID }, \
  338. .serverIndex = 0, .namespaceUri = {.data = (UA_Byte*)0, .length = -1} }
  339. /* QualifiedName */
  340. #define UA_QUALIFIEDNAME(NS_INDEX, CHARS) (const UA_QualifiedName) { \
  341. .namespaceIndex = NS_INDEX, .name = UA_STRING(CHARS) }
  342. #define UA_QUALIFIEDNAME_ALLOC(NS_INDEX, CHARS) (UA_QualifiedName) { \
  343. .namespaceIndex = NS_INDEX, .name = UA_STRING_ALLOC(CHARS) }
  344. /* LocalizedText */
  345. #define UA_LOCALIZEDTEXT(LOCALE, TEXT) (const UA_LocalizedText) { \
  346. .locale = UA_STRING(LOCALE), .text = UA_STRING(TEXT) }
  347. #define UA_LOCALIZEDTEXT_ALLOC(LOCALE, TEXT) (UA_LocalizedText) { \
  348. .locale = UA_STRING_ALLOC(LOCALE), .text = UA_STRING_ALLOC(TEXT) }
  349. /* Variant */
  350. /**
  351. * Returns true if the variant contains a scalar value. Note that empty variants contain an array of
  352. * length -1 (undefined).
  353. *
  354. * @param v The variant
  355. * @return Does the variant contain a scalar value.
  356. */
  357. UA_Boolean UA_EXPORT UA_Variant_isScalar(const UA_Variant *v);
  358. /**
  359. * Set the variant to a scalar value that already resides in memory. The value takes on the
  360. * lifecycle of the variant and is deleted with it.
  361. *
  362. * @param v The variant
  363. * @param p A pointer to the value data
  364. * @param type The datatype of the value in question
  365. * @return Indicates whether the operation succeeded or returns an error code
  366. */
  367. UA_StatusCode UA_EXPORT UA_Variant_setScalar(UA_Variant *v, void *p, const UA_DataType *type);
  368. /**
  369. * Set the variant to a scalar value that is copied from an existing variable.
  370. *
  371. * @param v The variant
  372. * @param p A pointer to the value data
  373. * @param type The datatype of the value
  374. * @return Indicates whether the operation succeeded or returns an error code
  375. */
  376. UA_StatusCode UA_EXPORT UA_Variant_setScalarCopy(UA_Variant *v, const void *p, const UA_DataType *type);
  377. /**
  378. * Set the variant to an array that already resides in memory. The array takes on the lifecycle of
  379. * the variant and is deleted with it.
  380. *
  381. * @param v The variant
  382. * @param array A pointer to the array data
  383. * @param noElements The size of the array
  384. * @param type The datatype of the array
  385. * @return Indicates whether the operation succeeded or returns an error code
  386. */
  387. UA_StatusCode UA_EXPORT UA_Variant_setArray(UA_Variant *v, void *array, UA_Int32 noElements,
  388. const UA_DataType *type);
  389. /**
  390. * Set the variant to an array that is copied from an existing array.
  391. *
  392. * @param v The variant
  393. * @param array A pointer to the array data
  394. * @param noElements The size of the array
  395. * @param type The datatype of the array
  396. * @return Indicates whether the operation succeeded or returns an error code
  397. */
  398. UA_StatusCode UA_EXPORT UA_Variant_setArrayCopy(UA_Variant *v, const void *array, UA_Int32 noElements,
  399. const UA_DataType *type);
  400. /** @brief NumericRanges are used select a subset in a (multidimensional) variant array.
  401. NumericRange has no official type structure in the standard. Officially, it only exists as an
  402. encoded string, such as "1:2,0:3,5". The colon separates min/max index and the comma separates
  403. dimensions. A single value indicates a range with a single element (min==max). */
  404. typedef struct {
  405. UA_Int32 dimensionsSize;
  406. struct UA_NumericRangeDimension {
  407. UA_UInt32 min;
  408. UA_UInt32 max;
  409. } *dimensions;
  410. } UA_NumericRange;
  411. /**
  412. * Copy the variant, but use only a subset of the (multidimensional) array into a variant. Returns
  413. * an error code if the variant is not an array or if the indicated range does not fit.
  414. */
  415. UA_StatusCode UA_EXPORT UA_Variant_copyRange(const UA_Variant *src, UA_Variant *dst, UA_NumericRange range);
  416. /**
  417. * Insert a range of data into an existing variant. The data array can't be reused afterwards if it
  418. * contains types without a fixed size (e.g. strings) since they take on the lifetime of the
  419. * variant.
  420. *
  421. * @param v The variant
  422. * @param dataArray The data array. The type must match the variant
  423. * @param dataarraySize The length of the data array. This is checked to match the range size.
  424. * @param range The range of where the new data is inserted
  425. * @return Indicates whether the operation succeeded or returns an error code
  426. */
  427. UA_StatusCode UA_EXPORT UA_Variant_setRange(UA_Variant *v, void *dataArray, UA_Int32 dataArraySize,
  428. const UA_NumericRange range);
  429. /**
  430. * Deep-copy a range of data into an existing variant.
  431. *
  432. * @param v The variant
  433. * @param dataArray The data array. The type must match the variant
  434. * @param dataarraySize The length of the data array. This is checked to match the range size.
  435. * @param range The range of where the new data is inserted
  436. * @return Indicates whether the operation succeeded or returns an error code
  437. */
  438. UA_StatusCode UA_EXPORT UA_Variant_setRangeCopy(UA_Variant *v, const void *dataArray, UA_Int32 dataArraySize,
  439. const UA_NumericRange range);
  440. /****************************/
  441. /* Structured Type Handling */
  442. /****************************/
  443. #define UA_MAX_TYPE_MEMBERS 13 // Maximum number of members per complex type
  444. #ifndef _WIN32
  445. # define UA_BITFIELD(SIZE) : SIZE
  446. #else
  447. # define UA_BITFIELD(SIZE)
  448. #endif
  449. #define UA_IS_BUILTIN(ID) (ID <= UA_TYPES_DIAGNOSTICINFO)
  450. typedef struct {
  451. UA_UInt16 memberTypeIndex UA_BITFIELD(9); ///< Index of the member in the datatypetable
  452. UA_Boolean namespaceZero UA_BITFIELD(1); /**< The type of the member is defined in namespace
  453. zero. In this implementation, types from custom
  454. namespace may contain members from the same
  455. namespace or ns0 only.*/
  456. UA_Byte padding UA_BITFIELD(5); /**< How much padding is there before this member element? For
  457. arrays this is split into 2 bytes padding before the
  458. length index (max 4 bytes) and 3 bytes padding before the
  459. pointer (max 8 bytes) */
  460. UA_Boolean isArray UA_BITFIELD(1); ///< The member is an array of the given type
  461. } UA_DataTypeMember;
  462. struct UA_DataType {
  463. UA_NodeId typeId; ///< The nodeid of the type
  464. ptrdiff_t memSize UA_BITFIELD(16); ///< Size of the struct in memory
  465. UA_UInt16 typeIndex UA_BITFIELD(13); ///< Index of the type in the datatypetable
  466. UA_Boolean namespaceZero UA_BITFIELD(1); ///< The type is defined in namespace zero
  467. UA_Boolean fixedSize UA_BITFIELD(1); ///< The type (and its members) contains no pointers
  468. UA_Boolean zeroCopyable UA_BITFIELD(1); ///< Can the type be copied directly off the stream?
  469. UA_Byte membersSize; ///< How many members does the type have?
  470. UA_DataTypeMember members[UA_MAX_TYPE_MEMBERS];
  471. };
  472. /**
  473. * Allocates and initializes a variable of type dataType
  474. *
  475. * @param dataType The datatype description
  476. * @return Returns the memory location of the variable or (void*)0 if no memory is available
  477. */
  478. void UA_EXPORT * UA_new(const UA_DataType *dataType);
  479. /**
  480. * Initializes a variable to default values
  481. *
  482. * @param p The memory location of the variable
  483. * @param dataType The datatype description
  484. */
  485. void UA_EXPORT UA_init(void *p, const UA_DataType *dataType);
  486. /**
  487. * Copies the content of two variables. If copying fails (e.g. because no memory was available for
  488. * an array), then dst is emptied and initialized to prevent memory leaks.
  489. *
  490. * @param src The memory location of the source variable
  491. * @param dst The memory location of the destination variable
  492. * @param dataType The datatype description
  493. * @return Indicates whether the operation succeeded or returns an error code
  494. */
  495. UA_StatusCode UA_EXPORT UA_copy(const void *src, void *dst, const UA_DataType *dataType);
  496. /**
  497. * Deletes the dynamically assigned content of a variable (e.g. a member-array). Afterwards, the
  498. * variable can be safely deleted without causing memory leaks. But the variable is not initialized
  499. * and may contain old data that is not memory-relevant.
  500. *
  501. * @param p The memory location of the variable
  502. * @param dataType The datatype description of the variable
  503. */
  504. void UA_EXPORT UA_deleteMembers(void *p, const UA_DataType *dataType);
  505. void UA_EXPORT UA_deleteMembersUntil(void *p, const UA_DataType *dataType, UA_Int32 lastMember);
  506. /**
  507. * Deletes (frees) a variable and all of its content.
  508. *
  509. * @param p The memory location of the variable
  510. * @param dataType The datatype description of the variable
  511. */
  512. void UA_EXPORT UA_delete(void *p, const UA_DataType *dataType);
  513. /********************/
  514. /* Array operations */
  515. /********************/
  516. #define MAX_ARRAY_SIZE 104857600 // arrays must be smaller than 100MB
  517. /**
  518. * Allocates and initializes an array of variables of a specific type
  519. *
  520. * @param dataType The datatype description
  521. * @return Returns the memory location of the variable or (void*)0 if no memory could be allocated
  522. */
  523. void UA_EXPORT * UA_Array_new(const UA_DataType *dataType, UA_Int32 noElements);
  524. /**
  525. * Allocates and copies an array. dst is set to (void*)0 if not enough memory is available.
  526. *
  527. * @param src The memory location of the source array
  528. * @param dst The memory location where the pointer to the destination array is written
  529. * @param dataType The datatype of the array members
  530. * @param noElements The size of the array
  531. * @return Indicates whether the operation succeeded or returns an error code
  532. */
  533. UA_StatusCode UA_EXPORT UA_Array_copy(const void *src, void **dst, const UA_DataType *dataType, UA_Int32 noElements);
  534. /**
  535. * Deletes an array.
  536. *
  537. * @param src The memory location of the array
  538. * @param dataType The datatype of the array members
  539. * @param noElements The size of the array
  540. */
  541. void UA_EXPORT UA_Array_delete(void *p, const UA_DataType *dataType, UA_Int32 noElements);
  542. /** @} */
  543. /* These are not generated from XML. Server *and* client need them. */
  544. typedef enum {
  545. UA_ATTRIBUTEID_NODEID = 1,
  546. UA_ATTRIBUTEID_NODECLASS = 2,
  547. UA_ATTRIBUTEID_BROWSENAME = 3,
  548. UA_ATTRIBUTEID_DISPLAYNAME = 4,
  549. UA_ATTRIBUTEID_DESCRIPTION = 5,
  550. UA_ATTRIBUTEID_WRITEMASK = 6,
  551. UA_ATTRIBUTEID_USERWRITEMASK = 7,
  552. UA_ATTRIBUTEID_ISABSTRACT = 8,
  553. UA_ATTRIBUTEID_SYMMETRIC = 9,
  554. UA_ATTRIBUTEID_INVERSENAME = 10,
  555. UA_ATTRIBUTEID_CONTAINSNOLOOPS = 11,
  556. UA_ATTRIBUTEID_EVENTNOTIFIER = 12,
  557. UA_ATTRIBUTEID_VALUE = 13,
  558. UA_ATTRIBUTEID_DATATYPE = 14,
  559. UA_ATTRIBUTEID_VALUERANK = 15,
  560. UA_ATTRIBUTEID_ARRAYDIMENSIONS = 16,
  561. UA_ATTRIBUTEID_ACCESSLEVEL = 17,
  562. UA_ATTRIBUTEID_USERACCESSLEVEL = 18,
  563. UA_ATTRIBUTEID_MINIMUMSAMPLINGINTERVAL = 19,
  564. UA_ATTRIBUTEID_HISTORIZING = 20,
  565. UA_ATTRIBUTEID_EXECUTABLE = 21,
  566. UA_ATTRIBUTEID_USEREXECUTABLE = 22
  567. } UA_AttributeId;
  568. #ifdef __cplusplus
  569. } // extern "C"
  570. #endif
  571. #endif /* UA_TYPES_H_ */