| 1 | //
 | 
|---|
| 2 | // memiter.cc
 | 
|---|
| 3 | //
 | 
|---|
| 4 | // derived from memamsg.cc
 | 
|---|
| 5 | // Copyright (C) 1996 Limit Point Systems, Inc.
 | 
|---|
| 6 | //
 | 
|---|
| 7 | // Author: Curtis Janssen <cljanss@limitpt.com>
 | 
|---|
| 8 | // Maintainer: LPS
 | 
|---|
| 9 | //
 | 
|---|
| 10 | // This file is part of the SC Toolkit.
 | 
|---|
| 11 | //
 | 
|---|
| 12 | // The SC Toolkit is free software; you can redistribute it and/or modify
 | 
|---|
| 13 | // it under the terms of the GNU Library General Public License as published by
 | 
|---|
| 14 | // the Free Software Foundation; either version 2, or (at your option)
 | 
|---|
| 15 | // any later version.
 | 
|---|
| 16 | //
 | 
|---|
| 17 | // The SC Toolkit is distributed in the hope that it will be useful,
 | 
|---|
| 18 | // but WITHOUT ANY WARRANTY; without even the implied warranty of
 | 
|---|
| 19 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 | 
|---|
| 20 | // GNU Library General Public License for more details.
 | 
|---|
| 21 | //
 | 
|---|
| 22 | // You should have received a copy of the GNU Library General Public License
 | 
|---|
| 23 | // along with the SC Toolkit; see the file COPYING.LIB.  If not, write to
 | 
|---|
| 24 | // the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
 | 
|---|
| 25 | //
 | 
|---|
| 26 | // The U.S. Government is granted a limited license as per AL 91-7.
 | 
|---|
| 27 | //
 | 
|---|
| 28 | 
 | 
|---|
| 29 | #ifndef _util_group_memiter_cc
 | 
|---|
| 30 | #define _util_group_memiter_cc
 | 
|---|
| 31 | 
 | 
|---|
| 32 | #ifdef __GNUC__
 | 
|---|
| 33 | #pragma implementation
 | 
|---|
| 34 | #endif
 | 
|---|
| 35 | 
 | 
|---|
| 36 | #include <util/group/memiter.h>
 | 
|---|
| 37 | 
 | 
|---|
| 38 | using namespace sc;
 | 
|---|
| 39 | 
 | 
|---|
| 40 | ///////////////////////////////////////////////////////////////////////
 | 
|---|
| 41 | // The MemoryIter class
 | 
|---|
| 42 | 
 | 
|---|
| 43 | int
 | 
|---|
| 44 | MemoryIter::local(distsize_t offset, int size, int node)
 | 
|---|
| 45 | {
 | 
|---|
| 46 |   if (offset >= offsets_[node] && offset + size <= offsets_[node+1])
 | 
|---|
| 47 |       return 1;
 | 
|---|
| 48 |   return 0;
 | 
|---|
| 49 | }
 | 
|---|
| 50 | 
 | 
|---|
| 51 | MemoryIter::MemoryIter(void *data,
 | 
|---|
| 52 |                        distsize_t *offsets,
 | 
|---|
| 53 |                        int n):
 | 
|---|
| 54 |   offsets_(offsets),
 | 
|---|
| 55 |   n_(n),
 | 
|---|
| 56 |   data_(data),
 | 
|---|
| 57 |   ready_(0)
 | 
|---|
| 58 | {
 | 
|---|
| 59 | }
 | 
|---|
| 60 | 
 | 
|---|
| 61 | void
 | 
|---|
| 62 | MemoryIter::begin(distsize_t offset, int size)
 | 
|---|
| 63 | {
 | 
|---|
| 64 |   offset_ = offset;
 | 
|---|
| 65 |   size_ = size;
 | 
|---|
| 66 | 
 | 
|---|
| 67 |   current_data_ = (char *) data_;
 | 
|---|
| 68 | 
 | 
|---|
| 69 |   distsize_t fence = offset + size;
 | 
|---|
| 70 | 
 | 
|---|
| 71 |   for (node_ = 0; node_ < n_; node_++) {
 | 
|---|
| 72 |       if (offset_ < offsets_[node_ + 1]) {
 | 
|---|
| 73 |           current_offset_ = distsize_to_size(offset_ - offsets_[node_]);
 | 
|---|
| 74 |           if (fence <= offsets_[node_ + 1]) {
 | 
|---|
| 75 |               current_size_ = size_;
 | 
|---|
| 76 |             }
 | 
|---|
| 77 |           else {
 | 
|---|
| 78 |               current_size_ = distsize_to_size(offsets_[node_ + 1] - offset_);
 | 
|---|
| 79 |             }
 | 
|---|
| 80 |           ready_ = 1;
 | 
|---|
| 81 |           return;
 | 
|---|
| 82 |         }
 | 
|---|
| 83 |     }
 | 
|---|
| 84 | 
 | 
|---|
| 85 |   // couldn't find the requested data, this is probably from an
 | 
|---|
| 86 |   // invalid argument
 | 
|---|
| 87 |   ready_ = 0;
 | 
|---|
| 88 | }
 | 
|---|
| 89 | 
 | 
|---|
| 90 | void
 | 
|---|
| 91 | MemoryIter::next()
 | 
|---|
| 92 | {
 | 
|---|
| 93 |   distsize_t fence = offset_ + size_;
 | 
|---|
| 94 | 
 | 
|---|
| 95 |   if (fence <= offsets_[node_ + 1]) {
 | 
|---|
| 96 |       ready_ = 0;
 | 
|---|
| 97 |     }
 | 
|---|
| 98 |   else {
 | 
|---|
| 99 |       node_++;
 | 
|---|
| 100 |       current_data_ += current_size_;
 | 
|---|
| 101 |       if (fence <= offsets_[node_ + 1]) {
 | 
|---|
| 102 |           current_size_ = size_ - distsize_to_size(offsets_[node_] - offset_);
 | 
|---|
| 103 |         }
 | 
|---|
| 104 |       else {
 | 
|---|
| 105 |           current_size_ = distsize_to_size(offsets_[node_+1]-offsets_[node_]);
 | 
|---|
| 106 |         }
 | 
|---|
| 107 |       current_offset_ = 0;
 | 
|---|
| 108 |     }
 | 
|---|
| 109 | }
 | 
|---|
| 110 | 
 | 
|---|
| 111 | #endif
 | 
|---|
| 112 | 
 | 
|---|
| 113 | /////////////////////////////////////////////////////////////////////////////
 | 
|---|
| 114 | 
 | 
|---|
| 115 | // Local Variables:
 | 
|---|
| 116 | // mode: c++
 | 
|---|
| 117 | // c-file-style: "CLJ"
 | 
|---|
| 118 | // End:
 | 
|---|