MCPcopy Create free account

hub / github.com/1a1a11a/libCacheSim / functions

Functions3,238 in github.com/1a1a11a/libCacheSim

↓ 12 callersMethodreset_thresholds
Reset the enlarge and shrink thresholds
libCacheSim/dataStructure/sparsepp/spp.h:419
↓ 12 callersFunctionset_rand_seed
libCacheSim/utils/mymath.c:15
↓ 11 callersFunctionFK_YAML_UNLIKELY
example/cacheHierarchy/fkYAML/node.hpp:7386
↓ 11 callersFunction_wymix
libCacheSim/dataStructure/hash/wyhash.h:59
↓ 11 callersFunctiondestroy
@brief Destroys the existing Node value. This process is recursive if the specified node type is for containers. @param[in] type A Node type to determ
example/cacheHierarchy/fkYAML/node.hpp:12859
↓ 11 callersMethodemplace
libCacheSim/dataStructure/robin_hood.h:1796
↓ 11 callersFunctionfree_cache_obj
libCacheSim/utils/dep/mem.c:128
↓ 11 callersMethodis_inuse
libCacheSim/dataStructure/sparsepp/spp_dlalloc.h:699
↓ 11 callersMethodis_mmapped
libCacheSim/dataStructure/sparsepp/spp_dlalloc.h:700
↓ 11 callersMethodrun
libCacheSim/traceAnalyzer/analyzer.cpp:88
↓ 10 callersMethodclear
libCacheSim/cache/eviction/LRB/lrb.h:258
↓ 10 callersFunctionclose_trace
libCacheSim/include/libCacheSim/reader.h:251
↓ 10 callersFunctioninsert
libCacheSim/dataStructure/splay.c:158
↓ 10 callersMethodoperator[]
libCacheSim/dataStructure/robin_hood.h:1729
↓ 10 callersFunctionrecord_eviction_age
libCacheSim/include/libCacheSim/cache.h:328
↓ 10 callersMethodrun
libCacheSim/bin/dep/oracleTraceGen/oracleReuseTraceGen.h:345
↓ 10 callersFunctions_spp_popcount_default
libCacheSim/dataStructure/sparsepp/spp_utils.h:337
↓ 10 callersFunctionsequence
example/cacheHierarchy/fkYAML/node.hpp:12171
↓ 10 callersMethodset_size_and_pinuse_of_free_chunk
libCacheSim/dataStructure/sparsepp/spp_dlalloc.h:684
↓ 10 callersFunctionsetup_vscsi_reader
test/common.h:131
↓ 10 callersFunctionsize
@brief Get the size of the referenced character sequence. @return The size of the referenced character sequence.
example/cacheHierarchy/fkYAML/node.hpp:2353
↓ 10 callersFunctiontest
(description, testFn)
libCacheSim-node/test.js:36
↓ 10 callersFunctionthrow_exception
libCacheSim/dataStructure/sparsepp/spp.h:93
↓ 10 callersFunctionverify_req
test/test_traceReader.c:26
↓ 9 callersFunctionXXH_memcpy
libCacheSim/dataStructure/hash/xxhash.h:948
↓ 9 callersFunctionXXH_swap64
libCacheSim/dataStructure/hash/xxhash.h:1708
↓ 9 callersFunctionfrom_node
example/cacheHierarchy/fkYAML/node.hpp:11560
↓ 9 callersFunctionmean
libCacheSim/traceAnalyzer/utils/include/utilsMath.h:30
↓ 9 callersMethodne_begin
We'll have versions for our special non-empty iterator too ----------------------------------------------------------
libCacheSim/dataStructure/sparsepp/spp.h:1054
↓ 9 callersMethodpinuse
libCacheSim/dataStructure/sparsepp/spp_dlalloc.h:697
↓ 9 callersFunctionpop_to_parent_node
example/cacheHierarchy/fkYAML/node.hpp:8350
↓ 9 callersFunctionsplay
libCacheSim/dataStructure/splay.c:61
↓ 9 callersFunctionto_node
example/cacheHierarchy/fkYAML/node.hpp:12253
↓ 8 callersFunctionARC_init
* @brief initialize the cache * * @param ccache_params some common cache parameters * @param cache_specific_params cache specific parameters, see p
libCacheSim/cache/eviction/ARC.c:99
↓ 8 callersFunctionLHD_init
* @brief initialize the cache * * @param ccache_params some common cache parameters * @param cache_specific_params cache specific parameters, see p
libCacheSim/cache/eviction/LHD/LHD_Interface.cpp:56
↓ 8 callersFunctionXXH64_mergeRound
libCacheSim/dataStructure/hash/xxhash.h:1791
↓ 8 callersFunction_detect_data_path
test/common.h:61
↓ 8 callersMethodcbegin
libCacheSim/dataStructure/robin_hood.h:1988
↓ 8 callersFunctioncend
@brief Get the iterator to the past-the-end element. (Always constant) @return The iterator to the past-the-end element.
example/cacheHierarchy/fkYAML/node.hpp:2323
↓ 8 callersFunctionconvert_to_lcs
* @brief Convert a trace to lcs format * * @param reader * @param ofilepath * @param sample_ratio * @param output_txt * @param remove_size_chang
libCacheSim/bin/traceUtils/traceConvLCS.cpp:46
↓ 8 callersMethodequal_range
Likewise, equal_range doesn't really make sense for us. Oh well. -----------------------------------------------------------------
libCacheSim/dataStructure/sparsepp/spp.h:3130
↓ 8 callersMethodfind
I hate to duplicate find() like that, but it is significantly faster to not have the intermediate pair -----------------------------------------------
libCacheSim/dataStructure/sparsepp/spp.h:3057
↓ 8 callersMethodget
example/cacheCluster/cacheCluster.cpp:16
↓ 8 callersFunctiongo_back_one_req
* @brief from current line/request, go back one, the next read will * get the current request * * @param reader * @return int */
libCacheSim/traceReader/reader.c:349
↓ 8 callersFunctionpad_request
pad request bytes into a usable size
libCacheSim/dataStructure/sparsepp/spp_dlalloc.h:787
↓ 8 callersFunctionpqueue_pop
libCacheSim/dataStructure/pqueue.c:213
↓ 8 callersFunctionrequest2size
pad request, checking for minimum (but not maximum)
libCacheSim/dataStructure/sparsepp/spp_dlalloc.h:793
↓ 8 callersFunctionsetDispatch
libCacheSim/dataStructure/hash/xxh_x86dispatch.c:624
↓ 8 callersFunctionset_error
example/cacheCluster/libketama/ketama.c:61
↓ 8 callersMethodsize
Functions that tell you about size. Alas, these aren't so useful because our table is always fixed size.
libCacheSim/dataStructure/sparsepp/spp.h:1281
↓ 8 callersMethodswap
Many STL algorithms use swap instead of copy constructors
libCacheSim/dataStructure/sparsepp/spp.h:1255
↓ 8 callersMethodupdate
libCacheSim/cache/eviction/LHD/lhd.cpp:83
↓ 7 callersFunctionHyperbolic_init
end user facing functions * @brief initialize a cache * * @param ccache_params some common cache parameters * @param cache_specific_params cache
libCacheSim/cache/eviction/Hyperbolic.c:43
↓ 7 callersFunctionLFU_init
end user facing functions init, free, get * @brief initialize a LFU cache * * @param ccache_params some common cache parameters * @param cache_sp
libCacheSim/cache/eviction/LFU.c:75
↓ 7 callersFunctionLeCaR_init
* @brief initialize the cache * * @param ccache_params some common cache parameters * @param cache_specific_params cache specific parameters, see p
libCacheSim/cache/eviction/LeCaR.c:101
↓ 7 callersFunctionSieve_init
* @brief initialize cache * * @param ccache_params some common cache parameters * @param cache_specific_params cache specific parameters, see parse
libCacheSim/cache/eviction/Sieve.c:45
↓ 7 callersFunctionXXH_swap32
libCacheSim/dataStructure/hash/xxhash.h:1156
↓ 7 callersFunction_check_parsed_result
libCacheSim/bin/cli_reader_utils.c:73
↓ 7 callersFunctionadd_new_key
@brief Add new key string to the current YAML node. @param key a key string to be added to the current YAML node. @param line The line where the key i
example/cacheHierarchy/fkYAML/node.hpp:8157
↓ 7 callersFunctionappend_obj_to_tail
* append the object to the tail of the doubly linked list * the object is not in the list, otherwise, use move_obj_to_tail * @param head * @param t
libCacheSim/cache/cacheObj.c:210
↓ 7 callersFunctioncal_offset
libCacheSim/traceReader/generalReader/binary.c:26
↓ 7 callersFunctioncal_seg_utility
calculate segment utility, * oracle_obj_sel: if true, the retained objects are chosen using oracle * obj_score, if false, use current obj_score_type
libCacheSim/cache/eviction/GLCache/segment.c:186
↓ 7 callersFunctionconvert_size_to_str
* convert size to an appropriate string with unit, for example 1048576 will be * 1 MiB * @param size * @param str a 8 byte char array */
libCacheSim/utils/mystr.c:20
↓ 7 callersMethoddestroy
libCacheSim/dataStructure/robin_hood.h:2449
↓ 7 callersFunctionformat_to_size
binary ****************/
libCacheSim/traceReader/readerInternal.h:63
↓ 7 callersMethodis_marked
libCacheSim/dataStructure/sparsepp/spp.h:1678
↓ 7 callersFunctionketama_sem_unlock
\brief Unlocks the semaphore. * \param sem_set_id The semaphore handle that you want to unlock. */
example/cacheCluster/libketama/ketama.c:150
↓ 7 callersFunctionlog2_ull
libCacheSim/utils/include/mymath.h:55
↓ 7 callersMethodmaintain
size of childs
libCacheSim/dataStructure/splaytree.hpp:19
↓ 7 callersMethodnext_chunk
Ptr to next or previous physical malloc_chunk.
libCacheSim/dataStructure/sparsepp/spp_dlalloc.h:719
↓ 7 callersMethodrbegin
libCacheSim/dataStructure/sparsepp/spp.h:1851
↓ 7 callersFunctionread_one_req_above
* read one request from reader precede current position, * in other words, read the line above current line, * and currently file points to either t
libCacheSim/traceReader/reader.c:435
↓ 7 callersMethodreset
libCacheSim/dataStructure/sparsepp/spp_timer.h:35
↓ 7 callersFunctionset_error
libCacheSim/dataStructure/ketama/ketama.c:59
↓ 7 callersFunctionswap
libCacheSim/dataStructure/robin_hood.h:660
↓ 7 callersMethodtest_strict
also tests for erased values ----------------------------
libCacheSim/dataStructure/sparsepp/spp.h:1466
↓ 7 callersFunctiontrace_type_str_to_enum
* @brief convert the trace type string to enum * * @param args */
libCacheSim/bin/cli_reader_utils.c:21
↓ 7 callersFunctionunescape_escaped_unicode
example/cacheHierarchy/fkYAML/node.hpp:5701
↓ 7 callersMethodunsafe_get
TODO(csilvers): make protected + friend This is used by sparse_hashtable to get an element from the table when we know it exists.
libCacheSim/dataStructure/sparsepp/spp.h:1292
↓ 6 callersFunctionCacheus_init
* @brief initialize a Cacheus cache * * @param ccache_params some common cache parameters * @param cache_specific_params Cacheus specific parameter
libCacheSim/cache/eviction/Cacheus.c:71
↓ 6 callersFunctionXXH3_mergeAccs
libCacheSim/dataStructure/hash/xxh3.h:1718
↓ 6 callersFunctionXXH_xorshift64
Seems to produce slightly better code on GCC for some reason. */
libCacheSim/dataStructure/hash/xxh3.h:658
↓ 6 callersFunctionalign_as_chunk
chunk associated with aligned address A
libCacheSim/dataStructure/sparsepp/spp_dlalloc.h:780
↓ 6 callersFunctioncal_obj_score
calculate the score of object, the larger score, the more important object is, we should keep it */
libCacheSim/cache/eviction/GLCache/obj.h:46
↓ 6 callersMethodcend
libCacheSim/dataStructure/sparsepp/spp.h:1850
↓ 6 callersMethodclear
libCacheSim/cache/eviction/3LCache/ThreeLCache.h:210
↓ 6 callersMethodclear
It's always nice to be able to clear a table without deallocating it
libCacheSim/dataStructure/sparsepp/spp.h:1269
↓ 6 callersFunctionclone_reader
libCacheSim/traceReader/reader.c:536
↓ 6 callersFunctioncreate_dir
libCacheSim/utils/mysys.c:106
↓ 6 callersFunctionempty
@brief Checks if the referenced character sequence is empty. @return true if empty, false otherwise.
example/cacheHierarchy/fkYAML/node.hpp:2371
↓ 6 callersMethodgetFirst
libCacheSim/dataStructure/robin_hood.h:996
↓ 6 callersMethodget_iter
Needed for hashtables, gets as a ne_iterator. Crashes for empty bcks
libCacheSim/dataStructure/sparsepp/spp.h:2192
↓ 6 callersFunctioninput_adapter
example/cacheHierarchy/fkYAML/node.hpp:9816
↓ 6 callersFunctionparse_reader_params
* @brief parse the reader parameters * * @param reader_params_str * @param params */
libCacheSim/bin/cli_reader_utils.c:88
↓ 6 callersFunctionread_data
* @brief read one piece of data at src according to the format * return the value as int64_t * this limits our format support to int types * * @pa
libCacheSim/traceReader/generalReader/binary.c:180
↓ 6 callersMethodrend
libCacheSim/dataStructure/sparsepp/spp.h:1854
↓ 6 callersMethodset_context_state
@brief Toggles the context state between flow and block. @param is_flow_context true: flow context, false: block context
example/cacheHierarchy/fkYAML/node.hpp:3537
↓ 6 callersMethodset_free_with_pinuse
Set size, pinuse bit, foot, and clear next pinuse
libCacheSim/dataStructure/sparsepp/spp_dlalloc.h:739
↓ 6 callersFunctionspp_is_aligned
libCacheSim/dataStructure/sparsepp/spp_dlalloc.h:279
↓ 6 callersFunctionstdev
libCacheSim/traceAnalyzer/utils/include/utilsMath.h:58
← previousnext →101–200 of 3,238, ranked by callers