Symbol: my_list
lib/libcurses/tinfo/db_iterator.c
204
FreeAndNull(my_list);
lib/libcurses/tinfo/db_iterator.c
273
&& my_list != 0
lib/libcurses/tinfo/db_iterator.c
274
&& my_list[*state] != 0) {
lib/libcurses/tinfo/db_iterator.c
275
result = my_list[*state];
lib/libcurses/tinfo/db_iterator.c
369
my_list = typeCalloc(char *, blobsize);
lib/libcurses/tinfo/db_iterator.c
371
if (my_list != 0 && my_stat != 0) {
lib/libcurses/tinfo/db_iterator.c
373
my_list[k++] = my_blob;
lib/libcurses/tinfo/db_iterator.c
376
&& ((&my_blob[j] - my_list[k - 1]) != 3
lib/libcurses/tinfo/db_iterator.c
377
|| !quick_prefix(my_list[k - 1]))) {
lib/libcurses/tinfo/db_iterator.c
379
my_list[k++] = &my_blob[j + 1];
lib/libcurses/tinfo/db_iterator.c
386
for (j = 0; my_list[j] != 0; ++j) {
lib/libcurses/tinfo/db_iterator.c
388
if (*my_list[j] == '\0') {
lib/libcurses/tinfo/db_iterator.c
391
my_list[j] = my_copy;
lib/libcurses/tinfo/db_iterator.c
394
trim_formatting(my_list[j]);
lib/libcurses/tinfo/db_iterator.c
396
if (!strcmp(my_list[j], my_list[k])) {
lib/libcurses/tinfo/db_iterator.c
397
T(("duplicate %s", my_list[j]));
lib/libcurses/tinfo/db_iterator.c
399
while ((my_list[j] = my_list[j + 1]) != 0) {
lib/libcurses/tinfo/db_iterator.c
412
for (j = 0; my_list[j] != 0; ++j) {
lib/libcurses/tinfo/db_iterator.c
413
bool found = check_existence(my_list[j], &my_stat[j]);
lib/libcurses/tinfo/db_iterator.c
426
T(("not found %s", my_list[j]));
lib/libcurses/tinfo/db_iterator.c
428
while ((my_list[k] = my_list[k + 1]) != 0) {
lib/libcurses/tinfo/db_iterator.c
453
if (my_list != 0)
lib/libcurses/tinfo/db_iterator.c
454
FreeAndNull(my_list);