You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

util.h 14 kB

5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395
  1. /**
  2. * Copyright 2019-2020 Huawei Technologies Co., Ltd
  3. *
  4. * Licensed under the Apache License, Version 2.0 (the "License");
  5. * you may not use this file except in compliance with the License.
  6. * You may obtain a copy of the License at
  7. *
  8. * http://www.apache.org/licenses/LICENSE-2.0
  9. *
  10. * Unless required by applicable law or agreed to in writing, software
  11. * distributed under the License is distributed on an "AS IS" BASIS,
  12. * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  13. * See the License for the specific language governing permissions and
  14. * limitations under the License.
  15. */
  16. #ifndef INC_FRAMEWORK_COMMON_UTIL_H_
  17. #define INC_FRAMEWORK_COMMON_UTIL_H_
  18. #include <google/protobuf/text_format.h>
  19. #include <limits.h>
  20. #include <math.h>
  21. #include <sstream>
  22. #include <string>
  23. #include <vector>
  24. #include "framework/common/debug/ge_log.h"
  25. #include "framework/common/debug/log.h"
  26. #include "framework/common/scope_guard.h"
  27. #include "framework/common/ge_inner_error_codes.h"
  28. #include "mmpa/mmpa_api.h"
  29. #define GE_CHECK_POSITIVE_SIZE_RANGE(size) \
  30. do { \
  31. if (size <= 0) { \
  32. DOMI_LOGE("param[%s] is not a positive number", #size); \
  33. return PARAM_INVALID; \
  34. } \
  35. } while (0)
  36. #define CHECK_FALSE_EXEC(expr, exec_expr, ...) \
  37. { \
  38. bool b = (expr); \
  39. if (!b) { \
  40. exec_expr; \
  41. } \
  42. }
  43. // new ge marco
  44. // Encapsulate common resource releases
  45. #define GE_MAKE_GUARD_RTMEM(var) \
  46. GE_MAKE_GUARD(var, [&] { \
  47. if (var) GE_CHK_RT(rtFreeHost(var)); \
  48. });
  49. #define GE_MAKE_GUARD_RTSTREAM(var) \
  50. GE_MAKE_GUARD(var, [&] { \
  51. if (var) GE_CHK_RT(rtStreamDestroy(var)); \
  52. });
  53. // For propagating errors when calling a function.
  54. #define GE_RETURN_IF_ERROR(expr) \
  55. do { \
  56. const ::ge::Status _status = (expr); \
  57. if (_status) return _status; \
  58. } while (0)
  59. #define GE_RETURN_WITH_LOG_IF_ERROR(expr, ...) \
  60. do { \
  61. const ::ge::Status _status = (expr); \
  62. if (_status) { \
  63. DOMI_LOGE(__VA_ARGS__); \
  64. return _status; \
  65. } \
  66. } while (0)
  67. // check whether the parameter is true. If it is, return FAILED and record the error log
  68. #define GE_RETURN_WITH_LOG_IF_TRUE(condition, ...) \
  69. do { \
  70. if (condition) { \
  71. DOMI_LOGE(__VA_ARGS__); \
  72. return ge::FAILED; \
  73. } \
  74. } while (0)
  75. // Check if the parameter is false. If yes, return FAILED and record the error log
  76. #define GE_RETURN_WITH_LOG_IF_FALSE(condition, ...) \
  77. do { \
  78. bool _condition = (condition); \
  79. if (!_condition) { \
  80. DOMI_LOGE(__VA_ARGS__); \
  81. return ge::FAILED; \
  82. } \
  83. } while (0)
  84. // Checks whether the parameter is true. If so, returns PARAM_INVALID and records the error log
  85. #define GE_RT_PARAM_INVALID_WITH_LOG_IF_TRUE(condition, ...) \
  86. do { \
  87. if (condition) { \
  88. DOMI_LOGE(__VA_ARGS__); \
  89. return ge::PARAM_INVALID; \
  90. } \
  91. } while (0)
  92. // Check if the parameter is false. If yes, return PARAM_INVALID and record the error log
  93. #define GE_RT_PARAM_INVALID_WITH_LOG_IF_FALSE(condition, ...) \
  94. do { \
  95. bool _condition = (condition); \
  96. if (!_condition) { \
  97. DOMI_LOGE(__VA_ARGS__); \
  98. return ge::PARAM_INVALID; \
  99. } \
  100. } while (0)
  101. // Check if the parameter is null. If yes, return PARAM_INVALID and record the error
  102. #define GE_CHECK_NOTNULL(val) \
  103. do { \
  104. if (val == nullptr) { \
  105. DOMI_LOGE("param[%s] must not be null.", #val); \
  106. return ge::PARAM_INVALID; \
  107. } \
  108. } while (0)
  109. // Check if the parameter is null. If yes, just return and record the error
  110. #define GE_CHECK_NOTNULL_JUST_RETURN(val) \
  111. do { \
  112. if (val == nullptr) { \
  113. DOMI_LOGE("param[%s] must not be null.", #val); \
  114. return; \
  115. } \
  116. } while (0)
  117. // Check whether the parameter is null. If so, execute the exec_expr expression and record the error log
  118. #define GE_CHECK_NOTNULL_EXEC(val, exec_expr) \
  119. do { \
  120. if (val == nullptr) { \
  121. DOMI_LOGE("param[%s] must not be null.", #val); \
  122. exec_expr; \
  123. } \
  124. } while (0)
  125. // Check whether the parameter is null. If yes, return directly and record the error log
  126. #define GE_RT_VOID_CHECK_NOTNULL(val) \
  127. do { \
  128. if (val == nullptr) { \
  129. DOMI_LOGE("param[%s] must not be null.", #val); \
  130. return; \
  131. } \
  132. } while (0)
  133. // Check if the parameter is null. If yes, return false and record the error log
  134. #define GE_RT_FALSE_CHECK_NOTNULL(val) \
  135. do { \
  136. if (val == nullptr) { \
  137. DOMI_LOGE("param[%s] must not be null.", #val); \
  138. return false; \
  139. } \
  140. } while (0)
  141. // Check if the parameter is out of bounds
  142. #define GE_CHECK_SIZE(size) \
  143. do { \
  144. if (size == 0) { \
  145. DOMI_LOGE("param[%s] is out of range", #size); \
  146. return ge::PARAM_INVALID; \
  147. } \
  148. } while (0)
  149. // Check if the container is empty
  150. #define GE_CHECK_VECTOR_NOT_EMPTY(vector) \
  151. do { \
  152. if (vector.empty()) { \
  153. DOMI_LOGE("param[%s] is empty!", #vector); \
  154. return ge::FAILED; \
  155. } \
  156. } while (0)
  157. // Check if the value on the left is greater than or equal to the value on the right
  158. #define GE_CHECK_GE(lhs, rhs) \
  159. do { \
  160. if (lhs < rhs) { \
  161. DOMI_LOGE("param[%s] is less than[%s]", #lhs, #rhs); \
  162. return ge::PARAM_INVALID; \
  163. } \
  164. } while (0)
  165. // Check if the value on the left is less than or equal to the value on the right
  166. #define GE_CHECK_LE(lhs, rhs) \
  167. do { \
  168. if (lhs > rhs) { \
  169. DOMI_LOGE("param[%s] is greater than[%s]", #lhs, #rhs); \
  170. return ge::PARAM_INVALID; \
  171. } \
  172. } while (0)
  173. #define GE_DELETE_NEW_SINGLE(var) \
  174. do { \
  175. if (var != nullptr) { \
  176. delete var; \
  177. var = nullptr; \
  178. } \
  179. } while (0)
  180. #define GE_DELETE_NEW_ARRAY(var) \
  181. do { \
  182. if (var != nullptr) { \
  183. delete[] var; \
  184. var = nullptr; \
  185. } \
  186. } while (0)
  187. /**
  188. * @ingroup domi_common
  189. * @brief version of om.proto file
  190. */
  191. static constexpr int32_t OM_PROTO_VERSION = 2;
  192. /**
  193. * Finding an Integer Ceiling Value Without Precision Loss
  194. */
  195. #define CEIL(N, n) (((N) + (n)-1) / (n))
  196. namespace ge {
  197. using google::protobuf::Message;
  198. ///
  199. /// @ingroup domi_common
  200. /// @brief Maximum file path length
  201. ///
  202. const int32_t DOMI_MAX_PATH_LEN = 256;
  203. ///
  204. /// @ingroup domi_common
  205. /// @brief proto file in bianary format
  206. /// @param [in] file path of proto file
  207. /// @param [out] proto memory for storing the proto file
  208. /// @return true success
  209. /// @return false fail
  210. ///
  211. bool ReadProtoFromBinaryFile(const char *file, Message *proto);
  212. ///
  213. /// @ingroup domi_common
  214. /// @brief Reads the proto structure from an array.
  215. /// @param [in] data proto data to be read
  216. /// @param [in] size proto data size
  217. /// @param [out] proto Memory for storing the proto file
  218. /// @return true success
  219. /// @return false fail
  220. ///
  221. bool ReadProtoFromArray(const void *data, int size, Message *proto);
  222. ///
  223. /// @ingroup domi_proto
  224. /// @brief Reads the proto file in the text format.
  225. /// @param [in] file path of proto file
  226. /// @param [out] message Memory for storing the proto file
  227. /// @return true success
  228. /// @return false fail
  229. ///
  230. bool ReadProtoFromText(const char *file, google::protobuf::Message *message);
  231. bool ReadProtoFromMem(const char *data, int size, google::protobuf::Message *message);
  232. ///
  233. /// @ingroup: domi_common
  234. /// @brief: get length of file
  235. /// @param [in] input_file: path of file
  236. /// @return long: File length. If the file length fails to be obtained, the value -1 is returned.
  237. ///
  238. extern long GetFileLength(const std::string &input_file);
  239. ///
  240. /// @ingroup domi_common
  241. /// @brief Reads all data from a binary file.
  242. /// @param [in] file_name path of file
  243. /// @param [out] buffer Output memory address, which needs to be released by the caller.
  244. /// @param [out] length Output memory size
  245. /// @return false fail
  246. /// @return true success
  247. ///
  248. bool ReadBytesFromBinaryFile(const char *file_name, char **buffer, int &length);
  249. bool ReadBytesFromBinaryFile(const char *file_name, std::vector<char> &buffer);
  250. ///
  251. /// @ingroup domi_common
  252. /// @brief Recursively Creating a Directory
  253. /// @param [in] directory_path Path, which can be a multi-level directory.
  254. /// @return 0 success
  255. /// @return -1 fail
  256. ///
  257. extern int CreateDirectory(const std::string &directory_path);
  258. ///
  259. /// @ingroup domi_common
  260. /// @brief Obtains the current time string.
  261. /// @return Time character string in the format : %Y%m%d%H%M%S, eg: 20171011083555
  262. ///
  263. std::string CurrentTimeInStr();
  264. ///
  265. /// @ingroup domi_common
  266. /// @brief onverts Vector of a number to a string.
  267. /// @param [in] v Vector of a number
  268. /// @return string
  269. ///
  270. template <typename T>
  271. std::string ToString(std::vector<T> &v) {
  272. std::stringstream ss;
  273. ss << "[";
  274. for (T x : v) {
  275. ss << x;
  276. ss << ", ";
  277. }
  278. std::string strRet =
  279. ss.str().substr(0, ss.str().length() - 2); // Delete the two extra characters at the end of the line.
  280. strRet += "]";
  281. return strRet;
  282. }
  283. ///
  284. /// @ingroup domi_common
  285. /// @brief Converts RepeatedField to String.
  286. /// @param [in] rpd_field RepeatedField
  287. /// @return string
  288. ///
  289. template <typename T>
  290. std::string ToString(const google::protobuf::RepeatedField<T> &rpd_field) {
  291. std::stringstream ss;
  292. ss << "[";
  293. for (T x : rpd_field) {
  294. ss << x;
  295. ss << ", ";
  296. }
  297. std::string strRet =
  298. ss.str().substr(0, ss.str().length() - 2); // Delete the two extra characters at the end of the line.
  299. strRet += "]";
  300. return strRet;
  301. }
  302. ///
  303. /// @ingroup domi_common
  304. /// @brief Obtains the absolute time (timestamp) of the current system.
  305. /// @return Timestamp, in microseconds (US)
  306. ///
  307. ///
  308. uint64_t GetCurrentTimestap();
  309. ///
  310. /// @ingroup domi_common
  311. /// @brief Check whether the product of two int64 numbers exceeds the int64 range.
  312. /// @param [in] a
  313. /// @param [in] b
  314. /// @return false: true: The result is within the normal int64 range.
  315. ///
  316. bool CheckInt64MulOverflow(int64_t a, int64_t b);
  317. ///
  318. /// @ingroup domi_common
  319. /// @brief Absolute path for obtaining files.
  320. /// @param [in] path of input file
  321. /// @param [out] Absolute path of a file. If the absolute path cannot be obtained, an empty string is returned
  322. ///
  323. std::string RealPath(const char *path);
  324. ///
  325. /// @ingroup domi_common
  326. /// @brief Check whether the specified input file path is valid.
  327. /// 1. The specified path cannot be empty.
  328. /// 2. The path can be converted to an absolute path.
  329. /// 3. The file path exists and is readable.
  330. /// @param [in] file_path path of input file
  331. /// @param [out] result
  332. ///
  333. bool CheckInputPathValid(const std::string &file_path, const std::string &atc_param = "");
  334. ///
  335. /// @ingroup domi_common
  336. /// @brief Checks whether the specified output file path is valid.
  337. /// @param [in] file_path path of output file
  338. /// @param [out] result
  339. ///
  340. bool CheckOutputPathValid(const std::string &file_path, const std::string &atc_param = "");
  341. ///
  342. /// @ingroup domi_common
  343. /// @brief Check whether the file path meets the whitelist verification requirements.
  344. /// @param [in] filePath file path
  345. /// @param [out] result
  346. ///
  347. bool ValidateStr(const std::string &filePath, const std::string &mode);
  348. } // namespace ge
  349. #endif // INC_FRAMEWORK_COMMON_UTIL_H_

图引擎模块(GE)是MindSpore的一个子模块,其代码由C++实现,位于前端模块ME和底层硬件之间,起到承接作用。图引擎模块以ME下发的图作为输入,然后进行一系列的深度图优化操作,最后输出一张可以在底层硬件上高效运行的图。GE针对昇腾AI处理器的硬件结构特点,做了特定的优化工作,以此来充分发挥出昇腾AI处理器的强大算力。在进行模型训练/推理时,GE会被自动调用而用户并不感知。GE主要由GE API和GE Core两部分组成,详细的架构图如下所示