HomeSort by: relevance | last modified time | path
    Searched refs:decomposed (Results 1 - 8 of 8) sorted by relevancy

  /src/external/bsd/openldap/dist/libraries/liblunicode/ucdata/
api.txt 103 contains the fully decomposed string in canonical order.
121 be decomposed into the `decomp' array arithmetically.
283 Can the character be decomposed into a set of other characters?
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/uni/
package.d 338 can be further decomposed.
8577 dchar[] decomposed;
8578 decomposed.reserve(31);
8589 decomposed ~= c;
8594 decomposed ~= c;
8596 ccc.length = decomposed.length;
8600 foreach (idx, dchar ch; decomposed)
8608 (zip(ccc[firstNonStable .. idx], decomposed[firstNonStable .. idx]));
8609 firstNonStable = decomposed.length;
8619 (zip(ccc[firstNonStable..$], decomposed[firstNonStable..$]))
    [all...]
  /src/external/gpl2/groff/dist/src/roff/troff/
input.cpp 3922 const char *decomposed = decompose_unicode(u); local
3923 if (decomposed)
3924 u = &decomposed[1];
  /src/external/gpl3/gcc.old/dist/gcc/config/s390/
s390.cc 3315 bool decomposed = false; local
3335 decomposed = true;
3348 if (!decomposed && !s390_decompose_address (op, &addr))
3350 decomposed = true;
3356 if (!decomposed && !s390_decompose_address (op, &addr))
3367 if (!decomposed && !s390_decompose_address (op, &addr))
3377 if (!decomposed && !s390_decompose_address (op, &addr))
  /src/external/gpl3/gcc/dist/gcc/config/s390/
s390.cc 3462 bool decomposed = false; local
3482 decomposed = true;
3495 if (!decomposed && !s390_decompose_address (op, &addr))
3497 decomposed = true;
3503 if (!decomposed && !s390_decompose_address (op, &addr))
3514 if (!decomposed && !s390_decompose_address (op, &addr))
3524 if (!decomposed && !s390_decompose_address (op, &addr))
  /src/external/gpl3/gcc.old/dist/gcc/
combine.cc 9995 N is the index of the term that is decomposed (the arithmetic operation,
10003 rtx decomposed, distributed, inner_op0, inner_op1, new_op0, new_op1, tmp;
10011 decomposed = XEXP (x, n);
10012 if (!ARITHMETIC_P (decomposed))
10019 inner_code = GET_CODE (decomposed);
10020 inner_op0 = XEXP (decomposed, 0);
10021 inner_op1 = XEXP (decomposed, 1);
9970 rtx decomposed, distributed, inner_op0, inner_op1, new_op0, new_op1, tmp; local
  /src/external/gpl3/gcc/dist/gcc/
combine.cc 10046 N is the index of the term that is decomposed (the arithmetic operation,
10054 rtx decomposed, distributed, inner_op0, inner_op1, new_op0, new_op1, tmp;
10062 decomposed = XEXP (x, n);
10063 if (!ARITHMETIC_P (decomposed))
10070 inner_code = GET_CODE (decomposed);
10071 inner_op0 = XEXP (decomposed, 0);
10072 inner_op1 = XEXP (decomposed, 1);
10021 rtx decomposed, distributed, inner_op0, inner_op1, new_op0, new_op1, tmp; local
  /src/external/mit/isl/dist/doc/
implementation.tex 977 final coordinates. The path $P'$ can then be decomposed into

Completed in 84 milliseconds