Lines Matching defs:entry
418 * program. For the entry-point (main) BPF program, this is always
433 * entry-point BPF programs this includes the size of main program
6192 struct hashmap_entry *entry;
6298 hashmap__for_each_entry(cand_cache, entry, i) {
6299 bpf_core_free_cands(entry->pvalue);
6792 * Algorithm operates as follows. Each entry-point BPF program (referred to as
6793 * main prog) is processed separately. For each subprog (non-entry functions,
6794 * that can be called from either entry progs or other subprogs) gets their
7127 pr_warn(".maps relo #%d: '%s' isn't an entry-point program\n",
7989 pr_warn("failed to read kallsyms entry: %d\n", ret);
11187 pr_warn("failed to parse available_filter_functions entry: %d\n", ret);
11260 pr_warn("failed to parse available_filter_functions_addrs entry: %d\n",
11573 struct zip_entry entry;
11588 ret = zip_archive_find_entry(archive, file_name, &entry);
11594 pr_debug("zip: found entry for %s in %s at 0x%lx\n", file_name, archive_path,
11595 (unsigned long)entry.data_offset);
11597 if (entry.compression) {
11598 pr_warn("zip: entry %s of %s is compressed and cannot be handled\n", file_name,
11604 elf = elf_memory((void *)entry.data, entry.data_length);
11609 ftruncate(fdm, entry.data_length);
11610 write(fdm, (char *)entry.data, entry.data_length);
11624 func_name, file_name, archive_path, entry.data_offset, ret,
11625 ret + entry.data_offset);
11626 ret += entry.data_offset;