Lines Matching full:inputs
30 if (inputs.empty()) { in addInput()
37 inputs.push_back(input); in addInput()
100 // to the inputs vector. We store new thunks via cheap vector append, rather
101 // than costly insertion into the inputs vector.
114 // the inputs and thunks vectors (both ordered by ascending address), which
128 for (ConcatInputSection *isec : inputs) in needsThunks()
134 for (ConcatInputSection *isec : inputs) { in needsThunks()
171 uint64_t isecVA = inputs[callIdx]->getVA(); in estimateStubsInRangeVA()
173 for (size_t i = callIdx; i < inputs.size(); i++) { in estimateStubsInRangeVA()
174 InputSection *isec = inputs[i]; in estimateStubsInRangeVA()
206 for (ConcatInputSection *isec : inputs) in finalizeContents()
212 for (ConcatInputSection *isec : inputs) in finalize()
231 // inputs[finalIdx] is for finalization (address-assignment) in finalize()
234 for (size_t callIdx = 0, endIdx = inputs.size(); callIdx < endIdx; in finalize()
237 finalizeOne(inputs[finalIdx++]); in finalize()
238 ConcatInputSection *isec = inputs[callIdx]; in finalize()
252 alignToPowerOf2(addr + size, inputs[finalIdx]->align) + in finalize()
253 inputs[finalIdx]->getSize(); in finalize()
256 finalizeOne(inputs[finalIdx++]); in finalize()
360 for (ConcatInputSection *isec : inputs) in writeTo()
366 size_t i = 0, ie = inputs.size(); in writeTo()
369 while (i < ie && (t == te || inputs[i]->empty() || in writeTo()
370 inputs[i]->outSecOff < thunks[t]->outSecOff)) { in writeTo()
371 inputs[i]->writeTo(buf + inputs[i]->outSecOff); in writeTo()
374 while (t < te && (i == ie || thunks[t]->outSecOff < inputs[i]->outSecOff)) { in writeTo()