Index: third_party/nspr/mozilla/nsprpub/lib/libc/src/plgetopt.c |
diff --git a/third_party/nspr/mozilla/nsprpub/lib/libc/src/plgetopt.c b/third_party/nspr/mozilla/nsprpub/lib/libc/src/plgetopt.c |
new file mode 100644 |
index 0000000000000000000000000000000000000000..0fe4fafe5ba008bda26aaf91ccc84a90ad5870b2 |
--- /dev/null |
+++ b/third_party/nspr/mozilla/nsprpub/lib/libc/src/plgetopt.c |
@@ -0,0 +1,254 @@ |
+/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */ |
+/* ***** BEGIN LICENSE BLOCK ***** |
+ * Version: MPL 1.1/GPL 2.0/LGPL 2.1 |
+ * |
+ * The contents of this file are subject to the Mozilla Public License Version |
+ * 1.1 (the "License"); you may not use this file except in compliance with |
+ * the License. You may obtain a copy of the License at |
+ * http://www.mozilla.org/MPL/ |
+ * |
+ * Software distributed under the License is distributed on an "AS IS" basis, |
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License |
+ * for the specific language governing rights and limitations under the |
+ * License. |
+ * |
+ * The Original Code is the Netscape Portable Runtime (NSPR). |
+ * |
+ * The Initial Developer of the Original Code is |
+ * Netscape Communications Corporation. |
+ * Portions created by the Initial Developer are Copyright (C) 1998-2000 |
+ * the Initial Developer. All Rights Reserved. |
+ * |
+ * Contributor(s): |
+ * |
+ * Alternatively, the contents of this file may be used under the terms of |
+ * either the GNU General Public License Version 2 or later (the "GPL"), or |
+ * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"), |
+ * in which case the provisions of the GPL or the LGPL are applicable instead |
+ * of those above. If you wish to allow use of your version of this file only |
+ * under the terms of either the GPL or the LGPL, and not to allow others to |
+ * use your version of this file under the terms of the MPL, indicate your |
+ * decision by deleting the provisions above and replace them with the notice |
+ * and other provisions required by the GPL or the LGPL. If you do not delete |
+ * the provisions above, a recipient may use your version of this file under |
+ * the terms of any one of the MPL, the GPL or the LGPL. |
+ * |
+ * ***** END LICENSE BLOCK ***** */ |
+ |
+/* |
+** File: plgetopt.c |
+** Description: utilities to parse argc/argv |
+*/ |
+ |
+#include "prmem.h" |
+#include "prlog.h" |
+#include "prerror.h" |
+#include "plstr.h" |
+#include "plgetopt.h" |
+ |
+#include <string.h> |
+ |
+static char static_Nul = 0; |
+ |
+struct PLOptionInternal |
+{ |
+ const char *options; /* client options list specification */ |
+ PRIntn argc; /* original number of arguments */ |
+ char **argv; /* vector of pointers to arguments */ |
+ PRIntn xargc; /* which one we're processing now */ |
+ const char *xargv; /* where within *argv[xargc] */ |
+ PRIntn minus; /* do we already have the '-'? */ |
+ const PLLongOpt *longOpts; /* Caller's array */ |
+ PRBool endOfOpts; /* have reached a "--" argument */ |
+ PRIntn optionsLen; /* is strlen(options) */ |
+}; |
+ |
+/* |
+** Create the state in which to parse the tokens. |
+** |
+** argc the sum of the number of options and their values |
+** argv the options and their values |
+** options vector of single character options w/ | w/o ': |
+*/ |
+PR_IMPLEMENT(PLOptState*) PL_CreateOptState( |
+ PRIntn argc, char **argv, const char *options) |
+{ |
+ return PL_CreateLongOptState( argc, argv, options, NULL); |
+} /* PL_CreateOptState */ |
+ |
+PR_IMPLEMENT(PLOptState*) PL_CreateLongOptState( |
+ PRIntn argc, char **argv, const char *options, |
+ const PLLongOpt *longOpts) |
+{ |
+ PLOptState *opt = NULL; |
+ PLOptionInternal *internal; |
+ |
+ if (NULL == options) |
+ { |
+ PR_SetError(PR_INVALID_ARGUMENT_ERROR, 0); |
+ return opt; |
+ } |
+ |
+ opt = PR_NEWZAP(PLOptState); |
+ if (NULL == opt) |
+ { |
+ PR_SetError(PR_OUT_OF_MEMORY_ERROR, 0); |
+ return opt; |
+ } |
+ |
+ internal = PR_NEW(PLOptionInternal); |
+ if (NULL == internal) |
+ { |
+ PR_DELETE(opt); |
+ PR_SetError(PR_OUT_OF_MEMORY_ERROR, 0); |
+ return NULL; |
+ } |
+ |
+ opt->option = 0; |
+ opt->value = NULL; |
+ opt->internal = internal; |
+ opt->longOption = 0; |
+ opt->longOptIndex = -1; |
+ |
+ internal->argc = argc; |
+ internal->argv = argv; |
+ internal->xargc = 0; |
+ internal->xargv = &static_Nul; |
+ internal->minus = 0; |
+ internal->options = options; |
+ internal->longOpts = longOpts; |
+ internal->endOfOpts = PR_FALSE; |
+ internal->optionsLen = PL_strlen(options); |
+ |
+ return opt; |
+} /* PL_CreateLongOptState */ |
+ |
+/* |
+** Destroy object created by CreateOptState() |
+*/ |
+PR_IMPLEMENT(void) PL_DestroyOptState(PLOptState *opt) |
+{ |
+ PR_DELETE(opt->internal); |
+ PR_DELETE(opt); |
+} /* PL_DestroyOptState */ |
+ |
+PR_IMPLEMENT(PLOptStatus) PL_GetNextOpt(PLOptState *opt) |
+{ |
+ PLOptionInternal *internal = opt->internal; |
+ |
+ opt->longOption = 0; |
+ opt->longOptIndex = -1; |
+ /* |
+ ** If the current xarg points to nul, advance to the next |
+ ** element of the argv vector. If the vector index is equal |
+ ** to argc, we're out of arguments, so return an EOL. |
+ ** Note whether the first character of the new argument is |
+ ** a '-' and skip by it if it is. |
+ */ |
+ while (0 == *internal->xargv) |
+ { |
+ internal->xargc += 1; |
+ if (internal->xargc >= internal->argc) |
+ { |
+ opt->option = 0; |
+ opt->value = NULL; |
+ return PL_OPT_EOL; |
+ } |
+ internal->xargv = internal->argv[internal->xargc]; |
+ internal->minus = 0; |
+ if (!internal->endOfOpts && ('-' == *internal->xargv)) |
+ { |
+ internal->minus++; |
+ internal->xargv++; /* and consume */ |
+ if ('-' == *internal->xargv && internal->longOpts) |
+ { |
+ internal->minus++; |
+ internal->xargv++; |
+ if (0 == *internal->xargv) |
+ { |
+ internal->endOfOpts = PR_TRUE; |
+ } |
+ } |
+ } |
+ } |
+ |
+ /* |
+ ** If we already have a '-' or '--' in hand, xargv points to the next |
+ ** option. See if we can find a match in the list of possible |
+ ** options supplied. |
+ */ |
+ |
+ if (internal->minus == 2) |
+ { |
+ char * foundEqual = strchr(internal->xargv,'='); |
+ PRIntn optNameLen = foundEqual ? (foundEqual - internal->xargv) : |
+ strlen(internal->xargv); |
+ const PLLongOpt *longOpt = internal->longOpts; |
+ |
+ opt->option = 0; |
+ opt->value = NULL; |
+ |
+ for (; longOpt->longOptName; ++longOpt) |
+ { |
+ if (strncmp(longOpt->longOptName, internal->xargv, optNameLen)) |
+ continue; /* not a possible match */ |
+ if (strlen(longOpt->longOptName) != optNameLen) |
+ continue; /* not a match */ |
+ /* option name match */ |
+ opt->longOptIndex = longOpt - internal->longOpts; |
+ opt->longOption = longOpt->longOption; |
+ if (foundEqual) |
+ { |
+ opt->value = foundEqual[1] ? foundEqual + 1 : NULL; |
+ } |
+ else if (longOpt->valueRequired) |
+ { |
+ opt->value = internal->argv[++(internal->xargc)]; |
+ } |
+ internal->xargv = &static_Nul; /* consume this */ |
+ return PL_OPT_OK; |
+ } |
+ internal->xargv = &static_Nul; /* consume this */ |
+ return PL_OPT_BAD; |
+ } |
+ if (internal->minus) |
+ { |
+ PRIntn cop; |
+ PRIntn eoo = internal->optionsLen; |
+ for (cop = 0; cop < eoo; ++cop) |
+ { |
+ if (internal->options[cop] == *internal->xargv) |
+ { |
+ opt->option = *internal->xargv++; |
+ opt->longOption = opt->option & 0xff; |
+ /* |
+ ** if options indicates that there's an associated |
+ ** value, this argv is finished and the next is the |
+ ** option's value. |
+ */ |
+ if (':' == internal->options[cop + 1]) |
+ { |
+ if (0 != *internal->xargv) |
+ return PL_OPT_BAD; |
+ opt->value = internal->argv[++(internal->xargc)]; |
+ internal->xargv = &static_Nul; |
+ internal->minus = 0; |
+ } |
+ else |
+ opt->value = NULL; |
+ return PL_OPT_OK; |
+ } |
+ } |
+ internal->xargv += 1; /* consume that option */ |
+ return PL_OPT_BAD; |
+ } |
+ /* |
+ ** No '-', so it must be a standalone value. The option is nul. |
+ */ |
+ opt->value = internal->argv[internal->xargc]; |
+ internal->xargv = &static_Nul; |
+ opt->option = 0; |
+ return PL_OPT_OK; |
+} /* PL_GetNextOpt */ |
+ |
+/* plgetopt.c */ |