| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Check for OOM in format_expand_simple() | Nalin Dahyabhai | 2014-03-13 | 1 | -1/+4 |
| | | |||||
| * | Add free() of a NULL pointer to make tools happy | Nalin Dahyabhai | 2014-02-17 | 1 | -0/+4 |
| | | |||||
| * | Don't leak ftmp on out-of-memory (static analysis) | Nalin Dahyabhai | 2014-02-17 | 1 | -0/+1 |
| | | |||||
| * | Add ignore-subtree and restrict-subtree settings | Nalin Dahyabhai | 2013-09-19 | 1 | -15/+216 |
| | | | | | | | | | | | | | | | Add {nis,schema-compat}-ignore-subtree (subtrees under which we ignore contents and updates )and {nis,schema-compat}-restrict-subtree (subtrees out of which we ignore contents and updates, if set) settings, and default the former to "cn=tasks,cn=config". This should avoid cases where we're looking through the ldbm backend for entries which have a dangling reference to a newly-added task (which, because it's in the DSE, means we acquire an ldbm lock after acquiring our internal lock) while also updating a compat entry after its source entry is modified (for example, by the memberOf plugin, which results in us attempting to acquire our lock while the ldbm lock is already held). | ||||
| * | Add a missing word in a comment | Nalin Dahyabhai | 2013-09-12 | 1 | -1/+1 |
| | | |||||
| * | Don't make an unnecessary check | Nalin Dahyabhai | 2013-08-27 | 1 | -1/+1 |
| | | |||||
| * | Skip values that are going to come up empty | Nalin Dahyabhai | 2013-08-27 | 1 | -0/+3 |
| | | |||||
| * | Make sure that length is always initialized | Nalin Dahyabhai | 2013-08-27 | 1 | -0/+1 |
| | | |||||
| * | Don't leak "buf" if its contents are unused | Nalin Dahyabhai | 2013-08-27 | 1 | -0/+2 |
| | | |||||
| * | Remove some unused variables | Nalin Dahyabhai | 2013-08-12 | 1 | -5/+1 |
| | | |||||
| * | Add %sort() and %dribble_merge() | Nalin Dahyabhai | 2013-05-23 | 1 | -1/+286 |
| | | | | | | | | Add %sort(), which binary-sorts a single list of values, and %dribble_merge(), which takes a quoted length, a separator, and some expressions and produces a list of lists of values using the separator, where no list is larger than the length. | ||||
| * | - log errors evaluating pad expressions in %%link rather than continuing on ↵ | Nalin Dahyabhai | 2012-04-10 | 1 | -0/+15 |
| | | | | | until we hit an arithmetic exception (#810258) | ||||
| * | - treat the padding values used by %link() into expressions instead of | Nalin Dahyabhai | 2012-03-30 | 1 | -34/+52 |
| | | | | | as literals | ||||
| * | - add a "default" function | Nalin Dahyabhai | 2012-03-28 | 1 | -0/+50 |
| | | |||||
| * | - remove unused variables | Nalin Dahyabhai | 2012-01-24 | 1 | -5/+3 |
| | | |||||
| * | - add multiple-result capable versions of match/regmatch/regsub | Nalin Dahyabhai | 2012-01-24 | 1 | -3/+129 |
| | | |||||
| * | - in callbacks, only use pblocks that are built from pblocks that we | Nalin Dahyabhai | 2012-01-16 | 1 | -28/+33 |
| | | | | | | | already have, so that we can pass the transaction ID around; this includes additional parameters for a number of functions and a new callback data type for backend_set_config_entry_add_cb() | ||||
| * | - avoid using pblocks for more than one internal operation - the server | Nalin Dahyabhai | 2012-01-11 | 1 | -25/+8 |
| | | | | | | | allocates internal state each time but doesn't clean up any that's aready there if you reuse the block - correctly free values we use when constructing compat entries | ||||
| * | - don't use the deprecated slapi_dn_parent() function, the result of which ↵ | Nalin Dahyabhai | 2012-01-11 | 1 | -3/+7 |
| | | | | | we used to leak | ||||
| * | - have slapi_search_internal_get_entry() always set its result to NULL on ↵ | Nalin Dahyabhai | 2012-01-11 | 1 | -3/+1 |
| | | | | | failure | ||||
| * | - use an internal sequence number to disable the skip-boring-updates logic, ↵ | Nalin Dahyabhai | 2012-01-10 | 1 | -1/+48 |
| | | | | | and test that while our results don't change, we did actually do processing | ||||
| * | - add and test a "unique" operator | Nalin Dahyabhai | 2012-01-10 | 1 | -0/+108 |
| | | |||||
| * | - Make a note of which attributes we read from any entry when evaluating ↵ | Nalin Dahyabhai | 2012-01-06 | 1 | -39/+110 |
| | | | | | data, and when we're later called for a modify request which doesn't modify any of those attributes, skip recalculating the entry contents (should make a dent in #771493). | ||||
| * | - it helps if i don't typo in a way that breaks compilation | Nalin Dahyabhai | 2012-01-04 | 1 | -4/+4 |
| | | |||||
| * | - add regsubi/regmatchi, which are like the originals but case-insensitive | Nalin Dahyabhai | 2012-01-04 | 1 | -26/+86 |
| | | |||||
| * | - try to handle two one-allocation-fails cases (static analysis) | Nalin Dahyabhai | 2011-07-27 | 1 | -0/+8 |
| | | |||||
| * | - remove format_* functions that didn't need to be exported | Nalin Dahyabhai | 2011-07-26 | 1 | -91/+122 |
| | | | | | | - make SDN lists/queues also have a sorted companion which we can use for presence testing | ||||
| * | - fix counting, there | Nalin Dahyabhai | 2011-07-26 | 1 | -2/+2 |
| | | |||||
| * | - don't dup a list and then just free the original | Nalin Dahyabhai | 2011-07-26 | 1 | -18/+11 |
| | | |||||
| * | - handle control characters in disallowed-chars lists | Nalin Dahyabhai | 2011-07-26 | 1 | -1/+39 |
| | | |||||
| * | - handle some unuseds | Nalin Dahyabhai | 2011-05-13 | 1 | -6/+3 |
| | | |||||
| * | - don't assume that libc will provide yp headers -- build them ourselves | Nalin Dahyabhai | 2011-05-13 | 1 | -1/+1 |
| | | |||||
| * | - fix a type error | Nalin Dahyabhai | 2011-04-21 | 1 | -1/+1 |
| | | |||||
| * | - oh right, we don't ever use the sorted version | Nalin Dahyabhai | 2011-04-21 | 1 | -2/+3 |
| | | |||||
| * | - when we can keep the list sorted we can search it faster | Nalin Dahyabhai | 2011-04-21 | 1 | -11/+94 |
| | | |||||
| * | - speed up an add-to-list operation which did things the obvious way before | Nalin Dahyabhai | 2011-04-19 | 1 | -7/+3 |
| | | |||||
| * | - drop some dead code (defect #10091) | Nalin Dahyabhai | 2011-01-03 | 1 | -17/+12 |
| | | |||||
| * | - only memcpy() 1 or more elements (defect #10094) | Nalin Dahyabhai | 2011-01-03 | 1 | -1/+3 |
| | | |||||
| * | - don't bother checking that list is not NULL -- if it is, that's a bug | Nalin Dahyabhai | 2011-01-03 | 1 | -3/+1 |
| | | | | | in the caller (defect #10109) | ||||
| * | - don't leak a normalized dn on out-of-memory (defect #10106) | Nalin Dahyabhai | 2011-01-03 | 1 | -0/+1 |
| | | |||||
| * | - don't leak memory on out-of-memory (defect #10103) | Nalin Dahyabhai | 2011-01-03 | 1 | -0/+1 |
| | | |||||
| * | cast ber_len_t lengths to (int) when we use them to limit string lengths | Nalin Dahyabhai | 2010-12-22 | 1 | -15/+17 |
| | | | | | in diagnostic messages | ||||
| * | - also, call the right function | Nalin Dahyabhai | 2010-11-23 | 1 | -1/+1 |
| | | |||||
| * | - whoops, enforce the right argument count | Nalin Dahyabhai | 2010-11-23 | 1 | -2/+2 |
| | | |||||
| * | - break up %deref into %deref and %deref_f | Nalin Dahyabhai | 2010-11-23 | 1 | -44/+107 |
| | | | | | - add %deref_fr as an alias for %deref_rf | ||||
| * | - use the filter at the right point in walking a chain | Nalin Dahyabhai | 2010-11-22 | 1 | -3/+37 |
| | | | | | - add a test for deref_rf | ||||
| * | - teach wrap_search_internal_get_entry to take an optional filter | Nalin Dahyabhai | 2010-11-22 | 1 | -94/+4 |
| | | | | | | - where we were applying a filter test after retrieving an entry, just let the retrieval function do it | ||||
| * | - try to factor deref_r and its corresponding update code into | Nalin Dahyabhai | 2010-11-22 | 1 | -46/+171 |
| | | | | | optionally handling filters at each step of the way | ||||
| * | - do a full clear of some temporaries (valgrind) | Nalin Dahyabhai | 2010-11-18 | 1 | -0/+2 |
| | | |||||
| * | - don't walk off the end of the filter array, but expect it to be of the | Nalin Dahyabhai | 2010-11-18 | 1 | -1/+1 |
| | | | | | right length | ||||
 |
index : slapi-nis.git | |
| SLAPI-NIS | Alexander Bokovoy |
| summaryrefslogtreecommitdiffstats |