1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
 int
 saf_find_algebraics(SAF_ParMode pmode,
                     SAF_Db *db,                 /* Database in which to limit the search. */
                     const char *name,           /* Optional name for which to search. */
                     const char *url,            /* Optional URL for which to search. */
                     htri_t indirect,            /* Optional indirect flag for which to search. The caller should pass a
                                                  * negative value if it is not interested in restricting the search. */
                     int *num,                   /* For this and the succeeding argument [see Returned Handles]. */
                     SAF_Algebraic **found       /* For this and the preceding argument [see Returned Handles]. */
                     )
 {
     SAF_ENTER(saf_find_algebraics, SAF_PRECONDITION_ERROR);
     SAF_KEYMASK(SAF_Algebraic, key, mask);
     size_t              nfound;
     ss_scope_t          scope;

     SAF_REQUIRE(_saf_valid_pmode(pmode), SAF_LOW_CHK_COST, SAF_PRECONDITION_ERROR,
                 _saf_errmsg("PMODE must be valid"));
     if (!_saf_is_participating_proc(pmode)) SAF_RETURN(-1);
     SAF_REQUIRE(ss_file_isopen(db, NULL)>0, SAF_LOW_CHK_COST, SAF_PRECONDITION_ERROR,
                 _saf_errmsg("DB must be a valid database"));
     SAF_REQUIRE(_saf_valid_memhints(num, (void**)found), SAF_LOW_CHK_COST, SAF_PRECONDITION_ERROR,
                _saf_errmsg("NUM and FOUND must be compatible for return value allocation"));

     ss_file_topscope(db, &scope);
     if (name) SAF_SEARCH_S(SAF_Algebraic, key, mask, name, name);
     if (url)  SAF_SEARCH_S(SAF_Algebraic, key, mask, url, url);
     if (indirect>=0) SAF_SEARCH(SAF_Algebraic, key, mask, indirect, indirect?TRUE:FALSE);

     if (!found) {
         /* Count the matches */
         assert(num);
         nfound = SS_NOSIZE;
         ss_pers_find(&scope, (ss_pers_t*)key, mask_count?(ss_persobj_t*)&mask:NULL, 0, &nfound, SS_PERS_TEST, NULL);
         *num = nfound;
     } else if (!*found) {
         /* Find all matches; library allocates results */
         nfound = SS_NOSIZE;
         *found = (ss_algebraic_t*)ss_pers_find(&scope, (ss_pers_t*)key, mask_count?(ss_persobj_t*)&mask:NULL, 0, &nfound,
                                                NULL, NULL);
         if (num) *num = nfound;
     } else {
         /* Find limited matches; client allocates result buffer */
         assert(num);
         nfound = *num;
         if (NULL==ss_pers_find(&scope, (ss_pers_t*)key, mask_count?(ss_persobj_t*)&mask:NULL, 0, &nfound, (ss_pers_t*)*found,
                                _SAF_GLOBALS.find_detect_overflow)) {
             SAF_ERROR(SAF_CONSTRAINT_ERROR, _saf_errmsg("found too many matching objects"));
         }
         *num = nfound;
     }

     SAF_LEAVE(SAF_SUCCESS);
 }