Cross Reference: /sssd/src/ldb

Lines Matching defs:first
125     struct mbof_del_operation *first;
310  * The real add operation is done first, to assure nothing else fails.
605             /* first operation */
1208  * Ok, first of all, contrary to the add operation, a delete operation
1209  * involves an existing object that may have existing parents. So, first, we
1223  * To handle the children we create a first ancestor operation that reflects
1225  * retrieved with the first search. Then we create a remove list.
1228  * object dn itself of the original delete operation target object (the first
1237  * first ancestor.
1239  * In each operation we must first lookup the target object and each immediate
1321     struct mbof_del_operation *first;
1348     /* create first entry */
1349     /* the first entry is the parent of all entries and the one where we remove
1351     first = talloc_zero(del_ctx, struct mbof_del_operation);
1352     if (!first) {
1356     del_ctx->first = first;
1358     first->del_ctx = del_ctx;
1359     first->entry_dn = req->op.del.dn;
1385                                first, mbof_del_search_callback,
1398     struct mbof_del_operation *first;
1405     first = talloc_get_type(req->context, struct mbof_del_operation);
1406     del_ctx = first->del_ctx;
1427             if (first->entry != NULL) {
1433             first->entry = talloc_steal(first, msg);
1434             if (first->entry == NULL) {
1439             first->parents = talloc_realloc(first, first->parents,
1441                                              first->num_parents + 1);
1442             if (!first->parents) {
1446             msg = talloc_steal(first->parents, ares->message);
1451             first->parents[first->num_parents] = msg;
1452             first->num_parents++;
1460         if (first->entry == NULL) {
1464                            ldb_dn_get_linearized(first->entry_dn));
1535     if (del_ctx->first->num_parents) {
1538         ret = mbof_del_fill_muop(del_ctx, del_ctx->first->entry);
1545         ret = mbof_del_fill_ghop(del_ctx, del_ctx->first->entry);
1554     else if (ldb_msg_find_element(del_ctx->first->entry, DB_MEMBER)) {
1584     struct mbof_del_operation *first;
1593     first = del_ctx->first;
1597     msg = ldb_msg_new(first->parents);
1600     msg->dn = first->parents[first->cur_parent]->dn;
1601     first->cur_parent++;
1611     val = ldb_dn_get_linearized(first->entry_dn);
1619     ret = ldb_build_mod_req(&mod_req, ldb, first->parents,
1633     struct mbof_del_operation *first;
1640     first = del_ctx->first;
1663     if (first->num_parents > first->cur_parent) {
1669         if (ldb_msg_find_element(first->entry, DB_MEMBER)) {
1701     struct mbof_del_operation *first;
1708     first = del_ctx->first;
1712     el = ldb_msg_find_element(first->entry, DB_MEMBER);
1716         valdn = ldb_dn_from_ldb_val(first, ldb, &el->values[i]);
1723         ret = mbof_append_delop(first, valdn);
1730     return mbof_del_execute_op(first->children[0]);
2059                 if (ldb_dn_compare(valdn, del_ctx->first->entry_dn) == 0) {
2159                 if (ldb_dn_compare(del_ctx->first->entry_dn, diff[j]) == 0) {
2390     /* first of all, save the current delop in the history */
2812  * If both add and delete are necessary, delete operations are performed first
2929      * must check first what's on the entry */
3404     /* if we have something to remove do it first */
3698     struct mbof_del_operation *first;
3712     /* create first entry */
3713     /* the first entry is the parent of all entries and the one where we
3715     first = talloc_zero(del_ctx, struct mbof_del_operation);
3716     if (!first) {
3719     del_ctx->first = first;
3727     first->del_ctx = del_ctx;
3728     first->entry = mod_ctx->entry;
3729     first->entry_dn = mod_ctx->entry->dn;
3732         ret = mbof_del_fill_ghop_ex(del_ctx, del_ctx->first->entry,
3742             ret = mbof_append_delop(first, del->dns[i]);
3749         return mbof_del_execute_op(first->children[0]);
4411     /* we process all users first and then all groups */