Fix a bunch of typos.
(cherry picked from commits2da5a28a07
,6cddd36139
. 7852c1e572abbc9fee2548a58e377cfbb3eff46d, f85d5b3f528ba19c598cbe77bad2566920bf9dd4, 0f8766a506f25118f732cca10fe44a1c9a0ace6a, 26adfe2d158e6a80d50b4e247c1539b5a07add9f)
This commit is contained in:
parent
647a207bde
commit
fc81223045
|
@ -328,7 +328,7 @@ class BitVector : public Vector<char> {
|
|||
/** Pack into a char array. */
|
||||
void pack(unsigned char*) const;
|
||||
|
||||
/** Unopack from a char array. */
|
||||
/** Unpack from a char array. */
|
||||
void unpack(const unsigned char*);
|
||||
|
||||
/** Make a hexdump string. */
|
||||
|
|
|
@ -77,7 +77,7 @@ class Log {
|
|||
protected:
|
||||
|
||||
std::ostringstream mStream; ///< This is where we write the long.
|
||||
Level mReportLevel; ///< Level of current repot.
|
||||
Level mReportLevel; ///< Level of current report.
|
||||
|
||||
static FILE *sFile;
|
||||
|
||||
|
@ -87,7 +87,7 @@ class Log {
|
|||
:mReportLevel(wReportLevel)
|
||||
{ }
|
||||
|
||||
// Most of the work in in the desctructor.
|
||||
// Most of the work is in the destructor.
|
||||
~Log();
|
||||
|
||||
std::ostringstream& get();
|
||||
|
|
|
@ -322,7 +322,7 @@ bool TransactionTable::find(const L3MobileIdentity& mobileID, TransactionEntry&
|
|||
|
||||
// Since clearDeadEntries is also linear, do that here, too.
|
||||
|
||||
// Brtue force search.
|
||||
// Brute force search.
|
||||
bool foundIt = false;
|
||||
mLock.lock();
|
||||
clearDeadEntries();
|
||||
|
|
|
@ -516,7 +516,7 @@ class TransactionEntry {
|
|||
/** Reset all Q.931 timers. */
|
||||
void resetTimers();
|
||||
|
||||
/** Retrns true if the transaction is "dead". */
|
||||
/** Returns true if the transaction is "dead". */
|
||||
bool dead() const;
|
||||
|
||||
private:
|
||||
|
@ -596,7 +596,7 @@ class TransactionTable {
|
|||
Also clears dead entries during search.
|
||||
@param mobileID The mobile at to search for.
|
||||
@param target A TransactionEntry to accept the found record.
|
||||
@return true is the mobile ID was foind.
|
||||
@return true is the mobile ID was found.
|
||||
*/
|
||||
bool find(const GSM::L3MobileIdentity& mobileID, TransactionEntry& target);
|
||||
|
||||
|
@ -707,7 +707,6 @@ class TMSITable {
|
|||
@param TMSI The TMSI to find.
|
||||
@param target A TMSI record to catch the result.
|
||||
@return true if the TMSI was found.
|
||||
@return Pointer to c-string IMSI or NULL.
|
||||
*/
|
||||
bool find(unsigned TMSI, TMSIRecord& target);
|
||||
|
||||
|
|
|
@ -300,12 +300,12 @@ bool SIPInterface::checkInvite( osip_message_t * msg )
|
|||
// IMSIs are 14 or 15 char + "IMSI" prefix
|
||||
unsigned namelen = strlen(IMSI);
|
||||
if ((namelen>19)||(namelen<18)) {
|
||||
LOG(WARN) << "INVITE with malformed username \"" << IMSI << "\"";
|
||||
LOG(WARN) << "INVITE/MESSAGE with malformed username \"" << IMSI << "\"";
|
||||
return false;
|
||||
}
|
||||
// Skip first 4 char "IMSI".
|
||||
IMSI+=4;
|
||||
// Make the mobile id we need for transaction and paging enties.
|
||||
// Make the mobile id we need for transaction and paging entries.
|
||||
L3MobileIdentity mobile_id(IMSI);
|
||||
|
||||
// Check SIP map. Repeated entry? Page again.
|
||||
|
@ -343,7 +343,7 @@ bool SIPInterface::checkInvite( osip_message_t * msg )
|
|||
if (!callerID) {
|
||||
callerID = emptyString;
|
||||
callerHost = emptyString;
|
||||
LOG(NOTICE) << "INVITE with no From: username for " << mobile_id;
|
||||
LOG(NOTICE) << "INVITE/MESSAGE with no From: username for " << mobile_id;
|
||||
}
|
||||
LOG(DEBUG) << "callerID " << callerID << "@" << callerHost;
|
||||
// Build the transaction table entry.
|
||||
|
|
|
@ -316,7 +316,7 @@ shortcode_register (const char *imsi, const char *msgtext,
|
|||
LOG(DEBUG) << phonenum << " is already in the HLR";
|
||||
answer << gConfig.getStr("SC.Register.Msg.TakenA")
|
||||
<< ' ' << phonenum << ' '
|
||||
<< gConfig.getStr("SC.Register.Msg.TAkenB");
|
||||
<< gConfig.getStr("SC.Register.Msg.TakenB");
|
||||
} else {
|
||||
LOG(DEBUG) << phonenum << " is not in the HLR";
|
||||
// Neither the IMSI nor the phonenum is in use.
|
||||
|
|
Reference in New Issue