Home
last modified time | relevance | path

Searched refs:previous (Results 1 – 3 of 3) sorted by relevance

/elf/
A Ddl-find_object.c105 struct dlfo_mappings_segment *previous; member
143 for (; seg != NULL; seg = seg->previous) in _dlfo_mappings_segment_count_allocated()
174 result->previous = NULL; in _dlfo_mappings_segment_allocate_unpadded()
193 if (previous == NULL) in _dlfo_mappings_segment_allocate()
196 minimum_growth = 2* previous->allocated; in _dlfo_mappings_segment_allocate()
221 result->previous = previous; in _dlfo_mappings_segment_allocate()
714 target_seg = target_seg->previous; in _dl_find_object_update_1()
755 if (target_seg->previous != NULL) in _dl_find_object_update_1()
756 target_seg->previous->size = 0; in _dl_find_object_update_1()
835 struct dlfo_mappings_segment *previous = seg->previous; in _dl_find_object_freeres() local
[all …]
A Dstringtable.c178 struct stringtable_entry *previous = array[j - 1]; in stringtable_finalize() local
180 if (previous->length >= current->length in stringtable_finalize()
181 && memcmp (&previous->string[previous->length - current->length], in stringtable_finalize()
183 current->offset = (previous->offset + previous->length in stringtable_finalize()
185 else if (__builtin_add_overflow (previous->offset, in stringtable_finalize()
186 previous->length + 1, in stringtable_finalize()
A Ddl-hwcaps.c145 struct dl_hwcaps_priority *previous = _dl_hwcaps_priorities + j - 1; in sort_priorities_by_name() local
151 if (current->name_length < previous->name_length) in sort_priorities_by_name()
154 to_compare = previous->name_length; in sort_priorities_by_name()
155 int cmp = memcmp (current->name, previous->name, to_compare); in sort_priorities_by_name()
157 || (cmp == 0 && current->name_length >= previous->name_length)) in sort_priorities_by_name()
161 struct dl_hwcaps_priority tmp = *previous; in sort_priorities_by_name()
162 *previous = *current; in sort_priorities_by_name()

Completed in 6 milliseconds