/* * OpenPBS (Portable Batch System) v2.3 Software License * * Copyright (c) 1999-2010 Veridian Information Solutions, Inc. * All rights reserved. * * --------------------------------------------------------------------------- * For a license to use or redistribute the OpenPBS software under conditions * other than those described below, or to purchase support for this software, * please contact Veridian Systems, PBS Products Department ("Licensor") at: * * www.OpenPBS.org +1 650 967-4675 sales@OpenPBS.org * 877 902-4PBS (US toll-free) * --------------------------------------------------------------------------- * * This license covers use of the OpenPBS v2.3 software (the "Software") at * your site or location, and, for certain users, redistribution of the * Software to other sites and locations. Use and redistribution of * OpenPBS v2.3 in source and binary forms, with or without modification, * are permitted provided that all of the following conditions are met. * After December 31, 2001, only conditions 3-6 must be met: * * 1. Commercial and/or non-commercial use of the Software is permitted * provided a current software registration is on file at www.OpenPBS.org. * If use of this software contributes to a publication, product, or * service, proper attribution must be given; see www.OpenPBS.org/credit.html * * 2. Redistribution in any form is only permitted for non-commercial, * non-profit purposes. There can be no charge for the Software or any * software incorporating the Software. Further, there can be no * expectation of revenue generated as a consequence of redistributing * the Software. * * 3. Any Redistribution of source code must retain the above copyright notice * and the acknowledgment contained in paragraph 6, this list of conditions * and the disclaimer contained in paragraph 7. * * 4. Any Redistribution in binary form must reproduce the above copyright * notice and the acknowledgment contained in paragraph 6, this list of * conditions and the disclaimer contained in paragraph 7 in the * documentation and/or other materials provided with the distribution. * * 5. Redistributions in any form must be accompanied by information on how to * obtain complete source code for the OpenPBS software and any * modifications and/or additions to the OpenPBS software. The source code * must either be included in the distribution or be available for no more * than the cost of distribution plus a nominal fee, and all modifications * and additions to the Software must be freely redistributable by any party * (including Licensor) without restriction. * * 6. All advertising materials mentioning features or use of the Software must * display the following acknowledgment: * * "This product includes software developed by NASA Ames Research Center, * Lawrence Livermore National Laboratory, and Veridian Information * Solutions, Inc. * Visit www.OpenPBS.org for OpenPBS software support, * products, and information." * * 7. DISCLAIMER OF WARRANTY * * THIS SOFTWARE IS PROVIDED "AS IS" WITHOUT WARRANTY OF ANY KIND. ANY EXPRESS * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND NON-INFRINGEMENT * ARE EXPRESSLY DISCLAIMED. * * IN NO EVENT SHALL VERIDIAN CORPORATION, ITS AFFILIATED COMPANIES, OR THE * U.S. GOVERNMENT OR ANY OF ITS AGENCIES BE LIABLE FOR ANY DIRECT OR 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. * * This license will be governed by the laws of the Commonwealth of Virginia, * without reference to its choice of law rules. */ #include #include "utils.h" #include "../Liblog/pbs_log.h" /** * gets the parent and the child from an xml string * also updates end to be the first character after * the parent's closing tag * string must have .*?.*?.*? * * @param start - the start of the string to examine * @param parent - where to store the parent's name (without '<>') * @param child - where to store the child data, trims whitespace * @param end - pointer to the first character after the closing tag */ int get_parent_and_child( char *start, /* I */ char **parent, /* O */ char **child, /* O */ char **end) /* O */ { char *ptr = strchr(start,'<'); char closingTag[MAXLINE]; int parent_len = 0; char *child_start; char *child_end; int reached_space = FALSE; if (ptr == NULL) { log_err(-1, __func__ ,"No parent tag found\n"); return(-1); } /*advance past the '<' */ ptr++; *parent = ptr; /* copy the parent name and create the closing tag */ sprintf(closingTag,"') { if (*ptr == ' ') { reached_space = TRUE; *ptr = '\0'; } else if (reached_space == FALSE) { closingTag[parent_len+2] = *ptr; parent_len++; } if(*ptr == '\0') { log_err(-1,__func__,"Invalid xml\n"); return(-1); } /* if attribute support becomes needed, start recording attribute strings * in an else here */ ptr++; } *ptr = '\0'; /* NULL terminate the string */ closingTag[parent_len+2] = '\0'; /* advance past the '>' */ ptr++; /* mark where the child begins */ child_start = ptr; child_end = strstr(ptr,closingTag); if (child_end == NULL) { log_err(-1, __func__, "Cannot find closing tag\n"); return(-1); } /* move behind the '<' */ *end = child_end; /* NULL terminate the string */ *child_end = '\0'; /* move behind it to check for whitespace */ child_end--; /* trim whitespace on start/end of child */ while (is_whitespace(*child_start)) child_start++; while (is_whitespace(*child_end)) { /* terminate the string earlier */ *child_end = '\0'; child_end--; } *child = child_start; /* last, advance the end pointer to the end of the closing tag */ while (**end != '>') (*end)++; /* move past the '>' */ (*end)++; return(0); } /* END get_parent_and_child() */ /* * iterates over in and writes it to out, escaping restricted xml characters * as it goes * * @param in - the input string * @param out - the output string * @param size - the max size that can be written to out * @return PBSE_NONE on success, nonzero otherwise */ int escape_xml( char *in, /* I */ char *out, /* O */ int size) /* I */ { int i; int final_len = 0; int len; if (in == NULL) { return(BUFFER_OVERFLOW); } if (out == NULL) { return(BUFFER_OVERFLOW); } len = strlen(in); for (i = 0; i < len; i++) { switch (in[i]) { case '<': if (size - final_len < LT_ESCAPED_LEN) return(BUFFER_OVERFLOW); else { strcpy(out+final_len,LT_ESCAPED); final_len += LT_ESCAPED_LEN; } break; case '>': if (size - final_len < GT_ESCAPED_LEN) return(BUFFER_OVERFLOW); else { strcpy(out+final_len,GT_ESCAPED); final_len += GT_ESCAPED_LEN; } break; case '&': if (size - final_len < AMP_ESCAPED_LEN) return(BUFFER_OVERFLOW); else { strcpy(out+final_len,AMP_ESCAPED); final_len += AMP_ESCAPED_LEN; } break; case '"': if (size - final_len < QUOT_ESCAPED_LEN) return(BUFFER_OVERFLOW); else { strcpy(out+final_len,QUOT_ESCAPED); final_len += QUOT_ESCAPED_LEN; } break; case '\'': if (size - final_len < APOS_ESCAPED_LEN) return(BUFFER_OVERFLOW); else { strcpy(out+final_len,APOS_ESCAPED); final_len += APOS_ESCAPED_LEN; } break; default: if (size <= final_len) return(BUFFER_OVERFLOW); else { out[final_len++] = in[i]; } } } out[final_len] = '\0'; return(PBSE_NONE); } /* END escape_xml() */ char *find_next_tag( char *buffer, char **tag) { char *ptr; ptr = buffer; if (ptr == NULL) { return(NULL); } /* We want the next tag. If we are currently pointing to a tag increment ptr*/ if (*ptr == '<') { ptr++; } while ((*ptr != '<') && (ptr[1] != '/')) { ptr++; } *tag = ptr; return(*tag); } /* * reads an xml string and translates it to regular characters * * @param in - the xml string * @param out - the raw characters * @param size - the max size out can be * @return PBSE_NONE on success */ int unescape_xml( char *in, /* I */ char *out, /* O */ int size) /* I */ { int i = 0; int final_len = 0; int len = strlen(in); while ((i < len) && (final_len < size)) { if (strncmp(in+i,LT_ESCAPED,LT_ESCAPED_LEN) == 0) { out[final_len] = '<'; i += LT_ESCAPED_LEN; } else if (strncmp(in+i,GT_ESCAPED,GT_ESCAPED_LEN) == 0) { out[final_len] = '>'; i += GT_ESCAPED_LEN; } else if (strncmp(in+i,QUOT_ESCAPED,QUOT_ESCAPED_LEN) == 0) { out[final_len] = '"'; i += QUOT_ESCAPED_LEN; } else if (strncmp(in+i,APOS_ESCAPED,APOS_ESCAPED_LEN) == 0) { out[final_len] = '\''; i += APOS_ESCAPED_LEN; } else if (strncmp(in+i,AMP_ESCAPED,AMP_ESCAPED_LEN) == 0) { out[final_len] = '&'; i += AMP_ESCAPED_LEN; } else { out[final_len] = in[i]; i++; } final_len++; } if (final_len < size) out[final_len] = '\0'; else out[size-1] = '\0'; /* check if we didn't finish reading the string */ if (i < len) return(BUFFER_OVERFLOW); return(PBSE_NONE); } /* END unescape_xml() */