Searched refs:num_needed (Results 1 - 8 of 8) sorted by relevance

/haiku-fatelf/src/add-ons/kernel/file_systems/userlandfs/server/beos/
H A Dfs_cache.c1625 get_ents(cache_ent **ents, int num_needed, int max, int *num_gotten, int bsize) argument
1627 int cur, retry_counter = 0, max_retry = num_needed * 256;
1630 if (num_needed > max)
1631 beos_panic("get_ents: num_needed %d but max %d (doh!)\n", num_needed, max);
1634 for(cur=0; bc.cur_blocks < bc.max_blocks && cur < num_needed; cur++) {
1642 while(cur < num_needed && retry_counter < max_retry) {
1643 for(ce=bc.normal.lru; ce && cur < num_needed; ce=ce->next) {
1654 if (cur < num_needed) {
1662 if (cur < num_needed
1952 int cur, cur_nblocks, num_dirty, real_nblocks, num_needed; local
[all...]
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/fs_shell/
H A Dcache.c1616 get_ents(cache_ent **ents, int num_needed, int max, int *num_gotten, int bsize) argument
1618 int cur, retry_counter = 0, max_retry = num_needed * 256;
1621 if (num_needed > max)
1622 panic("get_ents: num_needed %d but max %d (doh!)\n", num_needed, max);
1625 for(cur=0; bc.cur_blocks < bc.max_blocks && cur < num_needed; cur++) {
1633 while(cur < num_needed && retry_counter < max_retry) {
1634 for(ce=bc.normal.lru; ce && cur < num_needed; ce=ce->next) {
1645 if (cur < num_needed) {
1653 if (cur < num_needed
1944 int cur, cur_nblocks, num_dirty, real_nblocks, num_needed; local
[all...]
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/server/
H A Dcache.c1611 get_ents(cache_ent **ents, int num_needed, int max, int *num_gotten, int bsize) argument
1613 int cur, retry_counter = 0, max_retry = num_needed * 256;
1616 if (num_needed > max)
1617 panic("get_ents: num_needed %d but max %d (doh!)\n", num_needed, max);
1620 for(cur=0; bc.cur_blocks < bc.max_blocks && cur < num_needed; cur++) {
1628 while(cur < num_needed && retry_counter < max_retry) {
1629 for(ce=bc.normal.lru; ce && cur < num_needed; ce=ce->next) {
1640 if (cur < num_needed) {
1648 if (cur < num_needed
1938 int cur, cur_nblocks, num_dirty, real_nblocks, num_needed; local
[all...]
/haiku-fatelf/headers/private/runtime_loader/
H A Druntime_loader.h114 uint32 num_needed; member in struct:image_t
/haiku-fatelf/src/system/runtime_loader/
H A Dimages.cpp132 for (uint32 i = 0; i < image->num_needed; i++) {
157 for (uint32 i = 0; i < image->num_needed; i++)
229 memset(image->needed, 0xa5, sizeof(image->needed[0]) * image->num_needed);
279 for (i = 0; i < image->num_needed; i++)
H A Delf.cpp97 if (image->num_needed == 0)
103 image->needed = (image_t**)malloc(image->num_needed * sizeof(image_t *));
111 memset(image->needed, 0, image->num_needed * sizeof(image_t *));
159 if (j != image->num_needed) {
949 if (dynamicSection == NULL || image->num_needed <= searchIndex) {
H A Delf_symbol_lookup.cpp267 for (uint32 i = 0; i < image->num_needed; i++) {
323 for (uint32 i = 0; i < image->num_needed; i++) {
H A Delf_load_image.cpp248 image->num_needed += 1;

Completed in 89 milliseconds