zoukankan      html  css  js  c++  java
  • 获取 pool的并发数和Pool下成员的并发数

    use BigIP::iControl;
    use Data::Dumper;
    my $ic = BigIP::iControl->new(
    server => '10.4.10.10',
    username => 'zjtlcb',
    password => '123456',
    port => 443,
    proto => 'https'
    );
    
    ##获取所有定义的LTM 虚拟机服务器
    my $i=0;
     my $pool='ESB_huigui_pool';
     my @member=$ic->get_ltm_pool_members($pool);
     my @member=reverse(@member);
    ## 获取pool所有统计信息
      print '-------------pool--------------------------------'."
    ";
      #my %stats = $ic->get_pool_statistics_stringified ($pool);
      my %stats = $ic->get_pool_statistics_stringified ($pool);
      #print %stats;
         foreach $key (keys %stats) 
             { 
              print  "$key=>$stats{$key}
    ";
       print $stats{$key};
       my %h=%{$stats{$key}};
       foreach $key (keys %h){
          print  "$pool=>$key=>$h{$key}
    ";
     };
     };        
    print '------------pool member----------------------'."
    ";
    ##获取pool member 统计信息
    my %stats = $ic->get_pool_member_statistics_stringified($pool);
    # print %stats;
    # print "
    ";
    foreach $member (keys %stats) {
       print  "$member=>$stats{$member}
    ";
       my %h=%{$stats{$member}};
       # print %h;
       # print "
    ";
       foreach $key (keys %h){
                 if ($key eq 'stats'){
             my %h=%{$h{$key}};
      foreach $key (keys %h){
          print  "$pool=>$member=>$key=>$h{$key}
    ";
     }
      }
      else{
          print  "$pool=>$member=>$key=>$h{$key}
    ";
     };
         };
     $i++;
      };
  • 相关阅读:
    leetcode Power of Two
    Lowest Common Ancestor of a Binary Search Tree
    Lowest Common Ancestor of a Binary Tree
    leetcode Delete Node in a Linked List
    leetcode Search a 2D Matrix II
    leetcdoe Valid Anagram
    leetcode Add Digits
    leetcode Single Number III
    leetcode Ugly Number
    leetcode Ugly Number II
  • 原文地址:https://www.cnblogs.com/hzcya1995/p/13348979.html
Copyright © 2011-2022 走看看