summaryrefslogtreecommitdiffstats
path: root/src/format.c
Commit message (Collapse)AuthorAgeFilesLines
* Don't leak "buf" if its contents are unusedNalin Dahyabhai2013-08-271-0/+2
|
* Remove some unused variablesNalin Dahyabhai2013-08-121-5/+1
|
* Add %sort() and %dribble_merge()Nalin Dahyabhai2013-05-231-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 Dahyabhai2012-04-101-0/+15
| | | | until we hit an arithmetic exception (#810258)
* - treat the padding values used by %link() into expressions instead ofNalin Dahyabhai2012-03-301-34/+52
| | | | as literals
* - add a "default" functionNalin Dahyabhai2012-03-281-0/+50
|
* - remove unused variablesNalin Dahyabhai2012-01-241-5/+3
|
* - add multiple-result capable versions of match/regmatch/regsubNalin Dahyabhai2012-01-241-3/+129
|
* - in callbacks, only use pblocks that are built from pblocks that weNalin Dahyabhai2012-01-161-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 serverNalin Dahyabhai2012-01-111-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 Dahyabhai2012-01-111-3/+7
| | | | we used to leak
* - have slapi_search_internal_get_entry() always set its result to NULL on ↵Nalin Dahyabhai2012-01-111-3/+1
| | | | failure
* - use an internal sequence number to disable the skip-boring-updates logic, ↵Nalin Dahyabhai2012-01-101-1/+48
| | | | and test that while our results don't change, we did actually do processing
* - add and test a "unique" operatorNalin Dahyabhai2012-01-101-0/+108
|
* - Make a note of which attributes we read from any entry when evaluating ↵Nalin Dahyabhai2012-01-061-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 compilationNalin Dahyabhai2012-01-041-4/+4
|
* - add regsubi/regmatchi, which are like the originals but case-insensitiveNalin Dahyabhai2012-01-041-26/+86
|
* - try to handle two one-allocation-fails cases (static analysis)Nalin Dahyabhai2011-07-271-0/+8
|
* - remove format_* functions that didn't need to be exportedNalin Dahyabhai2011-07-261-91/+122
| | | | | - make SDN lists/queues also have a sorted companion which we can use for presence testing
* - fix counting, thereNalin Dahyabhai2011-07-261-2/+2
|
* - don't dup a list and then just free the originalNalin Dahyabhai2011-07-261-18/+11
|
* - handle control characters in disallowed-chars listsNalin Dahyabhai2011-07-261-1/+39
|
* - handle some unusedsNalin Dahyabhai2011-05-131-6/+3
|
* - don't assume that libc will provide yp headers -- build them ourselvesNalin Dahyabhai2011-05-131-1/+1
|
* - fix a type errorNalin Dahyabhai2011-04-211-1/+1
|
* - oh right, we don't ever use the sorted versionNalin Dahyabhai2011-04-211-2/+3
|
* - when we can keep the list sorted we can search it fasterNalin Dahyabhai2011-04-211-11/+94
|
* - speed up an add-to-list operation which did things the obvious way beforeNalin Dahyabhai2011-04-191-7/+3
|
* - drop some dead code (defect #10091)Nalin Dahyabhai2011-01-031-17/+12
|
* - only memcpy() 1 or more elements (defect #10094)Nalin Dahyabhai2011-01-031-1/+3
|
* - don't bother checking that list is not NULL -- if it is, that's a bugNalin Dahyabhai2011-01-031-3/+1
| | | | in the caller (defect #10109)
* - don't leak a normalized dn on out-of-memory (defect #10106)Nalin Dahyabhai2011-01-031-0/+1
|
* - don't leak memory on out-of-memory (defect #10103)Nalin Dahyabhai2011-01-031-0/+1
|
* cast ber_len_t lengths to (int) when we use them to limit string lengthsNalin Dahyabhai2010-12-221-15/+17
| | | | in diagnostic messages
* - also, call the right functionNalin Dahyabhai2010-11-231-1/+1
|
* - whoops, enforce the right argument countNalin Dahyabhai2010-11-231-2/+2
|
* - break up %deref into %deref and %deref_fNalin Dahyabhai2010-11-231-44/+107
| | | | - add %deref_fr as an alias for %deref_rf
* - use the filter at the right point in walking a chainNalin Dahyabhai2010-11-221-3/+37
| | | | - add a test for deref_rf
* - teach wrap_search_internal_get_entry to take an optional filterNalin Dahyabhai2010-11-221-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 intoNalin Dahyabhai2010-11-221-46/+171
| | | | optionally handling filters at each step of the way
* - do a full clear of some temporaries (valgrind)Nalin Dahyabhai2010-11-181-0/+2
|
* - don't walk off the end of the filter array, but expect it to be of theNalin Dahyabhai2010-11-181-1/+1
| | | | right length
* - add optional caching of filters to attribute listsNalin Dahyabhai2010-11-181-18/+50
|
* - use actual slapi_filter structures to avoid reparsingNalin Dahyabhai2010-11-181-3/+13
|
* - manage filters along with chains of attributes and search basesNalin Dahyabhai2010-11-181-4/+22
|
* - changes to commentsNalin Dahyabhai2009-05-071-4/+5
|
* - log more detailsNalin Dahyabhai2009-05-071-9/+30
|
* - make sure that %referred() and %deref() don't return empty stringsNalin Dahyabhai2009-05-071-8/+10
|
* - remove unused variablesNalin Dahyabhai2009-05-061-4/+1
|
* - add the list of function parameters to debugged invocation failure logNalin Dahyabhai2009-04-301-2/+2
| | | | messages