Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

msg/async/rdma: check ulimit #13655

Merged
merged 1 commit into from Mar 2, 2017
Merged

msg/async/rdma: check ulimit #13655

merged 1 commit into from Mar 2, 2017

Conversation

Adirl
Copy link

@Adirl Adirl commented Feb 26, 2017

On RDMA, memlock should be unlimited. If it is not, warn the user

Signed-off-by: Sarit Zubakov saritz@mellanox.com

@Adirl
Copy link
Author

Adirl commented Feb 26, 2017

@yuyuyu101
verifying that user memory lock is not limited.

struct rlimit limit;
getrlimit(RLIMIT_MEMLOCK, &limit);
if (limit.rlim_cur != RLIM_INFINITY || limit.rlim_max != RLIM_INFINITY) {
ldout(cct, 1) << __func__ << "!!! WARNING !!! For RDMA to work properly user memlock (ulimit -l) must be big enough to allow large amount of registered memory."
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

ldout(cct, 0) may better

Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

how about lderr(cct)?

@Adirl
Copy link
Author

Adirl commented Mar 2, 2017

@yuyuyu101
anything else needed here?

On RDMA, memlock should be unlimited. If it is not then
warn the user

issue: 973654

Change-Id: If1e07722aaca9df88714828ca3f7398a2504e262
Signed-off-by: Sarit Zubakov <saritz@mellanox.com>
Signed-off-by: Adir Lev <adirl@mellanox.com>
@yuyuyu101 yuyuyu101 merged commit 2ce11e1 into ceph:master Mar 2, 2017
@Adirl
Copy link
Author

Adirl commented Mar 2, 2017

Thanks

@Adirl Adirl deleted the ulimit branch April 18, 2017 18:12
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
5 participants