Searched refs:largest (Results 1 - 13 of 13) sorted by relevance
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/ |
H A D | string_lit.go | 99 r = 0x10ffff // largest rune value 101 assert(s, "\xf4\x8f\xbf\xbf", "largest rune") 117 s = string(0x10ffff) // largest rune value 118 assert(s, "\xf4\x8f\xbf\xbf", "largest rune constant")
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/bench/shootout/ |
H A D | meteor-contest.go | 617 /* Find smallest and largest solutions */ 618 func smallest_largest() (smallest, largest *[50]int8) { 620 largest = &solutions[0] 633 for j, s := range *largest { 639 largest = candidate 653 smallest, largest := smallest_largest() 655 pretty(largest)
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/fixedbugs/ |
H A D | bug260.go | 7 // Test that structures pack densely, according to the alignment of the largest field.
|
/haiku-buildtools/gcc/libgcc/config/cris/ |
H A D | mulsi3.S | 192 ;; Check if the largest operand is still just 16 bits.
|
H A D | umulsidi3.S | 201 ;; Check if the largest operand is still just 16 bits.
|
/haiku-buildtools/legacy/gcc/texinfo/info/ |
H A D | session.c | 67 For each loaded node, create a new window. Always split the largest of the 94 /* Find the largest window in WINDOWS, and make that be the active 97 register WINDOW *win, *largest = (WINDOW *)NULL; local 104 largest = win; 107 if (!largest) 115 active_window = largest; 2775 /* Search NODE, looking for the largest possible match of STRING. Start the
|
/haiku-buildtools/legacy/gcc/gcc/config/m68k/ |
H A D | lb1sf68.asm | 715 | the largest exponent in a2. 734 1: movew d4,d2 | move largest exponent to d2 832 subw d5,d6 | keep d5 (largest exponent) in d4 2551 | same, and put the largest exponent in d6. Note that we are using two 2560 bhi 5f | branch if second exponent largest 2562 subl d6,d7 | keep the largest exponent 2623 subl d6,d7 | keep the largest exponent 2677 | Now we have a in d0-d1, b in d2-d3, and the largest exponent in d6 (the
|
/haiku-buildtools/gcc/libgcc/config/m68k/ |
H A D | lb1sf68.S | 855 | the largest exponent in a2. 874 1: movew d4,d2 | move largest exponent to d2 972 subw d5,d6 | keep d5 (largest exponent) in d4 2719 | same, and put the largest exponent in d6. Note that we are using two 2728 bhi 5f | branch if second exponent largest 2730 subl d6,d7 | keep the largest exponent 2791 subl d6,d7 | keep the largest exponent 2845 | Now we have a in d0-d1, b in d2-d3, and the largest exponent in d6 (the
|
/haiku-buildtools/gcc/libgcc/config/arm/ |
H A D | ieee754-sf.S | 76 @ Compute exponent difference. Make largest exponent in r2, 88 @ If exponent difference is too large, return largest argument
|
H A D | ieee754-df.S | 99 @ Compute exponent difference. Make largest exponent in r4, 114 @ If exponent difference is too large, return largest argument
|
/haiku-buildtools/gcc/gcc/fortran/ |
H A D | primary.c | 450 the representation method with the largest decimal exponent range
|
H A D | trans-intrinsic.c | 4945 where ULL_MAX is the largest value that a ULL_MAX can hold 5057 where ULL_MAX is the largest value that a ULL_MAX can hold 6958 tree type, cond, tmp, count, exit_label, n, max, largest; local 7000 largest = TYPE_PRECISION (size_type_node) > TYPE_PRECISION (ncopies_type) 7003 fold_convert (largest, ncopies), 7004 fold_convert (largest, max));
|
/haiku-buildtools/isl/doc/ |
H A D | implementation.tex | 592 sizes of the coefficients. In particular, it takes the largest coefficient 593 of each row and then selects the row where this largest coefficient is smaller
|
Completed in 218 milliseconds