Mercurial > hg > truffle
comparison src/share/vm/memory/memRegion.cpp @ 1972:f95d63e2154a
6989984: Use standard include model for Hospot
Summary: Replaced MakeDeps and the includeDB files with more standardized solutions.
Reviewed-by: coleenp, kvn, kamg
author | stefank |
---|---|
date | Tue, 23 Nov 2010 13:22:55 -0800 |
parents | c18cbe5936b8 |
children | f9be75d21404 |
comparison
equal
deleted
inserted
replaced
1971:e33f46fc48ed | 1972:f95d63e2154a |
---|---|
1 /* | 1 /* |
2 * Copyright (c) 2000, 2004, Oracle and/or its affiliates. All rights reserved. | 2 * Copyright (c) 2000, 2010, Oracle and/or its affiliates. All rights reserved. |
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * | 4 * |
5 * This code is free software; you can redistribute it and/or modify it | 5 * This code is free software; you can redistribute it and/or modify it |
6 * under the terms of the GNU General Public License version 2 only, as | 6 * under the terms of the GNU General Public License version 2 only, as |
7 * published by the Free Software Foundation. | 7 * published by the Free Software Foundation. |
20 * or visit www.oracle.com if you need additional information or have any | 20 * or visit www.oracle.com if you need additional information or have any |
21 * questions. | 21 * questions. |
22 * | 22 * |
23 */ | 23 */ |
24 | 24 |
25 #include "precompiled.hpp" | |
26 #include "memory/memRegion.hpp" | |
27 #include "runtime/globals.hpp" | |
28 | |
25 // A very simple data structure representing a contigous word-aligned | 29 // A very simple data structure representing a contigous word-aligned |
26 // region of address space. | 30 // region of address space. |
27 | |
28 #include "incls/_precompiled.incl" | |
29 #include "incls/_memRegion.cpp.incl" | |
30 | 31 |
31 MemRegion MemRegion::intersection(const MemRegion mr2) const { | 32 MemRegion MemRegion::intersection(const MemRegion mr2) const { |
32 MemRegion res; | 33 MemRegion res; |
33 HeapWord* res_start = MAX2(start(), mr2.start()); | 34 HeapWord* res_start = MAX2(start(), mr2.start()); |
34 HeapWord* res_end = MIN2(end(), mr2.end()); | 35 HeapWord* res_end = MIN2(end(), mr2.end()); |