1da2e3ebdSchin /*********************************************************************** 2da2e3ebdSchin * * 3da2e3ebdSchin * This software is part of the ast package * 4*b30d1939SAndy Fiddaman * Copyright (c) 1985-2011 AT&T Intellectual Property * 5da2e3ebdSchin * and is licensed under the * 6*b30d1939SAndy Fiddaman * Eclipse Public License, Version 1.0 * 77c2fbfb3SApril Chin * by AT&T Intellectual Property * 8da2e3ebdSchin * * 9da2e3ebdSchin * A copy of the License is available at * 10*b30d1939SAndy Fiddaman * http://www.eclipse.org/org/documents/epl-v10.html * 11*b30d1939SAndy Fiddaman * (with md5 checksum b35adb5213ca9657e911e9befb180842) * 12da2e3ebdSchin * * 13da2e3ebdSchin * Information and Software Systems Research * 14da2e3ebdSchin * AT&T Research * 15da2e3ebdSchin * Florham Park NJ * 16da2e3ebdSchin * * 17da2e3ebdSchin * Glenn Fowler <gsf@research.att.com> * 18da2e3ebdSchin * David Korn <dgk@research.att.com> * 19da2e3ebdSchin * Phong Vo <kpv@research.att.com> * 20da2e3ebdSchin * * 21da2e3ebdSchin ***********************************************************************/ 22da2e3ebdSchin #pragma prototyped 23da2e3ebdSchin /* 24da2e3ebdSchin * strsort - sort an array pointers using fn 25da2e3ebdSchin * 26da2e3ebdSchin * fn follows strcmp(3) conventions 27da2e3ebdSchin * 28da2e3ebdSchin * David Korn 29da2e3ebdSchin * AT&T Bell Laboratories 30da2e3ebdSchin * 31da2e3ebdSchin * derived from Bourne Shell 32da2e3ebdSchin */ 33da2e3ebdSchin 34da2e3ebdSchin #include <ast.h> 35da2e3ebdSchin 36da2e3ebdSchin void strsort(char ** argv,int n,int (* fn)(const char *,const char *))37da2e3ebdSchinstrsort(char** argv, int n, int(*fn)(const char*, const char*)) 38da2e3ebdSchin { 39da2e3ebdSchin register int i; 40da2e3ebdSchin register int j; 41da2e3ebdSchin register int m; 42da2e3ebdSchin register char** ap; 43da2e3ebdSchin char* s; 44da2e3ebdSchin int k; 45da2e3ebdSchin 46da2e3ebdSchin for (j = 1; j <= n; j *= 2); 47da2e3ebdSchin for (m = 2 * j - 1; m /= 2;) 48da2e3ebdSchin for (j = 0, k = n - m; j < k; j++) 49da2e3ebdSchin for (i = j; i >= 0; i -= m) 50da2e3ebdSchin { 51da2e3ebdSchin ap = &argv[i]; 52da2e3ebdSchin if ((*fn)(ap[m], ap[0]) >= 0) break; 53da2e3ebdSchin s = ap[m]; 54da2e3ebdSchin ap[m] = ap[0]; 55da2e3ebdSchin ap[0] = s; 56da2e3ebdSchin } 57da2e3ebdSchin } 58