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.

string_util.h 4.8 kB

5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157
  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_STRING_UTIL_H_
  17. #define INC_FRAMEWORK_COMMON_STRING_UTIL_H_
  18. #include <cctype>
  19. #include <securec.h>
  20. #include <algorithm>
  21. #include <functional>
  22. #include <sstream>
  23. #include <string>
  24. #include <vector>
  25. namespace ge {
  26. class StringUtils {
  27. public:
  28. static std::string &Ltrim(std::string &s) {
  29. #if __cplusplus >= 201103L
  30. (void)s.erase(s.begin(), std::find_if(s.begin(), s.end(), [](int c) { return !std::isspace(c); }));
  31. #else
  32. (void)s.erase(s.begin(), std::find_if(s.begin(), s.end(), std::not1(std::ptr_fun<int, int>(std::isspace))));
  33. #endif
  34. return s;
  35. }
  36. static std::string &Rtrim(std::string &s) {
  37. #if __cplusplus >= 201103L
  38. (void)s.erase(s.begin(), std::find_if(s.begin(), s.end(), [](int c) { return !std::isspace(c); }));
  39. #else
  40. (void)s.erase(std::find_if(s.rbegin(), s.rend(), std::not1(std::ptr_fun<int, int>(std::isspace))).base(), s.end());
  41. #endif
  42. return s;
  43. }
  44. ///
  45. /// @ingroup domi_common
  46. /// @brief delete spaces at the beginning and end of a string
  47. /// @param [in] string to be trimmed
  48. /// @return string after trim
  49. ///
  50. static std::string &Trim(std::string &s) { return Ltrim(Rtrim(s)); }
  51. ///
  52. /// @ingroup domi_common
  53. /// @brief string splitting
  54. /// @param [in] str string to be trimmed
  55. /// @param [in] delim separator
  56. /// @return string array after segmentation
  57. ///
  58. static std::vector<std::string> Split(const std::string &str, char delim) {
  59. std::vector<std::string> elems;
  60. if (str.empty()) {
  61. elems.emplace_back("");
  62. return elems;
  63. }
  64. std::stringstream ss(str);
  65. std::string item;
  66. while (getline(ss, item, delim)) {
  67. elems.push_back(item);
  68. }
  69. auto str_size = str.size();
  70. if (str_size > 0 && str[str_size - 1] == delim) {
  71. elems.emplace_back("");
  72. }
  73. return elems;
  74. }
  75. ///
  76. /// @ingroup domi_common
  77. /// @brief obtain the file name
  78. /// @param [in] s path name
  79. /// @return file name
  80. ///
  81. static std::string GetFileName(std::string &s) {
  82. if (s.empty()) {
  83. return "";
  84. }
  85. std::vector<std::string> files = StringUtils::Split(s, '/');
  86. return files.empty() ? "" : files[files.size() - 1];
  87. }
  88. ///
  89. /// @ingroup domi_common
  90. /// @brief full replacement
  91. /// @link
  92. /// @param [in] str str string to be replaced
  93. /// @param [in] old_value old Characters Before Replacement
  94. /// @param [in] new_value new Characters Before Replacement
  95. /// @return string after replacement
  96. ///
  97. static std::string ReplaceAll(std::string str, const std::string &old_value, const std::string &new_value) {
  98. std::string::size_type cur_pos = 0;
  99. std::string::size_type old_length = old_value.length();
  100. std::string::size_type new_length = new_value.length();
  101. // cycle replace
  102. for (; cur_pos != std::string::npos; cur_pos += new_length) {
  103. if ((cur_pos = str.find(old_value, cur_pos)) != std::string::npos) {
  104. (void)str.replace(cur_pos, old_length, new_value);
  105. } else {
  106. break;
  107. }
  108. }
  109. return str;
  110. }
  111. ///
  112. /// @ingroup domi_common
  113. /// @brief checks whether a character string starts with a character string (prefix)
  114. /// @link
  115. /// @param [in] str string to be compared
  116. /// @param [in] str_x prefix
  117. /// @return if the value is a prefix, true is returned. Otherwise, false is returned
  118. ///
  119. static bool StartWith(const std::string &str, const std::string str_x) {
  120. return ((str.size() >= str_x.size()) && (str.compare(0, str_x.size(), str_x) == 0));
  121. }
  122. ///
  123. /// @ingroup domi_common
  124. /// @brief format string
  125. /// @link
  126. /// @param [in] format specifies the character string format
  127. /// @param [in] ... format Filling Content
  128. /// @return formatted string
  129. ///
  130. static std::string FormatString(const char *format, ...) {
  131. const uint32_t MAX_BUFFER_LEN = 1024; // the stack memory plint check result must be less than 1024
  132. va_list args;
  133. va_start(args, format);
  134. char buffer[MAX_BUFFER_LEN] = {0};
  135. int32_t ret = vsnprintf_s(buffer, MAX_BUFFER_LEN, MAX_BUFFER_LEN - 1, format, args);
  136. va_end(args);
  137. return ret > 0 ? buffer : "";
  138. }
  139. };
  140. } // namespace ge
  141. #endif // INC_FRAMEWORK_COMMON_STRING_UTIL_H_

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