ua_services_call.c 9.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223
  1. #include "ua_services.h"
  2. #include "ua_server_internal.h"
  3. #ifdef UA_ENABLE_METHODCALLS /* conditional compilation */
  4. static const UA_VariableNode *
  5. getArgumentsVariableNode(UA_Server *server, const UA_MethodNode *ofMethod,
  6. UA_String withBrowseName) {
  7. UA_NodeId hasProperty = UA_NODEID_NUMERIC(0, UA_NS0ID_HASPROPERTY);
  8. for(size_t i = 0; i < ofMethod->referencesSize; i++) {
  9. if(ofMethod->references[i].isInverse == false &&
  10. UA_NodeId_equal(&hasProperty, &ofMethod->references[i].referenceTypeId)) {
  11. const UA_Node *refTarget =
  12. UA_NodeStore_get(server->nodestore, &ofMethod->references[i].targetId.nodeId);
  13. if(!refTarget)
  14. continue;
  15. if(refTarget->nodeClass == UA_NODECLASS_VARIABLE &&
  16. refTarget->browseName.namespaceIndex == 0 &&
  17. UA_String_equal(&withBrowseName, &refTarget->browseName.name)) {
  18. return (const UA_VariableNode*) refTarget;
  19. }
  20. }
  21. }
  22. return NULL;
  23. }
  24. static UA_StatusCode
  25. satisfySignature(UA_Server *server, const UA_Variant *var, const UA_Argument *arg) {
  26. if(var == NULL || var->type == NULL)
  27. return UA_STATUSCODE_BADINVALIDARGUMENT;
  28. if(!UA_NodeId_equal(&var->type->typeId, &arg->dataType)){
  29. if(!UA_NodeId_equal(&var->type->typeId, &UA_TYPES[UA_TYPES_INT32].typeId))
  30. return UA_STATUSCODE_BADINVALIDARGUMENT;
  31. /* enumerations are encoded as int32 -> if provided var is integer, check if arg is an enumeration type */
  32. UA_NodeId enumerationNodeId = UA_NODEID_NUMERIC(0, UA_NS0ID_ENUMERATION);
  33. UA_NodeId hasSubTypeNodeId = UA_NODEID_NUMERIC(0,UA_NS0ID_HASSUBTYPE);
  34. UA_Boolean found = false;
  35. UA_StatusCode retval = isNodeInTree(server->nodestore, &arg->dataType, &enumerationNodeId, &hasSubTypeNodeId, 1, 1, &found);
  36. if(retval != UA_STATUSCODE_GOOD)
  37. return UA_STATUSCODE_BADINTERNALERROR;
  38. if(!found)
  39. return UA_STATUSCODE_BADINVALIDARGUMENT;
  40. }
  41. // Note: The namespace compiler will compile nodes with their actual array dimensions
  42. // Todo: Check if this is standard conform for scalars
  43. if(arg->arrayDimensionsSize > 0 && var->arrayDimensionsSize > 0)
  44. if(var->arrayDimensionsSize != arg->arrayDimensionsSize)
  45. return UA_STATUSCODE_BADINVALIDARGUMENT;
  46. UA_Int32 *varDims = var->arrayDimensions;
  47. size_t varDimsSize = var->arrayDimensionsSize;
  48. UA_Boolean scalar = UA_Variant_isScalar(var);
  49. /* The dimension 1 is implicit in the array length */
  50. UA_Int32 fakeDims;
  51. if(!scalar && !varDims) {
  52. fakeDims = (UA_Int32)var->arrayLength;
  53. varDims = &fakeDims;
  54. varDimsSize = 1;
  55. }
  56. /* ValueRank Semantics
  57. * n >= 1: the value is an array with the specified number of dimens*ions.
  58. * n = 0: the value is an array with one or more dimensions.
  59. * n = -1: the value is a scalar.
  60. * n = -2: the value can be a scalar or an array with any number of dimensions.
  61. * n = -3: the value can be a scalar or a one dimensional array. */
  62. switch(arg->valueRank) {
  63. case -3:
  64. if(varDimsSize > 1)
  65. return UA_STATUSCODE_BADINVALIDARGUMENT;
  66. break;
  67. case -2:
  68. break;
  69. case -1:
  70. if(!scalar)
  71. return UA_STATUSCODE_BADINVALIDARGUMENT;
  72. break;
  73. case 0:
  74. if(scalar || !varDims)
  75. return UA_STATUSCODE_BADINVALIDARGUMENT;
  76. break;
  77. default:
  78. break;
  79. }
  80. /* do the array dimensions match? */
  81. if(arg->arrayDimensionsSize != varDimsSize)
  82. return UA_STATUSCODE_BADINVALIDARGUMENT;
  83. for(size_t i = 0; i < varDimsSize; i++) {
  84. if((UA_Int32)arg->arrayDimensions[i] != varDims[i])
  85. return UA_STATUSCODE_BADINVALIDARGUMENT;
  86. }
  87. return UA_STATUSCODE_GOOD;
  88. }
  89. static UA_StatusCode
  90. argConformsToDefinition(UA_Server *server, const UA_VariableNode *argRequirements, size_t argsSize, const UA_Variant *args) {
  91. if(argRequirements->value.variant.value.type != &UA_TYPES[UA_TYPES_ARGUMENT])
  92. return UA_STATUSCODE_BADINTERNALERROR;
  93. UA_Argument *argReqs = (UA_Argument*)argRequirements->value.variant.value.data;
  94. size_t argReqsSize = argRequirements->value.variant.value.arrayLength;
  95. if(argRequirements->valueSource != UA_VALUESOURCE_VARIANT)
  96. return UA_STATUSCODE_BADINTERNALERROR;
  97. if(UA_Variant_isScalar(&argRequirements->value.variant.value))
  98. argReqsSize = 1;
  99. if(argReqsSize > argsSize)
  100. return UA_STATUSCODE_BADARGUMENTSMISSING;
  101. if(argReqsSize != argsSize)
  102. return UA_STATUSCODE_BADINVALIDARGUMENT;
  103. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  104. for(size_t i = 0; i < argReqsSize; i++)
  105. retval |= satisfySignature(server, &args[i], &argReqs[i]);
  106. return retval;
  107. }
  108. void
  109. Service_Call_single(UA_Server *server, UA_Session *session, const UA_CallMethodRequest *request,
  110. UA_CallMethodResult *result) {
  111. /* Get/verify the method node */
  112. const UA_MethodNode *methodCalled =
  113. (const UA_MethodNode*)UA_NodeStore_get(server->nodestore, &request->methodId);
  114. if(!methodCalled) {
  115. result->statusCode = UA_STATUSCODE_BADMETHODINVALID;
  116. return;
  117. }
  118. if(methodCalled->nodeClass != UA_NODECLASS_METHOD) {
  119. result->statusCode = UA_STATUSCODE_BADNODECLASSINVALID;
  120. return;
  121. }
  122. if(!methodCalled->executable || !methodCalled->userExecutable || !methodCalled->attachedMethod) {
  123. result->statusCode = UA_STATUSCODE_BADNOTWRITABLE; // There is no NOTEXECUTABLE?
  124. return;
  125. }
  126. /* Get/verify the object node */
  127. const UA_ObjectNode *withObject =
  128. (const UA_ObjectNode*)UA_NodeStore_get(server->nodestore, &request->objectId);
  129. if(!withObject) {
  130. result->statusCode = UA_STATUSCODE_BADNODEIDINVALID;
  131. return;
  132. }
  133. if(withObject->nodeClass != UA_NODECLASS_OBJECT && withObject->nodeClass != UA_NODECLASS_OBJECTTYPE) {
  134. result->statusCode = UA_STATUSCODE_BADNODECLASSINVALID;
  135. return;
  136. }
  137. /* Verify method/object relations. Object must have a hasComponent or a subtype of hasComponent reference to the method node. */
  138. /* Therefore, check every reference between the parent object and the method node if there is a hasComponent (or subtype) reference */
  139. UA_Boolean found = false;
  140. UA_NodeId hasComponentNodeId = UA_NODEID_NUMERIC(0,UA_NS0ID_HASCOMPONENT);
  141. UA_NodeId hasSubTypeNodeId = UA_NODEID_NUMERIC(0,UA_NS0ID_HASSUBTYPE);
  142. for(size_t i=0;i<methodCalled->referencesSize;i++){
  143. if (methodCalled->references[i].isInverse && UA_NodeId_equal(&methodCalled->references[i].targetId.nodeId,&withObject->nodeId)){
  144. //TODO adjust maxDepth to needed tree depth (define a variable in config?)
  145. isNodeInTree(server->nodestore, &methodCalled->references[i].referenceTypeId, &hasComponentNodeId,
  146. &hasSubTypeNodeId, 1, 1, &found);
  147. if(found){
  148. break;
  149. }
  150. }
  151. }
  152. if(!found)
  153. result->statusCode = UA_STATUSCODE_BADMETHODINVALID;
  154. if(result->statusCode != UA_STATUSCODE_GOOD)
  155. return;
  156. /* Verify Input Argument count, types and sizes */
  157. const UA_VariableNode *inputArguments = getArgumentsVariableNode(server, methodCalled, UA_STRING("InputArguments"));
  158. if(!inputArguments) {
  159. result->statusCode = UA_STATUSCODE_BADINVALIDARGUMENT;
  160. return;
  161. }
  162. result->statusCode = argConformsToDefinition(server, inputArguments, request->inputArgumentsSize,
  163. request->inputArguments);
  164. if(result->statusCode != UA_STATUSCODE_GOOD)
  165. return;
  166. /* Allocate the output arguments */
  167. const UA_VariableNode *outputArguments = getArgumentsVariableNode(server, methodCalled, UA_STRING("OutputArguments"));
  168. if(!outputArguments) {
  169. result->statusCode = UA_STATUSCODE_BADINTERNALERROR;
  170. return;
  171. }
  172. result->outputArguments = UA_Array_new(outputArguments->value.variant.value.arrayLength, &UA_TYPES[UA_TYPES_VARIANT]);
  173. if(!result->outputArguments) {
  174. result->statusCode = UA_STATUSCODE_BADOUTOFMEMORY;
  175. return;
  176. }
  177. result->outputArgumentsSize = outputArguments->value.variant.value.arrayLength;
  178. /* Call the method */
  179. result->statusCode = methodCalled->attachedMethod(methodCalled->methodHandle, withObject->nodeId,
  180. request->inputArgumentsSize, request->inputArguments,
  181. result->outputArgumentsSize, result->outputArguments);
  182. /* TODO: Verify Output Argument count, types and sizes */
  183. }
  184. void Service_Call(UA_Server *server, UA_Session *session, const UA_CallRequest *request,
  185. UA_CallResponse *response) {
  186. UA_LOG_DEBUG_SESSION(server->config.logger, session, "Processing CallRequest");
  187. if(request->methodsToCallSize <= 0) {
  188. response->responseHeader.serviceResult = UA_STATUSCODE_BADNOTHINGTODO;
  189. return;
  190. }
  191. response->results = UA_Array_new(request->methodsToCallSize, &UA_TYPES[UA_TYPES_CALLMETHODRESULT]);
  192. if(!response->results) {
  193. response->responseHeader.serviceResult = UA_STATUSCODE_BADOUTOFMEMORY;
  194. return;
  195. }
  196. response->resultsSize = request->methodsToCallSize;
  197. for(size_t i = 0; i < request->methodsToCallSize;i++)
  198. Service_Call_single(server, session, &request->methodsToCall[i], &response->results[i]);
  199. }
  200. #endif /* UA_ENABLE_METHODCALLS */