PHP 7.4.33
Preview: plural-exp.c Size: 3.79 KB
/home/godevadmin/public_html/upload_images/home/000~ROOT~000/usr/share/gettext/intl/plural-exp.c

/* Expression parsing for plural form selection.
   Copyright (C) 2000-2016 Free Software Foundation, Inc.
   Written by Ulrich Drepper <[email protected]>, 2000.

   This program is free software: you can redistribute it and/or modify
   it under the terms of the GNU Lesser General Public License as published by
   the Free Software Foundation; either version 2.1 of the License, or
   (at your option) any later version.

   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 Lesser General Public License for more details.

   You should have received a copy of the GNU Lesser General Public License
   along with this program.  If not, see <http://www.gnu.org/licenses/>.  */

#ifdef HAVE_CONFIG_H
# include <config.h>
#endif

#include <ctype.h>
#include <stdlib.h>
#include <string.h>

#include "plural-exp.h"

#if HAVE_STRUCT_INITIALIZER

/* These structs are the constant expression for the germanic plural
   form determination.  It represents the expression  "n != 1".  */
static const struct expression plvar =
{
  .nargs = 0,
  .operation = var,
};
static const struct expression plone =
{
  .nargs = 0,
  .operation = num,
  .val =
  {
    .num = 1
  }
};
const struct expression GERMANIC_PLURAL =
{
  .nargs = 2,
  .operation = not_equal,
  .val =
  {
    .args =
    {
      [0] = (struct expression *) &plvar,
      [1] = (struct expression *) &plone
    }
  }
};

# define INIT_GERMANIC_PLURAL()

#else

/* For compilers without support for ISO C 99 struct/union initializers:
   Initialization at run-time.  */

static struct expression plvar;
static struct expression plone;
struct expression GERMANIC_PLURAL;

static void
init_germanic_plural (void)
{
  if (plone.val.num == 0)
    {
      plvar.nargs = 0;
      plvar.operation = var;

      plone.nargs = 0;
      plone.operation = num;
      plone.val.num = 1;

      GERMANIC_PLURAL.nargs = 2;
      GERMANIC_PLURAL.operation = not_equal;
      GERMANIC_PLURAL.val.args[0] = &plvar;
      GERMANIC_PLURAL.val.args[1] = &plone;
    }
}

# define INIT_GERMANIC_PLURAL() init_germanic_plural ()

#endif

void
internal_function
EXTRACT_PLURAL_EXPRESSION (const char *nullentry,
			   const struct expression **pluralp,
			   unsigned long int *npluralsp)
{
  if (nullentry != NULL)
    {
      const char *plural;
      const char *nplurals;

      plural = strstr (nullentry, "plural=");
      nplurals = strstr (nullentry, "nplurals=");
      if (plural == NULL || nplurals == NULL)
	goto no_plural;
      else
	{
	  char *endp;
	  unsigned long int n;
	  struct parse_args args;

	  /* First get the number.  */
	  nplurals += 9;
	  while (*nplurals != '\0' && isspace ((unsigned char) *nplurals))
	    ++nplurals;
	  if (!(*nplurals >= '0' && *nplurals <= '9'))
	    goto no_plural;
#if defined HAVE_STRTOUL || defined _LIBC
	  n = strtoul (nplurals, &endp, 10);
#else
	  for (endp = nplurals, n = 0; *endp >= '0' && *endp <= '9'; endp++)
	    n = n * 10 + (*endp - '0');
#endif
	  if (nplurals == endp)
	    goto no_plural;
	  *npluralsp = n;

	  /* Due to the restrictions bison imposes onto the interface of the
	     scanner function we have to put the input string and the result
	     passed up from the parser into the same structure which address
	     is passed down to the parser.  */
	  plural += 7;
	  args.cp = plural;
	  if (PLURAL_PARSE (&args) != 0)
	    goto no_plural;
	  *pluralp = args.res;
	}
    }
  else
    {
      /* By default we are using the Germanic form: singular form only
         for `one', the plural form otherwise.  Yes, this is also what
         English is using since English is a Germanic language.  */
    no_plural:
      INIT_GERMANIC_PLURAL ();
      *pluralp = &GERMANIC_PLURAL;
      *npluralsp = 2;
    }
}

Directory Contents

Dirs: 0 × Files: 65

Name Size Perms Modified Actions
9.33 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
22.50 KB lrwxr-xr-x 2015-01-24 07:21:24
Edit Download
25.92 KB lrw-r--r-- 2014-12-13 03:48:16
Edit Download
1.71 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
46.49 KB lrw-r--r-- 2016-05-28 00:28:55
Edit Download
1.74 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
1.67 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
1.78 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
2.67 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
3.26 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
157 B lrw-r--r-- 2014-12-11 13:11:46
Edit Download
5.86 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
1.78 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
9.95 KB lrw-r--r-- 2016-05-28 00:28:55
Edit Download
4.74 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
1.51 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
1.28 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
3.37 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
1.73 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
10.64 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
12.42 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
16.40 KB lrw-r--r-- 2016-06-09 22:56:00
Edit Download
1.58 KB lrw-r--r-- 2014-12-11 13:02:40
Edit Download
4.99 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
33.73 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
20.04 KB lrw-r--r-- 2015-01-24 07:21:24
Edit Download
1.31 KB lrw-r--r-- 2015-06-05 21:52:52
Edit Download
3.01 KB lrw-r--r-- 2015-06-23 12:09:37
Edit Download
10.39 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
84.12 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
26.16 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
35.46 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
3.76 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
24.53 KB lrw-r--r-- 2016-06-11 07:37:41
Edit Download
1.86 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
2.77 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
1.47 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
988 B lrw-r--r-- 2016-03-20 07:37:53
Edit Download
3.79 KB lrw-r--r-- 2016-05-28 00:29:03
Edit Download
4.54 KB lrw-r--r-- 2016-05-28 00:29:03
Edit Download
52.03 KB lrw-r--r-- 2016-06-11 13:02:54
Edit Download
7.34 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
6.43 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
3.88 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
21.67 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
2.53 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
10.09 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
1.02 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
996 B lrw-r--r-- 2016-03-20 07:37:53
Edit Download
17.09 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
3.07 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
32.34 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
3.72 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
1.89 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
20.98 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
2.75 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
218.10 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
2.74 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
1.64 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
10.76 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
42 B lrw-r--r-- 2019-11-18 17:16:47
Edit Download
935 B lrw-r--r-- 2016-03-20 07:37:53
Edit Download
2.58 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download
78 B lrw-r--r-- 2014-12-11 13:11:46
Edit Download
3.57 KB lrw-r--r-- 2016-03-20 07:37:53
Edit Download

If ZipArchive is unavailable, a .tar will be created (no compression).