commit | fe8ab97ca6973c136d9cf0abb3e8df488e195e91 | [log] [tgz] |
---|---|---|
author | Rupert Swarbrick <rswarbrick@lowrisc.org> | Thu Oct 15 16:25:12 2020 +0100 |
committer | Rupert Swarbrick <rswarbrick@gmail.com> | Tue Oct 27 09:51:22 2020 +0000 |
tree | 656e2f1b41126f0965ae565b77e1bb25d66fbc3f | |
parent | 9932571560c91d0cc509d2e3d55fdc67530ee900 [diff] |
[memutil] Add iterator and merging insertion interfaces to RangedMap If you want to use a RangedMap to represent chunks of memory (say), you will need to be able to merge chunks. Given a merging function, the new Emplace method calls it as necessary to glob things together. This also exposes an iterator interface to allow iteration over the contents. Of course, once we have an iterator interface, the Find() function looks a bit silly, and should probably look more like the C++ standard library find() functions (returning an iterator that might be end()). So we do that too. Signed-off-by: Rupert Swarbrick <rswarbrick@lowrisc.org>
OpenTitan is an open source silicon Root of Trust (RoT) project. OpenTitan will make the silicon RoT design and implementation more transparent, trustworthy, and secure for enterprises, platform providers, and chip manufacturers. OpenTitan is administered by lowRISC CIC as a collaborative project to produce high quality, open IP for instantiation as a full-featured product. See the OpenTitan site and OpenTitan docs for more information about the project.
This repository contains hardware, software and utilities written as part of the OpenTitan project. It is structured as monolithic repository, or “monorepo”, where all components live in one repository. It exists to enable collaboration across partners participating in the OpenTitan project.
The project contains comprehensive documentation of all IPs and tools. You can access it online at docs.opentitan.org.
Have a look at CONTRIBUTING for guidelines on how to contribute code to this repository.
Unless otherwise noted, everything in this repository is covered by the Apache License, Version 2.0 (see LICENSE for full text).