• unknown's avatar
    ndb dd · 5bc7f5f9
    unknown authored
      Fix SR bug that extent pages was scanned before undo was run
      Fix bug wrt page flushing/tsman and tup's dirty page list
    
    
    storage/ndb/include/kernel/signaldata/PgmanContinueB.hpp:
      Fix dd SR + dd free space bugs
    storage/ndb/src/kernel/blocks/dblqh/Dblqh.hpp:
      remove some unused code
    storage/ndb/src/kernel/blocks/dblqh/DblqhMain.cpp:
      Add LCP_PREPARE to pgman
      Change order between TSMAN/LGMAN START_RECREQ
    storage/ndb/src/kernel/blocks/dbtup/Dbtup.hpp:
      Fix dd SR + dd free space bugs
    storage/ndb/src/kernel/blocks/dbtup/DbtupCommit.cpp:
      Fix dd SR + dd free space bugs
    storage/ndb/src/kernel/blocks/dbtup/DbtupDiskAlloc.cpp:
      Fix dd SR + dd free space bugs
    storage/ndb/src/kernel/blocks/dbtup/DbtupExecQuery.cpp:
      Fix dd SR + dd free space bugs
    storage/ndb/src/kernel/blocks/dbtup/DbtupScan.cpp:
      Fix dd SR + dd free space bugs
    storage/ndb/src/kernel/blocks/diskpage.hpp:
      Fix dd SR + dd free space bugs
    storage/ndb/src/kernel/blocks/lgman.cpp:
      Fix dd SR + dd free space bugs
    storage/ndb/src/kernel/blocks/pgman.cpp:
      Fix dd SR + dd free space bugs
    storage/ndb/src/kernel/blocks/pgman.hpp:
      Fix dd SR + dd free space bugs
    storage/ndb/src/kernel/blocks/tsman.cpp:
      Fix dd SR + dd free space bugs
    storage/ndb/src/kernel/blocks/tsman.hpp:
      Fix dd SR + dd free space bugs
    storage/ndb/src/kernel/vm/DLFifoList.hpp:
      Fix dd SR + dd free space bugs
    storage/ndb/test/tools/hugoLoad.cpp:
      Fix dd SR + dd free space bugs
    storage/ndb/tools/delete_all.cpp:
      Fix dd SR + dd free space bugs
    5bc7f5f9
DLFifoList.hpp 8.8 KB
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501
/* Copyright (C) 2003 MySQL AB

   This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation; either version 2 of the License, or
   (at your option) any later version.

   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with this program; if not, write to the Free Software
   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA */

#ifndef DLFIFOLIST_HPP
#define DLFIFOLIST_HPP

#include "ArrayPool.hpp"
#include <NdbOut.hpp>

/**
 * Template class used for implementing an
 *   list of object retreived from a pool
 */
template <class T, class U = T>
class DLFifoList {
public:
  /**
   * List head
   */
  struct Head {
    Head();
    Uint32 firstItem;
    Uint32 lastItem;

#ifdef VM_TRACE
    bool in_use;
#endif

    inline bool isEmpty() const { return firstItem == RNIL;}
  };
  
  DLFifoList(ArrayPool<T> & thePool);
  
  /**
   * Allocate an object from pool - update Ptr
   *
   * Return i
   */
  bool seize(Ptr<T> &);

  /**
   * Allocate an object from pool - update Ptr - put in front of list
   *
   * Return i
   */
  bool seizeFront(Ptr<T> &);

  /**
   * Allocate object <b>i</b> from pool - update Ptr
   *
   * Return i
   */
  bool seizeId(Ptr<T> &, Uint32 i);
  
  /**
   * Add object to list 
   * 
   * @NOTE MUST be seized from correct pool
   */
  void add(Ptr<T> &);

  /**
   * Insert object <em>ptr</ptr> _before_ <em>loc</em>
   */
  void insert(Ptr<T> & ptr, Ptr<T>& loc);
  
  /**
   * Remove from list 
   */
  void remove(Ptr<T> &);

  /**
   * Return an object to pool
   */
  void release(Uint32 i);
  
  /**
   * Return an object to pool
   */
  void release(Ptr<T> &);

  /**
   * Return all objects to the pool
   */
  void release();

  /**
   *  Update i & p value according to <b>i</b>
   */
  void getPtr(Ptr<T> &, Uint32 i) const;
  
  /**
   * Update p value for ptr according to i value 
   */
  void getPtr(Ptr<T> &) const ;
  
  /**
   * Get pointer for i value
   */
  T * getPtr(Uint32 i) const ;

  /**
   * Update ptr to first element in list
   *
   * Return i
   */
  bool first(Ptr<T> &) const ;


  /**
   * Update ptr to first element in list
   *
   * Return i
   */
  bool last(Ptr<T> &) const ;

  /**
   * Get next element
   *
   * NOTE ptr must be both p & i
   */
  bool next(Ptr<T> &) const ;
  

  /**
   * Get next element
   *
   * NOTE ptr must be both p & i
   */
  bool prev(Ptr<T> &) const ;
  
  /**
   * Check if next exists i.e. this is not last
   *
   * NOTE ptr must be both p & i
   */
  bool hasNext(const Ptr<T> &) const;
  
  /**
   * Check if prev exists i.e. this is not first
   *
   * NOTE ptr must be both p & i
   */
  bool hasPrev(const Ptr<T> &) const;

  Uint32 noOfElements() const {
    Uint32 c = 0;
    Uint32 i = head.firstItem;
    while(i != RNIL){
      c++;
      const T * t = thePool.getPtr(i);
      i = t->U::nextList;
    }
    return c;
  }

  /**
   * Print
   * (Run operator NdbOut<< on every element)
   */
  void print(NdbOut & out) {
    Uint32 i = head.firstItem;
    while(i != RNIL){
      T * t = thePool.getPtr(i);
      out << (unsigned int) t << "[" << i << "]:"; 
      t->print(out); out << " ";
      i = t->U::nextList;
    }
  }

  inline bool isEmpty() const { return head.firstItem == RNIL;}

  /**
   * Copy list (head)
   *   Will construct to identical lists
   */
  DLFifoList<T>& operator=(const DLFifoList<T>& src){
    assert(&thePool == &src.thePool);
    this->head = src.head;
    return * this;
  }

protected:
  Head head;
  ArrayPool<T> & thePool;
};

template <class T, class U = T>
class LocalDLFifoList : public DLFifoList<T,U> {
public:
  LocalDLFifoList(ArrayPool<T> & thePool, typename DLFifoList<T,U>::Head &_src)
    : DLFifoList<T,U>(thePool), src(_src)
  {
    this->head = src;
#ifdef VM_TRACE
    assert(src.in_use == false);
    src.in_use = true;
#endif
  }
  
  ~LocalDLFifoList(){
#ifdef VM_TRACE
    assert(src.in_use == true);
#endif
    src = this->head;
  }
private:
  typename DLFifoList<T,U>::Head & src;
};

template <class T, class U>
inline
DLFifoList<T,U>::DLFifoList(ArrayPool<T> & _pool):
  thePool(_pool){
}

template <class T, class U>
inline
DLFifoList<T,U>::Head::Head(){
  firstItem = RNIL;
  lastItem = RNIL;
#ifdef VM_TRACE
  in_use = false;
#endif
}

/**
 * Allocate an object from pool - update Ptr
 *
 * Return i
 */
template <class T, class U>
inline
bool
DLFifoList<T,U>::seize(Ptr<T> & p){
  thePool.seize(p);
  if (p.i != RNIL) {
    add(p);
    return true;
  }
  p.p = NULL;
  return false;
}

template <class T, class U>
inline
bool
DLFifoList<T,U>::seizeFront(Ptr<T> & p){
  Uint32 ff = head.firstItem;
  thePool.seize(p);
  if (p.i != RNIL) 
  {
    p.p->U::prevList = RNIL;
    p.p->U::nextList = ff;
    head.firstItem = p.i;
    if (ff == RNIL)
    {
      head.lastItem = p.i;
    }
    else
    {
      T * t2 = thePool.getPtr(ff);
      t2->U::prevList = p.i;
    }
    return true;
  }
  p.p = NULL;
  return false;
}

/**
 * Allocate an object from pool - update Ptr
 *
 * Return i
 */
template <class T, class U>
inline
bool
DLFifoList<T,U>::seizeId(Ptr<T> & p, Uint32 ir){
  thePool.seizeId(p, ir);
  if(p.i != RNIL){
    add(p);
    return true;
  }
  p.p = NULL;
  return false;
}

template <class T, class U>
inline
void
DLFifoList<T,U>::add(Ptr<T> & p){
  T * t = p.p;
  Uint32 last = head.lastItem;

  if(p.i == RNIL)
    ErrorReporter::handleAssert("DLFifoList<T,U>::add", __FILE__, __LINE__);
  
  t->U::nextList = RNIL;
  t->U::prevList = last;
  if (head.firstItem == RNIL)
    head.firstItem = p.i;
  head.lastItem = p.i;    
  
  if(last != RNIL){
    T * t2 = thePool.getPtr(last);
    t2->U::nextList = p.i;
  }
}

template <class T, class U>
inline
void
DLFifoList<T,U>::insert(Ptr<T> & ptr, Ptr<T> & loc){
  Uint32 prev= loc.p->U::prevList;
  if(loc.i == head.firstItem)
  {
    head.firstItem = ptr.i;
    assert(prev == RNIL);
  }
  else
  {
    T* t2 = thePool.getPtr(prev);
    t2->U::nextList = ptr.i;
  }
  
  loc.p->U::prevList = ptr.i;
  ptr.p->U::prevList = prev;
  ptr.p->U::nextList = loc.i;
}

/**
 * Return an object to pool
 */
template <class T, class U>
inline
void 
DLFifoList<T,U>::release(Uint32 i){
  Ptr<T> p;
  p.i = i;
  p.p = thePool.getPtr(i);
  release(p);
}

template <class T, class U>
inline
void 
DLFifoList<T,U>::remove(Ptr<T> & p){
  T * t = p.p;
  Uint32 ni = t->U::nextList;
  Uint32 pi = t->U::prevList;

  if(ni != RNIL){
    T * t = thePool.getPtr(ni);
    t->U::prevList = pi;
  } else {
    // We are releasing last
    head.lastItem = pi;
  }
  
  if(pi != RNIL){
    T * t = thePool.getPtr(pi);
    t->U::nextList = ni;
  } else {
    // We are releasing first
    head.firstItem = ni;
  }
}
  
/**
 * Return an object to pool
 */
template <class T, class U>
inline
void 
DLFifoList<T,U>::release(Ptr<T> & p){
  remove(p);
  thePool.release(p.i);
}  

template <class T, class U>
inline
void 
DLFifoList<T,U>::release(){
  Ptr<T> p;
  while(head.firstItem != RNIL){
    p.i = head.firstItem;  
    p.p = thePool.getPtr(head.firstItem);    
    T * t = p.p;
    head.firstItem = t->U::nextList;
    release(p);
  }
}  

template <class T, class U>
inline
void 
DLFifoList<T,U>::getPtr(Ptr<T> & p, Uint32 i) const {
  p.i = i;
  p.p = thePool.getPtr(i);
}

template <class T, class U>
inline
void 
DLFifoList<T,U>::getPtr(Ptr<T> & p) const {
  thePool.getPtr(p);
}
  
template <class T, class U>
inline
T * 
DLFifoList<T,U>::getPtr(Uint32 i) const {
  return thePool.getPtr(i);
}

/**
 * Update ptr to first element in list
 *
 * Return i
 */
template <class T, class U>
inline
bool
DLFifoList<T,U>::first(Ptr<T> & p) const {
  p.i = head.firstItem;
  if(p.i != RNIL){
    p.p = thePool.getPtr(p.i);
    return true;
  }
  p.p = NULL;
  return false;
}

template <class T, class U>
inline
bool
DLFifoList<T,U>::last(Ptr<T> & p) const {
  p.i = head.lastItem;
  if(p.i != RNIL){
    p.p = thePool.getPtr(p.i);
    return true;
  }
  p.p = NULL;
  return false;
}

template <class T, class U>
inline
bool
DLFifoList<T,U>::next(Ptr<T> & p) const {
  p.i = p.p->U::nextList;
  if(p.i != RNIL){
    p.p = thePool.getPtr(p.i);
    return true;
  }
  p.p = NULL;
  return false;
}

template <class T, class U>
inline
bool
DLFifoList<T,U>::prev(Ptr<T> & p) const {
  p.i = p.p->U::prevList;
  if(p.i != RNIL){
    p.p = thePool.getPtr(p.i);
    return true;
  }
  p.p = NULL;
  return false;
}

template <class T, class U>
inline
bool
DLFifoList<T,U>::hasNext(const Ptr<T> & p) const {
  return p.p->U::nextList != RNIL;
}

template <class T, class U>
inline
bool
DLFifoList<T,U>::hasPrev(const Ptr<T> & p) const {
  return p.p->U::prevList != RNIL;
}

#endif