find_program.h 3.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103
  1. /**
  2. * @file find_program.h
  3. * @author Ambroz Bizjak <ambrop7@gmail.com>
  4. *
  5. * @section LICENSE
  6. *
  7. * Redistribution and use in source and binary forms, with or without
  8. * modification, are permitted provided that the following conditions are met:
  9. * 1. Redistributions of source code must retain the above copyright
  10. * notice, this list of conditions and the following disclaimer.
  11. * 2. Redistributions in binary form must reproduce the above copyright
  12. * notice, this list of conditions and the following disclaimer in the
  13. * documentation and/or other materials provided with the distribution.
  14. * 3. Neither the name of the author nor the
  15. * names of its contributors may be used to endorse or promote products
  16. * derived from this software without specific prior written permission.
  17. *
  18. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
  19. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
  20. * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  21. * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
  22. * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
  23. * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  24. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
  25. * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  26. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  27. * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  28. *
  29. * @section DESCRIPTION
  30. *
  31. * Function that finds the absolute path of a program by checking a predefined
  32. * list of directories.
  33. */
  34. #ifndef BADVPN_FIND_PROGRAM_H
  35. #define BADVPN_FIND_PROGRAM_H
  36. #include <stdlib.h>
  37. #include <unistd.h>
  38. #include <string.h>
  39. #include <misc/concat_strings.h>
  40. #include <misc/debug.h>
  41. #include <misc/balloc.h>
  42. static char * badvpn_find_program (const char *name);
  43. static char * badvpn_find_program (const char *name)
  44. {
  45. ASSERT(name)
  46. char *path = getenv("PATH");
  47. if (path) {
  48. while (1) {
  49. size_t i = 0;
  50. while (path[i] != ':' && path[i] != '\0') {
  51. i++;
  52. }
  53. char const *src = path;
  54. size_t src_len = i;
  55. if (src_len == 0) {
  56. src = ".";
  57. src_len = 1;
  58. }
  59. size_t name_len = strlen(name);
  60. char *entry = BAllocSize(bsize_add(bsize_fromsize(src_len), bsize_add(bsize_fromsize(name_len), bsize_fromsize(2))));
  61. if (!entry) {
  62. goto fail;
  63. }
  64. memcpy(entry, src, src_len);
  65. entry[src_len] = '/';
  66. strcpy(entry + (src_len + 1), name);
  67. if (access(entry, X_OK) == 0) {
  68. return entry;
  69. }
  70. free(entry);
  71. if (path[i] == '\0') {
  72. break;
  73. }
  74. path += i + 1;
  75. }
  76. }
  77. const char *dirs[] = {"/usr/sbin", "/usr/bin", "/sbin", "/bin", NULL};
  78. for (size_t i = 0; dirs[i]; i++) {
  79. char *try_path = concat_strings(3, dirs[i], "/", name);
  80. if (!try_path) {
  81. goto fail;
  82. }
  83. if (access(try_path, X_OK) == 0) {
  84. return try_path;
  85. }
  86. free(try_path);
  87. }
  88. fail:
  89. return NULL;
  90. }
  91. #endif