Searched refs:bigger (Results 1 – 25 of 115) sorted by relevance
12345
85 Dwarf_Frame *bigger = realloc (fs, size); in execute_cfi() local86 if (unlikely (bigger == NULL)) in execute_cfi()94 memset (bigger->regs + bigger->nregs, 0, in execute_cfi()95 (reg + 1 - bigger->nregs) * sizeof bigger->regs[0]); in execute_cfi()96 bigger->nregs = reg + 1; in execute_cfi()97 fs = bigger; in execute_cfi()
95 const __m128 bigger = _mm_cmpgt_ps(absEf, kThresh); in ScaleErrorSignalSSE2() local100 ef_re_if = _mm_and_ps(bigger, ef_re_if); in ScaleErrorSignalSSE2()101 ef_im_if = _mm_and_ps(bigger, ef_im_if); in ScaleErrorSignalSSE2()102 ef_re = _mm_andnot_ps(bigger, ef_re); in ScaleErrorSignalSSE2()103 ef_im = _mm_andnot_ps(bigger, ef_im); in ScaleErrorSignalSSE2()357 const __m128 bigger = _mm_cmpgt_ps(vec_hNl, vec_hNlFb); in OverdriveAndSuppressSSE2() local363 const __m128 vec_if0 = _mm_andnot_ps(bigger, vec_hNl); in OverdriveAndSuppressSSE2()365 bigger, _mm_add_ps(vec_weightCurve_hNlFb, vec_one_weightCurve_hNl)); in OverdriveAndSuppressSSE2()
114 Interval bigger = addition.union(r); in add() local115 iter.set(bigger); in add()120 if ( bigger.adjacent(next)||!bigger.disjoint(next) ) { in add()124 iter.set(bigger.union(next)); // set to 3 merged ones in add()
29 - // Use indirect if size of the illegal vector is bigger than 16 bytes.31 + // Use indirect if size of the illegal vector is bigger than 32 bytes.
15 ; Finally, a bigger case where we chain things together. This corresponds to
114 ArrayList<Integer> bigger = Lists.newArrayListWithCapacity(256); in testNewArrayListWithCapacity() local115 assertEquals(Collections.emptyList(), bigger); in testNewArrayListWithCapacity() local130 ArrayList<Integer> bigger = Lists.newArrayListWithExpectedSize(256); in testNewArrayListWithExpectedSize() local131 assertEquals(Collections.emptyList(), bigger); in testNewArrayListWithExpectedSize() local
9 ; so I've disabled it with a bigger stick.
52 ; Variadic functions return structs bigger than 4 words via a hidden
244 # Requires bigger stack size in the Genesis and if stack size is increased,362 # Requires bigger stack size in the Genesis and if stack size is increased,407 # Requires bigger stack size in the Genesis and if stack size is increased,458 # Requires bigger stack size in the Genesis and if stack size is increased,501 # Requires bigger stack size in the Genesis and if stack size is increased,
81 * an attribute to build a bigger template; you get a self-embedded
283 ArrayList<Integer> bigger = Lists.newArrayListWithCapacity(256); in testNewArrayListWithCapacity() local284 assertEquals(Collections.emptyList(), bigger); in testNewArrayListWithCapacity() local299 ArrayList<Integer> bigger = Lists.newArrayListWithExpectedSize(256); in testNewArrayListWithExpectedSize() local300 assertEquals(Collections.emptyList(), bigger); in testNewArrayListWithExpectedSize() local
13 1) It doesn't work on filesystems bigger than 2GB135 2. ext2ed currently can't handle filesystems bigger than 2 GB. I am
31 * seek correctly in files bigger than 2 GB (Windows)
273 int (*bigger)(struct lock_stat *, struct lock_stat *)) in insert_to_result()283 if (bigger(st, p)) in insert_to_result()
19 ; When the size is bigger than 256, change into bzero.
113 * an attribute to build a bigger template; you get a self-embedded
109 ; Like f1 but with a frame that is 8 bytes bigger. This is the smallest176 ; Like f2 but with a frame that is 8 bytes bigger. This is the smallest
34 …* - fftw (http://www.fftw.org) : faster, GPL -- incompatible with Eigen in LGPL form, bigger code …72 // FFTW: faster, GPL -- incompatible with Eigen in LGPL form, bigger code size
135 * an attribute to build a bigger template; you get a self-embedded
126 * an attribute to build a bigger template; you get a self-embedded
141 * an attribute to build a bigger template; you get a self-embedded
org/kxml2/ org/kxml2/kdom/ org/kxml2/kdom/Element.class ...
9 both to the filesystem itself (bigger blocks, and sparse files), but
196 * an attribute to build a bigger template; you get a self-embedded
73 ; induction variable to a bigger type the exit count computation will overflow