Home
last modified time | relevance | path

Searched refs:cachep (Results 1 – 25 of 514) sorted by relevance

12345678910>>...21

/dports/multimedia/v4l_compat/linux-5.13-rc2/mm/
H A Dslab.c1343 cachep->name, cachep->size, cachep->gfporder); in slab_out_of_memory()
1844 cachep->colour = left / cachep->colour_off; in set_objfreelist_slab_cache()
1878 cachep->colour = left / cachep->colour_off; in set_off_slab_cache()
1894 cachep->colour = left / cachep->colour_off; in set_on_slab_cache()
1972 if (cachep->colour_off < cachep->align) in __kmem_cache_create()
1973 cachep->colour_off = cachep->align; in __kmem_cache_create()
2352 cachep->ctor(objp + obj_offset(cachep)); in cache_init_objs_debug()
2354 cachep, objp + obj_offset(cachep)); in cache_init_objs_debug()
3018 if (cachep->ctor && cachep->flags & SLAB_POISON) in cache_alloc_debugcheck_after()
3602 cachep->object_size, cachep->size, in kmem_cache_alloc_node()
[all …]
/dports/multimedia/libv4l/linux-5.13-rc2/mm/
H A Dslab.c1343 cachep->name, cachep->size, cachep->gfporder); in slab_out_of_memory()
1844 cachep->colour = left / cachep->colour_off; in set_objfreelist_slab_cache()
1878 cachep->colour = left / cachep->colour_off; in set_off_slab_cache()
1894 cachep->colour = left / cachep->colour_off; in set_on_slab_cache()
1972 if (cachep->colour_off < cachep->align) in __kmem_cache_create()
1973 cachep->colour_off = cachep->align; in __kmem_cache_create()
2352 cachep->ctor(objp + obj_offset(cachep)); in cache_init_objs_debug()
2354 cachep, objp + obj_offset(cachep)); in cache_init_objs_debug()
3018 if (cachep->ctor && cachep->flags & SLAB_POISON) in cache_alloc_debugcheck_after()
3602 cachep->object_size, cachep->size, in kmem_cache_alloc_node()
[all …]
/dports/multimedia/v4l-utils/linux-5.13-rc2/mm/
H A Dslab.c1343 cachep->name, cachep->size, cachep->gfporder); in slab_out_of_memory()
1844 cachep->colour = left / cachep->colour_off; in set_objfreelist_slab_cache()
1878 cachep->colour = left / cachep->colour_off; in set_off_slab_cache()
1894 cachep->colour = left / cachep->colour_off; in set_on_slab_cache()
1972 if (cachep->colour_off < cachep->align) in __kmem_cache_create()
1973 cachep->colour_off = cachep->align; in __kmem_cache_create()
2352 cachep->ctor(objp + obj_offset(cachep)); in cache_init_objs_debug()
2354 cachep, objp + obj_offset(cachep)); in cache_init_objs_debug()
3018 if (cachep->ctor && cachep->flags & SLAB_POISON) in cache_alloc_debugcheck_after()
3602 cachep->object_size, cachep->size, in kmem_cache_alloc_node()
[all …]
/dports/net-mgmt/net-snmp/net-snmp-5.9/snmplib/transports/
H A DsnmpDTLSUDPDomain.c140 for (cachep = biocache; cachep; cachep = cachep->next) { in find_bio_cache()
163 return cachep; in find_bio_cache()
187 cachep = cachep->next; in remove_bio_cache()
238 if (!cachep) in start_new_cached_connection()
360 SSL_set_bio(tlsdata->ssl, cachep->read_bio, cachep->write_bio); in start_new_cached_connection()
413 return cachep; in start_new_cached_connection()
432 return cachep; in find_or_create_bio_cache()
549 if (!cachep->write_cache || cachep->write_cache_len == 0) in _netsnmp_bio_try_and_write_buffered()
603 if (cachep->write_cache && cachep->write_cache_len > 0) { in _netsnmp_add_buffered_data()
615 memcpy(cachep->write_cache + cachep->write_cache_len, in _netsnmp_add_buffered_data()
[all …]
/dports/games/xzip/xzip/
H A Dmemory.c58 cache_entry_t *cachep; in load_cache() local
74 if (cachep == NULL) in load_cache()
76 cachep->flink = cache; in load_cache()
78 cache = cachep; in load_cache()
109 read_page (cachep->page_number, cachep->data); in load_cache()
147 for (cachep = cache; cachep->flink != NULL; cachep = nextp) { in unload_cache()
149 free (cachep); in unload_cache()
360 lastp = cachep, cachep = cachep->flink)
369 if (cachep->flink == NULL && cachep->page_number) {
387 cache = cachep;
[all …]
/dports/games/jzip/jzip-2.0.1g/
H A Dmemory.c58 cache_entry_t *cachep; in load_cache() local
72 if (cachep == NULL) in load_cache()
74 cachep->flink = cache; in load_cache()
76 cache = cachep; in load_cache()
107 read_page (cachep->page_number, cachep->data); in load_cache()
142 for (cachep = cache; cachep->flink != NULL; cachep = nextp) { in unload_cache()
144 free (cachep); in unload_cache()
355 lastp = cachep, cachep = cachep->flink)
364 if (cachep->flink == NULL && cachep->page_number) {
382 cache = cachep;
[all …]
/dports/multimedia/v4l_compat/linux-5.13-rc2/tools/testing/radix-tree/
H A Dlinux.c37 if (cachep->nr_objs) { in kmem_cache_alloc()
39 cachep->nr_objs--; in kmem_cache_alloc()
40 cachep->objs = node->parent; in kmem_cache_alloc()
46 if (cachep->align) in kmem_cache_alloc()
47 posix_memalign(&p, cachep->align, cachep->size); in kmem_cache_alloc()
49 p = malloc(cachep->size); in kmem_cache_alloc()
50 if (cachep->ctor) in kmem_cache_alloc()
51 cachep->ctor(p); in kmem_cache_alloc()
69 if (cachep->nr_objs > 10 || cachep->align) { in kmem_cache_free()
74 cachep->nr_objs++; in kmem_cache_free()
[all …]
/dports/multimedia/libv4l/linux-5.13-rc2/tools/testing/radix-tree/
H A Dlinux.c37 if (cachep->nr_objs) { in kmem_cache_alloc()
39 cachep->nr_objs--; in kmem_cache_alloc()
40 cachep->objs = node->parent; in kmem_cache_alloc()
46 if (cachep->align) in kmem_cache_alloc()
47 posix_memalign(&p, cachep->align, cachep->size); in kmem_cache_alloc()
49 p = malloc(cachep->size); in kmem_cache_alloc()
50 if (cachep->ctor) in kmem_cache_alloc()
51 cachep->ctor(p); in kmem_cache_alloc()
69 if (cachep->nr_objs > 10 || cachep->align) { in kmem_cache_free()
74 cachep->nr_objs++; in kmem_cache_free()
[all …]
/dports/multimedia/v4l-utils/linux-5.13-rc2/tools/testing/radix-tree/
H A Dlinux.c37 if (cachep->nr_objs) { in kmem_cache_alloc()
39 cachep->nr_objs--; in kmem_cache_alloc()
40 cachep->objs = node->parent; in kmem_cache_alloc()
46 if (cachep->align) in kmem_cache_alloc()
47 posix_memalign(&p, cachep->align, cachep->size); in kmem_cache_alloc()
49 p = malloc(cachep->size); in kmem_cache_alloc()
50 if (cachep->ctor) in kmem_cache_alloc()
51 cachep->ctor(p); in kmem_cache_alloc()
69 if (cachep->nr_objs > 10 || cachep->align) { in kmem_cache_free()
74 cachep->nr_objs++; in kmem_cache_free()
[all …]
/dports/lang/gcc12-devel/gcc-12-20211205/libobjc/
H A Dhash.c112 size_t indx = (*(*cachep)->hash_func) (*cachep, key); in objc_hash_add()
120 node->next = (*cachep)->node_table[indx]; in objc_hash_add()
125 node_ptr node1 = (*cachep)->node_table[indx]; in objc_hash_add()
135 (*cachep)->node_table[indx] = node; in objc_hash_add()
138 ++(*cachep)->used; in objc_hash_add()
142 if (FULLNESS (*cachep)) in objc_hash_add()
151 (*cachep)->hash_func, in objc_hash_add()
152 (*cachep)->compare_func); in objc_hash_add()
155 (int) *cachep, (*cachep)->size, new->size); in objc_hash_add()
162 objc_hash_delete (*cachep); in objc_hash_add()
[all …]
/dports/lang/gcc8/gcc-8.5.0/libobjc/
H A Dhash.c112 size_t indx = (*(*cachep)->hash_func) (*cachep, key); in objc_hash_add()
120 node->next = (*cachep)->node_table[indx]; in objc_hash_add()
125 node_ptr node1 = (*cachep)->node_table[indx]; in objc_hash_add()
135 (*cachep)->node_table[indx] = node; in objc_hash_add()
138 ++(*cachep)->used; in objc_hash_add()
142 if (FULLNESS (*cachep)) in objc_hash_add()
151 (*cachep)->hash_func, in objc_hash_add()
152 (*cachep)->compare_func); in objc_hash_add()
155 (int) *cachep, (*cachep)->size, new->size); in objc_hash_add()
162 objc_hash_delete (*cachep); in objc_hash_add()
[all …]
/dports/lang/gcc48/gcc-4.8.5/libobjc/
H A Dhash.c112 size_t indx = (*(*cachep)->hash_func) (*cachep, key); in objc_hash_add()
120 node->next = (*cachep)->node_table[indx]; in objc_hash_add()
125 node_ptr node1 = (*cachep)->node_table[indx]; in objc_hash_add()
135 (*cachep)->node_table[indx] = node; in objc_hash_add()
138 ++(*cachep)->used; in objc_hash_add()
142 if (FULLNESS (*cachep)) in objc_hash_add()
151 (*cachep)->hash_func, in objc_hash_add()
152 (*cachep)->compare_func); in objc_hash_add()
155 (int) *cachep, (*cachep)->size, new->size); in objc_hash_add()
162 objc_hash_delete (*cachep); in objc_hash_add()
[all …]
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/libobjc/
H A Dhash.c112 size_t indx = (*(*cachep)->hash_func) (*cachep, key); in objc_hash_add()
120 node->next = (*cachep)->node_table[indx]; in objc_hash_add()
125 node_ptr node1 = (*cachep)->node_table[indx]; in objc_hash_add()
135 (*cachep)->node_table[indx] = node; in objc_hash_add()
138 ++(*cachep)->used; in objc_hash_add()
142 if (FULLNESS (*cachep)) in objc_hash_add()
151 (*cachep)->hash_func, in objc_hash_add()
152 (*cachep)->compare_func); in objc_hash_add()
155 (int) *cachep, (*cachep)->size, new->size); in objc_hash_add()
162 objc_hash_delete (*cachep); in objc_hash_add()
[all …]
/dports/lang/gcc11/gcc-11.2.0/libobjc/
H A Dhash.c112 size_t indx = (*(*cachep)->hash_func) (*cachep, key); in objc_hash_add()
120 node->next = (*cachep)->node_table[indx]; in objc_hash_add()
125 node_ptr node1 = (*cachep)->node_table[indx]; in objc_hash_add()
135 (*cachep)->node_table[indx] = node; in objc_hash_add()
138 ++(*cachep)->used; in objc_hash_add()
142 if (FULLNESS (*cachep)) in objc_hash_add()
151 (*cachep)->hash_func, in objc_hash_add()
152 (*cachep)->compare_func); in objc_hash_add()
155 (int) *cachep, (*cachep)->size, new->size); in objc_hash_add()
162 objc_hash_delete (*cachep); in objc_hash_add()
[all …]
/dports/lang/gcc10/gcc-10.3.0/libobjc/
H A Dhash.c112 size_t indx = (*(*cachep)->hash_func) (*cachep, key); in objc_hash_add()
120 node->next = (*cachep)->node_table[indx]; in objc_hash_add()
125 node_ptr node1 = (*cachep)->node_table[indx]; in objc_hash_add()
135 (*cachep)->node_table[indx] = node; in objc_hash_add()
138 ++(*cachep)->used; in objc_hash_add()
142 if (FULLNESS (*cachep)) in objc_hash_add()
151 (*cachep)->hash_func, in objc_hash_add()
152 (*cachep)->compare_func); in objc_hash_add()
155 (int) *cachep, (*cachep)->size, new->size); in objc_hash_add()
162 objc_hash_delete (*cachep); in objc_hash_add()
[all …]
/dports/lang/gcc11-devel/gcc-11-20211009/libobjc/
H A Dhash.c112 size_t indx = (*(*cachep)->hash_func) (*cachep, key); in objc_hash_add()
120 node->next = (*cachep)->node_table[indx]; in objc_hash_add()
125 node_ptr node1 = (*cachep)->node_table[indx]; in objc_hash_add()
135 (*cachep)->node_table[indx] = node; in objc_hash_add()
138 ++(*cachep)->used; in objc_hash_add()
142 if (FULLNESS (*cachep)) in objc_hash_add()
151 (*cachep)->hash_func, in objc_hash_add()
152 (*cachep)->compare_func); in objc_hash_add()
155 (int) *cachep, (*cachep)->size, new->size); in objc_hash_add()
162 objc_hash_delete (*cachep); in objc_hash_add()
[all …]
/dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gcc/libobjc/
H A Dhash.c111 size_t indx = (*(*cachep)->hash_func)(*cachep, key); in hash_add()
120 node->next = (*cachep)->node_table[indx]; in hash_add()
136 (*cachep)->node_table[indx] = node; in hash_add()
139 ++(*cachep)->used; in hash_add()
143 if (FULLNESS (*cachep)) { in hash_add()
153 (*cachep)->hash_func, in hash_add()
154 (*cachep)->compare_func); in hash_add()
157 *cachep, (*cachep)->size, new->size); in hash_add()
160 while ((node1 = hash_next (*cachep, node1))) in hash_add()
164 hash_delete (*cachep); in hash_add()
[all …]
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/libobjc/
H A Dhash.c112 size_t indx = (*(*cachep)->hash_func) (*cachep, key); in objc_hash_add()
120 node->next = (*cachep)->node_table[indx]; in objc_hash_add()
125 node_ptr node1 = (*cachep)->node_table[indx]; in objc_hash_add()
135 (*cachep)->node_table[indx] = node; in objc_hash_add()
138 ++(*cachep)->used; in objc_hash_add()
142 if (FULLNESS (*cachep)) in objc_hash_add()
151 (*cachep)->hash_func, in objc_hash_add()
152 (*cachep)->compare_func); in objc_hash_add()
155 (int) *cachep, (*cachep)->size, new->size); in objc_hash_add()
162 objc_hash_delete (*cachep); in objc_hash_add()
[all …]
/dports/lang/gnat_util/gcc-6-20180516/libobjc/
H A Dhash.c112 size_t indx = (*(*cachep)->hash_func) (*cachep, key); in objc_hash_add()
120 node->next = (*cachep)->node_table[indx]; in objc_hash_add()
125 node_ptr node1 = (*cachep)->node_table[indx]; in objc_hash_add()
135 (*cachep)->node_table[indx] = node; in objc_hash_add()
138 ++(*cachep)->used; in objc_hash_add()
142 if (FULLNESS (*cachep)) in objc_hash_add()
151 (*cachep)->hash_func, in objc_hash_add()
152 (*cachep)->compare_func); in objc_hash_add()
155 (int) *cachep, (*cachep)->size, new->size); in objc_hash_add()
162 objc_hash_delete (*cachep); in objc_hash_add()
[all …]
/dports/devel/avr-gcc/gcc-10.2.0/libobjc/
H A Dhash.c112 size_t indx = (*(*cachep)->hash_func) (*cachep, key); in objc_hash_add()
120 node->next = (*cachep)->node_table[indx]; in objc_hash_add()
125 node_ptr node1 = (*cachep)->node_table[indx]; in objc_hash_add()
135 (*cachep)->node_table[indx] = node; in objc_hash_add()
138 ++(*cachep)->used; in objc_hash_add()
142 if (FULLNESS (*cachep)) in objc_hash_add()
151 (*cachep)->hash_func, in objc_hash_add()
152 (*cachep)->compare_func); in objc_hash_add()
155 (int) *cachep, (*cachep)->size, new->size); in objc_hash_add()
162 objc_hash_delete (*cachep); in objc_hash_add()
[all …]
/dports/lang/gcc9-devel/gcc-9-20211007/libobjc/
H A Dhash.c112 size_t indx = (*(*cachep)->hash_func) (*cachep, key); in objc_hash_add()
120 node->next = (*cachep)->node_table[indx]; in objc_hash_add()
125 node_ptr node1 = (*cachep)->node_table[indx]; in objc_hash_add()
135 (*cachep)->node_table[indx] = node; in objc_hash_add()
138 ++(*cachep)->used; in objc_hash_add()
142 if (FULLNESS (*cachep)) in objc_hash_add()
151 (*cachep)->hash_func, in objc_hash_add()
152 (*cachep)->compare_func); in objc_hash_add()
155 (int) *cachep, (*cachep)->size, new->size); in objc_hash_add()
162 objc_hash_delete (*cachep); in objc_hash_add()
[all …]
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/libobjc/
H A Dhash.c112 size_t indx = (*(*cachep)->hash_func) (*cachep, key); in objc_hash_add()
120 node->next = (*cachep)->node_table[indx]; in objc_hash_add()
125 node_ptr node1 = (*cachep)->node_table[indx]; in objc_hash_add()
135 (*cachep)->node_table[indx] = node; in objc_hash_add()
138 ++(*cachep)->used; in objc_hash_add()
142 if (FULLNESS (*cachep)) in objc_hash_add()
151 (*cachep)->hash_func, in objc_hash_add()
152 (*cachep)->compare_func); in objc_hash_add()
155 (int) *cachep, (*cachep)->size, new->size); in objc_hash_add()
162 objc_hash_delete (*cachep); in objc_hash_add()
[all …]
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/libobjc/
H A Dhash.c112 size_t indx = (*(*cachep)->hash_func) (*cachep, key); in objc_hash_add()
120 node->next = (*cachep)->node_table[indx]; in objc_hash_add()
125 node_ptr node1 = (*cachep)->node_table[indx]; in objc_hash_add()
135 (*cachep)->node_table[indx] = node; in objc_hash_add()
138 ++(*cachep)->used; in objc_hash_add()
142 if (FULLNESS (*cachep)) in objc_hash_add()
151 (*cachep)->hash_func, in objc_hash_add()
152 (*cachep)->compare_func); in objc_hash_add()
155 (int) *cachep, (*cachep)->size, new->size); in objc_hash_add()
162 objc_hash_delete (*cachep); in objc_hash_add()
[all …]
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/libobjc/
H A Dhash.c112 size_t indx = (*(*cachep)->hash_func) (*cachep, key); in objc_hash_add()
120 node->next = (*cachep)->node_table[indx]; in objc_hash_add()
125 node_ptr node1 = (*cachep)->node_table[indx]; in objc_hash_add()
135 (*cachep)->node_table[indx] = node; in objc_hash_add()
138 ++(*cachep)->used; in objc_hash_add()
142 if (FULLNESS (*cachep)) in objc_hash_add()
151 (*cachep)->hash_func, in objc_hash_add()
152 (*cachep)->compare_func); in objc_hash_add()
155 (int) *cachep, (*cachep)->size, new->size); in objc_hash_add()
162 objc_hash_delete (*cachep); in objc_hash_add()
[all …]
/dports/lang/gcc6-aux/gcc-6-20180516/libobjc/
H A Dhash.c112 size_t indx = (*(*cachep)->hash_func) (*cachep, key); in objc_hash_add()
120 node->next = (*cachep)->node_table[indx]; in objc_hash_add()
125 node_ptr node1 = (*cachep)->node_table[indx]; in objc_hash_add()
135 (*cachep)->node_table[indx] = node; in objc_hash_add()
138 ++(*cachep)->used; in objc_hash_add()
142 if (FULLNESS (*cachep)) in objc_hash_add()
151 (*cachep)->hash_func, in objc_hash_add()
152 (*cachep)->compare_func); in objc_hash_add()
155 (int) *cachep, (*cachep)->size, new->size); in objc_hash_add()
162 objc_hash_delete (*cachep); in objc_hash_add()
[all …]

12345678910>>...21