|
Server : Apache/2.2.17 (Unix) mod_ssl/2.2.17 OpenSSL/0.9.8e-fips-rhel5 DAV/2 PHP/5.2.17 System : Linux localhost 2.6.18-419.el5 #1 SMP Fri Feb 24 22:47:42 UTC 2017 x86_64 User : nobody ( 99) PHP Version : 5.2.17 Disable Function : NONE Directory : /proc/21573/root/usr/lib/python2.4/site-packages/setroubleshoot/ |
Upload File : |
mò
3ÔUc @ s9 d d g Z d k Z d k Z d k Z d k Z d k Z d k Z d k Z d k
Td k Z d k Z d k
Z
d k Z d k Z d k l Z d k Td k Td k Td k Te d d e ƒ Z y e e d ƒ Wn e j
o d e _ n Xe e i ƒ d ƒ Z d
„ Z d f d „ ƒ YZ d e i f d „ ƒ YZ! d S(
t AuditSocketReceiverThreadt AuditRecordReceiverN( t *( s
get_configt generalt use_auparset AUDIT_EOEi( i c C sˆ | i i d j p | i i d j o t Sn t i | i i j o@ t i d t | i ƒ t i d | i i
ƒ ƒ t i d ƒ n t
S( NsU setroubleshoot generated AVC, exiting to avoid recursion, context=%s, AVC scontext=%ss audit event
%si ( t avct scontextt typet Nonet tcontextt Falset
my_contextt log_programt errort audit_eventt formatt syst exitt True( R ( ( t< /usr/lib/python2.4/site-packages/setroubleshoot/avc_audit.pyt
verify_avc7 s &c B s† t Z d Z d Z d „ Z d „ Z d „ Z d „ Z d „ Z d „ Z d „ Z
d „ Z e d
„ Z
e d „ Z d „ Z d
„ Z RS( sO
The audit system emits messages about a single event
independently. Thus one single auditable event may be composed
from one or more individual audit messages. Each audit message is
prefixed with a unique event id, which includes a timestamp. The
last audit message associated with an event is not marked in any
fashion. Audit messages for a specific event may arrive
interleaved with audit messages for other events. It is the job of
higher level software (this code) to assemble the audit messages
into events. The AuditEvent class is used for assembly. When a new
event id is seen a new AuditEvent object is created, then
every time an audit message arrives with that event id it is added
to that object. The AuditEvent object contains the timestamp
associated with the audit event as well as other data items useful
for processing and handling the event.
The audit system does not tell us when the last message belonging
to an event has been emitted so we have no explicit way of knowing
when the audit event has been fully assembled from its constituent
message parts. We use the heuristic if a sufficient length of
time has expired since we last saw a message for this event, then
it must be complete
Thus when audit events are created we place them in a cache where
they will reside until their time to live has expired at which
point we will assume they are complete and emit the event.
Events are expired in the flush_cache() method. The events
resident in the cache are sorted by their timestamps. A time
threshold is established. Any events in the cache older than the
time threshold are flushed from the cache as complete events.
When should flushes be performed? The moment when a new message is
added would seem a likely candidate moment to perform a sweep of
the cache. But this is costly and does not improve how quickly
events are expired. We could wait some interval of time (something
much greater than how long we expect it would take for messages
percolate) and this has good behavior, except for the following
case. Sometimes messages are emitted by audit in rapid
succession. If we swept the cache once a second then the cache may
have grown quite large. Since it is very likely that any given audit
event is complete by the time the next several events start
arriving we can optimize by tracking how many messages have
arrived since the last time we swept the cache.
The the heuristic for when to sweep the cache becomes:
If we've seen a sufficient number of messages then sweep -or- if
a sufficient length of time has elapsed then we sweep
Note that when audit messages are injected via log file scanning
elapsed wall clock time has no meaning relative to when to perform
the cache sweep. However, the timestamp for an event remains a
critical factor when deciding if an event is complete (have we
scanned far enough ahead such we're confident we won't see any
more messages for this event?). Thus the threshold for when to
expire an event from the cache during static log file scanning is
determined not by wall clock time but rather by the oldest
timestamp in the cache (e.g.there is enough spread between
timestamps in the cache its reasonable to assume the event is
complete). One might ask in the case of log file scanning why not
fill the cache until EOF is reached and then sweep the cache?
Because in log files it is not unusual to have thousands or tens
of thousands of events and the cache would grown needlessly
large. Because we have to deal with the real time case we already
have code to keep only the most recent events in the cache so we
might as well use that logic, keep the code paths the same and
minimize resource usage.
f0.0050000000000000001c C s2 d | _ d | _ h | _ g | _ | i ƒ d S( Ni i ( t selft
flush_sizet flush_countt cachet eventst reset_statistics( R ( ( R t __init__ s
c C s
t | i ƒ S( N( t lenR R ( R ( ( R t num_cached_events– s c C s d | _ d | _ d S( Ni ( R t max_cache_lengtht event_count( R ( ( R R ™ s c C s# t ƒ } | | i t | i ƒ <| S( N( t
AuditEventR R R t strt recordt event_id( R R# R ( ( R t insert_new_event s c C s | i i t | i ƒ d ƒ S( N( R R t getR" R# R$ R ( R R# ( ( R t get_event_from_record¢ s c C s” t o t i d | i i | ƒ n | i | ƒ } | i d j o | o | i | ƒ n d Sn | d j o | i | ƒ } n | i | ƒ d S( Ns %s.add_record_to_cache(): %st EOE(
t debugt log_avcR t __class__t __name__R# R' R t record_typet flush_eventR R% t
add_record( R R# R ( ( R t add_record_to_cache¥ s
c C s& | i d 7_ | i i d | ƒ d S( Ni i ( R R R t insertR ( R R ( ( R t
emit_event² s c C s$ | i | ƒ | i t | i ƒ =d S( N( R R2 R R R" R$ ( R R ( ( R R. ¶ s
c s t ˆ i ƒ d j o d Sn t ˆ i ƒ ˆ i j o t ˆ i ƒ ˆ _ n ˆ i i ƒ } | d j o3 x( | D] } ˆ i | } ˆ i | ƒ qp Wd Sn | i
‡ d † ƒ | d j o ˆ i | d i ˆ i
} n x< | D]4 } ˆ i | } | i | j o ˆ i | ƒ qâ qâ Wd S( sl Flush events from the cache if they are older than the threshold age.
If the threshold age is None then the threshold age is set to the age
of the newest event in the cache minus the cache time to live, in other
words anything in the cache which is older than the time to live relative
to the most current event is flushed.
i Nc s! t ˆ i | i ˆ i | i ƒ S( N( t cmpR R t at timestampt b( R4 R6 ( R ( R t <lambda>Ó s iÿÿÿÿ( R R R R t keyst event_idst
threshold_ageR$ R R. t sortR R5 t cache_time_to_live( R R: R R$ R9 ( ( R R t flush_cacheº s(
c c sK | i | ƒ d | _ x. t | i ƒ d j o | i i ƒ } | Vq Wd S( Ni ( R R= R: R R R t popR ( R R: R ( ( R t flushÜ s
c c s" x | i d ƒ D]
} | Vq Wd S( s{ Emit every event in the cache irrespective of its
timestamp. This means we're done, nothing should remain buffered.i N( R R? R ( R R ( ( R t closeã s c c s» t o t i d | i i | ƒ n | i d 7_ | i d j o | i | ƒ n | i | i j o x | i
ƒ D]
} | Vqt Wn x. t | i
ƒ d j o | i
i ƒ } | Vq‰ Wd
S( s9 Accept a new audit record into the system for processing.s %s.feed() got %s'i t AVCt AVC_PATHt SYSCALLt CWDt PATHR( i N( s AVCRB RC RD s PATHs EOE( R) R* R R+ R, R# R R- R0 R R? R R R R> ( R R# R ( ( R t feedê s
( R, t
__module__t __doc__R< R R R R% R' R0 R2 R. R R= R? R@ RF ( ( ( R R D s E
" c B s> t Z d „ Z d „ Z d „ Z d „ Z d „ Z d „ Z RS( Nc C sc t i i | ƒ | | _ | | _ t ƒ | _ t d d t ƒ | _
| i ƒ d | _ t
| _ d S( Nt auditt retry_intervali ( t threadingt ThreadR R t queuet report_receiverR t record_receivert
get_configt intRJ t get_socket_pathst timeout_intervalR t
has_audit_eoe( R RM RN ( ( R R ÿ s
c C sK g | _ t d d ƒ } | i i | ƒ t d d ƒ } | i i | ƒ d S( NRI t text_protocol_socket_patht binary_protocol_socket_path( R t audit_socket_pathsRP t audit_socket_patht append( R RX ( ( R RR s
c C s x¦t ožy
xä | i D]Ù | _ | i d j oÀ yy t | i ƒ } t | ƒ | _ t i
t i t i ƒ | _
| i
i | i ƒ | i
i ƒ | _ t i d | i ƒ d SWqð t i j
o1 } t | ƒ \ } } t i d | i | ƒ qð Xq q Wt i d d i | i ƒ | i ƒ Wnz t i j
o7 } t | ƒ \ } } t i d | i | | i ƒ n6 t j
o) } t i d | i | d | i ƒ n Xt i | i ƒ q Wd S( Ns audit socket (%s) connecteds4 attempt to open audit socket (%s) failed, error='%s's: could not open any audit sockets (%s), retry in %d secondss , s9 audit socket (%s) failed, error='%s', retry in %d secondsi ( R R RW RX R t derive_record_formatt
record_formatt AuditRecordReadert
record_readert Sockett sockett AF_UNIXt SOCK_STREAMt audit_sockett connectt makefilet audit_socket_fdR* t infoR t et get_error_from_socket_exceptiont errnot strerrort warningt joinRJ t OSErrort timet sleep( R Rg Ri Rj R[ ( ( R Rc s8
c C sP t | | | | | ƒ } | i ƒ x' | i i
| ƒ D] } | i | ƒ q5 Wd S( s" called to enter a new audit recordN(
t AuditRecordR- R$ t body_textt fieldst line_numbert audit_recordt audispd_rectifyR RO RF R t new_audit_event_handler( R R- R$ Rq Rr Rs R Rt ( ( R t new_audit_record_handler5 s
c C s‡ t o t i d | ƒ n | i ƒ o[ | i ƒ oM | i ƒ d j o: t | ƒ } t | ƒ o | i
i | | i f ƒ qƒ n d S( Ns! new_audit_event_handler: event=%si (
R) R* R t is_avct
is_grantedt num_recordsRA R R R RM t putRN ( R R R ( ( R Rv = s .
c
C sc | i ƒ | i } xIt oAt i | i g g g | ƒ \ } } } y]| i | j oò t
i | i i
ƒ d ƒ } | d j o& t o t i d ƒ n | i ƒ q t o t i d | i i ƒ ƒ n | i p
| i } n x½ | i i | ƒ D]N \ } } } }
} | d j o t | _ d } n | i | | | |
| ƒ qó WnX x4 | i i t i ƒ | i ƒ D] } | i | ƒ qiW| i i ƒ d j o
d } n Wq t! j
o4 } t o t i d | i# i$ ƒ n t% i& ƒ q t' j
o4 } t o t i d | i# i$ ƒ n t% i& ƒ q t( j
o, } t i) d | i# i$ t* | ƒ ƒ d Sq Xq Wd S(
Ni t s audit socket connection droppeds cached audit event count = %dR( i s! KeyboardInterrupt exception in %ss SystemExit exception in %ss exception %s: %s(+ R Rc RS t timeoutR t selectRb t inListt outListt errListt ost readRe t filenot new_dataR) R* RO R RT R] RF R- R$ Rq Rr Rs R Rw R? Rn R Rv t KeyboardInterruptRg R+ R, t threadt interrupt_maint
SystemExitt Exceptiont exceptionR" (
R Rs R€ Rq R- R R$ R… R Rg Rr R} R ( ( R t runG sL
'
! ( R, RG R RR Rc Rw Rv RŒ ( ( ( R R þ s !
(" t __all__RI Ri t ErrnoR‚ t reR~ t selinuxR_ R^ t statt structR R‡ RK Rn t setroubleshoot.configRP t setroubleshoot.errcodet setroubleshoot.logt setroubleshoot.utilt setroubleshoot.audit_datat boolR t getattrt AttributeErrorR t
AvcContextt getconR R R RL R ( R RŽ R R~ R R’ R R R R R^ R RP RI R‡ R R‚ RK Rn ( ( R t ? s6
º