search for: compareatoms

...done by parallelizing archive member parsing. But I realized that was not the slowest pass. The single slowest pass in LLD is LayoutPass. Only sort() at the last of Layoutpass::perform takes about 3 seconds (one third of total execution time). It is because the comparison function passed to sort, compareAtoms, does too much stuff. It looks to me that the entire pass is overkill. We don't really need that complexity there. I think nobody is actually depends on the details of the pass's behavior. I'd like to simplify LayoutPass, so that the pass sorts atoms only by file position and position...