schur_templates.cc 6.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227
  1. // Ceres Solver - A fast non-linear least squares minimizer
  2. // Copyright 2023 Google Inc. All rights reserved.
  3. // http://ceres-solver.org/
  4. //
  5. // Redistribution and use in source and binary forms, with or without
  6. // modification, are permitted provided that the following conditions are met:
  7. //
  8. // * Redistributions of source code must retain the above copyright notice,
  9. // this list of conditions and the following disclaimer.
  10. // * Redistributions in binary form must reproduce the above copyright notice,
  11. // this list of conditions and the following disclaimer in the documentation
  12. // and/or other materials provided with the distribution.
  13. // * Neither the name of Google Inc. nor the names of its contributors may be
  14. // used to endorse or promote products derived from this software without
  15. // specific prior written permission.
  16. //
  17. // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  18. // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  19. // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  20. // ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  21. // LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  22. // CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  23. // SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  24. // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  25. // CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  26. // ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  27. // POSSIBILITY OF SUCH DAMAGE.
  28. //
  29. // Author: sameeragarwal@google.com (Sameer Agarwal)
  30. //
  31. // What template specializations are available.
  32. //
  33. // ========================================
  34. // THIS FILE IS AUTOGENERATED. DO NOT EDIT.
  35. // THIS FILE IS AUTOGENERATED. DO NOT EDIT.
  36. // THIS FILE IS AUTOGENERATED. DO NOT EDIT.
  37. // THIS FILE IS AUTOGENERATED. DO NOT EDIT.
  38. //=========================================
  39. //
  40. // This file is generated using generate_template_specializations.py.
  41. #include "ceres/internal/eigen.h"
  42. #include "ceres/schur_templates.h"
  43. namespace ceres {
  44. namespace internal {
  45. void GetBestSchurTemplateSpecialization(int* row_block_size,
  46. int* e_block_size,
  47. int* f_block_size) {
  48. LinearSolver::Options options;
  49. options.row_block_size = *row_block_size;
  50. options.e_block_size = *e_block_size;
  51. options.f_block_size = *f_block_size;
  52. *row_block_size = Eigen::Dynamic;
  53. *e_block_size = Eigen::Dynamic;
  54. *f_block_size = Eigen::Dynamic;
  55. #ifndef CERES_RESTRICT_SCHUR_SPECIALIZATION
  56. if ((options.row_block_size == 2) &&
  57. (options.e_block_size == 2) &&
  58. (options.f_block_size == 2)) {
  59. *row_block_size = 2;
  60. *e_block_size = 2;
  61. *f_block_size = 2;
  62. return;
  63. }
  64. if ((options.row_block_size == 2) &&
  65. (options.e_block_size == 2) &&
  66. (options.f_block_size == 3)) {
  67. *row_block_size = 2;
  68. *e_block_size = 2;
  69. *f_block_size = 3;
  70. return;
  71. }
  72. if ((options.row_block_size == 2) &&
  73. (options.e_block_size == 2) &&
  74. (options.f_block_size == 4)) {
  75. *row_block_size = 2;
  76. *e_block_size = 2;
  77. *f_block_size = 4;
  78. return;
  79. }
  80. if ((options.row_block_size == 2) &&
  81. (options.e_block_size == 2)) {
  82. *row_block_size = 2;
  83. *e_block_size = 2;
  84. *f_block_size = Eigen::Dynamic;
  85. return;
  86. }
  87. if ((options.row_block_size == 2) &&
  88. (options.e_block_size == 3) &&
  89. (options.f_block_size == 3)) {
  90. *row_block_size = 2;
  91. *e_block_size = 3;
  92. *f_block_size = 3;
  93. return;
  94. }
  95. if ((options.row_block_size == 2) &&
  96. (options.e_block_size == 3) &&
  97. (options.f_block_size == 4)) {
  98. *row_block_size = 2;
  99. *e_block_size = 3;
  100. *f_block_size = 4;
  101. return;
  102. }
  103. if ((options.row_block_size == 2) &&
  104. (options.e_block_size == 3) &&
  105. (options.f_block_size == 6)) {
  106. *row_block_size = 2;
  107. *e_block_size = 3;
  108. *f_block_size = 6;
  109. return;
  110. }
  111. if ((options.row_block_size == 2) &&
  112. (options.e_block_size == 3) &&
  113. (options.f_block_size == 9)) {
  114. *row_block_size = 2;
  115. *e_block_size = 3;
  116. *f_block_size = 9;
  117. return;
  118. }
  119. if ((options.row_block_size == 2) &&
  120. (options.e_block_size == 3)) {
  121. *row_block_size = 2;
  122. *e_block_size = 3;
  123. *f_block_size = Eigen::Dynamic;
  124. return;
  125. }
  126. if ((options.row_block_size == 2) &&
  127. (options.e_block_size == 4) &&
  128. (options.f_block_size == 3)) {
  129. *row_block_size = 2;
  130. *e_block_size = 4;
  131. *f_block_size = 3;
  132. return;
  133. }
  134. if ((options.row_block_size == 2) &&
  135. (options.e_block_size == 4) &&
  136. (options.f_block_size == 4)) {
  137. *row_block_size = 2;
  138. *e_block_size = 4;
  139. *f_block_size = 4;
  140. return;
  141. }
  142. if ((options.row_block_size == 2) &&
  143. (options.e_block_size == 4) &&
  144. (options.f_block_size == 6)) {
  145. *row_block_size = 2;
  146. *e_block_size = 4;
  147. *f_block_size = 6;
  148. return;
  149. }
  150. if ((options.row_block_size == 2) &&
  151. (options.e_block_size == 4) &&
  152. (options.f_block_size == 8)) {
  153. *row_block_size = 2;
  154. *e_block_size = 4;
  155. *f_block_size = 8;
  156. return;
  157. }
  158. if ((options.row_block_size == 2) &&
  159. (options.e_block_size == 4) &&
  160. (options.f_block_size == 9)) {
  161. *row_block_size = 2;
  162. *e_block_size = 4;
  163. *f_block_size = 9;
  164. return;
  165. }
  166. if ((options.row_block_size == 2) &&
  167. (options.e_block_size == 4)) {
  168. *row_block_size = 2;
  169. *e_block_size = 4;
  170. *f_block_size = Eigen::Dynamic;
  171. return;
  172. }
  173. if (options.row_block_size == 2) {
  174. *row_block_size = 2;
  175. *e_block_size = Eigen::Dynamic;
  176. *f_block_size = Eigen::Dynamic;
  177. return;
  178. }
  179. if ((options.row_block_size == 3) &&
  180. (options.e_block_size == 3) &&
  181. (options.f_block_size == 3)) {
  182. *row_block_size = 3;
  183. *e_block_size = 3;
  184. *f_block_size = 3;
  185. return;
  186. }
  187. if ((options.row_block_size == 4) &&
  188. (options.e_block_size == 4) &&
  189. (options.f_block_size == 2)) {
  190. *row_block_size = 4;
  191. *e_block_size = 4;
  192. *f_block_size = 2;
  193. return;
  194. }
  195. if ((options.row_block_size == 4) &&
  196. (options.e_block_size == 4) &&
  197. (options.f_block_size == 3)) {
  198. *row_block_size = 4;
  199. *e_block_size = 4;
  200. *f_block_size = 3;
  201. return;
  202. }
  203. if ((options.row_block_size == 4) &&
  204. (options.e_block_size == 4) &&
  205. (options.f_block_size == 4)) {
  206. *row_block_size = 4;
  207. *e_block_size = 4;
  208. *f_block_size = 4;
  209. return;
  210. }
  211. if ((options.row_block_size == 4) &&
  212. (options.e_block_size == 4)) {
  213. *row_block_size = 4;
  214. *e_block_size = 4;
  215. *f_block_size = Eigen::Dynamic;
  216. return;
  217. }
  218. #endif
  219. return;
  220. }
  221. } // namespace internal
  222. } // namespace ceres