/freebsd-current/sys/compat/linuxkpi/common/include/linux/ |
H A D | irqdomain.h | 8 #include <linux/radix-tree.h>
|
H A D | xarray.h | 30 #include <linux/radix-tree.h> 64 * around the radix tree implementation.
|
/freebsd-current/tools/test/stress2/misc/ |
H A D | radix.sh | 29 # Consume VM radix nodes 40 log=/tmp/radix.log 44 sed '1,/^EOF/d' < $odir/$0 > $dir/radix.c 45 mycc -o radix -Wall -Wextra radix.c || exit 1 46 rm -f radix.c 56 timeout 20m /tmp/radix $parallel > $log; s=$? 68 cat /tmp/radix.log 70 rm -f /tmp/radix $log 84 radix tre [all...] |
/freebsd-current/sys/kern/ |
H A D | subr_blist.c | 30 * BLIST.C - Bitmap allocator/deallocator, using a radix tree with hinting 37 * A radix tree controls access to pieces of the bitmap, and includes 39 * contiguous free blocks in the subtree rooted at that node. A radix 55 * the general radix structure optimizes both allocations and frees. The 56 * radix tree should be able to operate well no matter how much 64 * LAYOUT: The radix tree is laid out recursively using a linear array. 77 * radix is large enough that this restriction does not effect the swap 133 int maxcount, u_daddr_t radix); 136 u_daddr_t radix); 137 static void blst_copy(blmeta_t *scan, daddr_t blk, daddr_t radix, 168 radix_to_skip(daddr_t radix) argument 208 u_daddr_t nodes, radix; local 512 daddr_t i, nodes, radix; local 589 u_daddr_t radix; local 771 blst_meta_alloc(blmeta_t *scan, daddr_t cursor, int *count, int maxcount, u_daddr_t radix) argument 867 blst_meta_free(blmeta_t *scan, daddr_t freeBlk, daddr_t count, u_daddr_t radix) argument 911 blst_copy(blmeta_t *scan, daddr_t blk, daddr_t radix, blist_t dest, daddr_t count) argument 990 blst_meta_fill(blmeta_t *scan, daddr_t allocBlk, daddr_t count, u_daddr_t radix) argument 1026 blst_radix_print(blmeta_t *scan, daddr_t blk, daddr_t radix, int tab) argument [all...] |
/freebsd-current/usr.bin/file2c/ |
H A D | file2c.c | 28 int c, count, linepos, maxcount, pretty, radix; local 32 radix = 10; 42 radix = 16; 74 switch (radix) {
|
/freebsd-current/sbin/routed/ |
H A D | Makefile | 6 SRCS= if.c input.c main.c output.c parms.c radix.c rdisc.c table.c trace.c
|
/freebsd-current/contrib/less/ |
H A D | lessecho.c | 68 static long lstrtol(char *s, char **pend, int radix) argument 88 /* Determine radix if caller does not specify. */ 89 if (radix == 0) 91 radix = 10; 97 radix = 16; 101 radix = 8; 118 if (v >= radix) 120 n = n * radix + v;
|
H A D | output.c | 474 void funcname(type num, char *buf, int radix) \ 482 *--s = "0123456789ABCDEF"[num % radix]; \ 483 } while ((num /= radix) != 0); \ 496 type funcname(char *buf, char **ebuf, int radix) \ 503 if (digit < 0 || digit >= radix) break; \ 504 v |= ckd_mul(&val, val, radix); \ 519 static int funcname(type num, int radix) \ 522 typetoa(num, buf, radix); \
|
/freebsd-current/contrib/elftoolchain/size/ |
H A D | size.c | 72 static enum radix_style radix = RADIX_DECIMAL; variable in typeref:enum:radix_style 90 { "radix", required_argument, &size_option, OPT_RADIX }, 149 radix = RADIX_DECIMAL; 152 radix = RADIX_OCTAL; 158 radix = RADIX_HEX; 176 radix = RADIX_OCTAL; 178 radix = RADIX_DECIMAL; 180 radix = RADIX_HEX; 182 warnx("unsupported radix \"%s\".", 371 tbl_print_num(raw_size, radix, [all...] |
/freebsd-current/sys/ofed/drivers/infiniband/core/ |
H A D | rdma_core.h | 41 #include <linux/radix-tree.h> 84 * Depending on ID the slot pointer in the radix tree points at one of these 115 /* radix tree contains struct uverbs_api_* pointers */ 116 struct radix_tree_root radix; member in struct:uverbs_api 139 res = radix_tree_lookup(&uapi->radix, uapi_key_obj(object_id));
|
H A D | ib_uverbs_uapi.c | 27 rc = radix_tree_insert(&uapi->radix, key, elm); 50 elm = radix_tree_lookup(&uapi->radix, key); 366 radix_tree_for_each_slot (slot, &uapi->radix, &iter, 428 radix_tree_for_each_slot (slot, &uapi->radix, &iter, 0) { 458 radix_tree_for_each_slot (slot, &uapi->radix, &iter, 0) { 477 radix_tree_for_each_slot (slot, &uapi->radix, &iter, start) { 481 radix_tree_iter_delete(&uapi->radix, &iter, slot); 534 radix_tree_for_each_slot (slot, &uapi->radix, &iter, starting_key) { 570 radix_tree_iter_delete(&uapi->radix, &iter, slot); 650 INIT_RADIX_TREE(&uapi->radix, GFP_KERNE [all...] |
/freebsd-current/usr.bin/m4/ |
H A D | tokenizer.l | 42 radix 0[rR][0-9]+:[0-9a-zA-Z]+ 49 {radix} { if (mimic_gnu) {
|
/freebsd-current/stand/ficl/ |
H A D | vm.c | 662 char *ltoa( FICL_INT value, char *string, int radix ) 665 int sign = ((radix == 10) && (value < 0)); 668 assert(radix > 1); 669 assert(radix < 37); 672 pwr = isPowerOfTwo((FICL_UNS)radix); 697 result = ficlLongDiv(v, (FICL_UNS)radix); 716 char *ultoa(FICL_UNS value, char *string, int radix ) 722 assert(radix > 1); 723 assert(radix < 37); 736 result = ficlLongDiv(ud, (FICL_UNS)radix); [all...] |
/freebsd-current/contrib/ncurses/test/ |
H A D | back_ground.c | 50 int radix = 0; local 54 radix = 16; 56 result = strtol(value, &next, radix);
|
/freebsd-current/contrib/elftoolchain/strings/ |
H A D | strings.c | 78 static enum radix_style radix; variable in typeref:enum:radix_style 87 { "radix", required_argument, NULL, 't'}, 156 radix = RADIX_OCTAL; 161 radix = RADIX_DECIMAL; 163 radix = RADIX_OCTAL; 165 radix = RADIX_HEX; 406 switch (radix) { 454 -t R | --radix=R Print offsets using the radix named by 'R'.\n\
|
/freebsd-current/contrib/ldns/ldns/ |
H A D | ldns.h | 123 #include <ldns/radix.h>
|
/freebsd-current/lib/libldns/ |
H A D | Makefile | 16 host2wire.c keys.c net.c packet.c parse.c radix.c rbtree.c rdata.c \
|
/freebsd-current/contrib/llvm-project/libcxx/include/__random/ |
H A D | clamp_to_integral.h | 32 static_assert(numeric_limits<_FloatT>::radix == 2, "FloatT has incorrect radix");
|
/freebsd-current/stand/libsa/ |
H A D | printf.c | 57 static int kvprintf(char const *fmt, kvprintf_fn_t *func, void *arg, int radix, va_list ap); 243 kvprintf(char const *fmt, kvprintf_fn_t *func, void *arg, int radix, va_list ap) argument 279 if (radix < 2 || radix > 36) 280 radix = 10; 432 base = radix;
|
/freebsd-current/contrib/llvm-project/llvm/tools/llvm-strings/ |
H A D | llvm-strings.cpp | 72 enum radix { none, octal, hexadecimal, decimal }; enum 73 static radix Radix; 162 reportCmdLineError("--radix value should be one of: '' (no offset), 'o' "
|
/freebsd-current/contrib/llvm-project/llvm/lib/Support/ |
H A D | APInt.cpp | 49 inline static unsigned getDigit(char cdigit, uint8_t radix) { argument 52 if (radix == 16 || radix == 36) { 58 if (r <= radix - 11U) 62 if (r <= radix - 11U) 65 radix = 10; 69 if (r < radix) 115 APInt::APInt(unsigned numbits, StringRef Str, uint8_t radix) argument 117 fromString(numbits, Str, radix); 545 unsigned APInt::getBitsNeeded(StringRef str, uint8_t radix) { [all...] |
/freebsd-current/libexec/rtld-elf/ |
H A D | rtld_printf.c | 122 kvprintf(char const *fmt, struct snprintf_arg *arg, int radix, va_list ap) argument 141 if (radix < 2 || radix > 36) 142 radix = 10; 293 base = radix;
|
/freebsd-current/contrib/llvm-project/lldb/source/Core/ |
H A D | DumpDataExtractor.cpp | 100 bool is_signed, unsigned radix) { 103 std::string apint_str = toString(*apint, radix, is_signed); 104 switch (radix) { 446 const unsigned radix = 2; local 447 offset = DumpAPInt(s, DE, offset, item_byte_size, is_signed, radix); 506 const unsigned radix = 10; local 507 offset = DumpAPInt(s, DE, offset, item_byte_size, is_signed, radix); 518 const unsigned radix = 10; local 519 offset = DumpAPInt(s, DE, offset, item_byte_size, is_signed, radix); 530 const unsigned radix local 98 DumpAPInt(Stream *s, const DataExtractor &data, lldb::offset_t offset, lldb::offset_t byte_size, bool is_signed, unsigned radix) argument [all...] |
/freebsd-current/contrib/llvm-project/clang/lib/Lex/ |
H A D | LiteralSupport.cpp | 943 if (*s == '0') { // parse radix 948 radix = 10; 1188 /// parsing. If it detects a floating point number, the radix is set to 10. 1190 assert((radix == 8 || radix == 10) && "Unexpected radix"); 1199 << StringRef(s, 1) << (radix == 8 ? 1 : 0); 1207 radix = 10; 1216 radix = 10; 1285 /// radix et [all...] |
/freebsd-current/contrib/bearssl/tools/ |
H A D | names.c | 787 int radix; local 793 radix = 16; 796 radix = 10; 808 if (d < 0 || d >= radix) { 812 z = acc * (size_t)radix + (size_t)d; 813 if (z < (size_t)d || (z / (size_t)radix) != acc
|