Searched refs:mid (Results 1 - 25 of 58) sorted by relevance

123

/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/
H A Dpr43402.c27 unsigned mid, start, limit; local
32 mid = limit;
36 mid = (start + limit) / 2;
37 if (lastMid == mid) { /* Have we moved? */
40 lastMid = mid;
41 result = __builtin_strcmp(realName, cnvNameType[mid].name);
44 limit = mid;
46 start = mid;
48 return converterData[cnvNameType[mid].type];
H A Dpr36584.c153 double mid; local
164 mid = (min_value + max_value) / 2;
165 atmid = numchanges (np, sseq, mid);
169 if (fabs (mid) > RELERROR)
171 if (fabs ((max_value - min_value) / mid) < RELERROR)
173 roots[0] = mid;
181 roots[0] = mid;
187 min_value = mid;
189 max_value = mid;
192 roots[0] = mid;
[all...]
H A Dpr46620.c40 unsigned char mid; member in struct:pedr
60 me->mid = pmid;
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/graphite/
H A Dpr38559.c6 register char *mid; local
11 while (midend > mid)
H A Dvect-pr43423.c6 void foo(int n, int mid) argument
11 if (i < mid)
/haiku-buildtools/gcc/libbacktrace/
H A Dsort.c66 size_t mid; local
78 mid = 0;
83 ++mid;
84 if (i != mid)
85 swap (base + mid * size, base + i * size, size);
89 if (mid > 0)
90 swap (base, base + mid * size, size);
94 if (2 * mid < count)
96 backtrace_qsort (base, mid, size, compar);
97 base += (mid
[all...]
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.oliva/
H A Dthunk1.C21 struct mid: base { struct in inherits:base
22 mid(int bb) : base(bb) { function in struct:mid
23 // when mid is not in charge of vbase initialization,
30 struct derived: virtual mid {
31 derived(int cc) : mid(cc) {}
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/arm/
H A Dpr48183.c14 int32x4x2_t mid; local
19 mid.val[0] = vmovl_s16(input.val[0]);
20 mid.val[1] = vmovl_s16(input.val[1]);
21 output.val[0] = vshlq_n_s32(mid.val[0], 8);
22 output.val[1] = vshlq_n_s32(mid.val[1], 8);
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/partition_point/
H A D1.cc43 forward_iterator_wrapper<int> mid = local
46 VERIFY( std::all_of(con.begin(), mid, predicate) );
47 VERIFY( std::none_of(mid, con.end(), predicate) );
57 forward_iterator_wrapper<int> mid = local
60 VERIFY( std::all_of(con.begin(), mid, predicate) );
61 VERIFY( std::none_of(mid, con.end(), predicate) );
71 forward_iterator_wrapper<int> mid = local
74 VERIFY( std::all_of(con.begin(), mid, predicate) );
75 VERIFY( std::none_of(mid, con.end(), predicate) );
/haiku-buildtools/legacy/binutils/gprof/
H A Dsymtab.c180 long low, mid, high;
189 mid = (high + low) >> 1;
191 fprintf (stderr, "[dbg_sym_lookup] low=0x%lx, mid=0x%lx, high=0x%lx\n",
192 low, mid, high);
194 (unsigned long) sym[mid].addr,
195 (unsigned long) sym[mid + 1].addr);
197 if (sym[mid].addr <= address && sym[mid + 1].addr > address)
198 return &sym[mid];
200 if (sym[mid]
179 long low, mid, high; local
219 long mid = -1; local
[all...]
/haiku-buildtools/binutils/gprof/
H A Dsymtab.c181 unsigned long low, mid, high;
190 mid = (high + low) >> 1;
192 fprintf (stderr, "[dbg_sym_lookup] low=0x%lx, mid=0x%lx, high=0x%lx\n",
193 low, mid, high);
195 (unsigned long) sym[mid].addr,
196 (unsigned long) sym[mid + 1].addr);
198 if (sym[mid].addr <= address && sym[mid + 1].addr > address)
199 return &sym[mid];
201 if (sym[mid]
180 unsigned long low, mid, high; local
220 long mid = -1; local
[all...]
/haiku-buildtools/gcc/libgomp/testsuite/libgomp.c/
H A Dsort-1.c124 int mid = (lo + hi) / 2; local
126 if (array[mid] < array[lo])
127 swap (array, lo, mid);
128 if (array[hi] < array[mid])
130 swap (array, mid, hi);
131 if (array[mid] < array[lo])
132 swap (array, lo, mid);
134 return array[mid];
167 int lo = 0, hi = 0, mid, next_lo, next_hi; local
218 mid
259 int mid; local
310 int mid; local
[all...]
/haiku-buildtools/gcc/gcc/
H A Dhash-table.c89 unsigned int mid = low + (high - low) / 2; local
90 if (n > prime_tab[mid].prime)
91 low = mid + 1;
93 high = mid;
/haiku-buildtools/isl/
H A Disl_sort.c58 size_t mid; local
60 mid = MID (low, high);
62 if (mid + 1 < high)
63 msort (array, buf, mid + 1, high, size, compare, arg);
65 if (mid > low)
66 msort (array, buf, low, mid, size, compare, arg);
69 am = ((char *) array) + ((mid + 1) * size);
/haiku-buildtools/gcc/gcc/java/
H A Dmangle_name.c186 int mid = (last + first) / 2; local
189 for (mid = (last + first) / 2;
190 mid != old;
191 old = mid, mid = (last + first) / 2)
193 int kwl = strlen (cxx_keywords[mid]);
195 int r = utf8_cmp ((const unsigned char *) name, min_length, cxx_keywords[mid]);
209 last = mid;
211 first = mid;
/haiku-buildtools/gcc/libgcc/
H A Dunwind-dw2-fde-dip.c379 size_t lo, hi, mid; local
385 mid = fde_count - 1;
388 else if (data->pc < table[mid].initial_loc + data_base)
391 hi = mid;
395 mid = (lo + hi) / 2;
396 if (data->pc < table[mid].initial_loc + data_base)
397 hi = mid;
398 else if (data->pc >= table[mid + 1].initial_loc + data_base)
399 lo = mid + 1;
407 f = (fde *) (table[mid]
[all...]
/haiku-buildtools/gcc/libgcc/config/ia64/
H A Dfde-glibc.c100 size_t mid = (lo + hi) / 2; local
102 f = f_base + mid;
104 hi = mid;
106 lo = mid + 1;
/haiku-buildtools/gcc/gmp/mpn/pa64/
H A Dmul_1.asm135 fstd %fr22, -0x78(%r30) C mid product to -0x78..-0x71
138 fstd %fr23, -0x70(%r30) C mid product to -0x70..-0x69
155 fstd %fr22, -0x78(%r30) C mid product to -0x78..-0x71
159 fstd %fr23, -0x70(%r30) C mid product to -0x70..-0x69
185 C fstd %fr22, -0x78(%r30) C mid product to -0x78..-0x71
190 C fstd %fr23, -0x70(%r30) C mid product to -0x70..-0x69
220 fstd %fr22, -0x78(%r30) C mid product to -0x78..-0x71
224 fstd %fr23, -0x70(%r30) C mid product to -0x70..-0x69
331 fstd %fr22, -0x78(%r30) C mid product to -0x78..-0x71
334 fstd %fr23, -0x70(%r30) C mid produc
[all...]
H A Daddmul_1.asm135 fstd %fr22, -0x78(%r30) C mid product to -0x78..-0x71
138 fstd %fr23, -0x70(%r30) C mid product to -0x70..-0x69
155 fstd %fr22, -0x78(%r30) C mid product to -0x78..-0x71
159 fstd %fr23, -0x70(%r30) C mid product to -0x70..-0x69
187 C fstd %fr22, -0x78(%r30) C mid product to -0x78..-0x71
192 C fstd %fr23, -0x70(%r30) C mid product to -0x70..-0x69
225 fstd %fr22, -0x78(%r30) C mid product to -0x78..-0x71
229 fstd %fr23, -0x70(%r30) C mid product to -0x70..-0x69
349 fstd %fr22, -0x78(%r30) C mid product to -0x78..-0x71
352 fstd %fr23, -0x70(%r30) C mid produc
[all...]
H A Dsubmul_1.asm135 fstd %fr22, -0x78(%r30) C mid product to -0x78..-0x71
138 fstd %fr23, -0x70(%r30) C mid product to -0x70..-0x69
155 fstd %fr22, -0x78(%r30) C mid product to -0x78..-0x71
159 fstd %fr23, -0x70(%r30) C mid product to -0x70..-0x69
187 C fstd %fr22, -0x78(%r30) C mid product to -0x78..-0x71
192 C fstd %fr23, -0x70(%r30) C mid product to -0x70..-0x69
226 fstd %fr22, -0x78(%r30) C mid product to -0x78..-0x71
230 fstd %fr23, -0x70(%r30) C mid product to -0x70..-0x69
353 fstd %fr22, -0x78(%r30) C mid product to -0x78..-0x71
356 fstd %fr23, -0x70(%r30) C mid produc
[all...]
/haiku-buildtools/gcc/libsanitizer/include/sanitizer/
H A Dcommon_interface_defs.h76 // [beg, end); the memory [beg, mid) is used to store the current elements
77 // and the memory [mid, end) is reserved for future elements;
78 // beg <= mid <= end. For example, in "std::vector<> v"
81 // mid = beg + v.size() * sizeof(v[0]);
84 // container so that the tool can report errors when memory from [mid, end)
86 // Supply the old and the new values of mid (old_mid/new_mid).
87 // In the initial state mid == end and so should be the final
108 // - [beg, mid) is addressable,
109 // - [mid, end) is unaddressable.
111 // such complexity by touching only parts of the container around beg/mid/en
[all...]
/haiku-buildtools/gcc/libcilkrts/runtime/
H A Dcilk-abi-cilk-for.cpp249 count_t mid = low + count / 2; local
265 _Cilk_spawn cilk_for_recursive(low, mid, body, data, grain, w,
268 _Cilk_spawn cilk_for_recursive(low, mid, body, data, grain,
273 low = mid;
/haiku-buildtools/gcc/libsanitizer/asan/
H A Dasan_poisoning.cc371 uptr mid = reinterpret_cast<uptr>(mid_p); local
372 CHECK_LE(beg, mid);
373 CHECK_LE(mid, end);
374 // Check some bytes starting from beg, some bytes around mid, and some bytes
378 uptr r1_end = Min(end + kMaxRangeToCheck, mid);
379 uptr r2_beg = Max(beg, mid - kMaxRangeToCheck);
380 uptr r2_end = Min(end, mid + kMaxRangeToCheck);
381 uptr r3_beg = Max(end - kMaxRangeToCheck, mid);
386 for (uptr i = r2_beg; i < mid; i++)
389 for (uptr i = mid;
[all...]
/haiku-buildtools/legacy/binutils/bfd/
H A Delf-eh-frame.c709 unsigned int lo, hi, mid; local
720 mid = 0;
723 mid = (lo + hi) / 2;
724 if (offset < sec_info->entry[mid].offset)
725 hi = mid;
727 >= sec_info->entry[mid].offset + sec_info->entry[mid].size)
728 lo = mid + 1;
736 if (sec_info->entry[mid].removed)
741 if (sec_info->entry[mid]
[all...]
/haiku-buildtools/binutils/gas/config/
H A Dtc-visium.c765 int mid = (l + r) / 2; local
766 int ans = strcmp (mnem, opcode_table[mid].mnem);
769 r = mid - 1;
771 l = mid + 1;
774 *code = opcode_table[mid].code;
775 *mode = opcode_table[mid].mode;
776 *flags = opcode_table[mid].flags;
919 int mid = (l + r) / 2; local
920 int ans = strcmp (buf, gen_reg_table[mid].name);
923 r = mid
956 int mid = (l + r) / 2; local
993 int mid = (l + r) / 2; local
[all...]

Completed in 258 milliseconds

123