Sapian
/
asterisk
mirror of http://gerrit.asterisk.org/asterisk
3
0
Fork 0
Code Issues Releases Wiki Activity

Spelling corrections (mostly in comments and doxygen areas) #6249

Browse Source 
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@8100 65c4cc65-6c06-0410-ace0-fbb531ad65f3
1.4
BJ Weschke 20 years ago
parent fa07ae94ec
commit 3854a2438e
5 changed files with 13 additions and 13 deletions
Show Stats Download Patch File Download Diff File

2
app.c
Unescape View File

@ -55,7 +55,7 @@ ASTERISK_FILE_VERSION(__FILE__, "$Revision$")
/* ! /* !
This function presents a dialtone and reads an extension into 'collect' This function presents a dialtone and reads an extension into 'collect'
which must be a pointer to a **pre-initilized** array of char having a which must be a pointer to a **pre-initialized** array of char having a
size of 'size' suitable for writing to. It will collect no more than the smaller size of 'size' suitable for writing to. It will collect no more than the smaller
of 'maxlen' or 'size' minus the original strlen() of collect digits. of 'maxlen' or 'size' minus the original strlen() of collect digits.
\return 0 if extension does not exist, 1 if extension exists \return 0 if extension does not exist, 1 if extension exists

14
apps/app_queue.c
Unescape View File

@ -223,7 +223,7 @@ static char *app_upqm_descrip =
/*! \brief Persistent Members astdb family */ /*! \brief Persistent Members astdb family */
static const char *pm_family = "/Queue/PersistentMembers"; static const char *pm_family = "/Queue/PersistentMembers";
/* The maximum lengh of each persistent member queue database entry */ /* The maximum length of each persistent member queue database entry */
#define PM_MAX_LEN 2048 #define PM_MAX_LEN 2048
/*! \brief queues.conf [general] option */ /*! \brief queues.conf [general] option */
@ -282,7 +282,7 @@ struct queue_ent {
int pos; /*!< Where we are in the queue */ int pos; /*!< Where we are in the queue */
int prio; /*!< Our priority */ int prio; /*!< Our priority */
int last_pos_said; /*!< Last position we told the user */ int last_pos_said; /*!< Last position we told the user */
time_t last_periodic_announce_time; /*!< The last time we played a periodic anouncement */ time_t last_periodic_announce_time; /*!< The last time we played a periodic announcement */
time_t last_pos; /*!< Last time we told the user their position */ time_t last_pos; /*!< Last time we told the user their position */
int opos; /*!< Where we started in the queue */ int opos; /*!< Where we started in the queue */
int handled; /*!< Whether our call was handled */ int handled; /*!< Whether our call was handled */
@ -2135,7 +2135,7 @@ static int try_calling(struct queue_ent *qe, const char *options, char *announce
peer = NULL; peer = NULL;
if (!peer) { if (!peer) {
if (to) { if (to) {
/* Musta gotten hung up */ /* Must gotten hung up */
record_abandoned(qe); record_abandoned(qe);
res = -1; res = -1;
} else { } else {
@ -2302,7 +2302,7 @@ static int try_calling(struct queue_ent *qe, const char *options, char *announce
ast_hangup(peer); ast_hangup(peer);
update_queue(qe->parent, member); update_queue(qe->parent, member);
if (bridge == 0) if (bridge == 0)
res = 1; /* JDG: bridge successfull, leave app_queue */ res = 1; /* JDG: bridge successfully, leave app_queue */
else else
res = bridge; /* bridge error, stay in the queue */ res = bridge; /* bridge error, stay in the queue */
} }
@ -2332,7 +2332,7 @@ static struct member * interface_exists(struct ast_call_queue *q, char *interfac
} }
/* Dump all members in a specific queue to the databse /* Dump all members in a specific queue to the database
* *
* <pm_family>/<queuename> = <interface>;<penalty>;<paused>[|...] * <pm_family>/<queuename> = <interface>;<penalty>;<paused>[|...]
* *
@ -2561,7 +2561,7 @@ static void reload_queue_members(void)
paused_tok = strsep(&member, ";"); paused_tok = strsep(&member, ";");
if (!penalty_tok) { if (!penalty_tok) {
ast_log(LOG_WARNING, "Error parsing persisent member string for '%s' (penalty)\n", queue_name); ast_log(LOG_WARNING, "Error parsing persistent member string for '%s' (penalty)\n", queue_name);
break; break;
} }
penalty = strtol(penalty_tok, NULL, 10); penalty = strtol(penalty_tok, NULL, 10);
@ -2592,7 +2592,7 @@ static void reload_queue_members(void)
ast_mutex_unlock(&qlock); ast_mutex_unlock(&qlock);
if (db_tree) { if (db_tree) {
ast_log(LOG_NOTICE, "Queue members sucessfully reloaded from database.\n"); ast_log(LOG_NOTICE, "Queue members successfully reloaded from database.\n");
ast_db_freetree(db_tree); ast_db_freetree(db_tree);
} }
} }

2
asterisk.8
Unescape View File

@ -77,7 +77,7 @@ socket, the asterisk database, etc.
Provide brief summary of command line arguments and terminate. Provide brief summary of command line arguments and terminate.
.TP .TP
\fB-i\fR \fB-i\fR
Prompt user to intialize any encrypted private keys for IAX2 Prompt user to initialize any encrypted private keys for IAX2
secure authentication during startup. secure authentication during startup.
.TP .TP
\fB-L \fIloadaverage\fB\fR \fB-L \fIloadaverage\fB\fR

2
asterisk.c
Unescape View File

@ -1940,7 +1940,7 @@ static void ast_readconfig(void) {
/* Run as console (-c at startup, implies nofork) */ /* Run as console (-c at startup, implies nofork) */
} else if (!strcasecmp(v->name, "console")) { } else if (!strcasecmp(v->name, "console")) {
ast_set2_flag(&ast_options, ast_true(v->value), AST_OPT_FLAG_CONSOLE); ast_set2_flag(&ast_options, ast_true(v->value), AST_OPT_FLAG_CONSOLE);
/* Run with highg priority if the O/S permits (-p at startup) */ /* Run with high priority if the O/S permits (-p at startup) */
} else if (!strcasecmp(v->name, "highpriority")) { } else if (!strcasecmp(v->name, "highpriority")) {
ast_set2_flag(&ast_options, ast_true(v->value), AST_OPT_FLAG_HIGH_PRIORITY); ast_set2_flag(&ast_options, ast_true(v->value), AST_OPT_FLAG_HIGH_PRIORITY);
/* Initialize RSA auth keys (IAX2) (-i at startup) */ /* Initialize RSA auth keys (IAX2) (-i at startup) */

6
channel.c
Unescape View File

@ -484,7 +484,7 @@ int ast_best_codec(int fmts)
}; };
/* Find the first prefered codec in the format given */ /* Find the first preferred codec in the format given */
for (x=0; x < (sizeof(prefs) / sizeof(prefs[0]) ); x++) for (x=0; x < (sizeof(prefs) / sizeof(prefs[0]) ); x++)
if (fmts & prefs[x]) if (fmts & prefs[x])
return prefs[x]; return prefs[x];
@ -896,7 +896,7 @@ void ast_channel_free(struct ast_channel *chan)
if(chan->music_state) if(chan->music_state)
ast_moh_cleanup(chan); ast_moh_cleanup(chan);
/* Free translatosr */ /* Free translators */
if (chan->readtrans) if (chan->readtrans)
ast_translator_free_path(chan->readtrans); ast_translator_free_path(chan->readtrans);
if (chan->writetrans) if (chan->writetrans)
@ -2907,7 +2907,7 @@ int ast_do_masquerade(struct ast_channel *original)
manager_event(EVENT_FLAG_CALL, "Rename", "Oldname: %s\r\nNewname: %s\r\nUniqueid: %s\r\n", newn, masqn, clone->uniqueid); manager_event(EVENT_FLAG_CALL, "Rename", "Oldname: %s\r\nNewname: %s\r\nUniqueid: %s\r\n", newn, masqn, clone->uniqueid);
manager_event(EVENT_FLAG_CALL, "Rename", "Oldname: %s\r\nNewname: %s\r\nUniqueid: %s\r\n", orig, newn, original->uniqueid); manager_event(EVENT_FLAG_CALL, "Rename", "Oldname: %s\r\nNewname: %s\r\nUniqueid: %s\r\n", orig, newn, original->uniqueid);
/* Swap the technlogies */ /* Swap the technologies */
t = original->tech; t = original->tech;
original->tech = clone->tech; original->tech = clone->tech;
clone->tech = t; clone->tech = t;

Write Preview
Loading…
Cancel
Save