You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Lookup_fast may also run to __d_lookup, __d_lookup will also be called by d_lookup, which represents SLOW, where fast statistics may also go to slow statistics
Not using __d_lookup_rcu and __d_lookup may be related to the following reasons, although I didn't understand what they mean
* First problem: the current implementation takes a path and then does a
* lookup of each component. So how do we count a reference? Once for the path
* lookup, or once for every component lookup? I've chosen the latter
* since it seems to map more closely to actual dcache lookups (via
* __d_lookup_rcu()). It's counted via calls to lookup_fast().
Keeping the original code unchanged, without considering modifying the event, add b.attach_kretprobe' (event_de=r '^ lookup_fast $| ^ lookup_fast. const prop. *. \ d $', whether the return is null when counting the number of new misses, and whether it should be added correctly?
The text was updated successfully, but these errors were encountered:
This is the original code for dcstat
kernel code
Is there a problem here
__d_lookup
,__d_lookup
will also be called by d_lookup, which represents SLOW, where fast statistics may also go to slow statisticsNot using
__d_lookup_rcu
and__d_lookup
may be related to the following reasons, although I didn't understand what they meanKeeping the original code unchanged, without considering modifying the event, add
b.attach_kretprobe' (event_de=r '^ lookup_fast $| ^ lookup_fast. const prop. *. \ d $',
whether the return is null when counting the number of new misses, and whether it should be added correctly?The text was updated successfully, but these errors were encountered: