zoukankan      html  css  js  c++  java
  • HylaFAX传真服务器sendfax命令

    发送传真最简单方式

    #sendfax -n -d fax_number doc292.ps

    指定参数发送传真

    #sendfax -n -T 3 -I 1 -d fax_number doc292.ps

    正在发送的传真

    #faxstat -s

    传真报表

    #faxstat -d | sort

    删除传真队列

    #faxrm 454

    启动停止传真服务

    #/etc/init.d/hylafax start[stop]

    更改配置文件hfaxd.conf要重新执行下面的命令

    #kill 进程id

    #nohup /usr/local/sbin/faxgetty -D /dev/ttyS14 >/dev/null &

    传真服务器目录

    #/var/spool/hylafax/

    配置文件1

    #/var/spool/hylafax/etc/config.ttyS14

    #/var/spool/hylafax/etc/config.ttyS15

    配置文件2

    #/usr/local/lib/fax/hfaxd.conf

    sendfax参数意义

    -I time

    If a job must be requeued because of a communication failure schedule the retry according to  the  specified  time.   Times  are  given in seconds.  Minutes, hours, and days can be specified with 忖min忖, 忖hour忖, and   忖day忖 suffixes, respectively.  By default HylaFAX reschedules jobs using retry times that  depend  on  the  manner  in which the job failed; this interface permits a user to override this algorithm and specify a sin-gle fixed retry time for all communication failures.


    -T maxdials

    Make  no  more  than maxdials calls in attempting to send the facsimile.  By default, HylaFAX will redial 12 times before killing a job.  Use 忖-1忖 to indicate that no  maxdials  value  should  be  specified  to  the  server.

    其他文件

    /var/spool/hylafax/etc/xferfaxlog

    /var/spool/hylafax/etc/log/

    传真服务器安装请参考

    http://www.ringkee.com/note/opensource/debian/ch10s11.html

    http://52linux.bokee.com/38135.html

     传真服务进程

    [root@com ~]# ps -ef | grep fax
    root      8427     1  0 Jul08 ?        00:00:00 /usr/local/sbin/faxgetty -D /dev/ttyS14
    root     10603     1  0 Aug04 ?        00:00:00 /usr/local/sbin/faxq
    root     10605     1  0 Aug04 ?        00:00:00 /usr/local/sbin/hfaxd -i hylafax
    root     20275 20033  0 11:48 pts/0    00:00:00 grep fax

  • 相关阅读:
    1348:【例4-9】城市公交网建设问题
    1392:繁忙的都市(city)
    1381:城市路(Dijkstra)
    初识微积分
    进阶数论(1)逆元
    [题解] Codeforces Round #549 (Div. 2) B. Nirvana
    简单数论之整除&质因数分解&唯一分解定理
    [题解]ybt1365:FBI树(fbi)
    [题解]一本通1240:查找最接近的元素
    [题解]NOIP2018(普及组)T1标题统计(title)
  • 原文地址:https://www.cnblogs.com/coffee_cn/p/1260777.html
Copyright © 2011-2022 走看看