Home
last modified time | relevance | path

Searched refs:find_free (Results 1 – 25 of 138) sorted by relevance

123456

/dports/databases/soci/soci-4.0.1/src/core/
H A Dconnection-pool.cpp26 bool find_free(std::size_t & pos) in find_free() function
112 while (pimpl_->find_free(pos) == false) in try_lease()
188 bool find_free(std::size_t & pos) in find_free() function
259 if (!pimpl_->find_free(pos)) in try_lease()
/dports/devel/sunpromake/schily-2021-09-18/libfind/
H A Dfind_main.c200 find_free(Tree, &fa);
207 find_free(Tree, &fa);
216 find_free(Tree, &fa);
276 find_free(Tree, &fa);
H A Dlibfind-mapvers41 find_free; #
60 find_free; # find.c
/dports/devel/smake/schily-2021-09-18/libfind/
H A Dfind_main.c200 find_free(Tree, &fa);
207 find_free(Tree, &fa);
216 find_free(Tree, &fa);
276 find_free(Tree, &fa);
H A Dlibfind-mapvers41 find_free; #
60 find_free; # find.c
/dports/devel/schilybase/schily-2021-09-18/libfind/
H A Dfind_main.c200 find_free(Tree, &fa);
207 find_free(Tree, &fa);
216 find_free(Tree, &fa);
276 find_free(Tree, &fa);
H A Dlibfind-mapvers41 find_free; #
60 find_free; # find.c
/dports/net/rscsi/schily-2021-09-18/libfind/
H A Dfind_main.c200 find_free(Tree, &fa);
207 find_free(Tree, &fa);
216 find_free(Tree, &fa);
276 find_free(Tree, &fa);
H A Dlibfind-mapvers41 find_free; #
60 find_free; # find.c
/dports/archivers/star/schily-2021-09-18/libfind/
H A Dfind_main.c200 find_free(Tree, &fa);
207 find_free(Tree, &fa);
216 find_free(Tree, &fa);
276 find_free(Tree, &fa);
H A Dlibfind-mapvers41 find_free; #
60 find_free; # find.c
/dports/sysutils/cdrtools/schily-2021-09-18/libfind/
H A Dfind_main.c200 find_free(Tree, &fa);
207 find_free(Tree, &fa);
216 find_free(Tree, &fa);
276 find_free(Tree, &fa);
H A Dlibfind-mapvers41 find_free; #
60 find_free; # find.c
/dports/editors/ved/schily-2021-09-18/libfind/
H A Dfind_main.c200 find_free(Tree, &fa);
207 find_free(Tree, &fa);
216 find_free(Tree, &fa);
276 find_free(Tree, &fa);
H A Dlibfind-mapvers41 find_free; #
60 find_free; # find.c
/dports/devel/sccs/schily-2021-09-18/libfind/
H A Dfind_main.c200 find_free(Tree, &fa);
207 find_free(Tree, &fa);
216 find_free(Tree, &fa);
276 find_free(Tree, &fa);
H A Dlibfind-mapvers41 find_free; #
60 find_free; # find.c
/dports/sysutils/schilyutils/schily-2021-09-18/libfind/
H A Dfind_main.c200 find_free(Tree, &fa);
207 find_free(Tree, &fa);
216 find_free(Tree, &fa);
276 find_free(Tree, &fa);
H A Dlibfind-mapvers41 find_free; #
60 find_free; # find.c
/dports/net/rabbitmq/rabbitmq-server-3.9.11/deps/amqp_client/src/
H A Damqp_channels_manager.erl126 true -> find_free(MapNPA)
138 find_free(MapNPA) -> function
139 find_free(gb_trees:iterator(MapNPA), 1).
141 find_free(It, Candidate) -> function
146 find_free(It1, Candidate + 1)
/dports/editors/encryptpad/EncryptPad-0.5.0.1/deps/botan/src/lib/utils/mem_pool/
H A Dmem_pool.cpp159 bool find_free(size_t* bit);
198 bool BitMap::find_free(size_t* bit) in find_free() function in Botan::__anon24a8698d0111::BitMap
240 if(!m_bitmap.find_free(&offset)) in alloc()
/dports/security/botan2/Botan-2.18.2/src/lib/utils/mem_pool/
H A Dmem_pool.cpp159 bool find_free(size_t* bit);
198 bool BitMap::find_free(size_t* bit) in find_free() function in Botan::__anonc96c66cc0111::BitMap
240 if(!m_bitmap.find_free(&offset)) in alloc()
/dports/mail/thunderbird/thunderbird-91.8.0/comm/third_party/botan/src/lib/utils/mem_pool/
H A Dmem_pool.cpp159 bool find_free(size_t* bit);
198 bool BitMap::find_free(size_t* bit) in find_free() function in Botan::__anonf63a216f0111::BitMap
240 if(!m_bitmap.find_free(&offset)) in alloc()
/dports/misc/gpsim/gpsim-0.31.0/src/
H A Dtrigger.cc216 int TriggerObject::find_free() in find_free() function in TriggerObject
218 bpn = bp.find_free(); in find_free()
/dports/lang/yap/yap-6.2.2/library/
H A Dbhash.yap164 find_free(Index, Size, NewKeys, TrueIndex),
168 find_free(Index, Size, Keys, NewIndex) :-
176 find_free(I1, Size, Keys, NewIndex)

123456