1178825Sdfr/* 2233294Sstas * Copyright (c) 2006 Kungliga Tekniska H��gskolan 3233294Sstas * (Royal Institute of Technology, Stockholm, Sweden). 4233294Sstas * All rights reserved. 5178825Sdfr * 6233294Sstas * Redistribution and use in source and binary forms, with or without 7233294Sstas * modification, are permitted provided that the following conditions 8233294Sstas * are met: 9178825Sdfr * 10233294Sstas * 1. Redistributions of source code must retain the above copyright 11233294Sstas * notice, this list of conditions and the following disclaimer. 12178825Sdfr * 13233294Sstas * 2. Redistributions in binary form must reproduce the above copyright 14233294Sstas * notice, this list of conditions and the following disclaimer in the 15233294Sstas * documentation and/or other materials provided with the distribution. 16178825Sdfr * 17178825Sdfr * 3. Neither the name of KTH nor the names of its contributors may be 18178825Sdfr * used to endorse or promote products derived from this software without 19178825Sdfr * specific prior written permission. 20178825Sdfr * 21178825Sdfr * THIS SOFTWARE IS PROVIDED BY KTH AND ITS CONTRIBUTORS ``AS IS'' AND ANY 22178825Sdfr * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23178825Sdfr * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 24178825Sdfr * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL KTH OR ITS CONTRIBUTORS BE 25178825Sdfr * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 26178825Sdfr * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 27178825Sdfr * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR 28178825Sdfr * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, 29178825Sdfr * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR 30178825Sdfr * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF 31178825Sdfr * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 32178825Sdfr */ 33178825Sdfr 34178825Sdfr#include <common.h> 35233294SstasRCSID("$Id$"); 36178825Sdfr 37178825Sdfrkrb5_error_code 38178825Sdfrstore_string(krb5_storage *sp, const char *str) 39178825Sdfr{ 40178825Sdfr size_t len = strlen(str) + 1; 41178825Sdfr krb5_error_code ret; 42178825Sdfr 43178825Sdfr ret = krb5_store_int32(sp, len); 44178825Sdfr if (ret) 45178825Sdfr return ret; 46178825Sdfr ret = krb5_storage_write(sp, str, len); 47178825Sdfr if (ret != len) 48178825Sdfr return EINVAL; 49178825Sdfr return 0; 50178825Sdfr} 51178825Sdfr 52178825Sdfrstatic void 53178825Sdfradd_list(char ****list, size_t *listlen, char **str, size_t len) 54178825Sdfr{ 55178825Sdfr size_t i; 56178825Sdfr *list = erealloc(*list, sizeof(**list) * (*listlen + 1)); 57178825Sdfr 58178825Sdfr (*list)[*listlen] = ecalloc(len, sizeof(**list)); 59178825Sdfr for (i = 0; i < len; i++) 60178825Sdfr (*list)[*listlen][i] = str[i]; 61178825Sdfr (*listlen)++; 62178825Sdfr} 63178825Sdfr 64178825Sdfrstatic void 65233294Sstaspermute(char ****list, size_t *listlen, 66233294Sstas char **str, const int start, const int len) 67178825Sdfr{ 68178825Sdfr int i, j; 69178825Sdfr 70178825Sdfr#define SWAP(s,i,j) { char *t = str[i]; str[i] = str[j]; str[j] = t; } 71178825Sdfr 72178825Sdfr for (i = start; i < len - 1; i++) { 73178825Sdfr for (j = i+1; j < len; j++) { 74178825Sdfr SWAP(str,i,j); 75178825Sdfr permute(list, listlen, str, i+1, len); 76178825Sdfr SWAP(str,i,j); 77178825Sdfr } 78178825Sdfr } 79178825Sdfr add_list(list, listlen, str, len); 80178825Sdfr} 81178825Sdfr 82178825Sdfrchar *** 83178825Sdfrpermutate_all(struct getarg_strings *strings, size_t *size) 84178825Sdfr{ 85178825Sdfr char **list, ***all = NULL; 86178825Sdfr int i; 87178825Sdfr 88178825Sdfr *size = 0; 89178825Sdfr 90178825Sdfr list = ecalloc(strings->num_strings, sizeof(*list)); 91178825Sdfr for (i = 0; i < strings->num_strings; i++) 92178825Sdfr list[i] = strings->strings[i]; 93178825Sdfr 94178825Sdfr permute(&all, size, list, 0, strings->num_strings); 95178825Sdfr free(list); 96178825Sdfr return all; 97178825Sdfr} 98