randomize_fd.c (110723) | randomize_fd.c (110928) |
---|---|
1/* 2 * Copyright (C) 2003 Sean Chittenden <seanc@FreeBSD.org> 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright --- 8 unchanged lines hidden (view full) --- 17 * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE 18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24 * SUCH DAMAGE. | 1/* 2 * Copyright (C) 2003 Sean Chittenden <seanc@FreeBSD.org> 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright --- 8 unchanged lines hidden (view full) --- 17 * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE 18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24 * SUCH DAMAGE. |
25 * 26 * $FreeBSD: head/games/random/randomize_fd.c 110723 2003-02-11 19:32:18Z seanc $ | |
27 */ 28 | 25 */ 26 |
29#include "randomize_fd.h" | 27#include <sys/cdefs.h> 28__FBSDID("$FreeBSD: head/games/random/randomize_fd.c 110928 2003-02-15 10:26:10Z seanc $"); |
30 | 29 |
31struct rand_node *rand_root; 32struct rand_node *rand_tail; | 30#include <sys/types.h> 31#include <sys/param.h> |
33 | 32 |
33#include <ctype.h> 34#include <err.h> 35#include <stdlib.h> 36#include <stdio.h> 37#include <string.h> 38#include <unistd.h> |
|
34 | 39 |
35static 36struct rand_node *rand_node_allocate(void) | 40#include "randomize_fd.h" 41 42static struct rand_node *rand_root; 43static struct rand_node *rand_tail; 44 45static struct rand_node * 46rand_node_allocate(void) |
37{ 38 struct rand_node *n; 39 40 n = (struct rand_node *)malloc(sizeof(struct rand_node)); 41 if (n == NULL) 42 err(1, "malloc"); 43 44 n->len = 0; 45 n->cp = NULL; 46 n->next = NULL; 47 return(n); 48} 49 | 47{ 48 struct rand_node *n; 49 50 n = (struct rand_node *)malloc(sizeof(struct rand_node)); 51 if (n == NULL) 52 err(1, "malloc"); 53 54 n->len = 0; 55 n->cp = NULL; 56 n->next = NULL; 57 return(n); 58} 59 |
50 51static 52void rand_node_free(struct rand_node *n) | 60static void 61rand_node_free(struct rand_node *n) |
53{ 54 if (n != NULL) { 55 if (n->cp != NULL) 56 free(n->cp); 57 58 free(n); 59 } 60} 61 | 62{ 63 if (n != NULL) { 64 if (n->cp != NULL) 65 free(n->cp); 66 67 free(n); 68 } 69} 70 |
62 63static 64void rand_node_free_rec(struct rand_node *n) | 71static void 72rand_node_free_rec(struct rand_node *n) |
65{ 66 if (n != NULL) { 67 if (n->next != NULL) 68 rand_node_free_rec(n->next); 69 70 rand_node_free(n); 71 } 72} 73 | 73{ 74 if (n != NULL) { 75 if (n->next != NULL) 76 rand_node_free_rec(n->next); 77 78 rand_node_free(n); 79 } 80} 81 |
74 75static 76struct rand_node *rand_node_append(struct rand_node *n) | 82static void 83rand_node_append(struct rand_node *n) |
77{ | 84{ |
78 if (rand_root == NULL) { | 85 if (rand_root == NULL) |
79 rand_root = rand_tail = n; | 86 rand_root = rand_tail = n; |
80 return(n); 81 } else { | 87 else { |
82 rand_tail->next = n; 83 rand_tail = n; | 88 rand_tail->next = n; 89 rand_tail = n; |
84 85 return(n); | |
86 } 87} 88 | 90 } 91} 92 |
89 90int randomize_fd(int fd, int type, int unique, double denom) | 93int 94randomize_fd(int fd, int type, int unique, double denom) |
91{ 92 u_char *buf, *p; 93 u_int numnode, j, selected, slen; 94 struct rand_node *n, *prev; | 95{ 96 u_char *buf, *p; 97 u_int numnode, j, selected, slen; 98 struct rand_node *n, *prev; |
95 int bufc, bufleft, buflen, eof, fndstr, i, len, ret; | 99 int bufleft, eof, fndstr, ret; 100 size_t bufc, buflen, i; 101 ssize_t len; |
96 97 rand_root = rand_tail = NULL; | 102 103 rand_root = rand_tail = NULL; |
98 bufc = bufleft = eof = fndstr = numnode = 0; | 104 bufc = i = 0; 105 bufleft = eof = fndstr = numnode = ret = 0; |
99 100 if (type == RANDOM_TYPE_UNSET) 101 type = RANDOM_TYPE_LINES; 102 103 buflen = sizeof(u_char) * MAXBSIZE; 104 buf = (u_char *)malloc(buflen); 105 if (buf == NULL) 106 err(1, "malloc"); 107 108 while (!eof) { 109 /* Check to see if we have bits in the buffer */ 110 if (bufleft == 0) { 111 len = read(fd, buf, buflen); 112 if (len == -1) 113 err(1, "read"); | 106 107 if (type == RANDOM_TYPE_UNSET) 108 type = RANDOM_TYPE_LINES; 109 110 buflen = sizeof(u_char) * MAXBSIZE; 111 buf = (u_char *)malloc(buflen); 112 if (buf == NULL) 113 err(1, "malloc"); 114 115 while (!eof) { 116 /* Check to see if we have bits in the buffer */ 117 if (bufleft == 0) { 118 len = read(fd, buf, buflen); 119 if (len == -1) 120 err(1, "read"); |
114 else if (len == 0) 115 break; 116 else if (len < buflen) { 117 buflen = len; | 121 else if (len == 0) { |
118 eof++; | 122 eof++; |
119 } | 123 break; 124 } else if ((size_t)len < buflen) 125 buflen = (size_t)len; |
120 | 126 |
121 bufleft = len; | 127 bufleft = (int)len; |
122 } 123 124 /* Look for a newline */ | 128 } 129 130 /* Look for a newline */ |
125 for (i = bufc; i <= buflen; i++, bufleft--) { | 131 for (i = bufc; i <= buflen && bufleft >= 0; i++, bufleft--) { |
126 if (i == buflen) { 127 if (fndstr) { 128 if (!eof) { 129 memmove(buf, &buf[bufc], i - bufc); | 132 if (i == buflen) { 133 if (fndstr) { 134 if (!eof) { 135 memmove(buf, &buf[bufc], i - bufc); |
130 i = i - bufc; | 136 i -= bufc; |
131 bufc = 0; 132 len = read(fd, &buf[i], buflen - i); 133 if (len == -1) 134 err(1, "read"); 135 else if (len == 0) { 136 eof++; 137 break; | 137 bufc = 0; 138 len = read(fd, &buf[i], buflen - i); 139 if (len == -1) 140 err(1, "read"); 141 else if (len == 0) { 142 eof++; 143 break; |
138 } else if (len < buflen -i ) 139 buflen = i + len; | 144 } else if (len < (ssize_t)(buflen - i)) 145 buflen = i + (size_t)len; |
140 | 146 |
141 bufleft = len; | 147 bufleft = (int)len; |
142 fndstr = 0; 143 } 144 } else { 145 p = (u_char *)realloc(buf, buflen * 2); 146 if (p == NULL) 147 err(1, "realloc"); 148 149 buf = p; 150 if (!eof) { 151 len = read(fd, &buf[i], buflen); 152 if (len == -1) 153 err(1, "read"); 154 else if (len == 0) { 155 eof++; 156 break; | 148 fndstr = 0; 149 } 150 } else { 151 p = (u_char *)realloc(buf, buflen * 2); 152 if (p == NULL) 153 err(1, "realloc"); 154 155 buf = p; 156 if (!eof) { 157 len = read(fd, &buf[i], buflen); 158 if (len == -1) 159 err(1, "read"); 160 else if (len == 0) { 161 eof++; 162 break; |
157 } else if (len < buflen -i ) 158 buflen = len; | 163 } else if (len < (ssize_t)(buflen - i)) 164 buflen = (size_t)len; |
159 | 165 |
160 bufleft = len; | 166 bufleft = (int)len; |
161 } 162 163 buflen *= 2; 164 } 165 } 166 167 if ((type == RANDOM_TYPE_LINES && buf[i] == '\n') || 168 (type == RANDOM_TYPE_WORDS && isspace((int)buf[i])) || 169 (eof && i == buflen - 1)) { | 167 } 168 169 buflen *= 2; 170 } 171 } 172 173 if ((type == RANDOM_TYPE_LINES && buf[i] == '\n') || 174 (type == RANDOM_TYPE_WORDS && isspace((int)buf[i])) || 175 (eof && i == buflen - 1)) { |
176 make_token: |
|
170 n = rand_node_allocate(); | 177 n = rand_node_allocate(); |
171 slen = i - bufc; 172 n->len = slen + 2; 173 n->cp = (u_char *)malloc(slen + 2); 174 if (n->cp == NULL) 175 err(1, "malloc"); | 178 if (-1 != (int)i) { 179 slen = i - (u_long)bufc; 180 n->len = slen + 2; 181 n->cp = (u_char *)malloc(slen + 2); 182 if (n->cp == NULL) 183 err(1, "malloc"); |
176 | 184 |
177 memmove(n->cp, &buf[bufc], slen); 178 n->cp[slen] = buf[i]; 179 n->cp[slen + 1] = '\0'; 180 bufc = i + 1; 181 fndstr = 1; | 185 memmove(n->cp, &buf[bufc], slen); 186 n->cp[slen] = buf[i]; 187 n->cp[slen + 1] = '\0'; 188 bufc = i + 1; 189 } |
182 rand_node_append(n); | 190 rand_node_append(n); |
191 fndstr = 1; |
|
183 numnode++; 184 } 185 } 186 } 187 188 (void)close(fd); 189 | 192 numnode++; 193 } 194 } 195 } 196 197 (void)close(fd); 198 |
199 /* Necessary evil to compensate for files that don't end with a newline */ 200 if (bufc != i) { 201 i--; 202 goto make_token; 203 } 204 |
|
190 for (i = numnode; i > 0; i--) { 191 selected = ((int)denom * random())/(((double)RAND_MAX + 1) / numnode); 192 193 for (j = 0, prev = n = rand_root; n != NULL; j++, prev = n, n = n->next) { 194 if (j == selected) { | 205 for (i = numnode; i > 0; i--) { 206 selected = ((int)denom * random())/(((double)RAND_MAX + 1) / numnode); 207 208 for (j = 0, prev = n = rand_root; n != NULL; j++, prev = n, n = n->next) { 209 if (j == selected) { |
195 ret = printf("%.*s", n->len - 1, n->cp); | 210 if (n->cp == NULL) 211 break; 212 213 ret = printf("%.*s", (int)n->len - 1, n->cp); |
196 if (ret < 0) 197 err(1, "printf"); 198 if (unique) { 199 if (n == rand_root) 200 rand_root = n->next; 201 if (n == rand_tail) 202 rand_tail = prev; 203 --- 16 unchanged lines hidden --- | 214 if (ret < 0) 215 err(1, "printf"); 216 if (unique) { 217 if (n == rand_root) 218 rand_root = n->next; 219 if (n == rand_tail) 220 rand_tail = prev; 221 --- 16 unchanged lines hidden --- |