/freebsd-11-stable/contrib/libarchive/libarchive/ |
H A D | archive_read_support_format_zip.c | 688 * 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 D | archive_read_support_format_7zip.c | 527 * 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/sqlite3/ |
H A D | sqlite3.c | 1380 ** where the order in which destructors are called is arbitrary. 1478 ** here in order to indicate success or failure. 1661 ** information is written to disk in the same order as calls 1837 ** information is written to disk in the same order as calls 1896 ** file space based on this hint in order to help writes to the database 1956 ** windows [VFS] in order to provide robustness in the presence of 1980 ** in order for the database to be readable. The fourth parameter to 2051 ** shortly after it is opened in order to provide a custom VFS with access 2054 ** to a function of type (int (*)(void *)). In order to invoke the connection's 2109 ** circumstances in order t [all...] |
/freebsd-11-stable/contrib/unbound/ |
H A D | config.guess | 177 # Note: order is significant - the case branches are not exclusive. 756 /* The order matters, because CPU_IS_HP_MC68K erroneously returns
|
/freebsd-11-stable/contrib/subversion/subversion/svn/ |
H A D | filesize.c | 49 /* Get the index of the order of magnitude of the given SIZE. 53 const filesize_order_t *order, 62 if (abs_size > order[index].mask) 73 const filesize_order_t *order, 85 const char *const suffix = (long_units ? order[index].suffix 86 : order[index].short_suffix); 120 static const filesize_order_t order[] = 130 static const apr_size_t order_size = sizeof(order) / sizeof(order[0]); 133 apr_size_t index = get_order_index(abs_size, order, order_siz 50 get_order_index(svn_filesize_t abs_size, const filesize_order_t *order, apr_size_t order_size) argument 69 format_size(double human_readable_size, svn_boolean_t long_units, const filesize_order_t *order, apr_size_t index, apr_pool_t *result_pool) argument 118 static const filesize_order_t order[] = local 164 static const filesize_order_t order[] = local [all...] |
/freebsd-11-stable/sys/contrib/ipfilter/netinet/ |
H A D | radix_ipf.c | 60 /* lastp is not NULL. The bit count is performed using network byte order */ 501 /* ipf_rx_insert() will attempt to allocate memory in order for netmask to */ 1470 int *order; local 1478 order = calloc(nitems, sizeof(*order)); 1480 memset(order, 0xff, nitems * sizeof(*order)); 1481 order[21] = 21; 1486 if (order[j] == choice) 1489 order[ 1500 int *order; local 1519 int *order; local [all...] |
/freebsd-11-stable/contrib/ipfilter/ |
H A D | radix_ipf.c | 58 /* lastp is not NULL. The bit count is performed using network byte order */ 501 /* ipf_rx_insert() will attempt to allocate memory in order for netmask to */ 1470 int *order; local 1478 order = calloc(nitems, sizeof(*order)); 1480 memset(order, 0xff, nitems * sizeof(*order)); 1481 order[21] = 21; 1486 if (order[j] == choice) 1489 order[ 1500 int *order; local 1517 int *order; local [all...] |
/freebsd-11-stable/sys/dev/mlx4/mlx4_core/ |
H A D | mlx4.h | 967 u32 __mlx4_alloc_mtt_range(struct mlx4_dev *dev, int order); 968 void __mlx4_free_mtt_range(struct mlx4_dev *dev, u32 first_seg, int order);
|
/freebsd-11-stable/sys/compat/linuxkpi/common/include/linux/ |
H A D | bitops.h | 106 int order; local 108 order = fls(count) - 1; 110 order++; 111 return order; 345 linux_reg_op(unsigned long *bitmap, int pos, int order, int reg_op) argument 356 nbits_reg = 1 << order;
|
H A D | bitmap.h | 176 bitmap_find_free_region(unsigned long *bitmap, int bits, int order) argument 181 for (pos = 0; (end = pos + (1 << order)) <= bits; pos = end) { 182 if (!linux_reg_op(bitmap, pos, order, REG_OP_ISFREE)) 184 linux_reg_op(bitmap, pos, order, REG_OP_ALLOC); 191 bitmap_allocate_region(unsigned long *bitmap, int pos, int order) argument 193 if (!linux_reg_op(bitmap, pos, order, REG_OP_ISFREE)) 195 linux_reg_op(bitmap, pos, order, REG_OP_ALLOC); 200 bitmap_release_region(unsigned long *bitmap, int pos, int order) argument 202 linux_reg_op(bitmap, pos, order, REG_OP_RELEASE);
|
/freebsd-11-stable/sys/dev/mlx5/mlx5_ib/ |
H A D | mlx5_ib_mr.c | 63 static int order2idx(struct mlx5_ib_dev *dev, int order) argument 67 if (order < cache->ent[0].order) 70 return order - cache->ent[0].order; 75 return ((u64)1 << mr->order) * MLX5_ADAPTER_PAGE_SIZE >= 113 int c = order2idx(dev, mr->order); 158 int npages = 1 << ent->order; 180 mr->order = ent->order; 320 alloc_cached_mr(struct mlx5_ib_dev *dev, int order) argument 540 use_umr(int order) argument 628 mr_umem_get(struct ib_pd *pd, u64 start, u64 length, int access_flags, int *npages, int *page_shift, int *ncont, int *order) argument 669 reg_umr(struct ib_pd *pd, struct ib_umem *umem, u64 virt_addr, u64 len, int npages, int page_shift, int order, int access_flags) argument 971 int order; local 1061 rereg_umr(struct ib_pd *pd, struct mlx5_ib_mr *mr, u64 virt_addr, u64 length, int npages, int page_shift, int order, int access_flags, int flags) argument 1144 int order = 0; local [all...] |
H A D | mlx5_ib.h | 71 /* 5 is chosen in order to be compatible with old versions of libmlx5 */ 503 int order; member in struct:mlx5_ib_mr 550 u32 order; member in struct:mlx5_cache_ent 888 int *ncont, int *order);
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Sema/ |
H A D | SemaExpr.cpp | 1104 int order = S.Context.getFloatingTypeOrder(LHSType, RHSType); local 1105 if (order > 0) { 1110 assert(order < 0 && "illegal float comparison"); 1194 int order = S.Context.getIntegerTypeOrder(LHSType, RHSType); local 1199 if (order >= 0) { 1205 } else if (order != (LHSSigned ? 1 : -1)) { 5516 /// space as input. In order to do this, we need to replace the 8981 // If the scalar is constant and is of a higher order and has more active 8999 // order is greater than that of the vector element type. 11765 // diagnostics in field nesting order [all...] |
/freebsd-11-stable/sys/conf/ |
H A D | kmod.mk | 43 # order to use this firmware. See /usr/share/doc/legal
|
/freebsd-11-stable/contrib/llvm-project/openmp/runtime/src/ |
H A D | kmp_os.h | 1014 #define KMP_ATOMIC_LD(p, order) (p)->load(std::memory_order_##order) 1015 #define KMP_ATOMIC_OP(op, p, v, order) (p)->op(v, std::memory_order_##order)
|
/freebsd-11-stable/sys/kern/ |
H A D | init_main.c | 244 * their subsystem (primary key) and order (secondary key). 250 (*sipp)->order <= (*xipp)->order)) 440 **** convinced that they can not be safely combined, but their order of 479 schedinit(); /* scheduler gets its house in order */
|
/freebsd-11-stable/usr.sbin/efibootmgr/ |
H A D | efibootmgr.c | 77 char *order; member in struct:_bmgr_opts 98 {"bootorder", required_argument, NULL, 'o'}, /* set order */ 250 free(opts.order); 251 opts.order = strdup(optarg); 276 if (opts.order && !(opts.order)) 340 set_boot_order(char *order) argument 348 cp = order; 358 cp = strdup(order); 369 err(1, "Unabke to set BootOrder to %s", order); [all...] |
/freebsd-11-stable/contrib/llvm-project/lld/ELF/ |
H A D | Writer.cpp | 885 // order: R, RX, RWX, RW. This order is based on the following 939 // that we would like to make sure appear is a specific order to maximize 998 // executable. The runtime needs these symbols in order to resolve 1143 // one in charge of deciding the order of the sections. 1205 // Builds section order for handling --symbol-ordering-file. 1265 // Sorts the sections in ISD according to the provided section order. 1268 const DenseMap<const InputSectionBase *, int> &order) { 1274 auto i = order.find(isec); 1275 if (i == order 1267 sortISDBySectionOrder(InputSectionDescription *isd, const DenseMap<const InputSectionBase *, int> &order) argument 1330 sortSection(OutputSection *sec, const DenseMap<const InputSectionBase *, int> &order) argument 1383 DenseMap<const InputSectionBase *, int> order = buildSectionOrder(); local [all...] |
H A D | OutputSections.cpp | 159 // that it replaces. It then finalizes each synthetic section in order 218 llvm::function_ref<int(InputSectionBase *s)> order) { 221 v.push_back({order(s), s}); 238 void OutputSection::sort(llvm::function_ref<int(InputSectionBase *s)> order) { argument 242 sortByOrder(isd->sections, order); 363 // We must preserve the link order dependency of sections with the 479 // We want to keep the original order if the priorities are the same 480 // because the compiler keeps the original initialization order in a 217 sortByOrder(MutableArrayRef<InputSection *> in, llvm::function_ref<int(InputSectionBase *s)> order) argument
|
/freebsd-11-stable/share/mk/ |
H A D | src.libnames.mk | 207 # 2nd+ order consumers. Auto-generating this would be better.
|
/freebsd-11-stable/contrib/ntp/ntpd/ |
H A D | ntp_request.c | 921 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/sys/amd64/amd64/ |
H A D | machdep.c | 107 #error KDB must be enabled in order for DDB to work! 1647 * icu_lock: in order to allow an interrupt to occur in a critical
|
/freebsd-11-stable/usr.bin/svn/lib/libapr/ |
H A D | apr.h | 404 #error Unknown byte order.
|
/freebsd-11-stable/contrib/subversion/subversion/libsvn_wc/ |
H A D | wc-queries.sql | 137 /* Getting rows in an advantageous order using 154 the same order as returned by STMT_SELECT_NODE_CHILDREN_INFO, because
|
/freebsd-11-stable/contrib/subversion/subversion/libsvn_fs_x/ |
H A D | index.c | 467 * in little endian byte order. 64 bits is the largest portable integer 500 * reading the external LE byte order and convert it into host byte order. 3537 * _descending_ order. May be NULL if ENTRY->ITEM_COUNT < 2. */ 3538 svn_fs_x__id_t **order; member in struct:sub_item_ordered_t 3542 * Used to sort sub_item_ordered_t::order 3569 lhs_part = lhs->order ? lhs->order[lhs->entry->item_count - 1] 3571 rhs_part = rhs->order ? rhs->order[rh [all...] |