Asterisk - The Open Source Telephony Project  18.5.0
Data Fields
stasis_subscription_statistics Struct Reference
Collaboration diagram for stasis_subscription_statistics:
Collaboration graph
[legend]

Data Fields

const char * file
 The filename where the subscription originates. More...
 
const char * func
 The function where the subscription originates. More...
 
long highest_time_invoked
 Highest time spent invoking a message. More...
 
struct stasis_message_typehighest_time_message_type
 The message type that currently took the longest to process. More...
 
int lineno
 The line number where the subscription originates. More...
 
long lowest_time_invoked
 Lowest time spent invoking a message. More...
 
int messages_dropped
 The number of messages that were filtered out. More...
 
int messages_passed
 The number of messages that passed filtering. More...
 
struct stasis_subscriptionsub
 Pointer to the subscription (NOT refcounted, and must NOT be accessed) More...
 
struct ao2_containertopics
 Names of the topics we are subscribed to. More...
 
char uniqueid [0]
 Unique ID of the subscription. More...
 
int uses_mailbox
 Using a mailbox to queue messages. More...
 
int uses_threadpool
 Using stasis threadpool for handling messages. More...
 

Detailed Description

Definition at line 650 of file stasis.c.

Field Documentation

◆ file

const char* file

The filename where the subscription originates.

Definition at line 652 of file stasis.c.

Referenced by stasis_subscription_statistics_create(), and statistics_show_subscription().

◆ func

const char* func

The function where the subscription originates.

Definition at line 654 of file stasis.c.

Referenced by stasis_subscription_statistics_create(), and statistics_show_subscription().

◆ highest_time_invoked

long highest_time_invoked

Highest time spent invoking a message.

Definition at line 660 of file stasis.c.

Referenced by statistics_show_subscription(), and statistics_show_subscriptions().

◆ highest_time_message_type

struct stasis_message_type* highest_time_message_type

The message type that currently took the longest to process.

Definition at line 658 of file stasis.c.

Referenced by statistics_show_subscription().

◆ lineno

int lineno

The line number where the subscription originates.

Definition at line 672 of file stasis.c.

Referenced by stasis_subscription_statistics_create(), and statistics_show_subscription().

◆ lowest_time_invoked

long lowest_time_invoked

Lowest time spent invoking a message.

Definition at line 662 of file stasis.c.

Referenced by statistics_show_subscription(), and statistics_show_subscriptions().

◆ messages_dropped

int messages_dropped

The number of messages that were filtered out.

Definition at line 664 of file stasis.c.

Referenced by statistics_show_subscription(), and statistics_show_subscriptions().

◆ messages_passed

int messages_passed

The number of messages that passed filtering.

Definition at line 666 of file stasis.c.

Referenced by statistics_show_subscription(), and statistics_show_subscriptions().

◆ sub

struct stasis_subscription* sub

Pointer to the subscription (NOT refcounted, and must NOT be accessed)

Definition at line 674 of file stasis.c.

Referenced by stasis_subscription_statistics_create(), and statistics_show_subscription().

◆ topics

struct ao2_container* topics

Names of the topics we are subscribed to.

Definition at line 656 of file stasis.c.

Referenced by stasis_subscription_statistics_create(), statistics_show_subscription(), and subscription_statistics_destroy().

◆ uniqueid

char uniqueid[0]

◆ uses_mailbox

int uses_mailbox

Using a mailbox to queue messages.

Definition at line 668 of file stasis.c.

Referenced by stasis_subscription_statistics_create(), and statistics_show_subscription().

◆ uses_threadpool

int uses_threadpool

Using stasis threadpool for handling messages.

Definition at line 670 of file stasis.c.

Referenced by stasis_subscription_statistics_create(), and statistics_show_subscription().


The documentation for this struct was generated from the following file: