Lines Matching refs:comp
50 static int zcomp_strm_init(struct zcomp_strm *zstrm, struct zcomp *comp)
52 zstrm->tfm = crypto_alloc_comp(comp->name, 0, 0);
65 bool zcomp_available_algorithm(const char *comp)
74 return crypto_has_comp(comp, 0, 0) == 1;
78 ssize_t zcomp_available_show(const char *comp, char *buf)
85 if (!strcmp(comp, backends[i])) {
99 if (!known_algorithm && crypto_has_comp(comp, 0, 0) == 1)
101 "[%s] ", comp);
107 struct zcomp_strm *zcomp_stream_get(struct zcomp *comp)
109 local_lock(&comp->stream->lock);
110 return this_cpu_ptr(comp->stream);
113 void zcomp_stream_put(struct zcomp *comp)
115 local_unlock(&comp->stream->lock);
126 * comp algorithm `842' pads the compressed length to multiple of 8
154 struct zcomp *comp = hlist_entry(node, struct zcomp, node);
158 zstrm = per_cpu_ptr(comp->stream, cpu);
161 ret = zcomp_strm_init(zstrm, comp);
169 struct zcomp *comp = hlist_entry(node, struct zcomp, node);
172 zstrm = per_cpu_ptr(comp->stream, cpu);
177 static int zcomp_init(struct zcomp *comp)
181 comp->stream = alloc_percpu(struct zcomp_strm);
182 if (!comp->stream)
185 ret = cpuhp_state_add_instance(CPUHP_ZCOMP_PREPARE, &comp->node);
191 free_percpu(comp->stream);
195 void zcomp_destroy(struct zcomp *comp)
197 cpuhp_state_remove_instance(CPUHP_ZCOMP_PREPARE, &comp->node);
198 free_percpu(comp->stream);
199 kfree(comp);
212 struct zcomp *comp;
223 comp = kzalloc(sizeof(struct zcomp), GFP_KERNEL);
224 if (!comp)
227 comp->name = alg;
228 error = zcomp_init(comp);
230 kfree(comp);
233 return comp;