profile.js 19.8 KB
Newer Older
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
// Copyright 2009 the V8 project authors. All rights reserved.
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
//     * Redistributions of source code must retain the above copyright
//       notice, this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above
//       copyright notice, this list of conditions and the following
//       disclaimer in the documentation and/or other materials provided
//       with the distribution.
//     * Neither the name of Google Inc. nor the names of its
//       contributors may be used to endorse or promote products derived
//       from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.


/**
 * Creates a profile object for processing profiling-related events
 * and calculating function execution times.
 *
 * @constructor
 */
35 36 37 38
function Profile() {
  this.codeMap_ = new CodeMap();
  this.topDownTree_ = new CallTree();
  this.bottomUpTree_ = new CallTree();
39 40 41 42 43 44 45 46 47
};


/**
 * Returns whether a function with the specified name must be skipped.
 * Should be overriden by subclasses.
 *
 * @param {string} name Function name.
 */
48
Profile.prototype.skipThisFunction = function(name) {
49 50 51 52
  return false;
};


53 54 55 56 57 58
/**
 * Enum for profiler operations that involve looking up existing
 * code entries.
 *
 * @enum {number}
 */
59
Profile.Operation = {
60
  MOVE: 0,
61 62
  DELETE: 1,
  TICK: 2
63 64 65
};


66 67 68 69 70 71 72 73 74 75 76 77
/**
 * Enum for code state regarding its dynamic optimization.
 *
 * @enum {number}
 */
Profile.CodeState = {
  COMPILED: 0,
  OPTIMIZABLE: 1,
  OPTIMIZED: 2
};


78 79 80
/**
 * Called whenever the specified operation has failed finding a function
 * containing the specified address. Should be overriden by subclasses.
81
 * See the Profile.Operation enum for the list of
82
 * possible operations.
83
 *
84
 * @param {number} operation Operation.
85
 * @param {number} addr Address of the unknown code.
86 87 88
 * @param {number} opt_stackPos If an unknown address is encountered
 *     during stack strace processing, specifies a position of the frame
 *     containing the address.
89
 */
90
Profile.prototype.handleUnknownCode = function(
91
    operation, addr, opt_stackPos) {
92 93 94 95
};


/**
96 97 98 99 100 101
 * Registers a library.
 *
 * @param {string} name Code entry name.
 * @param {number} startAddr Starting address.
 * @param {number} endAddr Ending address.
 */
102
Profile.prototype.addLibrary = function(
103
    name, startAddr, endAddr) {
104
  var entry = new CodeMap.CodeEntry(
105 106 107 108 109 110 111 112
      endAddr - startAddr, name);
  this.codeMap_.addLibrary(startAddr, entry);
  return entry;
};


/**
 * Registers statically compiled code entry.
113 114 115 116 117
 *
 * @param {string} name Code entry name.
 * @param {number} startAddr Starting address.
 * @param {number} endAddr Ending address.
 */
118
Profile.prototype.addStaticCode = function(
119
    name, startAddr, endAddr) {
120
  var entry = new CodeMap.CodeEntry(
121 122 123
      endAddr - startAddr, name);
  this.codeMap_.addStaticCode(startAddr, entry);
  return entry;
124 125 126 127 128 129 130 131 132 133 134
};


/**
 * Registers dynamic (JIT-compiled) code entry.
 *
 * @param {string} type Code entry type.
 * @param {string} name Code entry name.
 * @param {number} start Starting address.
 * @param {number} size Code entry size.
 */
135
Profile.prototype.addCode = function(
136
    type, name, start, size) {
137
  var entry = new Profile.DynamicCodeEntry(size, type, name);
138 139
  this.codeMap_.addCode(start, entry);
  return entry;
140 141 142
};


143
/**
144
 * Registers dynamic (JIT-compiled) code entry.
145
 *
146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163
 * @param {string} type Code entry type.
 * @param {string} name Code entry name.
 * @param {number} start Starting address.
 * @param {number} size Code entry size.
 * @param {number} funcAddr Shared function object address.
 * @param {Profile.CodeState} state Optimization state.
 */
Profile.prototype.addFuncCode = function(
    type, name, start, size, funcAddr, state) {
  // As code and functions are in the same address space,
  // it is safe to put them in a single code map.
  var func = this.codeMap_.findDynamicEntryByStartAddress(funcAddr);
  if (!func) {
    func = new Profile.FunctionEntry(name);
    this.codeMap_.addCode(funcAddr, func);
  } else if (func.name !== name) {
    // Function object has been overwritten with a new one.
    func.name = name;
164
  }
165
  var entry = this.codeMap_.findDynamicEntryByStartAddress(start);
166 167 168 169 170 171 172 173
  if (entry) {
    if (entry.size === size && entry.func === func) {
      // Entry state has changed.
      entry.state = state;
    }
  } else {
    entry = new Profile.DynamicFuncCodeEntry(size, type, func, state);
    this.codeMap_.addCode(start, entry);
174
  }
175
  return entry;
176 177 178
};


179 180 181 182 183 184
/**
 * Reports about moving of a dynamic code entry.
 *
 * @param {number} from Current code entry address.
 * @param {number} to New code entry address.
 */
185
Profile.prototype.moveCode = function(from, to) {
186 187 188
  try {
    this.codeMap_.moveCode(from, to);
  } catch (e) {
189
    this.handleUnknownCode(Profile.Operation.MOVE, from);
190 191 192 193
  }
};


194 195 196 197 198 199 200 201 202 203 204 205 206 207
/**
 * Reports about deletion of a dynamic code entry.
 *
 * @param {number} start Starting address.
 */
Profile.prototype.deleteCode = function(start) {
  try {
    this.codeMap_.deleteCode(start);
  } catch (e) {
    this.handleUnknownCode(Profile.Operation.DELETE, start);
  }
};


208 209 210 211 212 213
/**
 * Reports about moving of a dynamic code entry.
 *
 * @param {number} from Current code entry address.
 * @param {number} to New code entry address.
 */
214
Profile.prototype.moveFunc = function(from, to) {
215 216 217 218 219 220
  if (this.codeMap_.findDynamicEntryByStartAddress(from)) {
    this.codeMap_.moveCode(from, to);
  }
};


221 222 223 224 225
/**
 * Retrieves a code entry by an address.
 *
 * @param {number} addr Entry address.
 */
226
Profile.prototype.findEntry = function(addr) {
227 228 229 230
  return this.codeMap_.findEntry(addr);
};


231 232 233 234 235 236
/**
 * Records a tick event. Stack must contain a sequence of
 * addresses starting with the program counter value.
 *
 * @param {Array<number>} stack Stack sample.
 */
237
Profile.prototype.recordTick = function(stack) {
238 239 240 241 242 243 244 245 246 247 248 249 250
  var processedStack = this.resolveAndFilterFuncs_(stack);
  this.bottomUpTree_.addPath(processedStack);
  processedStack.reverse();
  this.topDownTree_.addPath(processedStack);
};


/**
 * Translates addresses into function names and filters unneeded
 * functions.
 *
 * @param {Array<number>} stack Stack sample.
 */
251
Profile.prototype.resolveAndFilterFuncs_ = function(stack) {
252 253 254 255 256 257 258 259 260
  var result = [];
  for (var i = 0; i < stack.length; ++i) {
    var entry = this.codeMap_.findEntry(stack[i]);
    if (entry) {
      var name = entry.getName();
      if (!this.skipThisFunction(name)) {
        result.push(name);
      }
    } else {
261
      this.handleUnknownCode(
262
          Profile.Operation.TICK, stack[i], i);
263 264 265 266 267 268 269
    }
  }
  return result;
};


/**
270
 * Performs a BF traversal of the top down call graph.
271
 *
272
 * @param {function(CallTree.Node)} f Visitor function.
273
 */
274
Profile.prototype.traverseTopDownTree = function(f) {
275 276 277 278 279
  this.topDownTree_.traverse(f);
};


/**
280
 * Performs a BF traversal of the bottom up call graph.
281
 *
282
 * @param {function(CallTree.Node)} f Visitor function.
283
 */
284
Profile.prototype.traverseBottomUpTree = function(f) {
285 286 287 288
  this.bottomUpTree_.traverse(f);
};


289
/**
290 291
 * Calculates a top down profile for a node with the specified label.
 * If no name specified, returns the whole top down calls tree.
292
 *
293
 * @param {string} opt_label Node label.
294
 */
295
Profile.prototype.getTopDownProfile = function(opt_label) {
296 297 298 299 300 301 302 303 304 305
  return this.getTreeProfile_(this.topDownTree_, opt_label);
};


/**
 * Calculates a bottom up profile for a node with the specified label.
 * If no name specified, returns the whole bottom up calls tree.
 *
 * @param {string} opt_label Node label.
 */
306
Profile.prototype.getBottomUpProfile = function(opt_label) {
307
  return this.getTreeProfile_(this.bottomUpTree_, opt_label);
308 309 310 311
};


/**
312
 * Helper function for calculating a tree profile.
313
 *
314
 * @param {Profile.CallTree} tree Call tree.
315
 * @param {string} opt_label Node label.
316
 */
317
Profile.prototype.getTreeProfile_ = function(tree, opt_label) {
318 319 320
  if (!opt_label) {
    tree.computeTotalWeights();
    return tree;
321
  } else {
322 323 324
    var subTree = tree.cloneSubtree(opt_label);
    subTree.computeTotalWeights();
    return subTree;
325 326 327 328
  }
};


329
/**
330 331
 * Calculates a flat profile of callees starting from a node with
 * the specified label. If no name specified, starts from the root.
332
 *
333
 * @param {string} opt_label Starting node label.
334
 */
335 336 337
Profile.prototype.getFlatProfile = function(opt_label) {
  var counters = new CallTree();
  var rootLabel = opt_label || CallTree.ROOT_NODE_LABEL;
338
  var precs = {};
339 340 341
  precs[rootLabel] = 0;
  var root = counters.findOrAddChild(rootLabel);

342 343 344 345 346 347
  this.topDownTree_.computeTotalWeights();
  this.topDownTree_.traverseInDepth(
    function onEnter(node) {
      if (!(node.label in precs)) {
        precs[node.label] = 0;
      }
348 349 350 351 352 353 354 355 356 357 358 359 360
      var nodeLabelIsRootLabel = node.label == rootLabel;
      if (nodeLabelIsRootLabel || precs[rootLabel] > 0) {
        if (precs[rootLabel] == 0) {
          root.selfWeight += node.selfWeight;
          root.totalWeight += node.totalWeight;
        } else {
          var rec = root.findOrAddChild(node.label);
          rec.selfWeight += node.selfWeight;
          if (nodeLabelIsRootLabel || precs[node.label] == 0) {
            rec.totalWeight += node.totalWeight;
          }
        }
        precs[node.label]++;
361 362 363
      }
    },
    function onExit(node) {
364 365 366
      if (node.label == rootLabel || precs[rootLabel] > 0) {
        precs[node.label]--;
      }
367
    },
368 369 370 371 372 373 374 375 376 377 378 379
    null);

  if (!opt_label) {
    // If we have created a flat profile for the whole program, we don't
    // need an explicit root in it. Thus, replace the counters tree
    // root with the node corresponding to the whole program.
    counters.root_ = root;
  } else {
    // Propagate weights so percents can be calculated correctly.
    counters.getRoot().selfWeight = root.selfWeight;
    counters.getRoot().totalWeight = root.totalWeight;
  }
380
  return counters;
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
/**
 * Cleans up function entries that are not referenced by code entries.
 */
Profile.prototype.cleanUpFuncEntries = function() {
  var referencedFuncEntries = [];
  var entries = this.codeMap_.getAllDynamicEntriesWithAddresses();
  for (var i = 0, l = entries.length; i < l; ++i) {
    if (entries[i][1].constructor === Profile.FunctionEntry) {
      entries[i][1].used = false;
    }
  }
  for (var i = 0, l = entries.length; i < l; ++i) {
    if ("func" in entries[i][1]) {
      entries[i][1].func.used = true;
    }
  }
  for (var i = 0, l = entries.length; i < l; ++i) {
    if (entries[i][1].constructor === Profile.FunctionEntry &&
        !entries[i][1].used) {
      this.codeMap_.deleteCode(entries[i][0]);
    }
  }
};


409 410 411 412 413 414 415 416
/**
 * Creates a dynamic code entry.
 *
 * @param {number} size Code size.
 * @param {string} type Code type.
 * @param {string} name Function name.
 * @constructor
 */
417 418
Profile.DynamicCodeEntry = function(size, type, name) {
  CodeMap.CodeEntry.call(this, size, name);
419 420 421 422 423 424 425
  this.type = type;
};


/**
 * Returns node name.
 */
426
Profile.DynamicCodeEntry.prototype.getName = function() {
427
  return this.type + ': ' + this.name;
428 429 430
};


431 432 433
/**
 * Returns raw node name (without type decoration).
 */
434
Profile.DynamicCodeEntry.prototype.getRawName = function() {
435 436 437 438
  return this.name;
};


439
Profile.DynamicCodeEntry.prototype.isJSFunction = function() {
440 441 442 443
  return false;
};


444 445 446 447 448
Profile.DynamicCodeEntry.prototype.toString = function() {
  return this.getName() + ': ' + this.size.toString(16);
};


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
/**
 * Creates a dynamic code entry.
 *
 * @param {number} size Code size.
 * @param {string} type Code type.
 * @param {Profile.FunctionEntry} func Shared function entry.
 * @param {Profile.CodeState} state Code optimization state.
 * @constructor
 */
Profile.DynamicFuncCodeEntry = function(size, type, func, state) {
  CodeMap.CodeEntry.call(this, size);
  this.type = type;
  this.func = func;
  this.state = state;
};

Profile.DynamicFuncCodeEntry.STATE_PREFIX = ["", "~", "*"];

/**
 * Returns node name.
 */
Profile.DynamicFuncCodeEntry.prototype.getName = function() {
  var name = this.func.getName();
  return this.type + ': ' + Profile.DynamicFuncCodeEntry.STATE_PREFIX[this.state] + name;
};


/**
 * Returns raw node name (without type decoration).
 */
Profile.DynamicFuncCodeEntry.prototype.getRawName = function() {
  return this.func.getName();
};


Profile.DynamicFuncCodeEntry.prototype.isJSFunction = function() {
  return true;
};


489 490 491 492 493
Profile.DynamicFuncCodeEntry.prototype.toString = function() {
  return this.getName() + ': ' + this.size.toString(16);
};


494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516
/**
 * Creates a shared function object entry.
 *
 * @param {string} name Function name.
 * @constructor
 */
Profile.FunctionEntry = function(name) {
  CodeMap.CodeEntry.call(this, 0, name);
};


/**
 * Returns node name.
 */
Profile.FunctionEntry.prototype.getName = function() {
  var name = this.name;
  if (name.length == 0) {
    name = '<anonymous>';
  } else if (name.charAt(0) == ' ') {
    // An anonymous function with location: " aaa.js:10".
    name = '<anonymous>' + name;
  }
  return name;
517 518
};

519
Profile.FunctionEntry.prototype.toString = CodeMap.CodeEntry.prototype.toString;
520

521 522 523 524 525
/**
 * Constructs a call graph.
 *
 * @constructor
 */
526 527 528
function CallTree() {
  this.root_ = new CallTree.Node(
      CallTree.ROOT_NODE_LABEL);
529 530 531
};


532 533 534
/**
 * The label of the root node.
 */
535
CallTree.ROOT_NODE_LABEL = '';
536 537


538 539 540
/**
 * @private
 */
541
CallTree.prototype.totalsComputed_ = false;
542 543


544 545 546
/**
 * Returns the tree root.
 */
547
CallTree.prototype.getRoot = function() {
548 549 550 551
  return this.root_;
};


552 553 554 555 556
/**
 * Adds the specified call path, constructing nodes as necessary.
 *
 * @param {Array<string>} path Call path.
 */
557
CallTree.prototype.addPath = function(path) {
558 559 560 561 562 563 564 565 566 567 568 569
  if (path.length == 0) {
    return;
  }
  var curr = this.root_;
  for (var i = 0; i < path.length; ++i) {
    curr = curr.findOrAddChild(path[i]);
  }
  curr.selfWeight++;
  this.totalsComputed_ = false;
};


570 571 572 573 574 575 576
/**
 * Finds an immediate child of the specified parent with the specified
 * label, creates a child node if necessary. If a parent node isn't
 * specified, uses tree root.
 *
 * @param {string} label Child node label.
 */
577
CallTree.prototype.findOrAddChild = function(label) {
578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597
  return this.root_.findOrAddChild(label);
};


/**
 * Creates a subtree by cloning and merging all subtrees rooted at nodes
 * with a given label. E.g. cloning the following call tree on label 'A'
 * will give the following result:
 *
 *           <A>--<B>                                     <B>
 *          /                                            /
 *     <root>             == clone on 'A' ==>  <root>--<A>
 *          \                                            \
 *           <C>--<A>--<D>                                <D>
 *
 * And <A>'s selfWeight will be the sum of selfWeights of <A>'s from the
 * source call tree.
 *
 * @param {string} label The label of the new root node.
 */
598 599
CallTree.prototype.cloneSubtree = function(label) {
  var subTree = new CallTree();
600 601 602 603 604 605 606 607 608
  this.traverse(function(node, parent) {
    if (!parent && node.label != label) {
      return null;
    }
    var child = (parent ? parent : subTree).findOrAddChild(node.label);
    child.selfWeight += node.selfWeight;
    return child;
  });
  return subTree;
609 610 611
};


612 613 614
/**
 * Computes total weights in the call graph.
 */
615
CallTree.prototype.computeTotalWeights = function() {
616 617 618 619 620 621 622 623 624
  if (this.totalsComputed_) {
    return;
  }
  this.root_.computeTotalWeight();
  this.totalsComputed_ = true;
};


/**
625 626 627
 * Traverses the call graph in preorder. This function can be used for
 * building optionally modified tree clones. This is the boilerplate code
 * for this scenario:
628
 *
629 630 631 632 633 634 635
 * callTree.traverse(function(node, parentClone) {
 *   var nodeClone = cloneNode(node);
 *   if (parentClone)
 *     parentClone.addChild(nodeClone);
 *   return nodeClone;
 * });
 *
636
 * @param {function(CallTree.Node, *)} f Visitor function.
637
 *    The second parameter is the result of calling 'f' on the parent node.
638
 */
639
CallTree.prototype.traverse = function(f) {
640
  var pairsToProcess = new ConsArray();
641
  pairsToProcess.concat([{node: this.root_, param: null}]);
642 643
  while (!pairsToProcess.atEnd()) {
    var pair = pairsToProcess.next();
644 645
    var node = pair.node;
    var newParam = f(node, pair.param);
646 647 648 649
    var morePairsToProcess = [];
    node.forEachChild(function (child) {
        morePairsToProcess.push({node: child, param: newParam}); });
    pairsToProcess.concat(morePairsToProcess);
650 651 652 653 654 655 656
  }
};


/**
 * Performs an indepth call graph traversal.
 *
657
 * @param {function(CallTree.Node)} enter A function called
658
 *     prior to visiting node's children.
659
 * @param {function(CallTree.Node)} exit A function called
660 661
 *     after visiting node's children.
 */
662
CallTree.prototype.traverseInDepth = function(enter, exit) {
663 664 665 666 667
  function traverse(node) {
    enter(node);
    node.forEachChild(traverse);
    exit(node);
  }
668
  traverse(this.root_);
669 670 671 672 673 674 675
};


/**
 * Constructs a call graph node.
 *
 * @param {string} label Node label.
676
 * @param {CallTree.Node} opt_parent Node parent.
677
 */
678
CallTree.Node = function(label, opt_parent) {
679 680 681 682 683 684 685 686 687 688 689
  this.label = label;
  this.parent = opt_parent;
  this.children = {};
};


/**
 * Node self weight (how many times this node was the last node in
 * a call path).
 * @type {number}
 */
690
CallTree.Node.prototype.selfWeight = 0;
691 692 693 694 695 696


/**
 * Node total weight (includes weights of all children).
 * @type {number}
 */
697
CallTree.Node.prototype.totalWeight = 0;
698 699 700 701 702 703 704


/**
 * Adds a child node.
 *
 * @param {string} label Child node label.
 */
705 706
CallTree.Node.prototype.addChild = function(label) {
  var child = new CallTree.Node(label, this);
707 708 709 710 711 712 713 714
  this.children[label] = child;
  return child;
};


/**
 * Computes node's total weight.
 */
715
CallTree.Node.prototype.computeTotalWeight =
716 717 718 719 720 721 722 723 724 725 726
    function() {
  var totalWeight = this.selfWeight;
  this.forEachChild(function(child) {
      totalWeight += child.computeTotalWeight(); });
  return this.totalWeight = totalWeight;
};


/**
 * Returns all node's children as an array.
 */
727
CallTree.Node.prototype.exportChildren = function() {
728 729 730 731 732 733 734 735 736 737 738
  var result = [];
  this.forEachChild(function (node) { result.push(node); });
  return result;
};


/**
 * Finds an immediate child with the specified label.
 *
 * @param {string} label Child node label.
 */
739
CallTree.Node.prototype.findChild = function(label) {
740 741 742 743 744 745 746 747 748 749
  return this.children[label] || null;
};


/**
 * Finds an immediate child with the specified label, creates a child
 * node if necessary.
 *
 * @param {string} label Child node label.
 */
750
CallTree.Node.prototype.findOrAddChild = function(label) {
751 752 753 754 755 756 757
  return this.findChild(label) || this.addChild(label);
};


/**
 * Calls the specified function for every child.
 *
758
 * @param {function(CallTree.Node)} f Visitor function.
759
 */
760
CallTree.Node.prototype.forEachChild = function(f) {
761 762 763 764 765 766 767 768 769
  for (var c in this.children) {
    f(this.children[c]);
  }
};


/**
 * Walks up from the current node up to the call tree root.
 *
770
 * @param {function(CallTree.Node)} f Visitor function.
771
 */
772
CallTree.Node.prototype.walkUpToRoot = function(f) {
773 774 775 776 777 778 779 780 781 782
  for (var curr = this; curr != null; curr = curr.parent) {
    f(curr);
  }
};


/**
 * Tries to find a node with the specified path.
 *
 * @param {Array<string>} labels The path.
783
 * @param {function(CallTree.Node)} opt_f Visitor function.
784
 */
785
CallTree.Node.prototype.descendToChild = function(
786 787 788 789 790 791 792 793 794 795
    labels, opt_f) {
  for (var pos = 0, curr = this; pos < labels.length && curr != null; pos++) {
    var child = curr.findChild(labels[pos]);
    if (opt_f) {
      opt_f(child, pos);
    }
    curr = child;
  }
  return curr;
};