zoukankan
html css js c++ java
linux显示shm segment信息一例
#include <stdio.h> #include <sys/shm.h> #include <sys/stat.h> int main(void) { int segment_id; char* shared_memory; const int size = 4096; unsigned short mode; struct shmid_ds shmbuffer; segment_id = shmget(IPC_PRIVATE, size, S_IRUSR|S_IWUSR); shared_memory = (char*)shmat(segment_id, NULL, 0); sprintf(shared_memory, "shared memory"); printf("%s\n", shared_memory); if (shmctl(segment_id, IPC_STAT, &shmbuffer) == - 1) { fprintf(stderr, "Unable to access segment %d\n", segment_id); return -1; } printf("ID \t\t KEY \t MODE \t\t OWNER \t SIZE \t ATTTACHES \n"); printf("-- \t\t --- \t ---- \t\t ----- \t ---- \t --------- \n"); printf("%d \t %d \t",segment_id,shmbuffer.shm_perm.__key); mode = shmbuffer.shm_perm.mode; /** OWNER */ if (mode & 0400) printf("r"); else printf("-"); if (mode & 0200) printf("w"); else printf("-"); if (mode & 0100) printf("a"); else printf("-"); /** GROUP */ if (mode & 0040) printf("r"); else printf("-"); if (mode & 0020) printf("w"); else printf("-"); if (mode & 0010) printf("a"); else printf("-"); /** WORLD */ if (mode & 0004) printf("r"); else printf("-"); if (mode & 0002) printf("w"); else printf("-"); if (mode & 0001) printf("a"); else printf("-"); printf(" \t%4d\t",shmbuffer.shm_perm.uid); printf(" %d\t",shmbuffer.shm_segsz); printf(" %d\t",shmbuffer.shm_nattch); printf("\n%d", mode); printf("\n"); shmdt(shared_memory); shmctl(segment_id, IPC_RMID, NULL); fprintf(stdout, "\n%d", segment_id); return 0; }
查看全文
相关阅读:
使用 libevent 和 libev 提高网络应用性能
在PHP中PDO解决中文乱码问题的一些补充
apache重写规则详解
Apache的配置
正则表达式30分钟入门教程
LVS+keepalived搭建负载均衡
php判断终端是手机还是电脑访问网站代码
nginx 502 bad gateway
算法复习-深度优先遍历和回溯法的关系
分支限界法和回溯法对比
原文地址:https://www.cnblogs.com/seebro/p/2476556.html
最新文章
机器学习算法之旅
Levenberg-Marquardt优化算法以及基于LM的BP-ANN
机器学习前沿热点——Deep Learning
特征降维之SVD分解
Java进阶之美文共享
Python数据结构与算法设计(总结篇)
【推荐系统】Netflix 推荐系统:第二部分
推荐算法简介
Find the Duplicate Number
Missing Number, First Missing Positive
热门文章
Product of Array Except Self
Maximum Product Subarray
Search for a Range
First Bad Version
Search Insert Position
Add Digits
Happy Number
Ugly Number,Ugly Number II,Super Ugly Number
使用git进行代码管理
PHP写的异步高并发服务器,基于libevent
Copyright © 2011-2022 走看看