Lines Matching defs:removed
1272 * attribute being removed from a parent group is just inherited from the group
1273 * being removed or also a direct member of the parent group. To make sure
2122 * removed so that we can later schedule removal of memberuid
2808 * the object is not created a new or not completely removed, but the setup just
3431 struct mbof_dn_array *removed = NULL;
3462 ret = mbof_fill_dn_array(mem_ctx, ldb, el, &removed);
3470 removed = NULL;
3473 ret = mbof_fill_dn_array(mem_ctx, ldb, el, &removed);
3484 talloc_free(removed);
3490 if (removed && removed->num && added && added->num) {
3492 for (j = 0; j < removed->num; j++) {
3493 if (ldb_dn_compare(added->dns[i], removed->dns[j]) == 0) {
3497 if (j < removed->num) {
3498 /* preexisting one, not removed, nor added */
3499 for (; j+1 < removed->num; j++) {
3500 removed->dns[j] = removed->dns[j+1];
3502 removed->num--;
3518 *_removed = removed;
3530 struct mbof_val_array *removed = NULL;
3565 ret = mbof_fill_vals_array_el(mem_ctx, ghel, &removed);
3574 ret = mbof_fill_vals_array_el(mem_ctx, el, &removed);
3584 talloc_free(removed);
3593 talloc_free(removed);
3599 if (removed && removed->num && added && added->num) {
3601 for (j = 0; j < removed->num; j++) {
3603 (const char *) removed->vals[j].data) == 0) {
3607 if (j < removed->num) {
3608 /* preexisting one, not removed, nor added */
3609 for (; j+1 < removed->num; j++) {
3610 removed->vals[j] = removed->vals[j+1];
3612 removed->num--;
3628 *_removed = removed;