memRegion.cpp revision 1879
1879N/A * Copyright (c) 2000, 2010, Oracle and/or its affiliates. All rights reserved. 0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 0N/A * This code is free software; you can redistribute it and/or modify it 0N/A * under the terms of the GNU General Public License version 2 only, as 0N/A * published by the Free Software Foundation. 0N/A * This code is distributed in the hope that it will be useful, but WITHOUT 0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 0N/A * version 2 for more details (a copy is included in the LICENSE file that 0N/A * accompanied this code). 0N/A * You should have received a copy of the GNU General Public License version 0N/A * 2 along with this work; if not, write to the Free Software Foundation, 0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 1472N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 304N/A// A very simple data structure representing a contigous word-aligned 0N/A// region of address space. 1909N/A // If one region is empty, return the other 0N/A // Otherwise, regions must overlap or be adjacent 0N/A "non-adjacent or overlapping regions");
0N/A // There seem to be 6 cases: 0N/A // |overlap beginning| 0N/A // |completely overlapping| 0N/A // We can't deal with an interior case because it would 0N/A // produce two disjoint regions as a result. 0N/A // We aren't trying to be optimal in the number of tests below, 0N/A // but the order is important to distinguish the strictly cases 0N/A // from the overlapping cases. 0N/A // overlap beginning 0N/A // completely overlapping