any performance drawback to using mmap()?

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



the scenario: a single-board computer (SBC) running linux, limited RAM, which opens a potentially very large regular or device file, then possibly hops all over the place processing the contents. currently, this processing uses lseek() to move around in the file, and read() to get the relevant data.

is there any theoretical performance hit to using mmap() for this instead? i'm assuming that, regardless of the size of the actual file, all i will ever really need in RAM are the blocks currently being processed, right?

  so ... would mmap() have any inherent drawbacks in this situation?  thanks.

rday


--
To unsubscribe from this list: send an email with
"unsubscribe kernelnewbies" to ecartis@xxxxxxxxxxxx
Please read the FAQ at http://kernelnewbies.org/FAQ


[Index of Archives]     [Newbies FAQ]     [Linux Kernel Mentors]     [Linux Kernel Development]     [IETF Annouce]     [Git]     [Networking]     [Security]     [Bugtraq]     [Yosemite]     [MIPS Linux]     [ARM Linux]     [Linux RAID]     [Linux SCSI]     [Linux ACPI]
  Powered by Linux