Browse code

- Spelling checked - READMEs updated

Jan Janak authored on 24/08/2004 08:58:23
Showing 59 changed files
... ...
@@ -1,7 +1,7 @@
1 1
 /* $Id$
2 2
  *
3 3
  *
4
- * Copyright (C) 2001-2003 Fhg Fokus
4
+ * Copyright (C) 2001-2003 FhG Fokus
5 5
  *
6 6
  * This file is part of ser, a free SIP server.
7 7
  *
... ...
@@ -2,7 +2,7 @@
2 2
  *
3 3
  * simple, very fast, malloc library
4 4
  *
5
- * Copyright (C) 2001-2003 Fhg Fokus
5
+ * Copyright (C) 2001-2003 FhG Fokus
6 6
  *
7 7
  * This file is part of ser, a free SIP server.
8 8
  *
... ...
@@ -1,7 +1,7 @@
1 1
 /*
2 2
  * $Id$
3 3
  *
4
- * Copyright (C) 2001-2003 Fhg Fokus
4
+ * Copyright (C) 2001-2003 FhG Fokus
5 5
  *
6 6
  * This file is part of ser, a free SIP server.
7 7
  *
... ...
@@ -3,7 +3,7 @@
3 3
  * memory related stuff (malloc & friends)
4 4
  * 
5 5
  *
6
- * Copyright (C) 2001-2003 Fhg Fokus
6
+ * Copyright (C) 2001-2003 FhG Fokus
7 7
  *
8 8
  * This file is part of ser, a free SIP server.
9 9
  *
... ...
@@ -1,7 +1,7 @@
1 1
 /*
2 2
  * $Id$
3 3
  *
4
- * Copyright (C) 2001-2003 Fhg Fokus
4
+ * Copyright (C) 2001-2003 FhG Fokus
5 5
  *
6 6
  * This file is part of ser, a free SIP server.
7 7
  *
... ...
@@ -78,7 +78,7 @@ void memtest()
78 78
 
79 79
 	mem_block=MY_INIT( tst_mem, TEST_SIZE );
80 80
 
81
-	/* coalesing test w/big fragments */
81
+	/* coalescing test w/big fragments */
82 82
 	p0=ma(8194);
83 83
 	p1=ma(8194);
84 84
 	p2=ma(8194);
... ...
@@ -1,7 +1,7 @@
1 1
 /* $Id$
2 2
  *
3 3
  *
4
- * Copyright (C) 2001-2003 Fhg Fokus
4
+ * Copyright (C) 2001-2003 FhG Fokus
5 5
  *
6 6
  * This file is part of ser, a free SIP server.
7 7
  *
... ...
@@ -30,7 +30,7 @@
30 30
  *  ????-??-??  created by andrei
31 31
  *  2003-04-14  more debugging added in DBG_QM_MALLOC mode (andrei)
32 32
  *  2003-06-29  added qm_realloc (andrei)
33
- *  2004-07-19  fragments book keeping code and suport for 64 bits
33
+ *  2004-07-19  fragments book keeping code and support for 64 bits
34 34
  *               memory blocks (64 bits machine & size>=2^32) (andrei)
35 35
  *              GET_HASH s/</<=/ (avoids waste of 1 hash cell) (andrei)
36 36
  */
... ...
@@ -548,7 +548,7 @@ void* qm_realloc(struct qm_block* qm, void* p, unsigned int size)
548 548
 #ifdef DBG_QM_MALLOC
549 549
 		DBG("qm_realloc: shrinking from %ld to %d\n", f->size, size);
550 550
 		if(split_frag(qm, f, size, file, "fragm. from qm_realloc", line)!=0){
551
-		DBG("qm_realloc : shrinked succesfull\n");
551
+		DBG("qm_realloc : shrinked successful\n");
552 552
 #else
553 553
 		if(split_frag(qm, f, size)!=0){
554 554
 #endif
... ...
@@ -2,7 +2,7 @@
2 2
  *
3 3
  * simple & fast malloc library
4 4
  *
5
- * Copyright (C) 2001-2003 Fhg Fokus
5
+ * Copyright (C) 2001-2003 FhG Fokus
6 6
  *
7 7
  * This file is part of ser, a free SIP server.
8 8
  *
... ...
@@ -54,7 +54,7 @@
54 54
 #else /* DBG_QM_MALLOC */
55 55
 	#define ROUNDTO		16 /* size we round to, must be = 2^n  and also
56 56
 							 sizeof(qm_frag)+sizeof(qm_frag_end)
57
-							 must be mutliple of ROUNDTO!
57
+							 must be multiple of ROUNDTO!
58 58
 						   */
59 59
 #endif
60 60
 #define MIN_FRAG_SIZE	ROUNDTO
... ...
@@ -2,7 +2,7 @@
2 2
  *
3 3
  * Shared memory functions
4 4
  *
5
- * Copyright (C) 2001-2003 Fhg Fokus
5
+ * Copyright (C) 2001-2003 FhG Fokus
6 6
  *
7 7
  * This file is part of ser, a free SIP server.
8 8
  *
... ...
@@ -28,7 +28,7 @@
28 28
 /*
29 29
  * History:
30 30
  * --------
31
- *  2003-03-12  splited shm_mem_init in shm_getmem & shm_mem_init_mallocs
31
+ *  2003-03-12  split shm_mem_init in shm_getmem & shm_mem_init_mallocs
32 32
  *               (andrei)
33 33
  *  2004-07-27  ANON mmap support, needed on darwin (andrei)
34 34
  */
... ...
@@ -81,7 +81,7 @@ inline static void* sh_realloc(void* p, unsigned int size)
81 81
 }
82 82
 
83 83
 /* look at a buffer if there is perhaps enough space for the new size
84
-   (It is benefitial to do so because vq_malloc is pretty stateful
84
+   (It is beneficial to do so because vq_malloc is pretty stateful
85 85
     and if we ask for a new buffer size, we can still make it happy
86 86
     with current buffer); if so, we return current buffer again;
87 87
     otherwise, we free it, allocate a new one and return it; no
... ...
@@ -2,7 +2,7 @@
2 2
  *
3 3
  * shared mem stuff
4 4
  *
5
- * Copyright (C) 2001-2003 Fhg Fokus
5
+ * Copyright (C) 2001-2003 FhG Fokus
6 6
  *
7 7
  * This file is part of ser, a free SIP server.
8 8
  *
... ...
@@ -66,7 +66,7 @@
66 66
 #	define MY_FREE vqm_free
67 67
 #	define MY_STATUS vqm_status
68 68
 #	define  shm_malloc_init vqm_malloc_init
69
-#	warn "no proper vq_realloc implementantion, try another memory allocator"
69
+#	warn "no proper vq_realloc implementation, try another memory allocator"
70 70
 #elif defined F_MALLOC
71 71
 #	include "f_malloc.h"
72 72
 	extern struct fm_block* shm_block;
... ...
@@ -1,6 +1,6 @@
1 1
 /* $Id$
2 2
  *
3
- * Copyright (C) 2001-2003 Fhg Fokus
3
+ * Copyright (C) 2001-2003 FhG Fokus
4 4
  *
5 5
  * This file is part of ser, a free SIP server.
6 6
  *
... ...
@@ -34,7 +34,7 @@
34 34
  *
35 35
  * About:
36 36
  * aggressive, wasteful and very quick malloc library built for
37
- * servers that continuously alocate and release chunks of only
37
+ * servers that continuously allocate and release chunks of only
38 38
  * few sizes:
39 39
  * - free lists are organized by size (which eliminates long list traversal 
40 40
  *   thru short free chunks if a long one is asked)
... ...
@@ -43,17 +43,17 @@
43 43
  *    freeing
44 44
  * - the last bucket holds unlikely, huge, variable length chunks;
45 45
  *   they are maintained as stack growing from the opposite direction
46
- *   of our heap; coalesing is enabled; stack-like first-fit used to
46
+ *   of our heap; coalescing is enabled; stack-like first-fit used to
47 47
  *   find free fragments
48 48
  *
49
- * TODO: possibly, some delayed coalescation wouldn't hurt; also, further
49
+ * TODO: possibly, some delayed coalescence wouldn't hurt; also, further
50 50
  * optimization will certainly speed-up the entire process a lot; using
51 51
  * knowledge of application as well as trying to make pipeline happy
52 52
  * (from which I am sadly far away now)
53 53
  * provides optimization space; trying to use other memory allocators
54 54
  * to compare would be a great thing to do too;
55 55
  *
56
- * also, comparing to other memory allocaters (like Horde) would not
56
+ * also, comparing to other memory allocators (like Horde) would not
57 57
  * be a bad idea: those folks have been doing that for ages and specifically
58 58
  * Horde has been heavily optimized for multi-processor machines
59 59
  *
... ...
@@ -158,7 +158,7 @@ unsigned char size2bucket( struct vqm_block* qm, int *size  )
158 158
 		b = qm->s2b[ real_size ];
159 159
 		*size = qm->s2s[ real_size ];
160 160
 	/* there might be various allocations slightly 1>1k, I still
161
-	   don't want to be too agressive and increase useless 
161
+	   don't want to be too aggressive and increase useless 
162 162
 	   allocations in small steps
163 163
     	*/	
164 164
 	} else {
... ...
@@ -396,8 +396,8 @@ void vqm_free(struct vqm_block* qm, void* p)
396 396
 		next=FRAG_NEXT(f);
397 397
 		if  ((char *)next +sizeof( struct vqm_frag) < qm->core_end) {
398 398
 			VQM_DEBUG_FRAG(qm, next);
399
-			if (! FRAG_ISUSED(next)) { /* coalescate with next fragment */
400
-				DBG("vqm_free: coalescated with next\n");
399
+			if (! FRAG_ISUSED(next)) { /* coalesce with next fragment */
400
+				DBG("vqm_free: coalesced with next\n");
401 401
 				vqm_detach_free(qm, next);
402 402
 				f->size+=next->size;
403 403
 				FRAG_END(f)->size=f->size;
... ...
@@ -407,8 +407,8 @@ void vqm_free(struct vqm_block* qm, void* p)
407 407
 		if (first_big &&  f>first_big) {
408 408
 			prev=FRAG_PREV(f);
409 409
 			VQM_DEBUG_FRAG(qm, prev);
410
-			if (!FRAG_ISUSED(prev)) { /* coalescate with prev fragment */
411
-				DBG("vqm_free: coalescated with prev\n");
410
+			if (!FRAG_ISUSED(prev)) { /* coalesce with prev fragment */
411
+				DBG("vqm_free: coalesced with prev\n");
412 412
 				vqm_detach_free(qm, prev );
413 413
 				prev->size+=f->size;
414 414
 				f=prev;
... ...
@@ -1,7 +1,7 @@
1 1
 /* $Id$
2 2
  *
3 3
  *
4
- * Copyright (C) 2001-2003 Fhg Fokus
4
+ * Copyright (C) 2001-2003 FhG Fokus
5 5
  *
6 6
  * This file is part of ser, a free SIP server.
7 7
  *
... ...
@@ -35,7 +35,9 @@ Jiri Kuthan
35 35
 
36 36
         1.4. Exported Functions
37 37
 
38
-              1.4.1. t_relay_to(ip, port)
38
+              1.4.1. t_relay_to_udp(ip, port), t_relay_to_tcp(ip,
39
+                      port)
40
+
39 41
               1.4.2. t_relay()
40 42
               1.4.3. t_on_negative(reply_route)
41 43
               1.4.4. append_branch()
... ...
@@ -68,7 +70,7 @@ Jiri Kuthan
68 68
    1-7. Set retr_timer1p4 parameter
69 69
    1-8. Set retr_timer2 parameter
70 70
    1-9. Set noisy_ctimer parameter
71
-   1-10. t_relay_to usage
71
+   1-10. t_relay_to_udp usage
72 72
    1-11. t_relay usage
73 73
    1-12. t_on_negative usage
74 74
    1-13. append_branch usage
... ...
@@ -89,36 +91,37 @@ Chapter 1. User's Guide
89 89
    and CPU, is some services inherently need state. For example,
90 90
    transaction-based accounting (module acc) needs to process
91 91
    transaction state as opposed to individual messages, and any
92
-   kinds of forking must be implemented statefuly. Other use of
92
+   kinds of forking must be implemented statefully. Other use of
93 93
    stateful processing is it trading CPU caused by retransmission
94 94
    processing for memory. That makes however only sense if CPU
95 95
    consumption per request is huge. For example, if you want to
96 96
    avoid costly DNS resolution for every retransmission of a
97
-   request to an unresolveable destination, use stateful mode.
97
+   request to an unresolvable destination, use stateful mode.
98 98
    Then, only the initial message burdens server by DNS queries,
99
-   subsequent retranmissions will be dropped and will not result
99
+   subsequent retransmissions will be dropped and will not result
100 100
    in more processes blocked by DNS resolution. The price is more
101 101
    memory consumption and higher processing latency.
102 102
 
103
-   From user's perspective, there are two major functions :
104
-   t_relay and t_relay_to. Both setup transaction state, absorb
105
-   retransmissions from upstream, generate downstream
106
-   retransmissions and correlate replies to requests. t_relay
107
-   forwards to current URI (be it original request's URI or a URI
108
-   changed by some of URI-modifying functions, such as sethost).
109
-   t_relay_to forwards to a specific address.
103
+   From user's perspective, there are these major functions :
104
+   t_relay, t_relay_to_udp and t_relay_to_tcp. All of them setup
105
+   transaction state, absorb retransmissions from upstream,
106
+   generate downstream retransmissions and correlate replies to
107
+   requests. t_relay forwards to current URI (be it original
108
+   request's URI or a URI changed by some of URI-modifying
109
+   functions, such as sethost). t_relay_to_udp and t_relay_to_tcp
110
+   forward to a specific address over UDP or TCP respectively.
110 111
 
111 112
    In general, if TM is used, it copies clones of received SIP
112 113
    messages in shared memory. That costs the memory and also CPU
113 114
    time (memcpys, lookups, shmem locks, etc.) Note that non-TM
114 115
    functions operate over the received message in private memory,
115 116
    that means that any core operations will have no effect on
116
-   statefuly processed messages after creating the transactional
117
+   statefully processed messages after creating the transactional
117 118
    state. For example, calling record_route after t_relay is
118 119
    pretty useless, as the RR is added to privately held message
119 120
    whereas its TM clone is being forwarded.
120 121
 
121
-   TM is quite big and uneasy to programm--lot of mutexes, shared
122
+   TM is quite big and uneasy to program--lot of mutexes, shared
122 123
    memory access, malloc & free, timers--you really need to be
123 124
    careful when you do anything. To simplify TM programming,
124 125
    there is the instrument of callbacks. The callback mechanisms
... ...
@@ -126,7 +129,7 @@ Chapter 1. User's Guide
126 126
    event. See t_hooks.h for a list of possible events.
127 127
 
128 128
    Other things programmers may want to know is UAC--it is a very
129
-   simplictic code which allows you to generate your own
129
+   simplistic code which allows you to generate your own
130 130
    transactions. Particularly useful for things like NOTIFYs or
131 131
    IM gateways. The UAC takes care of all the transaction
132 132
    machinery: retransmissions , FR timeouts, forking, etc. See
... ...
@@ -184,7 +187,7 @@ modparam("tm", "fr_inv_timer", 200)
184 184
    Time for which a transaction stays in memory to absorb delayed
185 185
    messages after it completed; also, when this timer hits,
186 186
    retransmission of local cancels is stopped (a puristic but
187
-   complex behviour would be not to enter wait state until local
187
+   complex behavior would be not to enter wait state until local
188 188
    branches are finished by a final reply or FR timer--we
189 189
    simplified).
190 190
 
... ...
@@ -260,8 +263,8 @@ modparam("tm", "retr_timer2", 8)
260 260
 1.3.9. noisy_ctimer (integer)
261 261
 
262 262
    If set, on FR timer INVITE transactions will be explicitly
263
-   cancelled if possible, silently dropped otherwise. Preferably,
264
-   it is turned off to allow very long ringing. This behaviour is
263
+   canceled if possible, silently dropped otherwise. Preferably,
264
+   it is turned off to allow very long ringing. This behavior is
265 265
    overridden if a request is forked, or some functionality
266 266
    explicitly turned it off for a transaction (like acc does to
267 267
    avoid unaccounted transactions due to expired timer).
... ...
@@ -276,9 +279,9 @@ modparam("tm", "noisy_ctimer", 1)
276 276
 
277 277
 1.4. Exported Functions
278 278
 
279
-1.4.1. t_relay_to(ip, port)
279
+1.4.1. t_relay_to_udp(ip, port), t_relay_to_tcp(ip, port)
280 280
 
281
-   Relay a message statefuly to a fixed destination. This along
281
+   Relay a message statefully to a fixed destination. This along
282 282
    with t_relay is the function most users want to use--all other
283 283
    are mostly for programming. Programmers interested in writing
284 284
    TM logic should review how t_relay is implemented in tm.c and
... ...
@@ -289,15 +292,15 @@ modparam("tm", "noisy_ctimer", 1)
289 289
      * ip - IP address where the message should be sent.
290 290
      * port - Port number.
291 291
 
292
-   Example 1-10. t_relay_to usage
292
+   Example 1-10. t_relay_to_udp usage
293 293
 ...
294
-t_relay_to("1.2.3.4", "5060");
294
+t_relay_to_udp("1.2.3.4", "5060");
295 295
 ...
296 296
      _________________________________________________________
297 297
 
298 298
 1.4.2. t_relay()
299 299
 
300
-   Relay a message statefuly to destination indicated in current
300
+   Relay a message statefully to destination indicated in current
301 301
    URI. (If the original URI was rewritten by UsrLoc, RR,
302 302
    strip/prefix, etc., the new URI will be taken). Returns a
303 303
    negative value on failure--you may still want to send a
... ...
@@ -314,15 +317,15 @@ if (!t_relay()) { sl_reply_error(); break; };
314 314
 
315 315
    Sets reply routing block, to which control is passed after a
316 316
    transaction completed with a negative result but before
317
-   sending a final reply. In the refered block, you can either
317
+   sending a final reply. In the referred block, you can either
318 318
    start a new branch (good for services such as
319 319
    forward_on_no_reply) or send a final reply on your own (good
320 320
    for example for message silo, which received a negative reply
321 321
    from upstream and wants to tell upstream "202 I will take care
322
-   of it"). Note that the set of command which are useable within
322
+   of it"). Note that the set of command which are usable within
323 323
    reply_routes is strictly limited to rewriting URI, initiating
324 324
    new branches, logging, and sending stateful replies (t_reply).
325
-   Any other commands may result in unpredictable behaviour and
325
+   Any other commands may result in unpredictable behavior and
326 326
    possible server failure. Note that whenever reply_route is
327 327
    entered, uri is reset to value which it had on relaying. If it
328 328
    temporarily changed during a reply_route processing,
... ...
@@ -404,7 +407,7 @@ t_reply("404", "Not found");
404 404
 
405 405
    Checks if a transaction exists. Returns a positive value if
406 406
    so, negative otherwise. Most likely you will not want to use
407
-   it, as a typicall application of a looku-up is to introduce a
407
+   it, as a typical application of a looku-up is to introduce a
408 408
    new transaction if none was found. However this is safely
409 409
    (atomically) done using t_newtran.
410 410
 
... ...
@@ -440,7 +443,7 @@ t_release();
440 440
 1.4.10. t_forward_nonack(ip, port)
441 441
 
442 442
    mainly for internal usage--forward a non-ACK request
443
-   statefuly.
443
+   statefully.
444 444
 
445 445
    Meaning of the parameters is as follows:
446 446
 
... ...
@@ -534,7 +537,7 @@ Chapter 2. Developer's Guide
534 534
 
535 535
 2.1. Defines
536 536
 
537
-     * ACK_TAG enables stricter matching of acknowledgemnts
537
+     * ACK_TAG enables stricter matching of acknowledgments
538 538
        including to-tags. Without it, to-tags are ignored. It is
539 539
        disabled by default for two reasons:
540 540
           + It eliminates an unlikely race condition in which
... ...
@@ -543,7 +546,7 @@ Chapter 2. Developer's Guide
543 543
           + It makes UACs happy who set wrong to-tags.
544 544
        It should not make a difference, as there may be only one
545 545
        negative reply sent upstream and 200/ACKs are not matched
546
-       as they consititute another transaction. It will make no
546
+       as they constitute another transaction. It will make no
547 547
        difference at all when the new magic cookie matching is
548 548
        enabled anyway.
549 549
      * CANCEL_TAG similarly enables strict matching of CANCELs
... ...
@@ -3,7 +3,7 @@
3 3
  *
4 4
  * Fast Call-ID Generator
5 5
  *
6
- * Copyright (C) 2001-2003 Fhg Fokus
6
+ * Copyright (C) 2001-2003 FhG Fokus
7 7
  *
8 8
  * This file is part of ser, a free SIP server.
9 9
  *
... ...
@@ -48,7 +48,7 @@
48 48
 #define CALLID_SUFFIX_LEN ( 1 /* - */                                            + \
49 49
 			    5 /* pid */                                          + \
50 50
                            42 /* embedded v4inv6 address can be looong '128.' */ + \
51
-	                    2 /* parenthessis [] */                              + \
51
+	                    2 /* parenthesis [] */                              + \
52 52
                             1 /* ZT 0 */                                         + \
53 53
 	                   16 /* one never knows ;-) */                            \
54 54
                           )
... ...
@@ -3,7 +3,7 @@
3 3
  *
4 4
  * Fast Call-ID Generator
5 5
  *
6
- * Copyright (C) 2001-2003 Fhg Fokus
6
+ * Copyright (C) 2001-2003 FhG Fokus
7 7
  *
8 8
  * This file is part of ser, a free SIP server.
9 9
  *
... ...
@@ -2,7 +2,7 @@
2 2
  * $Id$
3 3
  *
4 4
  *
5
- * Copyright (C) 2001-2003 Fhg Fokus
5
+ * Copyright (C) 2001-2003 FhG Fokus
6 6
  *
7 7
  * This file is part of ser, a free SIP server.
8 8
  *
... ...
@@ -41,7 +41,7 @@
41 41
 */
42 42
 #include "../../hash_func.h"
43 43
 
44
-/* maximumum length of localy generated acknowledgement */
44
+/* maximum length of localy generated acknowledgment */
45 45
 #define MAX_ACK_LEN   1024
46 46
 
47 47
 /* FINAL_RESPONSE_TIMER ... tells how long should the transaction engine
... ...
@@ -76,11 +76,11 @@
76 76
 #define MAX_FROM 512
77 77
 
78 78
 /* messages generated by server */
79
-#define CANCELLING "cancelling"
79
+#define CANCELING "canceling"
80 80
 #define CANCEL_DONE "ok -- no more pending branches"
81
-#define CANCELLED "Request cancelled"
81
+#define CANCELED "Request canceled"
82 82
 
83
-/* ACKnowledgement forking hack -- that is good for phones
83
+/* Acknowledgment forking hack -- that is good for phones
84 84
    which send ACKs to the same outbound proxy; if forking is
85 85
    enabled, the proxy wouldn't know to which branch to forward;
86 86
    without forking, it could forward to other branch than from
... ...
@@ -2,7 +2,7 @@
2 2
  * $Id$
3 3
  *
4 4
  *
5
- * Copyright (C) 2001-2003 Fhg Fokus
5
+ * Copyright (C) 2001-2003 FhG Fokus
6 6
  *
7 7
  * This file is part of ser, a free SIP server.
8 8
  *
... ...
@@ -1,7 +1,7 @@
1 1
 /*
2 2
  * $Id$
3 3
  *
4
- * Copyright (C) 2001-2003 Fhg Fokus
4
+ * Copyright (C) 2001-2003 FhG Fokus
5 5
  *
6 6
  * This file is part of ser, a free SIP server.
7 7
  *
... ...
@@ -350,7 +350,7 @@ static inline int get_route_set(struct sip_msg* _m, rr_t** _rs, unsigned char _o
350 350
 
351 351
 
352 352
 /*
353
- * Extract all necessarry information from a response and put it
353
+ * Extract all necessary information from a response and put it
354 354
  * in a dialog structure
355 355
  */
356 356
 static inline int response2dlg(struct sip_msg* _m, dlg_t* _d)
... ...
@@ -425,7 +425,7 @@ static inline int dlg_new_resp_uac(dlg_t* _d, struct sip_msg* _m)
425 425
 	} else {
426 426
 		     /* 
427 427
 		      * A negative final response, mark the dialog as destroyed
428
-		      * Again, I do not update the structures here becuase it
428
+		      * Again, I do not update the structures here because it
429 429
 		      * makes no sense to me, a dialog shouldn't be used after
430 430
 		      * it is destroyed
431 431
 		      */
... ...
@@ -1,6 +1,6 @@
1 1
 /*
2 2
  * $Id$
3
- * Copyright (C) 2001-2003 Fhg Fokus
3
+ * Copyright (C) 2001-2003 FhG Fokus
4 4
  *
5 5
  * This file is part of ser, a free SIP server.
6 6
  *
... ...
@@ -69,7 +69,7 @@ typedef struct dlg_id {
69 69
 
70 70
 
71 71
 /*
72
- * It is neccessary to analyze the dialog data to find out
72
+ * It is necessary to analyze the dialog data to find out
73 73
  * what URI put into the Record-Route, where the message
74 74
  * should be really sent and how to construct the route
75 75
  * set of the message. This structure stores this information
... ...
@@ -101,7 +101,7 @@ typedef struct dlg {
101 101
 	rr_t* route_set;        /* Route set */
102 102
 	dlg_hooks_t hooks;      /* Various hooks used to store information that
103 103
 				 * can be reused when building a message (to
104
-				 * prevent repeated analysing of the dialog data
104
+				 * prevent repeated analyzing of the dialog data
105 105
 				 */
106 106
 } dlg_t;
107 107
 
... ...
@@ -18,7 +18,7 @@
18 18
 	<itemizedlist>
19 19
 	    <listitem>
20 20
 		<para>
21
-		    ACK_TAG enables stricter matching of acknowledgemnts including to-tags. Without
21
+		    ACK_TAG enables stricter matching of acknowledgments including to-tags. Without
22 22
 		    it, to-tags are ignored. It is disabled by default for two reasons: 
23 23
 		</para>
24 24
 		<itemizedlist>
... ...
@@ -40,7 +40,7 @@
40 40
 		<para>
41 41
 		    It should not make a difference, as there may be only one
42 42
 		    negative reply sent upstream and 200/ACKs are not matched
43
-		    as they consititute another transaction. It will make no
43
+		    as they constitute another transaction. It will make no
44 44
 		    difference at all when the new magic cookie matching is
45 45
 		    enabled anyway.
46 46
 		</para>
... ...
@@ -18,13 +18,13 @@
18 18
 	    use of stateful logic, which is costly in terms of memory and <acronym>CPU</acronym>, is
19 19
 	    some services inherently need state. For example, transaction-based accounting (module
20 20
 	    acc) needs to process transaction state as opposed to individual messages, and any kinds
21
-	    of forking must be implemented statefuly. Other use of stateful processing is it trading
21
+	    of forking must be implemented statefully. Other use of stateful processing is it trading
22 22
 	    <acronym>CPU</acronym> caused by retransmission processing for memory. That makes
23 23
 	    however only sense if <acronym>CPU</acronym> consumption per request is huge. For
24 24
 	    example, if you want to avoid costly <acronym>DNS</acronym> resolution for every
25
-	    retransmission of a request to an unresolveable destination, use stateful mode. Then,
25
+	    retransmission of a request to an unresolvable destination, use stateful mode. Then,
26 26
 	    only the initial message burdens server by <acronym>DNS</acronym> queries, subsequent
27
-	    retranmissions will be dropped and will not result in more processes blocked by
27
+	    retransmissions will be dropped and will not result in more processes blocked by
28 28
 	    <acronym>DNS</acronym> resolution. The price is more memory consumption and higher
29 29
 	    processing latency.
30 30
 	</para>
... ...
@@ -42,20 +42,20 @@
42 42
 	    messages in shared memory. That costs the memory and also <acronym>CPU</acronym> time
43 43
 	    (memcpys, lookups, shmem locks, etc.)  Note that non-<acronym>TM</acronym> functions
44 44
 	    operate over the received message in private memory, that means that any core operations
45
-	    will have no effect on statefuly processed messages after creating the transactional
45
+	    will have no effect on statefully processed messages after creating the transactional
46 46
 	    state. For example, calling record_route <emphasis>after</emphasis> t_relay is pretty
47 47
 	    useless, as the <acronym>RR</acronym> is added to privately held message whereas its
48 48
 	    <acronym>TM</acronym> clone is being forwarded.
49 49
 	</para>
50 50
 	<para>
51
-	    <acronym>TM</acronym> is quite big and uneasy to programm--lot of mutexes, shared memory
51
+	    <acronym>TM</acronym> is quite big and uneasy to program--lot of mutexes, shared memory
52 52
 	    access, malloc & free, timers--you really need to be careful when you do anything. To
53 53
 	    simplify <acronym>TM</acronym> programming, there is the instrument of callbacks. The
54 54
 	    callback mechanisms allow programmers to register their functions to specific event. See
55 55
 	    t_hooks.h for a list of possible events.
56 56
 	</para>
57 57
 	<para>
58
-	    Other things programmers may want to know is &uac;--it is a very simplictic code which
58
+	    Other things programmers may want to know is &uac;--it is a very simplistic code which
59 59
 	    allows you to generate your own transactions. Particularly useful for things like
60 60
 	    NOTIFYs or <acronym>IM</acronym> gateways. The &uac; takes care of all the transaction
61 61
 	    machinery: retransmissions , FR timeouts, forking, etc.  See t_uac prototype in uac.h
... ...
@@ -141,7 +141,7 @@ modparam("tm", "fr_inv_timer", 200)
141 141
 	    <para>
142 142
 		Time for which a transaction stays in memory to absorb delayed messages after it
143 143
 		completed; also, when this timer hits, retransmission of local cancels is stopped (a
144
-		puristic but complex behviour would be not to enter wait state until local branches
144
+		puristic but complex behavior would be not to enter wait state until local branches
145 145
 		are finished by a final reply or FR timer--we simplified).
146 146
 	    </para>
147 147
 	    <para>
... ...
@@ -263,9 +263,9 @@ modparam("tm", "retr_timer2", 8)
263 263
 	<section>
264 264
 	    <title><varname>noisy_ctimer</varname> (integer)</title>
265 265
 	    <para>
266
-		If set, on FR timer INVITE transactions will be explicitly cancelled if possible,
266
+		If set, on FR timer INVITE transactions will be explicitly canceled if possible,
267 267
 		silently dropped otherwise. Preferably, it is turned off to allow very long ringing.
268
-		This behaviour is overridden if a request is forked, or some functionality
268
+		This behavior is overridden if a request is forked, or some functionality
269 269
 		explicitly turned it off for a transaction (like acc does to avoid unaccounted
270 270
 		transactions due to expired timer).
271 271
 	    </para>
... ...
@@ -295,7 +295,7 @@ modparam("tm", "noisy_ctimer", 1)
295 295
 		<function moreinfo="none">t_relay_to_tcp(ip, port)</function>
296 296
 	    </title>
297 297
 	    <para>
298
-		Relay a message statefuly to a fixed destination. This along with <function
298
+		Relay a message statefully to a fixed destination. This along with <function
299 299
 		    moreinfo="none">t_relay</function> is the function most users want to use--all
300 300
 		other are mostly for programming. Programmers interested in writing
301 301
 		<acronym>TM</acronym> logic should review how t_relay is implemented in tm.c and
... ...
@@ -327,7 +327,7 @@ t_relay_to_udp("1.2.3.4", "5060");
327 327
 		<function moreinfo="none">t_relay()</function>
328 328
 	    </title>
329 329
 	    <para>
330
-		Relay a message statefuly to destination indicated in current &uri;. (If the
330
+		Relay a message statefully to destination indicated in current &uri;. (If the
331 331
 		original &uri; was rewritten by UsrLoc, RR, strip/prefix, etc., the new &uri; will
332 332
 		be taken). Returns a negative value on failure--you may still want to send a
333 333
 		negative reply upstream statelessly not to leave upstream &uac; in lurch.
... ...
@@ -348,14 +348,14 @@ if (!t_relay()) { sl_reply_error(); break; };
348 348
 	    </title>
349 349
 	    <para>
350 350
 		Sets reply routing block, to which control is passed after a transaction completed
351
-		with a negative result but before sending a final reply. In the refered block, you
351
+		with a negative result but before sending a final reply. In the referred block, you
352 352
 		can either start a new branch (good for services such as forward_on_no_reply) or
353 353
 		send a final reply on your own (good for example for message silo, which received a
354 354
 		negative reply from upstream and wants to tell upstream <quote>202 I will take care
355
-		of it</quote>). Note that the set of command which are useable within reply_routes
355
+		of it</quote>). Note that the set of command which are usable within reply_routes
356 356
 		is strictly limited to rewriting &uri;, initiating new branches, logging, and
357 357
 		sending stateful replies (<function>t_reply</function>). Any other commands may
358
-		result in unpredictable behaviour and possible server failure. Note that whenever
358
+		result in unpredictable behavior and possible server failure. Note that whenever
359 359
 		reply_route is entered, uri is reset to value which it had on relaying. If it
360 360
 		temporarily changed during a reply_route processing, subsequent reply_route will
361 361
 		ignore the changed value and use again the original one.
... ...
@@ -472,7 +472,7 @@ t_reply("404", "Not found");
472 472
 	    </title>
473 473
 	    <para>
474 474
 		Checks if a transaction exists. Returns a positive value if so, negative otherwise.
475
-		Most likely you will not want to use it, as a typicall application of a looku-up is
475
+		Most likely you will not want to use it, as a typical application of a looku-up is
476 476
 		to introduce a new transaction if none was found. However this is safely
477 477
 		(atomically) done using <function>t_newtran</function>.
478 478
 	    </para>
... ...
@@ -528,7 +528,7 @@ t_release();
528 528
 		<function moreinfo="none">t_forward_nonack(ip, port)</function>
529 529
 	    </title>
530 530
 	    <para>
531
-		mainly for internal usage--forward a non-ACK request statefuly.
531
+		mainly for internal usage--forward a non-ACK request statefully.
532 532
 	    </para>
533 533
 	    <para>Meaning of the parameters is as follows:</para>
534 534
 	    <itemizedlist>
... ...
@@ -7,7 +7,7 @@
7 7
  *
8 8
  * I admit it is not a nice hack; -jiri 
9 9
  *
10
- * Copyright (C) 2001-2003 Fhg Fokus
10
+ * Copyright (C) 2001-2003 FhG Fokus
11 11
  *
12 12
  * This file is part of ser, a free SIP server.
13 13
  *
... ...
@@ -31,7 +31,7 @@
31 31
  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
32 32
  */
33 33
 /*
34
- * Histoy:
34
+ * History:
35 35
  * -------
36 36
  *  2003-11-24  changed free_via_lump to free_via_clen_lump and make it
37 37
  *              handle CONTENTLENGTH lumps also (andrei)
... ...
@@ -1,7 +1,7 @@
1 1
 /*
2 2
  * $Id$
3 3
  *
4
- * Copyright (C) 2001-2003 Fhg Fokus
4
+ * Copyright (C) 2001-2003 FhG Fokus
5 5
  *
6 6
  * This file is part of ser, a free SIP server.
7 7
  *
... ...
@@ -182,7 +182,7 @@ static inline void init_synonym_id( struct cell *t )
182 182
 		p_msg=t->uas.request;
183 183
 		if (p_msg) {
184 184
 			/* char value of a proxied transaction is
185
-			   calculated out of header-fileds forming
185
+			   calculated out of header-fields forming
186 186
 			   transaction key
187 187
 			*/
188 188
 			char_msg_val( p_msg, t->md5 );
... ...
@@ -351,14 +351,14 @@ error0:
351 351
 
352 352
 
353 353
 /*  Takes an already created cell and links it into hash table on the
354
- *  appropiate entry. */
354
+ *  appropriate entry. */
355 355
 void insert_into_hash_table_unsafe( struct cell * p_cell, unsigned int _hash )
356 356
 {
357 357
 	struct entry* p_entry;
358 358
 
359 359
 	p_cell->hash_index=_hash;
360 360
 
361
-	/* locates the apropiate entry */
361
+	/* locates the appropriate entry */
362 362
 	p_entry = &tm_table->entrys[ _hash ];
363 363
 
364 364
 	p_cell->label = p_entry->next_label++;
... ...
@@ -1,7 +1,7 @@
1 1
 /*
2 2
  * $Id$
3 3
  *
4
- * Copyright (C) 2001-2003 Fhg Fokus
4
+ * Copyright (C) 2001-2003 FhG Fokus
5 5
  *
6 6
  * This file is part of ser, a free SIP server.
7 7
  *
... ...
@@ -90,7 +90,7 @@ void unlock_hash(int i);
90 90
    REQ_RPLD means that a transaction has been replied -- either
91 91
             it implies going to wait state, or for invite transactions
92 92
             FR timer is ticking until ACK arrives
93
-   REQ_RLSD means that a transaction was put on wait explicitely
93
+   REQ_RLSD means that a transaction was put on wait explicitly
94 94
             from t_release_transaction
95 95
    REQ_EXIST means that this request is a retransmission which does not
96 96
             affect transactional state
... ...
@@ -114,7 +114,7 @@ typedef struct retr_buf
114 114
 	struct timer_link fr_timer;
115 115
 	enum lists retr_list;
116 116
 
117
-	/*the cell that containes this retrans_buff*/
117
+	/*the cell that contains this retrans_buff*/
118 118
 	struct cell* my_T;
119 119
 	unsigned int branch;
120 120
 }retr_buf_type;
... ...
@@ -143,7 +143,7 @@ typedef struct ua_client
143 143
 {
144 144
 	struct retr_buf  request;
145 145
 	/* we maintain a separate copy of cancel rather than
146
-	   reuse the strructure for original request; the 
146
+	   reuse the structure for original request; the 
147 147
 	   original request is no longer needed but its delayed
148 148
 	   timer may fire and interfere with whoever tries to
149 149
 	   rewrite it
... ...
@@ -167,10 +167,10 @@ struct totag_elem {
167 167
 
168 168
 
169 169
 
170
-/* transaction's falgs */
170
+/* transaction's flags */
171 171
 /* is the transaction's request an INVITE? */
172 172
 #define T_IS_INVITE_FLAG     (1<<0)
173
-/* is this a trnasaction generated by local request? */
173
+/* is this a transaction generated by local request? */
174 174
 #define T_IS_LOCAL_FLAG      (1<<1)
175 175
 /* set to one if you want to disallow silent transaction
176 176
    dropping when C timer hits */
... ...
@@ -1,7 +1,7 @@
1 1
 /*
2 2
  * $Id$
3 3
  *
4
- * Copyright (C) 2001-2003 Fhg Fokus
4
+ * Copyright (C) 2001-2003 FhG Fokus
5 5
  *
6 6
  * This file is part of ser, a free SIP server.
7 7
  *
... ...
@@ -50,8 +50,8 @@
50 50
 #define SEM_MAX		4096
51 51
 
52 52
 /* we implement mutex here using lock sets; as the number of
53
-   sempahores may be limited (e.g. sysv) and number of synchronized 
54
-   elements high, we partition the sync'ed SER elements and share 
53
+   semaphores may be limited (e.g. sysv) and number of synchronized 
54
+   elements high, we partition the synced SER elements and share 
55 55
    semaphores in each of the partitions; we try to use as many 
56 56
    semaphores as OS gives us for finest granularity. 
57 57
 
... ...
@@ -84,7 +84,7 @@ static ser_lock_t* timer_group_lock=0; /* pointer to a TG_NR lock array,
84 84
 								    it's safer if we alloc this in shared mem 
85 85
 									( required for fast lock ) */
86 86
 
87
-/* intitialize the locks; return 0 on success, -1 otherwise
87
+/* initialize the locks; return 0 on success, -1 otherwise
88 88
 */
89 89
 int lock_initialize()
90 90
 {
... ...
@@ -157,7 +157,7 @@ again:
157 157
 					continue;
158 158
 				/* failure after we stepped back; give up */
159 159
 			} else {
160
-					DBG("DEBUG: lock_initialize:   second time sempahore"
160
+					DBG("DEBUG: lock_initialize:   second time semaphore"
161 161
 							" allocation failure\n");
162 162
 					goto error;
163 163
 			}
... ...
@@ -210,7 +210,7 @@ void lock_cleanup()
210 210
 /* remove the semaphore set from system */
211 211
 void lock_cleanup()
212 212
 {
213
-	/* that's system-wide; all othe processes trying to use
213
+	/* that's system-wide; all other processes trying to use
214 214
 	   the semaphore will fail! call only if it is for sure
215 215
 	   no other process lives 
216 216
 	*/
... ...
@@ -257,7 +257,7 @@ int init_entry_lock( struct s_table* ht, struct entry *entry )
257 257
 #else
258 258
 	/* just advice which of the available semaphores to use;
259 259
 	   specifically, all entries are partitioned into as
260
-	   many partitions as number of available semaphors allows
260
+	   many partitions as number of available semaphores allows
261 261
         */
262 262
 	entry->mutex.semaphore_set=entry_semaphore;
263 263
 	entry->mutex.semaphore_index = ( ((char *)entry - (char *)(ht->entrys ) )
... ...
@@ -1,7 +1,7 @@
1 1
 /*
2 2
  * $Id$
3 3
  *
4
- * Copyright (C) 2001-2003 Fhg Fokus
4
+ * Copyright (C) 2001-2003 FhG Fokus
5 5
  *
6 6
  * This file is part of ser, a free SIP server.
7 7
  *
... ...
@@ -12,7 +12,7 @@
12 12
  * not only take lookup in fragment table but also a shmem lock
13 13
  * operation (the same for shm_free)
14 14
  *
15
- * Copyright (C) 2001-2003 Fhg Fokus
15
+ * Copyright (C) 2001-2003 FhG Fokus
16 16
  *
17 17
  * This file is part of ser, a free SIP server.
18 18
  *
... ...
@@ -62,7 +62,7 @@
62 62
 
63 63
 
64 64
 /* rounds to the first 4 byte multiple on 32 bit archs 
65
- * and to the first 8 byte multipe on 64 bit archs */
65
+ * and to the first 8 byte multiple on 64 bit archs */
66 66
 #define ROUND4(s) \
67 67
 	(((s)+(sizeof(char*)-1))&(~(sizeof(char*)-1)))
68 68
 
... ...
@@ -466,7 +466,7 @@ do { \
466 466
 			hdr->body.s);
467 467
 		/* by default, we assume we don't understand this header in TM
468 468
 		   and better set it to zero; if we do, we will set a specific
469
-		   valu in the following switch statement
469
+		   value in the following switch statement
470 470
 		*/
471 471
 		new_hdr->parsed=0;
472 472
 
... ...
@@ -660,7 +660,7 @@ do { \
660 660
 		new_msg->last_header = last_hdr;
661 661
 	}
662 662
 
663
-	/* clonning data lump */
663
+	/* cloning data lump */
664 664
 #define CLONE_LUMP_LIST(anchor, list) \
665 665
 do { \
666 666
 	struct lump* lump_tmp, *l; \
... ...
@@ -1,7 +1,7 @@
1 1
 /*
2 2
  * $Id$
3 3
  *
4
- * Copyright (C) 2001-2003 Fhg Fokus
4
+ * Copyright (C) 2001-2003 FhG Fokus
5 5
  *
6 6
  * This file is part of ser, a free SIP server.
7 7
  *
... ...
@@ -2,7 +2,7 @@
2 2
  * $Id$
3 3
  *
4 4
  *
5
- * Copyright (C) 2001-2003 Fhg Fokus
5
+ * Copyright (C) 2001-2003 FhG Fokus
6 6
  *
7 7
  * This file is part of ser, a free SIP server.
8 8
  *
... ...
@@ -49,7 +49,7 @@
49 49
 #include "../../unixsock_server.h"
50 50
 
51 51
 
52
-/* determine which branches should be cancelled; do it
52
+/* determine which branches should be canceled; do it
53 53
    only from within REPLY_LOCK, otherwise collisions
54 54
    could occur (e.g., two 200 for two branches processed
55 55
    by two processes might concurrently try to generate
... ...
@@ -2,7 +2,7 @@
2 2
  * $Id$
3 3
  *
4 4
  *
5
- * Copyright (C) 2001-2003 Fhg Fokus
5
+ * Copyright (C) 2001-2003 FhG Fokus
6 6
  *
7 7
  * This file is part of ser, a free SIP server.
8 8
  *
... ...
@@ -44,7 +44,7 @@
44 44
    to generate a CANCEL, other processes are not supposed to"
45 45
    (which might happen if for example in a three-branch forking,
46 46
    two 200 would enter separate processes and compete for
47
-   cancelling the third branch); note that to really avoid
47
+   canceling the third branch); note that to really avoid
48 48
    race conditions, the value must be set in REPLY_LOCK
49 49
 */
50 50
 
... ...
@@ -2,7 +2,7 @@
2 2
  * $Id$
3 3
  *
4 4
  *
5
- * Copyright (C) 2001-2003 Fhg Fokus
5
+ * Copyright (C) 2001-2003 FhG Fokus
6 6
  *
7 7
  * This file is part of ser, a free SIP server.
8 8
  *
... ...
@@ -2,7 +2,7 @@
2 2
  * $Id$
3 3
  *
4 4
  *
5
- * Copyright (C) 2001-2003 Fhg Fokus
5
+ * Copyright (C) 2001-2003 FhG Fokus
6 6
  *
7 7
  * This file is part of ser, a free SIP server.
8 8
  *
... ...
@@ -3,7 +3,7 @@
3 3
  *
4 4
  * transaction maintenance functions
5 5
  *
6
- * Copyright (C) 2001-2003 Fhg Fokus
6
+ * Copyright (C) 2001-2003 FhG Fokus
7 7
  *
8 8
  * This file is part of ser, a free SIP server.
9 9
  *
... ...
@@ -1,7 +1,7 @@
1 1
 /*
2 2
  * $Id$
3 3
  *
4
- * Copyright (C) 2001-2003 Fhg Fokus
4
+ * Copyright (C) 2001-2003 FhG Fokus
5 5
  *
6 6
  * This file is part of ser, a free SIP server.
7 7
  *
... ...
@@ -3,7 +3,7 @@
3 3
  *
4 4
  * transaction maintenance functions
5 5
  *
6
- * Copyright (C) 2001-2003 Fhg Fokus
6
+ * Copyright (C) 2001-2003 FhG Fokus
7 7
  *
8 8
  * This file is part of ser, a free SIP server.
9 9
  *
... ...
@@ -107,13 +107,13 @@ void tm_shutdown()
107 107
 	unlink_timer_lists();
108 108
 
109 109
 	/* destroy the hash table */
110
-	DBG("DEBUG: tm_shutdown : empting hash table\n");
110
+	DBG("DEBUG: tm_shutdown : emptying hash table\n");
111 111
 	free_hash_table( );
112 112
 	DBG("DEBUG: tm_shutdown : releasing timers\n");
113 113
 	free_timer_table();
114 114
 	DBG("DEBUG: tm_shutdown : removing semaphores\n");
115 115
 	lock_cleanup();
116
-	DBG("DEBUG: tm_shutdown : destroing tmcb lists\n");
116
+	DBG("DEBUG: tm_shutdown : destroying tmcb lists\n");
117 117
 	destroy_tmcb_lists();
118 118
 	free_tm_stats();
119 119
 	DBG("DEBUG: tm_shutdown : done\n");
... ...
@@ -178,10 +178,10 @@ static int kill_transaction( struct cell *trans )
178 178
 	int reply_ret;
179 179
 	int ret;
180 180
 
181
-	/*  we reply statefuly and enter WAIT state since error might
182
-		have occured in middle of forking and we do not
181
+	/*  we reply statefully and enter WAIT state since error might
182
+		have occurred in middle of forking and we do not
183 183
 		want to put the forking burden on upstream client;
184
-		howver, it may fail too due to lack of memory */
184
+		however, it may fail too due to lack of memory */
185 185
 
186 186
 	ret=err2reason_phrase( ser_error, &sip_err,
187 187
 		err_buffer, sizeof(err_buffer), "TM" );
... ...
@@ -281,7 +281,7 @@ int t_relay_to( struct sip_msg  *p_msg , struct proxy_l *proxy, int proto,
281 281
 	t=get_t();
282 282
 	if (replicate) t->flags|=T_IS_LOCAL_FLAG;
283 283
 
284
-	/* INVITE processing might take long, partcularly because of DNS
284
+	/* INVITE processing might take long, particularly because of DNS
285 285
 	   look-ups -- let upstream know we're working on it */
286 286
 	if (p_msg->REQ_METHOD==METHOD_INVITE )
287 287
 	{
... ...
@@ -1,7 +1,7 @@
1 1
 /*
2 2
  * $Id$
3 3
  *
4
- * Copyright (C) 2001-2003 Fhg Fokus
4
+ * Copyright (C) 2001-2003 FhG Fokus
5 5
  *
6 6
  * This file is part of ser, a free SIP server.
7 7
  *
... ...
@@ -74,7 +74,7 @@ extern int noisy_ctimer;
74 74
 
75 75
 
76 76
 /* send a private buffer: utilize a retransmission structure
77
-   but take a separate buffer not refered by it; healthy
77
+   but take a separate buffer not referred by it; healthy
78 78
    for reducing time spend in REPLIES locks
79 79
 */
80 80
 
... ...
@@ -2,7 +2,7 @@
2 2
  * $Id$
3 3
  *
4 4
  *
5
- * Copyright (C) 2001-2003 Fhg Fokus
5
+ * Copyright (C) 2001-2003 FhG Fokus
6 6
  *
7 7
  * This file is part of ser, a free SIP server.
8 8
  *
... ...
@@ -343,7 +343,7 @@ void e2e_cancel( struct sip_msg *cancel_msg,
343 343
 	}
344 344
 
345 345
 
346
-	/* if error occured, let it know upstream (final reply
346
+	/* if error occurred, let it know upstream (final reply
347 347
 	   will also move the transaction on wait state
348 348
 	*/
349 349
 	if (lowest_error<0) {
... ...
@@ -354,9 +354,9 @@ void e2e_cancel( struct sip_msg *cancel_msg,
354 354
 	*/
355 355
 	} else if (cancel_bm) {
356 356
 		DBG("DEBUG: e2e_cancel: e2e cancel proceeding\n");
357
-		t_reply( t_cancel, cancel_msg, 200, CANCELLING );
357
+		t_reply( t_cancel, cancel_msg, 200, CANCELING );
358 358
 	/* if the transaction exists, but there is no more pending
359
-	   branch, tell usptream we're done
359
+	   branch, tell upstream we're done
360 360
 	*/
361 361
 	} else {
362 362
 		DBG("DEBUG: e2e_cancel: e2e cancel -- no more pending branches\n");
... ...
@@ -366,9 +366,9 @@ void e2e_cancel( struct sip_msg *cancel_msg,
366 366
 #ifdef LOCAL_487
367 367
 
368 368
 	/* local 487s have been deprecated -- it better handles
369
-	 * race conditions (UAS sending 200); hopefuly there are
369
+	 * race conditions (UAS sending 200); hopefully there are
370 370
 	 * no longer UACs who go crazy waiting for the 487 whose
371
-	 * forwarding is being blocked by other unreponsive branch
371
+	 * forwarding is being blocked by other unresponsive branch
372 372
 	 */
373 373
 
374 374
 	/* we could await downstream UAS's 487 replies; however,
... ...
@@ -386,13 +386,13 @@ void e2e_cancel( struct sip_msg *cancel_msg,
386 386
 	   try, and the later one will result in error message 
387 387
 	   "can't reply twice"
388 388
 	*/
389
-	t_reply(t_invite, t_invite->uas.request, 487, CANCELLED );
389
+	t_reply(t_invite, t_invite->uas.request, 487, CANCELED );
390 390
 #endif
391 391
 }
392 392
 
393 393
 
394 394
 /* function returns:
395
- *       1 - forward successfull
395
+ *       1 - forward successful
396 396
  *      -1 - error during forward
397 397
  */
398 398
 int t_forward_nonack( struct cell *t, struct sip_msg* p_msg , 
... ...
@@ -469,7 +469,7 @@ int t_forward_nonack( struct cell *t, struct sip_msg* p_msg ,
469 469
 	/* things went wrong ... no new branch has been fwd-ed at all */
470 470
 	if (added_branches==0) {
471 471
 		if (try_new==0) {
472
-			LOG(L_ERR, "ERROR: t_forward_nonack: no branched for fwding\n");
472
+			LOG(L_ERR, "ERROR: t_forward_nonack: no branched for forwarding\n");
473 473
 			return -1;
474 474
 		}
475 475
 		LOG(L_ERR, "ERROR: t_forward_nonack: failure to add branches\n");
... ...
@@ -2,7 +2,7 @@
2 2
  * $Id$
3 3
  *
4 4
  *
5
- * Copyright (C) 2001-2003 Fhg Fokus
5
+ * Copyright (C) 2001-2003 FhG Fokus
6 6
  *
7 7
  * This file is part of ser, a free SIP server.
8 8
  *
... ...
@@ -1,7 +1,7 @@
1 1
 /*
2 2
  * $Id$
3 3
  *
4
- * Copyright (C) 2001-2003 Fhg Fokus
4
+ * Copyright (C) 2001-2003 FhG Fokus
5 5
  *
6 6
  * This file is part of ser, a free SIP server.
7 7
  *
... ...
@@ -57,7 +57,7 @@ int init_tmcb_lists()
57 57
 	req_in_tmcb_hl = (struct tmcb_head_list*)shm_malloc
58 58
 		( sizeof(struct tmcb_head_list) );
59 59
 	if (req_in_tmcb_hl==0) {
60
-		LOG(L_CRIT,"ERROR:tm:init_tmcb_lists: nomore shared mem\n");
60
+		LOG(L_CRIT,"ERROR:tm:init_tmcb_lists: no more shared mem\n");
61 61
 		return -1;
62 62
 	}
63 63
 	req_in_tmcb_hl->first = 0;
... ...
@@ -115,7 +115,7 @@ inline int insert_tmcb(struct tmcb_head_list *cb_list, int types,
115 115
 
116 116
 /* register a callback function 'f' for 'types' mask of events;
117 117
  * will be called back whenever one of the events occurs in transaction module
118
- * (global or per transacation, depinding of event type)
118
+ * (global or per transaction, depending of event type)
119 119
 */
120 120
 int register_tmcb( struct sip_msg* p_msg, struct cell *t, int types,
121 121
 											transaction_cb f, void *param )
... ...
@@ -1,7 +1,7 @@
1 1
 /*
2 2
  * $Id$
3 3
  *
4
- * Copyright (C) 2001-2003 Fhg Fokus
4
+ * Copyright (C) 2001-2003 FhG Fokus
5 5
  *
6 6
  * This file is part of ser, a free SIP server.
7 7
  *
... ...
@@ -84,16 +84,16 @@ struct cell;
84 84
  * with it).
85 85
  *
86 86
  * TMCB_RESPONSE_IN -- a brand-new reply was received which matches
87
- * an existing transaction. It may or may not be a retranmisssion.
87
+ * an existing transaction. It may or may not be a retransmission.
88 88
  *
89
- *  TMCB_RESPONSE_OUT -- a final reply was sent out (eiter local 
89
+ *  TMCB_RESPONSE_OUT -- a final reply was sent out (either local 
90 90
  *  or proxied) -- there is nothing more you can change from
91 91
  *  the callback, it is good for accounting-like uses.
92 92
  *
93 93
  *    Note: the message passed to callback may also have
94 94
  *    value FAKED_REPLY (like other reply callbacks) which
95
- *    indicates a psedo_reply caused by a timer. Check for
96
- *    this value before derefing -- you will cause a segfault
95
+ *    indicates a pseudo_reply caused by a timer. Check for
96
+ *    this value before deferring -- you will cause a segfault
97 97
  *    otherwise. Check for t->uas.request validity too if you
98 98
  *    need it ... locally initiated UAC transactions set it to 0.
99 99
  *
... ...
@@ -118,8 +118,8 @@ struct cell;
118 118
  *  made to forward a reply; it is parametrized by pkg message 
119 119
  *  which caused the transaction to complete (which is not 
120 120
  *  necessarily the same which will be forwarded). As forwarding
121
- *  has not been executed and may fail, there is no guarentee
122
- *  a reply will be successfuly sent out at this point of time.
121
+ *  has not been executed and may fail, there is no guarantee
122
+ *  a reply will be successfully sent out at this point of time.
123 123
  *
124 124
  *     Note: TMCB_REPLY_ON_FAILURE and TMCB_REPLY_FWDED are
125 125
  *     called from reply mutex which is used to deterministically
... ...
@@ -137,7 +137,7 @@ struct cell;
137 137
  *  TMCB_E2EACK_IN -- called when an ACK belonging to a proxied
138 138
  *  INVITE transaction completed with 200 arrived. Note that
139 139
  *  because it can be only dialog-wise matched, only the first
140
- *  transaction occurence will be matched with spirals. If
140
+ *  transaction occurrence will be matched with spirals. If
141 141
  *  record-routing is not enabled, you will never receive the
142 142
  *  ACK and the callback will be never triggered.
143 143
  *
... ...
@@ -160,7 +160,7 @@ struct cell;
160 160
 */
161 161
 
162 162
 
163
-/* pack structure with all params passed toa callback function */
163
+/* pack structure with all params passed to callback function */
164 164
 struct tmcb_params {
165 165
 	struct sip_msg* req;
166 166
 	struct sip_msg* rpl;
... ...
@@ -5,10 +5,10 @@
5 5
  * existing transactions. Note that we do not do SIP-compliant
6 6
  * request matching as asked by SIP spec. We do bitwise matching of 
7 7
  * all header fields in requests which form a transaction key. 
8
- * It is much faster and it worx pretty well -- we haven't 
8
+ * It is much faster and it works pretty well -- we haven't 
9 9
  * had any interop issue neither in lab nor in bake-offs. The reason
10 10
  * is that retransmissions do look same as original requests
11
- * (it would be really silly if they wuld be mangled). The only
11
+ * (it would be really silly if they would be mangled). The only
12 12
  * exception is we parse To as To in ACK is compared to To in
13 13
  * reply and both  of them are constructed by different software.
14 14
  * 
... ...
@@ -26,7 +26,7 @@
26 26
  * -jiri
27 27
  *
28 28
  *
29
- * Copyright (C) 2001-2003 Fhg Fokus
29
+ * Copyright (C) 2001-2003 FhG Fokus
30 30
  *
31 31
  * This file is part of ser, a free SIP server.
32 32
  *
... ...
@@ -68,7 +68,7 @@
68 68
  * 2003-04-04  bug_fix: RESPONSE_IN callback not called for local
69 69
  *             UAC transactions (jiri)
70 70
  * 2003-04-07  new transactions inherit on_negative and on_relpy from script
71
- *             variables on instatntiation (jiri)
71
+ *             variables on instantiation (jiri)
72 72
  * 2003-04-30  t_newtran clean up (jiri)
73 73
  * 2003-08-21  request lookups fixed to skip UAC transactions, 
74 74
  *             thanks Ed (jiri)
... ...
@@ -254,7 +254,7 @@ static inline int via_matching( struct via_body *inv_via,
254 254
 				ack_via->tid.len)!=0)
255 255
 		return 0;
256 256
 	/* ok, tid matches -- now make sure that the
257
-	 * originater matches too to avoid confusion with
257
+	 * originator matches too to avoid confusion with
258 258
 	 * different senders generating the same tid
259 259
 	 */
260 260
 	if (inv_via->host.len!=ack_via->host.len)
... ...
@@ -376,7 +376,7 @@ int t_lookup_request( struct sip_msg* p_msg , int leave_new_locked )
376 376
 		p_msg->hash_index,isACK);
377 377
 
378 378
 
379
-	/* asume not found */
379
+	/* assume not found */
380 380
 	ret=-1;
381 381
 
382 382
 	/* first of all, look if there is RFC3261 magic cookie in branch; if
... ...
@@ -517,7 +517,7 @@ found:
517 517
 
518 518
 
519 519
 
520
-/* function lookups transaction being cancelled by CANCEL in p_msg;
520
+/* function lookups transaction being canceled by CANCEL in p_msg;
521 521
  * it returns:
522 522
  *       0 - transaction wasn't found
523 523
  *       T - transaction found
... ...
@@ -624,7 +624,7 @@ struct cell* t_lookupOriginalT(  struct sip_msg* p_msg )
624 624
 
625 625
 notfound:
626 626
 	/* no transaction found */
627
-	DBG("DEBUG: t_lookupOriginalT: no CANCEL maching found! \n" );
627
+	DBG("DEBUG: t_lookupOriginalT: no CANCEL matching found! \n" );
628 628
 	UNLOCK_HASH(hash_index);
629 629
 	DBG("DEBUG: t_lookupOriginalT completed\n");
630 630
 	return 0;
... ...
@@ -663,7 +663,7 @@ int t_reply_matching( struct sip_msg *p_msg , int *p_branch )
663 663
 	
664 664
 	short is_cancel;
665 665
 
666
-	/* make compiler warnnings happy */
666
+	/* make compiler warnings happy */
667 667
 	loopi=0;
668 668
 	loopl=0;
669 669
 	syni=0;
... ...
@@ -728,7 +728,7 @@ int t_reply_matching( struct sip_msg *p_msg , int *p_branch )
728 728
 		|| (syn_branch ? (entry_label=reverse_hex2int(syni, synl))<0 
729 729
 			: loopl!=MD5_LEN )
730 730
 	) {
731
-		DBG("DEBUG: t_reply_matching: poor reply lables %d label %d "
731
+		DBG("DEBUG: t_reply_matching: poor reply labels %d label %d "
732 732
 			"branch %d\n",hash_index, entry_label, branch_id );
733 733
 		goto nomatch2;
734 734
 	}
... ...
@@ -763,7 +763,7 @@ int t_reply_matching( struct sip_msg *p_msg , int *p_branch )
763 763
 			continue;
764 764
 
765 765
 		/* does method match ? (remember -- CANCELs have the same branch
766
-		   as cancelled transactions) */
766
+		   as canceled transactions) */
767 767
 		req_method=p_cell->method;
768 768
 		if ( /* method match */
769 769
 			! ((cseq_method.len==req_method.len 
... ...
@@ -771,8 +771,8 @@ int t_reply_matching( struct sip_msg *p_msg , int *p_branch )
771 771
 			/* or it is a local cancel */
772 772
 			|| (is_cancel && is_invite(p_cell)
773 773
 				/* commented out -- should_cancel_branch set it to
774
-				   BUSY_BUFFER to avoid collisions with repliesl;
775
-				   thus, we test here by bbuffer size
774
+				   BUSY_BUFFER to avoid collisions with replies;
775
+				   thus, we test here by buffer size
776 776
 				*/
777 777
 				/* && p_cell->uac[branch_id].local_cancel.buffer ))) */
778 778
 				&& p_cell->uac[branch_id].local_cancel.buffer_len ))) 
... ...
@@ -788,7 +788,7 @@ int t_reply_matching( struct sip_msg *p_msg , int *p_branch )
788 788
 		UNLOCK_HASH(hash_index);
789 789
 		DBG("DEBUG: t_reply_matching: reply matched (T=%p)!\n",T);
790 790
 		/* if this is a 200 for INVITE, we will wish to store to-tags to be
791
-		 * able to distuingish retransmissions later and not to call
791
+		 * able to distinguish retransmissions later and not to call
792 792
  		 * TMCB_RESPONSE_OUT uselessly; we do it only if callbacks are
793 793
 		 * enabled -- except callback customers, nobody cares about 
794 794
 		 * retransmissions of multiple 200/INV or ACK/200s
... ...
@@ -896,7 +896,7 @@ int t_check( struct sip_msg* p_msg , int *param_branch )
896 896
 			p_msg->id,global_msg_id,T);
897 897
 	} else {
898 898
 		if (T)
899
-			DBG("DEBUG: t_check: T alredy found!\n");
899
+			DBG("DEBUG: t_check: T already found!\n");
900 900
 		else
901 901
 			DBG("DEBUG: t_check: T previously sought and not found\n");
902 902
 	}
... ...
@@ -999,7 +999,7 @@ static inline int new_t(struct sip_msg *p_msg)
999 999
 
1000 1000
 	+1	if a request did not match a transaction
1001 1001
 		- it that was an ack, the calling function
1002
-		  shall forward statelessy
1002
+		  shall forward statelessly
1003 1003
 		- otherwise it means, a new transaction was
1004 1004
 		  introduced and the calling function
1005 1005
 		  shall reply/relay/whatever_appropriate
... ...
@@ -1038,7 +1038,7 @@ int t_newtran( struct sip_msg* p_msg )
1038 1038
 			LOG(L_ERR, "ERROR: t_newtran: EoH not parsed\n");
1039 1039
 			return E_OUT_OF_MEM;
1040 1040
 	}
1041
-	/* t_lookup_requests attmpts to find the transaction; 
1041
+	/* t_lookup_requests attempts to find the transaction; 
1042 1042
 	   it also calls check_transaction_quadruple -> it is
1043 1043
 	   safe to assume we have from/callid/cseq/to
1044 1044
 	*/ 
... ...
@@ -1108,7 +1108,7 @@ int t_newtran( struct sip_msg* p_msg )
1108 1108
   	   the transaction 
1109 1109
 	*/
1110 1110
 	if (!init_rb( &T->uas.response, p_msg)) {
1111
-		LOG(L_ERR, "ERROR: t_newtran: unresolveable via1\n");
1111
+		LOG(L_ERR, "ERROR: t_newtran: unresolvable via1\n");
1112 1112
 		put_on_wait( T );
1113 1113
 		t_unref(p_msg);
1114 1114
 		return E_BAD_VIA;
... ...
@@ -1219,7 +1219,7 @@ int t_lookup_callid(struct cell ** trans, str callid, str cseq) {
1219 1219
 	struct cell* p_cell;
1220 1220
 	unsigned hash_index;
1221 1221
 
1222
-	/* I use MAX_HEADER, not shure if this is a good choice... */
1222
+	/* I use MAX_HEADER, not sure if this is a good choice... */
1223 1223
 	char callid_header[MAX_HEADER];
1224 1224
 	char cseq_header[MAX_HEADER];
1225 1225
 	/* save return value of print_* functions here */
... ...
@@ -1257,7 +1257,7 @@ int t_lookup_callid(struct cell ** trans, str callid, str cseq) {
1257 1257
 	for ( p_cell = get_tm_table()->entrys[hash_index].first_cell;
1258 1258
 	  p_cell; p_cell = p_cell->next_cell ) {
1259 1259
 		
1260
-		/* compare complete header fields, casecmp to make shure invite=INVITE */
1260
+		/* compare complete header fields, casecmp to make sure invite=INVITE */
1261 1261
 		if ( (strncmp(callid_header, p_cell->callid.s, p_cell->callid.len) == 0)
1262 1262
 			&& (strncasecmp(cseq_header, p_cell->cseq_n.s, p_cell->cseq_n.len) == 0) ) {
1263 1263
 			DBG("we have a match: callid=>>%.*s<< cseq=>>%.*s<<\n", p_cell->callid.len, 
... ...
@@ -1,7 +1,7 @@
1 1
 /*
2 2
  * $Id$
3 3
  *
4
- * Copyright (C) 2001-2003 Fhg Fokus
4
+ * Copyright (C) 2001-2003 FhG Fokus
5 5
  *
6 6
  * This file is part of ser, a free SIP server.
7 7
  *
... ...
@@ -3,7 +3,7 @@
3 3
  *
4 4
  * message printing
5 5
  *
6
- * Copyright (C) 2001-2003 Fhg Fokus
6
+ * Copyright (C) 2001-2003 FhG Fokus
7 7
  *
8 8
  * This file is part of ser, a free SIP server.
9 9
  *
... ...
@@ -487,7 +487,7 @@ char *build_dlg_ack(struct sip_msg* rpl, struct cell *Trans, unsigned int branch
487 487
 
488 488
 
489 489
 /*
490
- * Convert lenght of body into asciiz
490
+ * Convert length of body into asciiz
491 491
  */
492 492
 static inline int print_content_length(str* dest, str* body)
493 493
 {
... ...
@@ -649,7 +649,7 @@ static inline char* print_cseq(char* w, str* cseq, str* method, struct cell* t)
649 649
 {
650 650
 	t->cseq_n.s = w; 
651 651
 	/* don't include method name and CRLF -- subsequent
652
-	 * local reuqests ACK/CANCEl will add their own */
652
+	 * local requests ACK/CANCEL will add their own */
653 653
 	t->cseq_n.len = CSEQ_LEN + cseq->len; 
654 654
 	w = print_cseq_mini(w, cseq, method);
655 655
 	return w;
... ...
@@ -2,7 +2,7 @@
2 2
  * $Id$
3 3
  *
4 4
  *
5
- * Copyright (C) 2001-2003 Fhg Fokus
5
+ * Copyright (C) 2001-2003 FhG Fokus
6 6
  *
7 7
  * This file is part of ser, a free SIP server.
8 8
  *
... ...
@@ -2,7 +2,7 @@
2 2
  * $Id$
3 3
  *
4 4
  *
5
- * Copyright (C) 2001-2003 Fhg Fokus
5
+ * Copyright (C) 2001-2003 FhG Fokus
6 6
  *
7 7
  * This file is part of ser, a free SIP server.
8 8
  *
... ...
@@ -35,7 +35,7 @@
35 35
  *  2003-02-28  scratchpad compatibility abandoned (jiri)
36 36
  *  2003-03-01  kr set through a function now (jiri)
37 37
  *  2003-03-06  saving of to-tags for ACK/200 matching introduced, 
38
- *              voicemail changes accepted, udpated to new callback
38
+ *              voicemail changes accepted, updated to new callback
39 39
  *              names (jiri)
40 40
  *  2003-03-10  fixed new to tag bug/typo (if w/o {})  (andrei)
41 41
  *  2003-03-16  removed _TOTAG (jiri)
... ...
@@ -119,7 +119,7 @@ static int goto_on_reply=0;
119 119
    t_relay when a reply may arrive after we set this
120 120
    value; that's why we do it how we do it, i.e.,
121 121
    *inside*  t_relay using hints stored in private memory
122
-   before t_reay is called
122
+   before t_relay is called
123 123
 */
124 124
 
125 125
 
... ...
@@ -232,9 +232,9 @@ inline static int update_totag_set(struct cell *t, struct sip_msg *ok)
232 232
 				&& memcmp(i->tag.s, tag->s, tag->len) ==0 ){
233 233
 			/* to tag already recorded */
234 234
 #ifdef XL_DEBUG
235
-			LOG(L_CRIT, "DEBUG: update_totag_set: totag retranmission\n");