low 127 lib/search/regex.c GString *upp, *low; low 131 lib/search/regex.c low = mc_search__tolower_case_str (charset, one_char, str_len); low 138 lib/search/regex.c if (loop >= low->len || upp->str[loop] == low->str[loop]) low 144 lib/search/regex.c (unsigned char) upp->str[loop], (unsigned char) low->str[loop]); low 150 lib/search/regex.c g_string_free (low, TRUE); low 760 lib/widget/input_complete.c int low = 4096; /* Count of max-matched characters. */ low 798 lib/widget/input_complete.c else if (low > si - match_list[i]) low 799 lib/widget/input_complete.c low = si - match_list[i]; low 807 lib/widget/input_complete.c match_list[0] = g_strndup (match_list[1], low); low 1097 lib/widget/input_complete.c int low = 4096; low 1165 lib/widget/input_complete.c if (low > si - last_text) low 1166 lib/widget/input_complete.c low = si - last_text; low 1175 lib/widget/input_complete.c insert_text (input, last_text, low); low 335 src/vfs/smbfs/helpers/include/smb.h uint32 low; low 160 src/vfs/smbfs/helpers/lib/time.c time_t low, high; low 176 src/vfs/smbfs/helpers/lib/time.c low = t - MAX_DST_WIDTH / 2; low 177 src/vfs/smbfs/helpers/lib/time.c if (t < low) low 178 src/vfs/smbfs/helpers/lib/time.c low = TIME_T_MIN; low 185 src/vfs/smbfs/helpers/lib/time.c while (low + 60 * 60 < dst_table[i].start) low 187 src/vfs/smbfs/helpers/lib/time.c if (dst_table[i].start - low > MAX_DST_SKIP * 2) low 190 src/vfs/smbfs/helpers/lib/time.c t = low + (dst_table[i].start - low) / 2; low 194 src/vfs/smbfs/helpers/lib/time.c low = t; low 288 src/vfs/smbfs/helpers/lib/time.c d += (nt->low & 0xFFF00000); low 315 src/vfs/smbfs/helpers/lib/time.c nt.low = IVAL (p, 0); low 331 src/vfs/smbfs/helpers/lib/time.c nt->low = 0; low 344 src/vfs/smbfs/helpers/lib/time.c nt->low = (uint32) (d - ((double) nt->high) * 4.0 * (double) (1 << 30)); low 357 src/vfs/smbfs/helpers/lib/time.c SIVAL (p, 0, nt.low);