/** --- BEGIN COPYRIGHT BLOCK --- * This Program is free software; you can redistribute it and/or modify it under * the terms of the GNU General Public License as published by the Free Software * Foundation; version 2 of the License. * * This Program is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. * * You should have received a copy of the GNU General Public License along with * this Program; if not, write to the Free Software Foundation, Inc., 59 Temple * Place, Suite 330, Boston, MA 02111-1307 USA. * * In addition, as a special exception, Red Hat, Inc. gives You the additional * right to link the code of this Program with code not covered under the GNU * General Public License ("Non-GPL Code") and to distribute linked combinations * including the two, subject to the limitations in this paragraph. Non-GPL Code * permitted under this exception must only link to the code of this Program * through those well defined interfaces identified in the file named EXCEPTION * found in the source code files (the "Approved Interfaces"). The files of * Non-GPL Code may instantiate templates or use macros or inline functions from * the Approved Interfaces without causing the resulting work to be covered by * the GNU General Public License. Only Red Hat, Inc. may make changes or * additions to the list of Approved Interfaces. You must obey the GNU General * Public License in all respects for all of the Program code and other code used * in conjunction with the Program except the Non-GPL Code covered by this * exception. If you modify this file, you may extend this exception to your * version of the file, but you are not obligated to do so. If you do not wish to * provide this exception without modification, you must delete this exception * statement from your version and license this file solely under the GPL without * exception. * * * Copyright (C) 2001 Sun Microsystems, Inc. Used by permission. * Copyright (C) 2005 Red Hat, Inc. * All rights reserved. --- END COPYRIGHT BLOCK --- */ /* DON'T SHIP THIS PROGRAM. It's terribly un-secure, as it enables an HTTP client to read the contents of any file. */ /* This is a Gateway CGI program, for testing collation. It reads the text file named by $PATH_INFO and outputs its lines, sorted, in a table with the script and collation key computed by dsgw_strkeygen. The locale is controlled by the Accept-Language header in the HTTP request, like any Gateway CGI. */ #include #include /* fopen, fgets, perror */ #include /* getenv, qsort */ #include "dsgw.h" static const char* fgetln(FILE* f, int* error) { auto size_t buflen = 128; auto char* buf = dsgw_ch_malloc (buflen); *buf = '\0'; while (fgets (buf, buflen, f)) { auto const size_t read = strlen(buf); if (buf[read-1] == '\n') { buf[read-1] = '\0'; return buf; } buflen *= 2; buf = dsgw_ch_realloc (buf, buflen); } if (feof(f) && *buf) return buf; free (buf); return NULL; } typedef struct keystring { const char* ks_val; struct berval* ks_key; } keystring_t; static int keystring_cmp (const void* Lv, const void* Rv) { auto const keystring_t** L = (const keystring_t**)Lv; auto const keystring_t** R = (const keystring_t**)Rv; return dsgw_keycmp (NULL, (*L)->ks_key, (*R)->ks_key); } int main( int argc, char* argv[] ) { auto int error = 0; auto const int reqmethod = dsgw_init (argc, argv, DSGW_METHOD_GET); auto char* fname = getenv ("PATH_INFO"); dsgw_send_header(); dsgw_emits ("\n"); dsgw_head_begin(); dsgw_emits ("\n\n\n"); if (!fname) { dsgw_emits ("!PATH_INFO\n"); error = 1; } else { auto FILE* f = fopen (fname, "r"); if (!f) { dsgw_emitf ("%s: errno %i\n", fname, errno); error = 2; } else { auto const char* line; auto keystring_t* v = NULL; auto size_t vlen = 0; while (line = fgetln(f, &error)) { v = (keystring_t*) dsgw_ch_realloc (v, (vlen+1) * sizeof(keystring_t)); v[vlen].ks_val = line; v[vlen].ks_key = dsgw_strkeygen (CASE_INSENSITIVE, line); ++vlen; } fclose (f); if (vlen) { auto keystring_t** vp; auto size_t i; vp = (keystring_t**) dsgw_ch_malloc (vlen * sizeof(keystring_t*)); for (i = 0; i < vlen; ++i) { vp[i] = v + i; } qsort (vp, vlen, sizeof(keystring_t*), keystring_cmp); dsgw_emits ("\n"); dsgw_emits (" " "" "" "" "" "" "\n"); for (i = 0; i < vlen; ++i) { auto size_t j; dsgw_emits (" "); dsgw_emitf ("", 1 + (unsigned long)(vp[i]-v)); dsgw_emitf ("", vp[i]->ks_val); dsgw_emits (""); dsgw_emitf ("", (unsigned long)(vp[i]->ks_key->bv_len) - 2); dsgw_emits (""); dsgw_emits ("\n"); } dsgw_emits ("

" DSGW_UTF8_NBSP "	line	script	" DSGW_UTF8_NBSP "	Sort Key
%lu:	%s	"); if (vp[i]->ks_key->bv_len) { dsgw_emitf ("%u", 0xFF & (unsigned)(vp[i]->ks_key->bv_val[0])); } else { dsgw_emits (DSGW_UTF8_NBSP); } dsgw_emits ("	%lu:	"); for (j = 1; j < vp[i]->ks_key->bv_len - 1; ++j) { dsgw_emitf ("%02x", 0xFF & (unsigned)(vp[i]->ks_key->bv_val[j])); } dsgw_emits ("

\n"); free (vp); for (i = 0; i < vlen; ++i) { dsgw_keyfree (NULL, v[i].ks_key); } free (v); } } } dsgw_emits ("\n"); return error; }