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

  /src/external/gpl3/gcc/dist/libgfortran/
mk-kinds-h.sh 17 smallest=""
32 if [ "$smallest" = "" ]; then
33 smallest="$k"
48 echo "#define GFC_DEFAULT_CHAR ${smallest}"
  /src/external/gpl3/gcc.old/dist/libgfortran/
mk-kinds-h.sh 16 smallest=""
31 if [ "$smallest" = "" ]; then
32 smallest="$k"
47 echo "#define GFC_DEFAULT_CHAR ${smallest}"
  /src/external/mit/libuv/dist/src/
heap-inl.h 153 struct heap_node* smallest; local
218 * swap it with the smallest child.
221 smallest = child;
222 if (child->left != NULL && less_than(child->left, smallest))
223 smallest = child->left;
224 if (child->right != NULL && less_than(child->right, smallest))
225 smallest = child->right;
226 if (smallest == child)
228 heap_node_swap(heap, child, smallest);
  /src/external/bsd/ntp/dist/scripts/calc_tickadj/
calc_tickadj-opts.def 37 smallest possible number.
  /src/external/gpl2/groff/dist/src/devices/xditview/
font.c 60 DviFontSizeList *fs, *best = 0, *smallest = 0; local
96 if (smallest == 0 || fs->size < smallest->size)
97 smallest = fs;
99 return best ? best : smallest;
  /src/external/cddl/osnet/dist/uts/common/sys/
cpuvar.h 442 * Determine the smallest and largest CPU id in the set. Returns
443 * CPUSET_NOTINSET in smallest and largest when set is empty.
445 #define CPUSET_BOUNDS(set, smallest, largest) { \
446 cpuset_bounds(&(set), &(smallest), &(largest)); \
515 #define CPUSET_BOUNDS(set, smallest, largest) { \
516 smallest = (uint_t)(lowbit(set) - 1); \
  /src/external/gpl2/xcvs/dist/contrib/
validate_repo.in 44 I<important> revisions are defined as the smallest set which, when checked out,
  /src/external/lgpl3/gmp/dist/mpn/powerpc32/vmx/
copyd.asm 48 C * The VMX code is used from the smallest sizes it handles, but measurements
copyi.asm 48 C * The VMX code is used from the smallest sizes it handles, but measurements
  /src/external/mit/isl/dist/doc/
implementation.tex 120 and it is defined as the (inclusion-wise) smallest basic set
146 with $\vec K_i$ the (component-wise) smallest non-negative integer vectors
224 smallest increment in the variables $\vec x$,
227 In order to be able to determine the smallest increment, the tableau
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/datetime/
date.d 134 Array of the strings representing time units, starting with the smallest
10012 1. `T` must define a static property named `min` which is the smallest
10132 `"hnsecs"` are the smallest.
10198 units and `"hnsecs"` are the smallest.
  /src/sys/arch/m68k/060sp/dist/
pfpsp.s 971 # multiply operation is the smallest possible normalized number
1004 # multiply operation is the smallest possible normalized number
1032 # multiply operation is the smallest possible normalized number
5417 # plus two, then set the smallest exponent to a very small value as a #
7169 ori.l &0x00800000,%d1 # make smallest sgl
7215 ori.l &0x00800000,%d1 # make smallest sgl
7262 ori.l &0x00800000,%d1 # make smallest sgl
11280 # result is equal to the smallest normalized number in the selected precision
11300 # ok, so now the result has a exponent equal to the smallest normalized
11733 # result is equal to the smallest normalized number in the selected precisio
    [all...]
fpsp.s 971 # multiply operation is the smallest possible normalized number
1004 # multiply operation is the smallest possible normalized number
1032 # multiply operation is the smallest possible normalized number
8505 mov.l (%a0),%d3 # D3 is exponent of smallest norm. #
14848 # result is equal to the smallest normalized number in the selected precision
14868 # ok, so now the result has a exponent equal to the smallest normalized
15301 # result is equal to the smallest normalized number in the selected precision
15321 # ok, so now the result has a exponent equal to the smallest normalized
15870 # plus two, then set the smallest exponent to a very small value as a #
20267 ori.l &0x00800000,%d1 # make smallest sg
    [all...]
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/uni/
package.d 4105 The design goal is optimal speed with smallest footprint size.
5452 $(P Level 4 is the slowest and has the smallest footprint. )

Completed in 46 milliseconds