| [0b990d] | 1 | //
 | 
|---|
 | 2 | // topology.h
 | 
|---|
 | 3 | //
 | 
|---|
 | 4 | // Copyright (C) 1996 Limit Point Systems, Inc.
 | 
|---|
 | 5 | //
 | 
|---|
 | 6 | // Author: Curtis Janssen <cljanss@limitpt.com>
 | 
|---|
 | 7 | // Maintainer: LPS
 | 
|---|
 | 8 | //
 | 
|---|
 | 9 | // This file is part of the SC Toolkit.
 | 
|---|
 | 10 | //
 | 
|---|
 | 11 | // The SC Toolkit is free software; you can redistribute it and/or modify
 | 
|---|
 | 12 | // it under the terms of the GNU Library General Public License as published by
 | 
|---|
 | 13 | // the Free Software Foundation; either version 2, or (at your option)
 | 
|---|
 | 14 | // any later version.
 | 
|---|
 | 15 | //
 | 
|---|
 | 16 | // The SC Toolkit is distributed in the hope that it will be useful,
 | 
|---|
 | 17 | // but WITHOUT ANY WARRANTY; without even the implied warranty of
 | 
|---|
 | 18 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 | 
|---|
 | 19 | // GNU Library General Public License for more details.
 | 
|---|
 | 20 | //
 | 
|---|
 | 21 | // You should have received a copy of the GNU Library General Public License
 | 
|---|
 | 22 | // along with the SC Toolkit; see the file COPYING.LIB.  If not, write to
 | 
|---|
 | 23 | // the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
 | 
|---|
 | 24 | //
 | 
|---|
 | 25 | // The U.S. Government is granted a limited license as per AL 91-7.
 | 
|---|
 | 26 | //
 | 
|---|
 | 27 | 
 | 
|---|
 | 28 | #ifdef __GNUG__
 | 
|---|
 | 29 | #pragma interface
 | 
|---|
 | 30 | #endif
 | 
|---|
 | 31 | 
 | 
|---|
 | 32 | #ifndef _util_group_topology_h
 | 
|---|
 | 33 | #define _util_group_topology_h
 | 
|---|
 | 34 | 
 | 
|---|
 | 35 | #include <util/class/class.h>
 | 
|---|
 | 36 | #include <util/keyval/keyval.h>
 | 
|---|
 | 37 | 
 | 
|---|
 | 38 | namespace sc {
 | 
|---|
 | 39 | 
 | 
|---|
 | 40 | class GlobalMsgIter: public DescribedClass {
 | 
|---|
 | 41 |   protected:
 | 
|---|
 | 42 |     int me_;
 | 
|---|
 | 43 |     int nproc_;
 | 
|---|
 | 44 |     int root_;
 | 
|---|
 | 45 |     int i_;
 | 
|---|
 | 46 |     int n_; // the number of steps--intialized by derived class CTORs
 | 
|---|
 | 47 |     int fwd_;
 | 
|---|
 | 48 | 
 | 
|---|
 | 49 |     // for sending messages in the forward direction (like a bcast)
 | 
|---|
 | 50 |     virtual int fwdsendto() = 0;
 | 
|---|
 | 51 |     virtual int fwdsend() = 0;
 | 
|---|
 | 52 |     virtual int fwdrecvfrom() = 0;
 | 
|---|
 | 53 |     virtual int fwdrecv() = 0;
 | 
|---|
 | 54 |   public:
 | 
|---|
 | 55 |     GlobalMsgIter(int nproc, int me, int root = 0);
 | 
|---|
 | 56 |     ~GlobalMsgIter();
 | 
|---|
 | 57 |     void backwards() { fwd_ = 0; i_ = n_ - 1; }
 | 
|---|
 | 58 |     void forwards() { fwd_ = 1; i_ = 0; }
 | 
|---|
 | 59 |     void next() { if (fwd_) i_++; else i_--; }
 | 
|---|
 | 60 |     int done() { return i_<0 || i_>=n_; }
 | 
|---|
 | 61 |     int n() { return n_; }
 | 
|---|
 | 62 |     int sendto() { return fwd_?fwdsendto():fwdrecvfrom(); }
 | 
|---|
 | 63 |     int send() { return fwd_?fwdsend():fwdrecv(); }
 | 
|---|
 | 64 |     int recvfrom() { return fwd_?fwdrecvfrom():fwdsendto(); }
 | 
|---|
 | 65 |     int recv() { return fwd_?fwdrecv():fwdsend(); }
 | 
|---|
 | 66 | };
 | 
|---|
 | 67 | 
 | 
|---|
 | 68 | 
 | 
|---|
 | 69 | class MessageGrp;
 | 
|---|
 | 70 | class MachineTopology: public DescribedClass {
 | 
|---|
 | 71 |   public:
 | 
|---|
 | 72 |     MachineTopology();
 | 
|---|
 | 73 |     MachineTopology(const Ref<KeyVal>&);
 | 
|---|
 | 74 |     ~MachineTopology();
 | 
|---|
 | 75 | 
 | 
|---|
 | 76 |     virtual Ref<GlobalMsgIter> global_msg_iter(const Ref<MessageGrp>&,
 | 
|---|
 | 77 |                                              int target) = 0;
 | 
|---|
 | 78 | };
 | 
|---|
 | 79 | 
 | 
|---|
 | 80 | }
 | 
|---|
 | 81 | 
 | 
|---|
 | 82 | #endif
 | 
|---|
 | 83 | 
 | 
|---|
 | 84 | // Local Variables:
 | 
|---|
 | 85 | // mode: c++
 | 
|---|
 | 86 | // c-file-style: "CLJ"
 | 
|---|
 | 87 | // End:
 | 
|---|