centos_clamav_杀毒软件

  • chl142326
    了解作者
  • Java
    开发工具
  • 15.7MB
    文件大小
  • gz
    文件格式
  • 0
    收藏次数
  • 10 积分
    下载积分
  • 0
    下载次数
  • 2022-08-09 12:09
    上传日期
centos查毒杀毒,埃尔我发撒我个人等保测评时候使用
clamav-0.103.7.tar.gz
内容介绍
Target Independent Opportunities: //===---------------------------------------------------------------------===// Dead argument elimination should be enhanced to handle cases when an argument is dead to an externally visible function. Though the argument can't be removed from the externally visible function, the caller doesn't need to pass it in. For example in this testcase: void foo(int X) __attribute__((noinline)); void foo(int X) { sideeffect(); } void bar(int A) { foo(A+1); } We compile bar to: define void @bar(i32 %A) nounwind ssp { %0 = add nsw i32 %A, 1 ; <i32> [#uses=1] tail call void @foo(i32 %0) nounwind noinline ssp ret void } The add is dead, we could pass in 'i32 undef' instead. This occurs for C++ templates etc, which usually have linkonce_odr/weak_odr linkage, not internal linkage. //===---------------------------------------------------------------------===// With the recent changes to make the implicit def/use set explicit in machineinstrs, we should change the target descriptions for 'call' instructions so that the .td files don't list all the call-clobbered registers as implicit defs. Instead, these should be added by the code generator (e.g. on the dag). This has a number of uses: 1. PPC32/64 and X86 32/64 can avoid having multiple copies of call instructions for their different impdef sets. 2. Targets with multiple calling convs (e.g. x86) which have different clobber sets don't need copies of call instructions. 3. 'Interprocedural register allocation' can be done to reduce the clobber sets of calls. //===---------------------------------------------------------------------===// Make the PPC branch selector target independant //===---------------------------------------------------------------------===// Get the C front-end to expand hypot(x,y) -> llvm.sqrt(x*x+y*y) when errno and precision don't matter (ffastmath). Misc/mandel will like this. :) This isn't safe in general, even on darwin. See the libm implementation of hypot for examples (which special case when x/y are exactly zero to get signed zeros etc right). //===---------------------------------------------------------------------===// Solve this DAG isel folding deficiency: int X, Y; void fn1(void) { X = X | (Y << 3); } compiles to fn1: movl Y, %eax shll $3, %eax orl X, %eax movl %eax, X ret The problem is the store's chain operand is not the load X but rather a TokenFactor of the load X and load Y, which prevents the folding. There are two ways to fix this: 1. The dag combiner can start using alias analysis to realize that y/x don't alias, making the store to X not dependent on the load from Y. 2. The generated isel could be made smarter in the case it can't disambiguate the pointers. Number 1 is the preferred solution. This has been "fixed" by a TableGen hack. But that is a short term workaround which will be removed once the proper fix is made. //===---------------------------------------------------------------------===// On targets with expensive 64-bit multiply, we could LSR this: for (i = ...; ++i) { x = 1ULL << i; into: long long tmp = 1; for (i = ...; ++i, tmp+=tmp) x = tmp; This would be a win on ppc32, but not x86 or ppc64. //===---------------------------------------------------------------------===// Shrink: (setlt (loadi32 P), 0) -> (setlt (loadi8 Phi), 0) //===---------------------------------------------------------------------===// Reassociate should turn things like: int factorial(int X) { return X*X*X*X*X*X*X*X; } into llvm.powi calls, allowing the code generator to produce balanced multiplication trees. First, the intrinsic needs to be extended to support integers, and second the code generator needs to be enhanced to lower these to multiplication trees. //===---------------------------------------------------------------------===// Interesting? testcase for add/shift/mul reassoc: int bar(int x, int y) { return x*x*x+y+x*x*x*x*x*y*y*y*y; } int foo(int z, int n) { return bar(z, n) + bar(2*z, 2*n); } This is blocked on not handling X*X*X -> powi(X, 3) (see note above). The issue is that we end up getting t = 2*X s = t*t and don't turn this into 4*X*X, which is the same number of multiplies and is canonical, because the 2*X has multiple uses. Here's a simple example: define i32 @test15(i32 %X1) { %B = mul i32 %X1, 47 ; X1*47 %C = mul i32 %B, %B ret i32 %C } //===---------------------------------------------------------------------===// Reassociate should handle the example in GCC PR16157: extern int a0, a1, a2, a3, a4; extern int b0, b1, b2, b3, b4; void f () { /* this can be optimized to four additions... */ b4 = a4 + a3 + a2 + a1 + a0; b3 = a3 + a2 + a1 + a0; b2 = a2 + a1 + a0; b1 = a1 + a0; } This requires reassociating to forms of expressions that are already available, something that reassoc doesn't think about yet. //===---------------------------------------------------------------------===// This function: (derived from GCC PR19988) double foo(double x, double y) { return ((x + 0.1234 * y) * (x + -0.1234 * y)); } compiles to: _foo: movapd %xmm1, %xmm2 mulsd LCPI1_1(%rip), %xmm1 mulsd LCPI1_0(%rip), %xmm2 addsd %xmm0, %xmm1 addsd %xmm0, %xmm2 movapd %xmm1, %xmm0 mulsd %xmm2, %xmm0 ret Reassociate should be able to turn it into: double foo(double x, double y) { return ((x + 0.1234 * y) * (x - 0.1234 * y)); } Which allows the multiply by constant to be CSE'd, producing: _foo: mulsd LCPI1_0(%rip), %xmm1 movapd %xmm1, %xmm2 addsd %xmm0, %xmm2 subsd %xmm1, %xmm0 mulsd %xmm2, %xmm0 ret This doesn't need -ffast-math support at all. This is particularly bad because the llvm-gcc frontend is canonicalizing the later into the former, but clang doesn't have this problem. //===---------------------------------------------------------------------===// These two functions should generate the same code on big-endian systems: int g(int *j,int *l) { return memcmp(j,l,4); } int h(int *j, int *l) { return *j - *l; } this could be done in SelectionDAGISel.cpp, along with other special cases, for 1,2,4,8 bytes. //===---------------------------------------------------------------------===// It would be nice to revert this patch: http://lists.cs.uiuc.edu/pipermail/llvm-commits/Week-of-Mon-20060213/031986.html And teach the dag combiner enough to simplify the code expanded before legalize. It seems plausible that this knowledge would let it simplify other stuff too. //===---------------------------------------------------------------------===// For vector types, TargetData.cpp::getTypeInfo() returns alignment that is equal to the type size. It works but can be overly conservative as the alignment of specific vector types are target dependent. //===---------------------------------------------------------------------===// We should produce an unaligned load from code like this: v4sf example(float *P) { return (v4sf){P[0], P[1], P[2], P[3] }; } //===---------------------------------------------------------------------===// Add support for conditional increments, and other related patterns. Instead of: movl 136(%esp), %eax cmpl $0, %eax je LBB16_2 #cond_next LBB16_1: #cond_true incl _foo LBB16_2: #cond_next emit: movl _foo, %eax cmpl $1, %edi sbbl $-1, %eax movl %eax, _foo //===---------------------------------------------------------------------===// Combine: a = sin(x), b = cos(x) into a,b = sincos(x). Expand these to calls of sin/cos and stores: double sincos(double x, double *sin, double *cos); float sincosf(float x, float *sin, float *cos); long double sincosl(long double x, long double *sin, long double *cos); Doing so could allow SROA of the destination pointers. See also: http://gcc.gnu.org/bugzilla/show_bug.cgi?id=17687 This is now easily doable with MRVs. We could even make an intrinsic for this if anyon
评论
    相关推荐
    • clamav-rest
      clamav 作为开源的杀毒程序,可以直接对本地文件进行定期杀毒扫描,也可以启动杀毒服务,由远程程序调用服务将文件传输过来,扫描后返回是否为病毒的状态,可用于业务系统中文件上传后调起远程扫描,达到嵌入业务...
    • clamav-alpine:高山上的ClamAV
      ClamAV扫描基于Alpine的Docker容器 这个容器允许您使用clamscan扫描挂载目录的非常简单的方法。 在运行clamscan之前,它将始终通过使用标准freshclam更新ClamAV数据库。 如果本地ClamAV数据库是最新的,它将检查并...
    • clamav-documentation:ClamAV 文档
      ClamAV 文档 这是 ClamAV 文档库。 欢迎并感谢通过 GitHub 拉取请求做出的贡献。 此处的文档使用 mdBook 生成。 ClamAV 用户手册 :copyright: 2021 Cisco Systems, Inc. 本文档根据 GNU 通用公共许可证 v2 的...
    • php clamav 扩展
      可以在php中clamav对文件查毒....
    • clamav-onacc
      Ansible剧本,用于安装和自定义ClamAV并针对受感染的文件进行测试。 支持Linux发行版 Debian 9 Debian 10 Ubuntu 16.04 Ubuntu 18.04 Ubuntu的20.04 合格的支持 有对其他发行版的合格支持: ClamAV软件包并非在...
    • clamav4pipeline
      clamav4pipeline clamav4pipeline是一个命令行工具,可用于在指定目录的顶部运行ClamAV防病毒扫描。 最新的clamav4pipeline映像包含每天更新两次的最新病毒数据库。 Docker镜像 最新的Docker映像位于。 每天0:00 ...
    • ansible_role_clamav:Ansible clamav角色
      Ansible amtega.clamav角色 这是设置ClamAV防病毒程序的角色。 角色变量 此角色的所有默认变量的列表位于defaults/main.yml 。 用法 这是一个示例剧本: --- - hosts : all roles : - role : amtega.clamav 测验 ...
    • ClamAV-Lambda
      应用程序可使用Docker容器中部署的AWS Lambda使用ClamAV病毒扫描程序在S3上扫描文件 检查状态 curl http://localhost:8080/status -H "Accept:text/plain"
    • clamav4j:ClamAV 的 Java 库
      ClamAV4j ClamAV 的 Java 库 此 Java 库旨在充当 Java 应用程序或 Web 服务与 ClamAV 防病毒引擎之间的桥梁。 使用 ClamAV4j,可以对来自外部的任何内容执行病毒检测。 该库使用 TCP 套接字 (INET) 通过 ClamAV 的 ...
    • NS2example.rar
      在ns2下实现无线传感器网络仿真,多个节点进行网络活动