/crypto/heimdal/appl/gssmask/common.c

https://bitbucket.org/freebsd/freebsd-head/ · C · 97 lines · 53 code · 12 blank · 32 comment · 7 complexity · dfc327f783d751a915ad1ca56315f4c8 MD5 · raw file

  1. /*
  2. * Copyright (c) 2006 Kungliga Tekniska Hรถgskolan
  3. * (Royal Institute of Technology, Stockholm, Sweden).
  4. * All rights reserved.
  5. *
  6. * Redistribution and use in source and binary forms, with or without
  7. * modification, are permitted provided that the following conditions
  8. * are met:
  9. *
  10. * 1. Redistributions of source code must retain the above copyright
  11. * notice, this list of conditions and the following disclaimer.
  12. *
  13. * 2. Redistributions in binary form must reproduce the above copyright
  14. * notice, this list of conditions and the following disclaimer in the
  15. * documentation and/or other materials provided with the distribution.
  16. *
  17. * 3. Neither the name of KTH nor the names of its contributors may be
  18. * used to endorse or promote products derived from this software without
  19. * specific prior written permission.
  20. *
  21. * THIS SOFTWARE IS PROVIDED BY KTH AND ITS CONTRIBUTORS ``AS IS'' AND ANY
  22. * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  23. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  24. * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL KTH OR ITS CONTRIBUTORS BE
  25. * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  26. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  27. * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
  28. * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
  29. * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
  30. * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
  31. * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  32. */
  33. #include <common.h>
  34. RCSID("$Id$");
  35. krb5_error_code
  36. store_string(krb5_storage *sp, const char *str)
  37. {
  38. size_t len = strlen(str) + 1;
  39. krb5_error_code ret;
  40. ret = krb5_store_int32(sp, len);
  41. if (ret)
  42. return ret;
  43. ret = krb5_storage_write(sp, str, len);
  44. if (ret != len)
  45. return EINVAL;
  46. return 0;
  47. }
  48. static void
  49. add_list(char ****list, size_t *listlen, char **str, size_t len)
  50. {
  51. size_t i;
  52. *list = erealloc(*list, sizeof(**list) * (*listlen + 1));
  53. (*list)[*listlen] = ecalloc(len, sizeof(**list));
  54. for (i = 0; i < len; i++)
  55. (*list)[*listlen][i] = str[i];
  56. (*listlen)++;
  57. }
  58. static void
  59. permute(char ****list, size_t *listlen,
  60. char **str, const int start, const int len)
  61. {
  62. int i, j;
  63. #define SWAP(s,i,j) { char *t = str[i]; str[i] = str[j]; str[j] = t; }
  64. for (i = start; i < len - 1; i++) {
  65. for (j = i+1; j < len; j++) {
  66. SWAP(str,i,j);
  67. permute(list, listlen, str, i+1, len);
  68. SWAP(str,i,j);
  69. }
  70. }
  71. add_list(list, listlen, str, len);
  72. }
  73. char ***
  74. permutate_all(struct getarg_strings *strings, size_t *size)
  75. {
  76. char **list, ***all = NULL;
  77. int i;
  78. *size = 0;
  79. list = ecalloc(strings->num_strings, sizeof(*list));
  80. for (i = 0; i < strings->num_strings; i++)
  81. list[i] = strings->strings[i];
  82. permute(&all, size, list, 0, strings->num_strings);
  83. free(list);
  84. return all;
  85. }