Home
last modified time | relevance | path

Searched refs:minsize_for_tree_index (Results 1 – 25 of 109) sorted by relevance

12345

/dports/misc/minidnn/MiniDNN-525ff216a6b5f576d4d679aee6a4636994bd4f23/include/external/sparsepp/
H A Dspp_dlalloc.h1375 static bindex_t minsize_for_tree_index(bindex_t i) in minsize_for_tree_index() function
1817 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
1818 assert((idx == NTREEBINS - 1) || (tsize < minsize_for_tree_index((idx + 1)))); in do_check_tree()
/dports/devel/cquery/cquery-20180718/third_party/sparsepp/sparsepp/
H A Dspp_dlalloc.h1375 static bindex_t minsize_for_tree_index(bindex_t i) in minsize_for_tree_index() function
1817 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
1818 assert((idx == NTREEBINS - 1) || (tsize < minsize_for_tree_index((idx + 1)))); in do_check_tree()
/dports/lang/gcc6-aux/gcc-6-20180516/libffi/src/
H A Ddlmalloc.c2338 #define minsize_for_tree_index(i) \ macro
2707 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
2708 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); in do_check_tree()
/dports/devel/jna/jna-5.7.0/native/libffi/src/
H A Ddlmalloc.c2343 #define minsize_for_tree_index(i) \ macro
2712 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
2713 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); in do_check_tree()
/dports/lang/gcc12-devel/gcc-12-20211205/libffi/src/
H A Ddlmalloc.c2343 #define minsize_for_tree_index(i) \ macro
2712 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
2713 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); in do_check_tree()
/dports/lang/gcc8/gcc-8.5.0/libffi/src/
H A Ddlmalloc.c2338 #define minsize_for_tree_index(i) \ macro
2707 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
2708 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); in do_check_tree()
/dports/lang/python27/Python-2.7.18/Modules/_ctypes/libffi/src/
H A Ddlmalloc.c2343 #define minsize_for_tree_index(i) \ macro
2712 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
2713 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); in do_check_tree()
/dports/lang/ruby26/ruby-2.6.9/ext/fiddle/libffi-3.2.1/src/
H A Ddlmalloc.c2338 #define minsize_for_tree_index(i) \ macro
2707 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
2708 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); in do_check_tree()
/dports/lang/mono/mono-5.10.1.57/mono/utils/
H A Ddlmalloc.c2268 #define minsize_for_tree_index(i) \ macro
2634 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
2635 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); in do_check_tree()
/dports/devel/sdl12/SDL-1.2.15/src/stdlib/
H A DSDL_malloc.c2291 #define minsize_for_tree_index(i) \ macro
2655 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
2656 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); in do_check_tree()
/dports/lang/gcc10/gcc-10.3.0/libffi/src/
H A Ddlmalloc.c2338 #define minsize_for_tree_index(i) \ macro
2707 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
2708 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); in do_check_tree()
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/libffi/src/
H A Ddlmalloc.c2338 #define minsize_for_tree_index(i) \ macro
2707 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
2708 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); in do_check_tree()
/dports/www/firefox-esr/firefox-91.8.0/js/src/ctypes/libffi/src/
H A Ddlmalloc.c2343 #define minsize_for_tree_index(i) \ macro
2712 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
2713 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); in do_check_tree()
/dports/lang/spidermonkey78/firefox-78.9.0/js/src/ctypes/libffi/src/
H A Ddlmalloc.c2338 #define minsize_for_tree_index(i) \ macro
2707 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
2708 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); in do_check_tree()
/dports/math/reduce/Reduce-svn5758-src/libraries/libffi-for-mac/libffi-3.3/src/
H A Ddlmalloc.c2343 #define minsize_for_tree_index(i) \ macro
2712 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
2713 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); in do_check_tree()
/dports/math/reduce/Reduce-svn5758-src/libraries/libffi/src/
H A Ddlmalloc.c2343 #define minsize_for_tree_index(i) \ macro
2712 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
2713 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); in do_check_tree()
/dports/math/reduce/Reduce-svn5758-src/libraries/libffi-for-mac/libffi-3.3-x86_64/src/
H A Ddlmalloc.c2343 #define minsize_for_tree_index(i) \ macro
2712 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
2713 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); in do_check_tree()
/dports/math/reduce/Reduce-svn5758-src/libraries/libffi-for-mac/libffi-3.3-arm64/src/
H A Ddlmalloc.c2343 #define minsize_for_tree_index(i) \ macro
2712 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
2713 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); in do_check_tree()
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/libffi/src/
H A Ddlmalloc.c2338 #define minsize_for_tree_index(i) \ macro
2707 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
2708 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); in do_check_tree()
/dports/lang/gcc9-devel/gcc-9-20211007/libffi/src/
H A Ddlmalloc.c2338 #define minsize_for_tree_index(i) \ macro
2707 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
2708 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); in do_check_tree()
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/libffi/src/
H A Ddlmalloc.c2338 #define minsize_for_tree_index(i) \ macro
2707 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
2708 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); in do_check_tree()
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/libffi/src/
H A Ddlmalloc.c2338 #define minsize_for_tree_index(i) \ macro
2707 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
2708 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); in do_check_tree()
/dports/math/R-cran-Matching/Matching/inst/extras/
H A Dmalloc.c2245 #define minsize_for_tree_index(i) \ macro
2609 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
2610 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); in do_check_tree()
/dports/math/R/R-4.1.2/src/gnuwin32/
H A Dmalloc.c2279 #define minsize_for_tree_index(i) \ macro
2645 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
2646 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); in do_check_tree()
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/libffi/src/
H A Ddlmalloc.c2338 #define minsize_for_tree_index(i) \ macro
2707 assert(tsize >= minsize_for_tree_index(idx)); in do_check_tree()
2708 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); in do_check_tree()

12345