drakx - Mageia Installer and base platform for many utilities

diff options

author	Thierry Vignaud <tv@mageia.org>	2011-05-19 00:54:08 +0000
committer	Thierry Vignaud <tv@mageia.org>	2011-05-19 00:54:08 +0000
commit	1bb9d79eeba5d00b0815d0664bc0ac4b47a596f8 (patch)
tree	1365582e5d77cd062d6f3cff29ef79ca8ea73dbf /perl-install/install/share/po/sc.po
parent	a8bcda629a72d50fc86c754850281bd6b8737cb7 (diff)
download	drakx-1bb9d79eeba5d00b0815d0664bc0ac4b47a596f8.tar drakx-1bb9d79eeba5d00b0815d0664bc0ac4b47a596f8.tar.gz drakx-1bb9d79eeba5d00b0815d0664bc0ac4b47a596f8.tar.bz2 drakx-1bb9d79eeba5d00b0815d0664bc0ac4b47a596f8.tar.xz drakx-1bb9d79eeba5d00b0815d0664bc0ac4b47a596f8.zip

sync with code

Diffstat (limited to 'perl-install/install/share/po/sc.po')

-rw-r--r--

perl-install/install/share/po/sc.po

1 files changed, 12 insertions, 35 deletions

/* -*- c -*- */ /* This include file is a template for defining arithmetic binary operations * on arithmetic types. I realize that doing it this way is not very * elegant but it minimizes the number of lines of code and I believe it * promotes clarity. */ /* The following macros should be properly defined before including this file: * * GENERIC_BINARY_FUNCTION: The name of the binary function * GENERIC_TYPE: The class data type * MOD_FUNCTION: The function to use for mod * ABS_FUNCTION: Name of the abs function * SIGN_FUNCTION: Name of the sign function * GENERIC_UNARY_FUNCTION Name of the unary function * * If GENERIC_BIT_OPERATIONS is defined, the bit-level binary operators * will get included. If the data type has a power operation (SLANG_POW), * then POW_FUNCTION should be defined to return POW_RESULT_TYPE. */ #ifdef GENERIC_BINARY_FUNCTION static int GENERIC_BINARY_FUNCTION (int op, unsigned char a_type, VOID_STAR ap, unsigned int na, unsigned char b_type, VOID_STAR bp, unsigned int nb, VOID_STAR cp) { GENERIC_TYPE *c, *a, *b; #ifdef POW_FUNCTION POW_RESULT_TYPE *d; #endif unsigned int n; #if _SLANG_OPTIMIZE_FOR_SPEED < 2 unsigned int n_max, da, db; #endif char *cc; (void) a_type; /* Both SLANG_INT_TYPE */ (void) b_type; a = (GENERIC_TYPE *) ap; b = (GENERIC_TYPE *) bp; c = (GENERIC_TYPE *) cp; cc = (char *) cp; #if _SLANG_OPTIMIZE_FOR_SPEED < 2 if (na == 1) da = 0; else da = 1; if (nb == 1) db = 0; else db = 1; if (na > nb) n_max = na; else n_max = nb; #endif switch (op) { default: return 0; #ifdef POW_FUNCTION case SLANG_POW: d = (POW_RESULT_TYPE *) cp; #if _SLANG_OPTIMIZE_FOR_SPEED < 2 for (n = 0; n < n_max; n++) { d[n] = POW_FUNCTION(*a, *b); a += da; b += db; } #else if (na == nb) { for (n = 0; n < na; n++) d[n] = POW_FUNCTION(a[n],b[n]); } else if (nb == 1) { GENERIC_TYPE xb = *b; if (xb == 2) for (n = 0; n < na; n++) d[n] = a[n] * a[n]; else for (n = 0; n < na; n++) d[n] = POW_FUNCTION(a[n], xb); } else /* if (na == 1) */ { GENERIC_TYPE xa = *a; for (n = 0; n < nb; n++) d[n] = POW_FUNCTION(xa, b[n]); } #endif break; #endif case SLANG_PLUS: #if _SLANG_OPTIMIZE_FOR_SPEED < 2 for (n = 0; n < n_max; n++) { c[n] = (*a + *b); a += da; b += db; } #else if (na == nb) { for (n = 0; n < na; n++) c[n] = a[n] + b[n]; } else if (nb == 1) { GENERIC_TYPE xb = *b; for (n = 0; n < na; n++) c[n] = a[n] + xb; } else /* if (na == 1) */ { GENERIC_TYPE xa = *a; for (n = 0; n < nb; n++) c[n] = xa + b[n]; } #endif break; case SLANG_MINUS: #if _SLANG_OPTIMIZE_FOR_SPEED < 2 for (n = 0; n < n_max; n++) { c[n] = (*a - *b); a += da; b += db; } #else if (na == nb) { for (n = 0; n < na; n++) c[n] = a[n] - b[n]; } else if (nb == 1) { GENERIC_TYPE xb = *b; for (n = 0; n < na; n++) c[n] = a[n] - xb; } else /* if (na == 1) */ { GENERIC_TYPE xa = *a; for (n = 0; n < nb; n++) c[n] = xa - b[n]; } #endif break; case SLANG_TIMES: #if _SLANG_OPTIMIZE_FOR_SPEED < 2 for (n = 0; n < n_max; n++) { c[n] = (*a * *b); a += da; b += db; } #else if (na == nb) { for (n = 0; n < na; n++) c[n] = a[n] * b[n]; } else if (nb == 1) { GENERIC_TYPE xb = *b; for (n = 0; n < na; n++) c[n] = a[n] * xb; } else /* if (na == 1) */ { GENERIC_TYPE xa = *a; for (n = 0; n < nb; n++) c[n] = xa * b[n]; } #endif break; case SLANG_DIVIDE: #if _SLANG_OPTIMIZE_FOR_SPEED < 2 for (n = 0; n < n_max; n++) { if (*b == 0) { SLang_Error = SL_DIVIDE_ERROR; return -1; } c[n] = (*a / *b); a += da; b += db; } #else if (na == nb) { for (n = 0; n < na; n++) { if (b[n] == 0) { SLang_Error = SL_DIVIDE_ERROR; return -1; } c[n] = a[n] / b[n]; } } else if (nb == 1) { GENERIC_TYPE xb = *b; if (xb == 0) { SLang_Error = SL_DIVIDE_ERROR; return -1; } for (n = 0; n < na; n++) c[n] = a[n] / xb; } else /* if (na == 1) */ { GENERIC_TYPE xa = *a; for (n = 0; n < nb; n++) { if (b[n] == 0) { SLang_Error = SL_DIVIDE_ERROR; return -1; } c[n] = xa / b[n]; } } #endif break; case SLANG_MOD: #if _SLANG_OPTIMIZE_FOR_SPEED < 2 for (n = 0; n < n_max; n++) { if (*b == 0) { SLang_Error = SL_DIVIDE_ERROR; return -1; } c[n] = MOD_FUNCTION(*a, *b); a += da; b += db; } #else if (na == nb) { for (n = 0; n < na; n++) { if (b[n] == 0) { SLang_Error = SL_DIVIDE_ERROR; return -1; } c[n] = MOD_FUNCTION(a[n],b[n]); } } else if (nb == 1) { GENERIC_TYPE xb = *b; if (xb == 0) { SLang_Error = SL_DIVIDE_ERROR; return -1; } for (n = 0; n < na; n++) c[n] = MOD_FUNCTION(a[n],xb); } else /* if (na == 1) */ { GENERIC_TYPE xa = *a; for (n = 0; n < nb; n++) { if (b[n] == 0) { SLang_Error = SL_DIVIDE_ERROR; return -1; } c[n] = MOD_FUNCTION(xa,b[n]); } } #endif break; #ifdef GENERIC_BIT_OPERATIONS case SLANG_BAND: #if _SLANG_OPTIMIZE_FOR_SPEED < 2 for (n = 0; n < n_max; n++) { c[n] = (*a & *b); a += da; b += db; } #else if (na == nb) { for (n = 0; n < na; n++) c[n] = a[n] & b[n]; } else if (nb == 1) { GENERIC_TYPE xb = *b; for (n = 0; n < na; n++) c[n] = a[n] & xb; } else /* if (na == 1) */ { GENERIC_TYPE xa = *a; for (n = 0; n < nb; n++) c[n] = xa & b[n]; } #endif break; case SLANG_BXOR: #if _SLANG_OPTIMIZE_FOR_SPEED < 2 for (n = 0; n < n_max; n++) { c[n] = (*a ^ *b); a += da; b += db; } #else if (na == nb) { for (n = 0; n < na; n++) c[n] = a[n] ^ b[n]; } else if (nb == 1) { GENERIC_TYPE xb = *b; for (n = 0; n < na; n++) c[n] = a[n] ^ xb; } else /* if (na == 1) */ { GENERIC_TYPE xa = *a; for (n = 0; n < nb; n++) c[n] = xa ^ b[n]; } #endif break; case SLANG_BOR: #if _SLANG_OPTIMIZE_FOR_SPEED < 2 for (n = 0; n < n_max; n++) { c[n] = (*a | *b); a += da; b += db; } #else if (na == nb) { for (n = 0; n < na; n++) c[n] = a[n] | b[n]; } else if (nb == 1) { GENERIC_TYPE xb = *b; for (n = 0; n < na; n++) c[n] = a[n] | xb; } else /* if (na == 1) */ { GENERIC_TYPE xa = *a; for (n = 0; n < nb; n++) c[n] = xa | b[n]; } #endif break; case SLANG_SHL: #if _SLANG_OPTIMIZE_FOR_SPEED < 2 for (n = 0; n < n_max; n++) { c[n] = (*a << *b); a += da; b += db; } #else if (na == nb) { for (n = 0; n < na; n++) c[n] = a[n] << b[n]; } else if (nb == 1) { GENERIC_TYPE xb = *b; for (n = 0; n < na; n++) c[n] = a[n] << xb; } else /* if (na == 1) */ { GENERIC_TYPE xa = *a; for (n = 0; n < nb; n++) c[n] = xa << b[n]; } #endif break; case SLANG_SHR: #if _SLANG_OPTIMIZE_FOR_SPEED < 2 for (n = 0; n < n_max; n++) { c[n] = (*a >> *b); a += da; b += db; } #else if (na == nb) { for (n = 0; n < na; n++) c[n] = a[n] >> b[n]; } else if (nb == 1) { GENERIC_TYPE xb = *b; for (n = 0; n < na; n++) c[n] = a[n] >> xb; } else /* if (na == 1) */ { GENERIC_TYPE xa = *a; for (n = 0; n < nb; n++) c[n] = xa >> b[n]; } #endif break; #endif /* GENERIC_BIT_OPERATIONS */ case SLANG_EQ: #if _SLANG_OPTIMIZE_FOR_SPEED < 2 for (n = 0; n < n_max; n++) { cc[n] = (*a == *b); a += da; b += db; } #else if (na == nb) { for (n = 0; n < na; n++) cc[n] = (a[n] == b[n]); } else if (nb == 1) { GENERIC_TYPE xb = *b; for (n = 0; n < na; n++) cc[n] = (a[n] == xb); } else /* if (na == 1) */ { GENERIC_TYPE xa = *a; for (n = 0; n < nb; n++) cc[n] = (xa == b[n]); } #endif break; case SLANG_NE: #if _SLANG_OPTIMIZE_FOR_SPEED < 2 for (n = 0; n < n_max; n++) { cc[n] = (*a != *b); a += da; b += db; } #else if (na == nb) { for (n = 0; n < na; n++) cc[n] = (a[n] != b[n]); } else if (nb == 1) { GENERIC_TYPE xb = *b; for (n = 0; n < na; n++) cc[n] = (a[n] != xb); } else /* if (na == 1) */ { GENERIC_TYPE xa = *a; for (n = 0; n < nb; n++) cc[n] = (xa != b[n]); } #endif break; case SLANG_GT: #if _SLANG_OPTIMIZE_FOR_SPEED < 2 for (n = 0; n < n_max; n++) { cc[n] = (*a > *b); a += da; b += db; } #else if (na == nb) { for (n = 0; n < na; n++) cc[n] = (a[n] > b[n]); } else if (nb == 1) { GENERIC_TYPE xb = *b; for (n = 0; n < na; n++) cc[n] = (a[n] > xb); } else /* if (na == 1) */ { GENERIC_TYPE xa = *a; for (n = 0; n < nb; n++) cc[n] = (xa > b[n]); } #endif break; case SLANG_GE: #if _SLANG_OPTIMIZE_FOR_SPEED < 2 for (n = 0; n < n_max; n++) { cc[n] = (*a >= *b); a += da; b += db; } #else if (na == nb) { for (n = 0; n < na; n++) cc[n] = (a[n] >= b[n]); } else if (nb == 1) { GENERIC_TYPE xb = *b; for (n = 0; n < na; n++) cc[n] = (a[n] >= xb); } else /* if (na == 1) */ { GENERIC_TYPE xa = *a; for (n = 0; n < nb; n++) cc[n] = (xa >= b[n]); } #endif break; case SLANG_LT: #if _SLANG_OPTIMIZE_FOR_SPEED < 2 for (n = 0; n < n_max; n++) { cc[n] = (*a < *b); a += da; b += db; } #else if (na == nb) { for (n = 0; n < na; n++) cc[n] = (a[n] < b[n]); } else if (nb == 1) { GENERIC_TYPE xb = *b; for (n = 0; n < na; n++) cc[n] = (a[n] < xb); } else /* if (na == 1) */ { GENERIC_TYPE xa = *a; for (n = 0; n < nb; n++) cc[n] = (xa < b[n]); } #endif break; case SLANG_LE: #if _SLANG_OPTIMIZE_FOR_SPEED < 2 for (n = 0; n < n_max; n++) { cc[n] = (*a <= *b); a += da; b += db; } #else if (na == nb) { for (n = 0; n < na; n++) cc[n] = (a[n] <= b[n]); } else if (nb == 1) { GENERIC_TYPE xb = *b; for (n = 0; n < na; n++) cc[n] = (a[n] <= xb); } else /* if (na == 1) */ { GENERIC_TYPE xa = *a; for (n = 0; n < nb; n++) cc[n] = (xa <= b[n]); } #endif break; case SLANG_OR: #if _SLANG_OPTIMIZE_FOR_SPEED < 2 for (n = 0; n < n_max; n++) { cc[n] = (*a || *b); a += da; b += db; } #else if (na == nb) { for (n = 0; n < na; n++) cc[n] = (a[n] || b[n]); } else if (nb == 1) { GENERIC_TYPE xb = *b; for (n = 0; n < na; n++) cc[n] = (a[n] || xb); } else /* if (na == 1) */ { GENERIC_TYPE xa = *a; for (n = 0; n < nb; n++) cc[n] = (xa || b[n]); } #endif break; case SLANG_AND: #if _SLANG_OPTIMIZE_FOR_SPEED < 2 for (n = 0; n < n_max; n++) { cc[n] = (*a && *b); a += da; b += db; } #else if (na == nb) { for (n = 0; n < na; n++) cc[n] = (a[n] && b[n]); } else if (nb == 1) { GENERIC_TYPE xb = *b; for (n = 0; n < na; n++) cc[n] = (a[n] && xb); } else /* if (na == 1) */ { GENERIC_TYPE xa = *a; for (n = 0; n < nb; n++) cc[n] = (xa && b[n]); } #endif break; } return 1; } #endif /* GENERIC_BINARY_FUNCTION */ #ifdef GENERIC_UNARY_FUNCTION static int GENERIC_UNARY_FUNCTION (int op, unsigned char a_type, VOID_STAR ap, unsigned int na, VOID_STAR bp ) { GENERIC_TYPE *a, *b; unsigned int n; int *ib; (void) a_type; a = (GENERIC_TYPE *) ap; b = (GENERIC_TYPE *) bp; switch (op) { default: return 0; case SLANG_PLUSPLUS: for (n = 0; n < na; n++) b[n] = (a[n] + 1); break; case SLANG_MINUSMINUS: for (n = 0; n < na; n++) b[n] = (a[n] - 1); break; case SLANG_CHS: for (n = 0; n < na; n++) b[n] = (GENERIC_TYPE) -(a[n]); break; case SLANG_SQR: for (n = 0; n < na; n++) b[n] = (a[n] * a[n]); break; case SLANG_MUL2: for (n = 0; n < na; n++) b[n] = (2 * a[n]); break; case SLANG_ABS: for (n = 0; n < na; n++) b[n] = ABS_FUNCTION (a[n]); break; case SLANG_SIGN: ib = (int *) bp; for (n = 0; n < na; n++) ib[n] = SIGN_FUNCTION(a[n]); break; #ifdef GENERIC_BIT_OPERATIONS case SLANG_NOT: for (n = 0; n < na; n++) b[n] = !(a[n]); break; case SLANG_BNOT: for (n = 0; n < na; n++) b[n] = ~(a[n]); break; #endif } return 1; } #endif /* GENERIC_UNARY_FUNCTION */


context:
space:
mode: