+
+%% ============================================================================
+%% Process code origin approximation or naming the anonymous processes.
+%%
+%% At runtime, given a PID, how precicely can we identify the origin of the
+%% code it is running?
+%%
+%% We have these data points:
+%%
+%% - Sometimes | registered name (if so, we're done)
+%% - Sometimes | ancestor PIDs or registered names
+%% - Always | initial_call (can be too generic, such as erlang:apply)
+%% - Always | current_function (can be too far down the stack)
+%% - Always | current_location (can be too far down the stack)
+%% - Potentially | application tree, but maybe expensive to compute, need to check
+%% ============================================================================
+
+-define(TAG(Tag), fun (X) -> {Tag, X} end).
+
+-spec best_known_origin(t()) ->
+ best_known_origin().
+best_known_origin(?T{registered_name={some, RegisteredName}}) ->
+ {registered_name, RegisteredName};
+best_known_origin(
+ ?T
+ { pid = _Pid
+ , registered_name = none
+ , raw_initial_call = InitCallRaw
+ , otp_initial_call = InitCallOTPOpt1
+ , otp_ancestors = AncestorsOpt1
+ , status = _Status
+ , memory = _Memory
+ , total_heap_size = _TotalHeapSize
+ , stack_size = _StackSize
+ , message_queue_len = _MsgQueueLen
+ }
+) ->
+ ToSingleton = fun (X) -> [X] end,
+ InitCallOTPOpt2 = hope_option:map(InitCallOTPOpt1, ?TAG(otp_initial_call)),
+ AncestorsOpt2 = hope_option:map(AncestorsOpt1 , ?TAG(otp_ancestors)),
+ InitCallOTPOpt3 = hope_option:map(InitCallOTPOpt2, ToSingleton),
+ AncestorsOpt3 = hope_option:map(AncestorsOpt2 , ToSingleton),
+ MaybeInitCallOTP = hope_option:get(InitCallOTPOpt3, []),
+ MaybeAncestors = hope_option:get(AncestorsOpt3 , []),
+ Ancestry =
+ [{raw_initial_call, InitCallRaw}] ++
+ MaybeInitCallOTP ++
+ MaybeAncestors,
+ {ancestry, Ancestry}.