/freebsd-11-stable/tools/tools/mid/ |
H A D | mid-build | 11 home=/g/www/mid 22 find text/* -type f | mid-master-index 4 mid-index $dbout/mid 30 mid-master-index 1 mid-index $dbout/mid-current 35 echo "usage mid-build {current|all}"
|
H A D | mid-master-index | 11 filelistmid=`perl -e "for(0 .. $count -1) {print qq{$file.temp.\\$_.mid }}"` 14 if mid-master $count $command $file.temp; then 15 sort -u -m -o $file.temp.mid $filelistmid && 16 rm -f $filelistmid && mv $file.temp.mid $file.mid || exit 1
|
/freebsd-11-stable/lib/libutil/ |
H A D | kld.c | 44 int fid, mid; local 59 for (mid = kldfirstmod(fid); mid > 0; mid = modfnext(mid)) { 61 if (modstat(mid, &mstat) != 0)
|
/freebsd-11-stable/sys/sparc64/include/ |
H A D | bus_common.h | 63 #define INTMAP_ENABLE(mr, mid) \ 64 (INTMAP_TID((mr), (mid)) | INTMAP_V) 65 #define INTMAP_TID(mr, mid) \ 66 (((mr) & ~INTMAP_TID_MASK) | ((mid) << INTMAP_TID_SHIFT))
|
/freebsd-11-stable/contrib/libexecinfo/ |
H A D | symtab.c | 170 size_t mid = ns / 2; local 174 if (s[mid].st_value < me) 175 lo = mid; 176 else if (s[mid].st_value > me) 177 hi = mid; 181 mid = lo; 184 mid = (hi + lo) / 2; 187 sd = me - s[mid].st_value; 189 dli->dli_saddr = (void *)s[mid].st_value; 190 dli->dli_sname = s[mid] [all...] |
/freebsd-11-stable/lib/libc/quad/ |
H A D | muldi3.c | 70 * (2^n) (u1 - u0) (v0 - v1) + [(u1-u0)... = mid] 89 * (2^n)(high) + (2^n)(mid) + (2^n + 1)(low) 93 * (2^n)(high + mid + low) + low 95 * Furthermore, `high' and `mid' can be computed mod 2^n, as any factor 106 u_long high, mid, udiff, vdiff; local 138 * any upper bits in high and mid, so we can use native 151 mid = udiff * vdiff; 158 prod.ul[H] = high + (negmid ? -mid : mid) + low.ul[L] + 189 u_long u1, u0, v1, v0, udiff, vdiff, high, mid, lo local [all...] |
/freebsd-11-stable/sys/libkern/arm/ |
H A D | muldi3.c | 75 * (2^n) (u1 - u0) (v0 - v1) + [(u1-u0)... = mid] 94 * (2^n)(high) + (2^n)(mid) + (2^n + 1)(low) 98 * (2^n)(high + mid + low) + low 100 * Furthermore, `high' and `mid' can be computed mod 2^n, as any factor 111 u_int high, mid, udiff, vdiff; local 143 * any upper bits in high and mid, so we can use native 156 mid = udiff * vdiff; 163 prod.ul[H] = high + (negmid ? -mid : mid) + low.ul[L] + 194 u_int u1, u0, v1, v0, udiff, vdiff, high, mid, lo local [all...] |
/freebsd-11-stable/contrib/sendmail/src/ |
H A D | macro.c | 75 #define NEXTMACROID(mid) ( \ 76 (mid < NEXTMACROID_L) ? (NextMIdTable[mid]) : \ 77 ((mid < NEXTMACROID_H) ? NEXTMACROID_H : (mid + 1))) 83 #define NEXTMACROID(mid) ((mid) + 1) 126 #define MACBINDING(name, mid) \ 127 stab(name, ST_MACRO, ST_ENTER)->s_macro = mid; \ 128 MacroName[mid] 646 int mid; local [all...] |
/freebsd-11-stable/sys/dev/bhnd/nvram/ |
H A D | nvram_subr.c | 116 size_t min, mid, max; local 126 mid = 0; 131 mid = (min + max) / 2; 134 order = strcmp(bhnd_nvram_vars[mid].name, varname); 137 min = mid + 1; 140 max = mid - 1; 143 return (&bhnd_nvram_vars[mid]);
|
/freebsd-11-stable/contrib/groff/src/preproc/eqn/ |
H A D | delim.cpp | 37 const char *mid; member in struct:delimiter 202 static void build_extensible(const char *ext, const char *top, const char *mid, argument 217 if (mid) { 220 mid); 236 if (mid) 241 if (mid) 248 if (mid) 273 if (mid) { 277 mid); 338 build_extensible(d->ext, d->top, d->mid, [all...] |
/freebsd-11-stable/contrib/gcc/ |
H A D | unwind-dw2-fde-glibc.c | 340 size_t lo, hi, mid; local 346 mid = fde_count - 1; 349 else if (data->pc < table[mid].initial_loc + data_base) 352 hi = mid; 356 mid = (lo + hi) / 2; 357 if (data->pc < table[mid].initial_loc + data_base) 358 hi = mid; 359 else if (data->pc >= table[mid + 1].initial_loc + data_base) 360 lo = mid + 1; 368 f = (fde *) (table[mid] [all...] |
/freebsd-11-stable/contrib/gcc/config/ia64/ |
H A D | fde-glibc.c | 103 size_t mid = (lo + hi) / 2; local 105 f = f_base + mid; 107 hi = mid; 109 lo = mid + 1;
|
/freebsd-11-stable/sys/netinet/ |
H A D | sctp_indata.h | 46 uint32_t mid, uint8_t flags, 50 #define sctp_build_readq_entry_mac(_ctl, in_it, context, net, tsn, ppid, sid, flags, dm, tfsn, mid) do { \ 57 (_ctl)->mid = mid; \
|
/freebsd-11-stable/sys/dev/vt/ |
H A D | vt_font.c | 52 int min, mid, max; local 72 mid = (min + max) / 2; 73 if (src < map[mid].vfm_src) 74 max = mid - 1; 75 else if (src > map[mid].vfm_src + map[mid].vfm_len) 76 min = mid + 1; 78 return (src - map[mid].vfm_src + map[mid].vfm_dst);
|
/freebsd-11-stable/contrib/wpa/src/eap_common/ |
H A D | eap_pax_common.c | 126 * @mid: Buffer for the derived Method ID 130 u8 *mk, u8 *ck, u8 *ick, u8 *mid) 140 e, 2 * EAP_PAX_RAND_LEN, EAP_PAX_MID_LEN, mid)) 147 wpa_hexdump_key(MSG_MSGDUMP, "EAP-PAX: MID", mid, EAP_PAX_MID_LEN); 129 eap_pax_initial_key_derivation(u8 mac_id, const u8 *ak, const u8 *e, u8 *mk, u8 *ck, u8 *ick, u8 *mid) argument
|
/freebsd-11-stable/sys/sparc64/sparc64/ |
H A D | mp_machdep.c | 128 static void ap_count(phandle_t node, u_int mid, u_int cpu_impl); 129 static void ap_start(phandle_t node, u_int mid, u_int cpu_impl); 132 u_int mid, u_int cpu_impl)); 167 foreach_ap(phandle_t node, void (*func)(phandle_t node, u_int mid, argument 196 if (portid == PCPU_GET(mid)) 219 ap_count(phandle_t node __unused, u_int mid __unused, u_int cpu_impl __unused) 293 cpuid_to_mid[curcpu] = PCPU_GET(mid); 302 ap_start(phandle_t node, u_int mid, u_int cpu_impl) argument 340 cpuid_to_mid[cpuid] = mid; 352 pc->pc_mid = mid; 580 u_int mid; local 627 u_int mid; local 725 u_int busy, busynack, mid; local [all...] |
/freebsd-11-stable/sys/sys/ |
H A D | imgact_aout.h | 44 #define N_SETMAGIC(ex,mag,mid,flag) \ 46 (((mid) & 0x03ff) << 16) | \ 55 #define N_SETMAGIC_NET(ex,mag,mid,flag) \ 56 ( (ex).a_midmag = htonl( (((flag)&0x3f)<<26) | (((mid)&0x03ff)<<16) \ 113 uint32_t a_midmag; /* flags<<26 | mid<<16 | magic */
|
/freebsd-11-stable/contrib/llvm-project/libunwind/src/ |
H A D | EHHeaderParser.hpp | 117 size_t mid = low + (len / 2); local 118 tableEntry = hdrInfo.table + mid * tableEntrySize; 123 low = mid; 126 low = mid;
|
/freebsd-11-stable/contrib/llvm-project/compiler-rt/include/sanitizer/ |
H A D | common_interface_defs.h | 110 /// <c>[beg, end)</c>; the memory <c>[beg, mid)</c> is used to store the 111 /// current elements, and the memory <c>[mid, end)</c> is reserved for future 112 /// elements (<c>beg <= mid <= end</c>). For example, in 118 /// mid = beg + v.size() * sizeof(v[0]); 123 /// <c>[mid, end)</c> is accessed. Insert this annotation into methods like 125 /// <c>mid</c>(<c><i>old_mid</i></c> and <c><i>new_mid</i></c>). In the initial 126 /// state <c>mid == end</c>, so that should be the final state when the 164 /// <c>[beg, mid)</c> is addressable and <c>[mid, end)</c> is unaddressable. 167 /// <c><i>beg</i></c>, <c><i>mid</ [all...] |
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_interface_internal.h | 66 int __sanitizer_verify_contiguous_container(const void *beg, const void *mid, 70 const void *beg, const void *mid, const void *end);
|
/freebsd-11-stable/contrib/llvm-project/lld/COFF/ |
H A D | ICF.cpp | 113 size_t mid = bound - chunks.begin(); local 117 for (size_t i = begin; i < mid; ++i) 118 chunks[i]->eqClass[(cnt + 1) % 2] = mid; 121 if (mid != end) 124 begin = mid; 204 size_t mid = findBoundary(begin, end); local 205 fn(begin, mid); 206 begin = mid;
|
/freebsd-11-stable/contrib/subversion/subversion/libsvn_subr/ |
H A D | utf_width.c | 79 apr_uint32_t mid; local 84 mid = (min + max) / 2; 85 if (ucs > table[mid].last) 86 min = mid + 1; 87 else if (ucs < table[mid].first) 88 max = mid - 1; /* this is safe because ucs >= table[0].first */
|
/freebsd-11-stable/sys/teken/ |
H A D | teken_wcwidth.h | 21 int mid; local 26 mid = (min + max) / 2; 27 if (ucs > table[mid].last) 28 min = mid + 1; 29 else if (ucs < table[mid].first) 30 max = mid - 1;
|
/freebsd-11-stable/sys/dev/sound/midi/ |
H A D | mpu401.c | 76 struct snd_midi *mid; member in struct:mpu401 148 midi_in(m->mid, b, i); 151 if (midi_out(m->mid, b, 1)) { 194 m->mid = midi_init(&mpu401_class, 0, 0, m); 195 if (!m->mid) 211 retval = midi_uninit(m->mid);
|
/freebsd-11-stable/contrib/binutils/bfd/ |
H A D | elf-eh-frame.c | 1079 unsigned int lo, hi, mid; local 1095 mid = 0; 1098 mid = (lo + hi) / 2; 1099 if (offset < sec_info->entry[mid].offset) 1100 hi = mid; 1102 >= sec_info->entry[mid].offset + sec_info->entry[mid].size) 1103 lo = mid + 1; 1111 if (sec_info->entry[mid].removed) 1116 if (!sec_info->entry[mid] [all...] |