static int emit_match(deflate_state *s, struct match match) {
int flush = 0;
- /* matches that are not long enough we need to emit as litterals */
+ /* matches that are not long enough we need to emit as literals */
if (match.match_length < MIN_MATCH) {
while (match.match_length) {
flush += tr_tally_lit(s, s->window[match.strstart]);
if (unlikely(s->lookahead <= match.match_length + MIN_MATCH))
return;
- /* matches that are not long enough we need to emit as litterals */
+ /* matches that are not long enough we need to emit as literals */
if (match.match_length < MIN_MATCH) {
#ifdef NOT_TWEAK_COMPILER
while (match.match_length) {
/* longest_match() with minor change to improve performance (in terms of
* execution time).
*
- * The pristine longest_match() function is sketched bellow (strip the
+ * The pristine longest_match() function is sketched below (strip the
* then-clause of the "#ifdef UNALIGNED_OK"-directive)
*
* ------------------------------------------------------------