/* ==================================================================== * Copyright (c) 1999-2001 Carnegie Mellon University. All rights * reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in * the documentation and/or other materials provided with the * distribution. * * This work was supported in part by funding from the Defense Advanced * Research Projects Agency and the National Science Foundation of the * United States of America, and the CMU Sphinx Speech Consortium. * * THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * ==================================================================== * */ /* * str2words.c -- Convert a string to an array of words * HISTORY * * 21-Oct-95 M K Ravishankar (rkm@cs.cmu.edu) at Carnegie Mellon University. * Created. */ #include #include #include #include #include #include "s2types.h" #include "str2words.h" #include "err.h" int32 str2words (char *line, char **ptr, int32 max_ptr) { int32 i, n; n = 0; /* #words found so far */ i = 0; /* For scanning through the input string */ for (;;) { /* Skip whitespace before next word */ for (; line[i] && (isspace(line[i])); i++); if (! line[i]) break; if (n >= max_ptr) { /* * Pointer array size insufficient. Restore NULL chars inserted so far * to space chars. Not a perfect restoration, but better than nothing. */ for (; i >= 0; --i) if (line[i] == '\0') line[i] = ' '; return -1; } /* Scan to end of word */ ptr[n++] = line+i; for (; line[i] && (! isspace(line[i])); i++); if (! line[i]) break; line[i++] = '\0'; } return n; }