Lines Matching refs:sequences
1819 struct line_sequence* sequences;
1913 struct line_sequence* seq = table->sequences;
1973 seq->prev_sequence = table->sequences;
1976 table->sequences = seq;
2375 /* Compare function for line sequences. */
2452 /* Sort the line sequences for quick lookup. */
2458 struct line_sequence *sequences;
2467 /* Allocate space for an array of sequences. */
2469 sequences = (struct line_sequence *) bfd_alloc (table->abfd, amt);
2470 if (sequences == NULL)
2474 seq = table->sequences;
2480 sequences[n].low_pc = seq->low_pc;
2481 sequences[n].prev_sequence = NULL;
2482 sequences[n].last_line = seq->last_line;
2483 sequences[n].line_info_lookup = NULL;
2484 sequences[n].num_lines = n;
2490 qsort (sequences, n, sizeof (struct line_sequence), compare_sequences);
2495 last_high_pc = sequences[0].last_line->address;
2498 if (sequences[n].low_pc < last_high_pc)
2500 if (sequences[n].last_line->address <= last_high_pc)
2505 sequences[n].low_pc = last_high_pc;
2507 last_high_pc = sequences[n].last_line->address;
2511 sequences[num_sequences].low_pc = sequences[n].low_pc;
2512 sequences[num_sequences].last_line = sequences[n].last_line;
2517 table->sequences = sequences;
2862 table->sequences = NULL;
2903 /* Read the statement sequences until there's nothing left. */
2917 compilers generate address sequences that are wildly out of
3105 while (table->sequences != NULL)
3107 struct line_sequence* seq = table->sequences;
3108 table->sequences = table->sequences->prev_sequence;
3132 /* Binary search the array of sequences. */
3138 seq = &table->sequences[mid];