Searched refs:order (Results 251 - 275 of 313) sorted by relevance

<<111213

/freebsd-11-stable/sys/dev/firewire/
H A Dsbp.c2650 int order = 0; local
2677 else if (order > 0) {
2701 order++;
2704 if (ocb && order > 0) {
2706 "%s:%s unordered execution order:%d\n",
2707 __func__, sdev->bustgtlun, order);
/freebsd-11-stable/contrib/libarchive/libarchive/
H A Darchive_read_support_format_zip.c688 * n bytes - feature bitmap: first byte has low-order
689 * 7 bits. If high-order bit is set, a subsequent
1652 * So, in order to use the "lzma alone" decoder for the zipx lzma
1924 uint32_t order; local
1959 order = (val & 15) + 1;
1963 if(order < 2 || restore_method > 2) {
1965 "Invalid parameter set in PPMd8 stream (order=%" PRId32 ", "
1966 "restore=%" PRId32 ")", order, restore_method);
1989 __archive_ppmd8_functions.Ppmd8_Init(&zip->ppmd8, order,
4010 /* Get next entry in local header offset order
[all...]
H A Darchive_read_support_format_7zip.c527 * Magic Code, so we should do this in order not to
1232 unsigned order; local
1246 order = coder1->properties[0];
1248 if (order < PPMD7_MIN_ORDER || order > PPMD7_MAX_ORDER ||
1263 &zip->ppmd7_context, order);
2500 * the uncompressed buffer in order not to
2887 * in order to parse the header correctly.
3555 * Reset a stream reader in order to read the main stream
/freebsd-11-stable/contrib/ntp/ntpd/
H A Dntp_request.c921 ip->order[i] = (u_char)((pp->filter_nextpt +
924 if (ip->order[i] >= NTP_SHIFT)
925 ip->order[i] -= NTP_SHIFT;
1641 * restriction list in reverse order.
1673 * restriction list in reverse order.
1721 * The restriction lists are kept sorted in the reverse order
1723 * dump each list in reverse order. The workers take care of that.
/freebsd-11-stable/contrib/binutils/bfd/
H A Delfxx-ia64.c1541 containing ELF relocation info. We need this hack in order to
1774 struct bfd_link_order *order = m->sections[i]->map_head.link_order;
1776 while (order != NULL)
1778 if (order->type == bfd_indirect_link_order)
1780 asection *is = order->u.indirect.section;
1788 order = order->next;
1770 struct bfd_link_order *order = m->sections[i]->map_head.link_order; local
/freebsd-11-stable/usr.sbin/ntp/ntpdc/
H A Dnl.c188 printf("offsetof(order) = %d\n",
189 (int) offsetof(struct info_peer, order));
/freebsd-11-stable/crypto/openssl/crypto/bn/asm/
H A Dsparct4-mont.pl69 # hardly measurable. But in order to mitigate this problem for higher
887 st $t2, [$rp-4] ! reverse order
1139 st $t2, [$rp-4] ! reverse order
/freebsd-11-stable/crypto/openssl/crypto/ec/
H A Decp_nistp224.c81 * group order size for the elliptic curve, and we also use this type for
1515 if (!BN_nnmod(tmp_scalar, p_scalar, &group->order, ctx)) {
1567 if (!BN_nnmod(tmp_scalar, scalar, &group->order, ctx)) {
H A Decp_nistp256.c259 /* In order to prevent underflow, we subtract from 0 mod p. */
276 * In order to prevent underflow, we add 0 mod p before subtracting.
308 * In order to prevent underflow, we add 0 mod p before subtracting.
419 * In order to make space in tmp[3] for the carry from 2 -> 3, we
2107 if (!BN_nnmod(tmp_scalar, p_scalar, &group->order, ctx)) {
2161 if (!BN_nnmod(tmp_scalar, scalar, &group->order, ctx)) {
H A Decp_nistp521.c295 /* In order to prevent underflow, we subtract from 0 mod p. */
320 * In order to prevent underflow, we add 0 mod p before subtracting.
346 * In order to prevent underflow, we add 64p mod p (which is equivalent
377 * In order to prevent underflow, we add 0 mod p before subtracting.
946 * In order to test that |out| >= 2^521-1 we need only test if out[8] >>
1919 if (!BN_nnmod(tmp_scalar, p_scalar, &group->order, ctx)) {
1971 if (!BN_nnmod(tmp_scalar, scalar, &group->order, ctx)) {
/freebsd-11-stable/lib/libc/gen/
H A Dgetpwent.c1211 int rv, order; local
1218 rv = yp_order(domain, buffer, &order);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/Windows/
H A DPath.inc468 // it is mapped into memory (e.g. using MemoryBuffer). Rename it in order to
/freebsd-11-stable/contrib/llvm-project/lld/COFF/
H A DDriver.cpp353 // same /EXPORT options. In order to save cost of parsing them,
879 // Parse an /order file. If an option is given, the linker places
880 // COMDAT sections in the same order as their names appear in the
886 error("malformed /order option: '@' missing");
902 // Parse a file. An order file contains one symbol per line.
903 // All symbols that were not present in a given order file are
912 warn("/order:" + arg + ": missing symbol: " + s + " [LNK4037]");
915 config->order[s] = INT_MIN + config->order.size();
1284 // present in the argument list in order t
[all...]
H A DWriter.cpp117 // lowest 4 bytes usually being the timestamp in little-endian order).
643 // For /order.
648 return config->order.lookup(sec->sym->getName());
681 // symbol, and one trailer object. In order for the .idata tables/lists to
688 // Make sure all .idata$* section chunks are mapped as RDATA in order to
706 // if SC1, order them ascending. If SC2 or both null,
737 // The loader assumes a specific order of data.
738 // Add each type in the correct order.
810 // Try to match the section order used by link.exe.
852 // Process an /order optio
[all...]
/freebsd-11-stable/share/mk/
H A Dsrc.libnames.mk207 # 2nd+ order consumers. Auto-generating this would be better.
/freebsd-11-stable/sys/conf/
H A Dkmod.mk43 # order to use this firmware. See /usr/share/doc/legal
/freebsd-11-stable/sys/dev/drm/
H A DdrmP.h364 int order; /* log-base-2(total) */ member in struct:drm_buf
/freebsd-11-stable/crypto/openssl/crypto/
H A Dsparccpuid.S247 ! is slow (documented to be 6 cycles on T2) and the core is in-order
/freebsd-11-stable/contrib/mdocml/
H A Dmdoc_validate.c1683 int order; local
1800 order = strcmp(prev_Er, nnext->string);
1801 if (order > 0)
1806 else if (order == 0)
1960 * The full `Rs' block needs special handling to order the
1962 * and correctly order it. This is an insertion sort.
1967 /* Determine order number of this child. */
2000 /* Determine order of `prev'. */
2287 * follow a conventional order and may only appear in certain
2341 * out of order
[all...]
/freebsd-11-stable/contrib/openpam/
H A Dconfig.guess156 # Note: order is significant - the case branches are not exclusive.
719 /* The order matters, because CPU_IS_HP_MC68K erroneously returns
1400 pertinent to <config-patches@gnu.org> in order to provide the needed
/freebsd-11-stable/contrib/gcc/config/i386/
H A Di386.c2176 /* If we're doing fast math, we don't care about comparison order
3158 in order to implement the type. By computing the natural mode, we'll
5742 The later is there in order that the unwinder can see where it
10141 /* ??? In order to make all comparisons reversible, we do all comparisons
12211 in the right order. Maximally three parts are generated. */
12365 int the correct order; operands 5-7 contain the output values. */
12421 /* We need to do copy in the right order in case an address register
12509 /* Choose correct order to not overwrite the source before it is copied. */
15030 swap_comparison in order to support it. */
16604 /* Note the arg order i
19400 rtx order[4]; local
[all...]
/freebsd-11-stable/contrib/openbsm/config/
H A Dconfig.guess139 # Note: order is significant - the case branches are not exclusive.
653 /* The order matters, because CPU_IS_HP_MC68K erroneously returns
1374 pertinent to <config-patches@gnu.org> in order to provide the needed
/freebsd-11-stable/contrib/ncurses/
H A Dconfig.guess156 # Note: order is significant - the case branches are not exclusive.
704 /* The order matters, because CPU_IS_HP_MC68K erroneously returns
1525 pertinent to <config-patches@gnu.org> in order to provide the needed
/freebsd-11-stable/contrib/binutils/
H A Dconfig.guess142 # Note: order is significant - the case branches are not exclusive.
664 /* The order matters, because CPU_IS_HP_MC68K erroneously returns
1483 pertinent to <config-patches@gnu.org> in order to provide the needed
/freebsd-11-stable/contrib/libreadline/support/
H A Dconfig.guess137 # Note: order is significant - the case branches are not exclusive.
656 /* The order matters, because CPU_IS_HP_MC68K erroneously returns
1370 pertinent to <config-patches@gnu.org> in order to provide the needed

Completed in 510 milliseconds

<<111213