osd内的pg数量

最新推荐文章于 2023-10-05 11:20:56 发布

weixin_33918357

最新推荐文章于 2023-10-05 11:20:56 发布

阅读量281

点赞数

文章标签： awk

原文链接：https://my.oschina.net/banwh/blog/1523582

版权

为什么80%的码农都做不了架构师？>>>

ceph pg dump | awk '
/pg_stat/ { col=1; while($col!=“up”) {col++}; col++ }
/[0-9a-f]+.[0-9a-f]+/ { match($0,/^[0-9a-f]+/); pool=substr($0, RSTART, RLENGTH); poollist[pool]=0;
up=$col; i=0; RSTART=0; RLENGTH=0; delete osds; while(match(up,/[0-9]+/)>0) { osds[++i]=substr(up,RSTART,RLENGTH); up = substr(up, RSTART+RLENGTH) }
for(i in osds) {array[osds[i],pool]++; osdlist[osds[i]];}
}
END {
printf(“\n”);
printf(“pool :\t”); for (i in poollist) printf(“%s\t”,i); printf(“| SUM \n”);
for (i in poollist) printf(“——–“); printf(“—————-\n”);
for (i in osdlist) { printf(“osd.%i\t”, i); sum=0;
for (j in poollist) { printf(“%i\t”, array[i,j]); sum+=array[i,j]; poollist[j]+=array[i,j] }; printf(“| %i\n”,sum) }
for (i in poollist) printf(“——–“); printf(“—————-\n”);
printf(“SUM :\t”); for (i in poollist) printf(“%s\t”,poollist[i]); printf(“|\n”);
}'

转载于:https://my.oschina.net/banwh/blog/1523582