Cross Reference: /sssd-io/src/ldb

Lines Matching defs:num
42     int num;
47     int num;
397     if (!parents || parents->num == 0) {
420               num_gh_vals, parents->num);
422     for (i = 0; i < parents->num; i++) {
530     parents->num = 1;
794                                 addop->parents->num);
800     for (i = 0; i < addop->parents->num; i++) {
805         parents->dns[parents->num] = addop->parents->dns[i];
806         parents->num++;
824             for (j = 0; j < parents->num; j++) {
830             if (j < parents->num) {
832                 for (;j+1 < parents->num; j++) {
835                 parents->num--;
839         if (parents->num == 0) {
895         for (i = 0; i < parents->num; i++) {
936     el->values = talloc_array(msg, struct ldb_val, parents->num);
940     for (i = 0, j = 0; i < parents->num; i++) {
1007     int ret, i, num;
1012     num = 0;
1014         num++;
1016     if (num == 0) {
1029     el->values = talloc_array(msg, struct ldb_val, num);
1033     el->num_values = num;
1917     new_list->num = delop->num_parents;
1921     delop->anc_ctx->num_direct = new_list->num;
1924     if (new_list->num == 0) {
1934                                       new_list->num);
2050                 for (j = 0; j < new_list->num; j++) {
2054                 if (j < new_list->num) {
2066                                                new_list->num + 1);
2071                 new_list->dns[new_list->num] = valdn;
2072                 new_list->num++;
2175     if (new_list->num) {
2181         el->values = talloc_array(el, struct ldb_val, new_list->num);
2185         for (i = 0, j = 0; i < new_list->num; i++) {
3405     if ((mod_ctx->mb_remove && mod_ctx->mb_remove->num) ||
3406         (mod_ctx->gh_remove && mod_ctx->gh_remove->num)) {
3412     if ((mod_ctx->mb_add && mod_ctx->mb_add->num) ||
3413         (mod_ctx->gh_add && mod_ctx->gh_add->num)) {
3490         if (removed && removed->num && added && added->num) {
3491             for (i = 0; i < added->num; i++) {
3492                 for (j = 0; j < removed->num; j++) {
3497                 if (j < removed->num) {
3499                     for (; j+1 < removed->num; j++) {
3502                     removed->num--;
3503                     for (j = i; j+1 < added->num; j++) {
3506                     added->num--;
3599         if (removed && removed->num && added && added->num) {
3600             for (i = 0; i < added->num; i++) {
3601                 for (j = 0; j < removed->num; j++) {
3607                 if (j < removed->num) {
3609                     for (; j+1 < removed->num; j++) {
3612                     removed->num--;
3613                     for (j = i; j+1 < added->num; j++) {
3616                     added->num--;
3664                                      parents, addgh->vals, addgh->num);
3670     if (ael != NULL && ael->num > 0) {
3673                                     struct ldb_dn *, parents->num + 1);
3677         parents->dns[parents->num] = mod_ctx->entry->dn;
3678         parents->num++;
3681         for (i = 0; i < ael->num; i++) {
3722     if ((mod_ctx->mb_add && mod_ctx->mb_add->num > 0) ||
3723         (mod_ctx->gh_add && mod_ctx->gh_add->num > 0)) {
3733                                     delgh->vals, delgh->num);
3740     if (del != NULL && del->num > 0) {
3741         for (i = 0; i < del->num; i++) {
3779     ar->num = el->num_values;
3781     for (i = 0; i < ar->num; i++) {
3816     vi = var->num;
3817     var->num += num_values;
3818     var->vals = talloc_realloc(memctx, var->vals, struct ldb_val, var->num);