Documentation ¶
Overview ¶
Package telemtry contains telemetry provider implementations as well as common code that can be shared by each telemetry vendor. Istio vendor is the canonical impl.
Index ¶
- func MarkOutsideOrInaccessible(trafficMap graph.TrafficMap, o graph.TelemetryOptions)
- func MarkTrafficGenerators(trafficMap graph.TrafficMap)
- func MergeTrafficMaps(trafficMap graph.TrafficMap, ns string, nsTrafficMap graph.TrafficMap)
- func ReduceToServiceGraph(trafficMap graph.TrafficMap) graph.TrafficMap
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func MarkOutsideOrInaccessible ¶
func MarkOutsideOrInaccessible(trafficMap graph.TrafficMap, o graph.TelemetryOptions)
MarkOutsideOrInaccessible sets metadata for outsider and inaccessible nodes. It should be called after all appender work is completed.
func MarkTrafficGenerators ¶
func MarkTrafficGenerators(trafficMap graph.TrafficMap)
MarkTrafficGenerators set IsRoot metadata. It is called after appender work is complete.
func MergeTrafficMaps ¶
func MergeTrafficMaps(trafficMap graph.TrafficMap, ns string, nsTrafficMap graph.TrafficMap)
MergeTrafficMaps typically combines two namespace traffic maps. It ensures that we only have unique nodes by removing duplicate nodes and merging their edges. When removing a duplicate prefer an instance from the namespace being merged-in because it is guaranteed to have all appender information applied (i.e. not an outsider). We also need to avoid duplicate edges, it can happen when a terminal node of one namespace is a root node of another:
ns1 graph: unknown -> ns1:A -> ns2:B ns2 graph: ns1:A -> ns2:B -> ns2:C
func ReduceToServiceGraph ¶
func ReduceToServiceGraph(trafficMap graph.TrafficMap) graph.TrafficMap
ReduceToServiceGraph compresses a [service-injected workload] graph by removing the workload nodes such that, with exception of non-service root nodes, the resulting graph has edges only from and to service nodes. It is typically the last thing called prior to returning the service graph.
Types ¶
This section is empty.