#2922 ID mapping - bug in computing max id for slice range
Closed: Fixed Opened by preichl.

There seems to be a bug in the way we assign ranges for domain when we algorithmically perform id mapping.

In sss_idmap_calculate_range() we compute the upper limit for ids max as being 'min + range' which means that actual range of ids is:

max - min + 1 = min + range - min + 1 = range + 1

And this differs from range by 1.

We should be even be able to see some mapping issue with secondary ranges. The last POSIX ID from a range and the first POSIX ID from the next range should return the same SID/RID.

In the IPA code there is 'range.max = r->base_id + r->id_range_size -1;' We should amend code to the same.


If there's seems to be a bug could you write unit test which will fail? TDD way.

Fields changed

rhbz: => [https://bugzilla.redhat.com/show_bug.cgi?id=1298629 1298629]

Fields changed

milestone: NEEDS_TRIAGE => SSSD 1.13.4
priority: major => critical

master:

  • 7db89d44b5582a0cb0a61a7aa42a2fac7ca9408f

sssd-1-13:

  • 645933bcfd4acfb1729fcee2fee6c37b1acbfb92

There is a missing unit test for this bug.
We needn't open new bug and it can be tracked here.

Man page change:

master:

  • d9de4b26f44a344025bbfa23104b7b67935fae35

sssd-1-13:

  • c2fa17edf4b9d385302ddd24ce599a1cef7250a6

Fields changed

owner: somebody => preichl
status: new => assigned

Fields changed

patch: 0 => 1

Unit test

master:

  • 9d17f436795a36b1b1126f444923aa847fd0f93a

sssd-1-13:

  • 8c1f3b27d8e20b271dfea0c41fd864e9af5476f5

resolution: => fixed
status: assigned => closed

Metadata Update from @preichl:
- Issue assigned to preichl
- Issue set to the milestone: SSSD 1.13.4

SSSD is moving from Pagure to Github. This means that new issues and pull requests
will be accepted only in SSSD's github repository.

This issue has been cloned to Github and is available here:
- https://github.com/SSSD/sssd/issues/3963

If you want to receive further updates on the issue, please navigate to the github issue
and click on subscribe button.

Thank you for understanding. We apologize for all inconvenience.

Metadata