2 * Copyright (c) 2006 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
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.
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.
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.
35 __RCSID("$Heimdal: common.c 18900 2006-11-03 05:21:01Z lha $"
39 store_string(krb5_storage
*sp
, const char *str
)
41 size_t len
= strlen(str
) + 1;
44 ret
= krb5_store_int32(sp
, len
);
47 ret
= krb5_storage_write(sp
, str
, len
);
54 add_list(char ****list
, size_t *listlen
, char **str
, size_t len
)
57 *list
= erealloc(*list
, sizeof(**list
) * (*listlen
+ 1));
59 (*list
)[*listlen
] = ecalloc(len
, sizeof(**list
));
60 for (i
= 0; i
< len
; i
++)
61 (*list
)[*listlen
][i
] = str
[i
];
66 permute(char ****list
, size_t *listlen
,
67 char **str
, const int start
, const int len
)
71 #define SWAP(s,i,j) { char *t = str[i]; str[i] = str[j]; str[j] = t; }
73 for (i
= start
; i
< len
- 1; i
++) {
74 for (j
= i
+1; j
< len
; j
++) {
76 permute(list
, listlen
, str
, i
+1, len
);
80 add_list(list
, listlen
, str
, len
);
84 permutate_all(struct getarg_strings
*strings
, size_t *size
)
86 char **list
, ***all
= NULL
;
91 list
= ecalloc(strings
->num_strings
, sizeof(*list
));
92 for (i
= 0; i
< strings
->num_strings
; i
++)
93 list
[i
] = strings
->strings
[i
];
95 permute(&all
, size
, list
, 0, strings
->num_strings
);