1 /* $NetBSD: init.c,v 1.4 2001/01/12 19:30:22 jdolecek Exp $ */ 2 3 /*- 4 * Copyright (c) 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * Peter McIlroy. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 */ 38 39 #include "sort.h" 40 41 #ifndef lint 42 __RCSID("$NetBSD: init.c,v 1.4 2001/01/12 19:30:22 jdolecek Exp $"); 43 __SCCSID("@(#)init.c 8.1 (Berkeley) 6/6/93"); 44 #endif /* not lint */ 45 46 #include <ctype.h> 47 #include <string.h> 48 49 static void insertcol __P((struct field *)); 50 static const char *setcolumn __P((const char *, struct field *, int)); 51 int setfield __P((const char *, struct field *, int)); 52 53 extern struct coldesc clist[(ND+1)*2]; 54 extern int ncols; 55 u_char gweights[NBINS]; 56 57 /* 58 * masks of ignored characters. Alltable is 256 ones. 59 */ 60 static u_char alltable[NBINS], dtable[NBINS], itable[NBINS]; 61 62 /* 63 * clist (list of columns which correspond to one or more icol or tcol) 64 * is in increasing order of columns. 65 * Fields are kept in increasing order of fields. 66 */ 67 68 /* 69 * keep clist in order--inserts a column in a sorted array 70 */ 71 static void 72 insertcol(field) 73 struct field *field; 74 { 75 int i; 76 for (i = 0; i < ncols; i++) 77 if (field->icol.num <= clist[i].num) 78 break; 79 if (field->icol.num != clist[i].num) { 80 memmove(clist+i+1, clist+i, sizeof(COLDESC)*(ncols-i)); 81 clist[i].num = field->icol.num; 82 ncols++; 83 } 84 if (field->tcol.num && field->tcol.num != field->icol.num) { 85 for (i = 0; i < ncols; i++) 86 if (field->tcol.num <= clist[i].num) 87 break; 88 if (field->tcol.num != clist[i].num) { 89 memmove(clist+i+1, clist+i,sizeof(COLDESC)*(ncols-i)); 90 clist[i].num = field->tcol.num; 91 ncols++; 92 } 93 } 94 } 95 96 /* 97 * matches fields with the appropriate columns--n^2 but who cares? 98 */ 99 void 100 fldreset(fldtab) 101 struct field *fldtab; 102 { 103 int i; 104 fldtab[0].tcol.p = clist+ncols-1; 105 for (++fldtab; fldtab->icol.num; ++fldtab) { 106 for (i = 0; fldtab->icol.num != clist[i].num; i++); 107 fldtab->icol.p = clist + i; 108 if (!fldtab->tcol.num) 109 continue; 110 for (i = 0; fldtab->tcol.num != clist[i].num; i++); 111 fldtab->tcol.p = clist + i; 112 } 113 } 114 115 /* 116 * interprets a column in a -k field 117 */ 118 static const char * 119 setcolumn(pos, cur_fld, gflag) 120 const char *pos; 121 struct field *cur_fld; 122 int gflag; 123 { 124 struct column *col; 125 int tmp; 126 col = cur_fld->icol.num ? (&(*cur_fld).tcol) : (&(*cur_fld).icol); 127 pos += sscanf(pos, "%d", &(col->num)); 128 while (isdigit(*pos)) 129 pos++; 130 if (col->num <= 0 && !(col->num == 0 && col == &(cur_fld->tcol))) 131 errx(2, "field numbers must be positive"); 132 if (*pos == '.') { 133 if (!col->num) 134 errx(2, "cannot indent end of line"); 135 pos += sscanf(++pos, "%d", &(col->indent)); 136 while (isdigit(*pos)) 137 pos++; 138 if (&cur_fld->icol == col) 139 col->indent--; 140 if (col->indent < 0) 141 errx(2, "illegal offset"); 142 } 143 if (optval(*pos, cur_fld->tcol.num)) 144 while ((tmp = optval(*pos, cur_fld->tcol.num))) { 145 cur_fld->flags |= tmp; 146 pos++; 147 } 148 if (cur_fld->icol.num == 0) 149 cur_fld->icol.num = 1; 150 return (pos); 151 } 152 153 int 154 setfield(pos, cur_fld, gflag) 155 const char *pos; 156 struct field *cur_fld; 157 int gflag; 158 { 159 static int nfields = 0; 160 int tmp; 161 162 if (++nfields == ND) 163 errx(2, "too many sort keys. (Limit is %d)", ND-1); 164 165 cur_fld->weights = ascii; 166 cur_fld->mask = alltable; 167 168 pos = setcolumn(pos, cur_fld, gflag); 169 if (*pos == '\0') /* key extends to EOL. */ 170 cur_fld->tcol.num = 0; 171 else { 172 if (*pos != ',') 173 errx(2, "illegal field descriptor"); 174 setcolumn((++pos), cur_fld, gflag); 175 } 176 if (!cur_fld->flags) 177 cur_fld->flags = gflag; 178 tmp = cur_fld->flags; 179 180 /* 181 * Assign appropriate mask table and weight table. 182 * If the global weights are reversed, the local field 183 * must be "re-reversed". 184 */ 185 if (((tmp & R) ^ (gflag & R)) && (tmp & F)) 186 cur_fld->weights = RFtable; 187 else if (tmp & F) 188 cur_fld->weights = Ftable; 189 else if ((tmp & R) ^ (gflag & R)) 190 cur_fld->weights = Rascii; 191 192 if (tmp & I) 193 cur_fld->mask = itable; 194 else if (tmp & D) 195 cur_fld->mask = dtable; 196 197 cur_fld->flags |= (gflag & (BI | BT)); 198 if (!cur_fld->tcol.indent) /* BT has no meaning at end of field */ 199 cur_fld->flags &= ~BT; 200 201 if (cur_fld->tcol.num && !(!(cur_fld->flags & BI) 202 && cur_fld->flags & BT) && (cur_fld->tcol.num <= cur_fld->icol.num 203 && cur_fld->tcol.indent < cur_fld->icol.indent)) 204 errx(2, "fields out of order"); 205 insertcol(cur_fld); 206 return (cur_fld->tcol.num); 207 } 208 209 int 210 optval(desc, tcolflag) 211 int desc, tcolflag; 212 { 213 switch(desc) { 214 case 'b': 215 if (!tcolflag) 216 return(BI); 217 else 218 return(BT); 219 case 'd': return(D); 220 case 'f': return(F); 221 case 'i': return(I); 222 case 'n': return(N); 223 case 'r': return(R); 224 default: return(0); 225 } 226 } 227 228 void 229 fixit(argc, argv) 230 int *argc; 231 char **argv; 232 { 233 int i, j, v, w, x; 234 static char vbuf[ND*20], *vpos, *tpos; 235 vpos = vbuf; 236 237 for (i = 1; i < *argc; i++) { 238 if (argv[i][0] == '+') { 239 tpos = argv[i]+1; 240 argv[i] = vpos; 241 vpos += sprintf(vpos, "-k"); 242 tpos += sscanf(tpos, "%d", &v); 243 while (isdigit(*tpos)) 244 tpos++; 245 vpos += sprintf(vpos, "%d", v+1); 246 if (*tpos == '.') { 247 tpos += sscanf(++tpos, "%d", &x); 248 vpos += sprintf(vpos, ".%d", x+1); 249 } 250 while (*tpos) 251 *vpos++ = *tpos++; 252 vpos += sprintf(vpos, ","); 253 if (argv[i+1] && 254 argv[i+1][0] == '-' && isdigit(argv[i+1][1])) { 255 tpos = argv[i+1] + 1; 256 tpos += sscanf(tpos, "%d", &w); 257 while (isdigit(*tpos)) 258 tpos++; 259 x = 0; 260 if (*tpos == '.') { 261 tpos += sscanf(++tpos, "%d", &x); 262 while (isdigit(*tpos)) 263 tpos++; 264 } 265 if (x) { 266 vpos += sprintf(vpos, "%d", w+1); 267 vpos += sprintf(vpos, ".%d", x); 268 } else 269 vpos += sprintf(vpos, "%d", w); 270 while (*tpos) 271 *vpos++ = *tpos++; 272 for (j= i+1; j < *argc; j++) 273 argv[j] = argv[j+1]; 274 *argc -= 1; 275 } 276 } 277 } 278 } 279 280 /* 281 * ascii, Rascii, Ftable, and RFtable map 282 * REC_D -> REC_D; {not REC_D} -> {not REC_D}. 283 * gweights maps REC_D -> (0 or 255); {not REC_D} -> {not gweights[REC_D]}. 284 * Note: when sorting in forward order, to encode character zero in a key, 285 * use \001\001; character 1 becomes \001\002. In this case, character 0 286 * is reserved for the field delimiter. Analagously for -r (fld_d = 255). 287 * Note: this is only good for ASCII sorting. For different LC 's, 288 * all bets are off. See also num_init in number.c 289 */ 290 void 291 settables(gflags) 292 int gflags; 293 { 294 u_char *wts; 295 int i, incr; 296 for (i=0; i < 256; i++) { 297 ascii[i] = i; 298 if (i > REC_D && i < 255 - REC_D+1) 299 Rascii[i] = 255 - i + 1; 300 else 301 Rascii[i] = 255 - i; 302 if (islower(i)) { 303 Ftable[i] = Ftable[toupper(i)]; 304 RFtable[i] = RFtable[toupper(i)]; 305 } else if (REC_D>= 'A' && REC_D < 'Z' && i < 'a' && i > REC_D) { 306 Ftable[i] = i + 1; 307 RFtable[i] = Rascii[i] - 1; 308 } else { 309 Ftable[i] = i; 310 RFtable[i] = Rascii[i]; 311 } 312 alltable[i] = 1; 313 314 if (i == '\n' || isprint(i)) 315 itable[i] = 1; 316 else 317 itable[i] = 0; 318 319 if (i == '\n' || i == '\t' || i == ' ' || isalnum(i)) 320 dtable[i] = 1; 321 else 322 dtable[i] = 0; 323 } 324 325 Rascii[REC_D] = RFtable[REC_D] = REC_D; 326 if (isupper(REC_D)) 327 Ftable[tolower(REC_D)]++; 328 329 if ((gflags & R) && !((gflags & F) && SINGL_FLD)) 330 wts = Rascii; 331 else if (!((gflags & F) && SINGL_FLD)) 332 wts = ascii; 333 else if (gflags & R) 334 wts = RFtable; 335 else 336 wts = Ftable; 337 338 memmove(gweights, wts, sizeof(gweights)); 339 incr = (gflags & R) ? -1 : 1; 340 for (i = 0; i < REC_D; i++) 341 gweights[i] += incr; 342 gweights[REC_D] = ((gflags & R) ? 255 : 0); 343 if (SINGL_FLD && (gflags & F)) { 344 for (i = 0; i < REC_D; i++) { 345 ascii[i] += incr; 346 Rascii[i] += incr; 347 } 348 ascii[REC_D] = Rascii[REC_D] = gweights[REC_D]; 349 } 350 } 351