Searched defs:add (Results 1 - 14 of 14) sorted by path

/system/core/include/utils/
H A DBasicHashtable.h70 size_t add(hash_t hash, const void* __restrict__ entry);
131 // Returns the increment to add to a bucket index to seek to the next bucket
168 * We do this because it means that operations like add() can't fail.
291 * entry: The entry to add.
293 inline size_t add(hash_t hash, const TEntry& entry) { function in class:android::BasicHashtable
294 return BasicHashtableImpl::add(hash, &entry);
332 /* Determines whether there is room to add another entry without rehashing.
333 * When this returns true, a subsequent add() operation is guaranteed to
H A DSortedVector.h106 //! add an item in the right place (and replace the one that is there)
107 ssize_t add(const TYPE& item);
206 ssize_t SortedVector<TYPE>::add(const TYPE& item) { function in class:android::SortedVector
207 return SortedVectorImpl::add(&item);
H A DVector.h136 * add/insert/replace items
150 inline ssize_t add();
152 ssize_t add(const TYPE& item);
182 * these inlines add some level of compatibility with STL. eventually
337 ssize_t Vector<TYPE>::add(const TYPE& item) { function in class:android::Vector
338 return VectorImpl::add(&item);
362 ssize_t Vector<TYPE>::add() { function in class:android::Vector
363 return VectorImpl::add();
/system/core/libpixelflinger/codeflinger/
H A Dtexturing.cpp1126 add(fragment, incoming, texel, component);
1330 void GGLAssembler::add( function in class:android::GGLAssembler
/system/core/libpixelflinger/codeflinger/tinyutils/
H A DKeyedVector.h77 * add/insert/replace items
80 ssize_t add(const KEY& key, const VALUE& item);
154 ssize_t KeyedVector<KEY,VALUE>::add(const KEY& key, const VALUE& value) { function in class:android::tinyutils::KeyedVector
155 return mVector.add( key_value_pair_t<KEY,VALUE>(key, value) );
162 return mVector.add(pair);
H A DVector.h121 * add/insert/replace items
135 inline ssize_t add();
137 ssize_t add(const TYPE& item);
276 ssize_t Vector<TYPE>::add(const TYPE& item) { function in class:android::tinyutils::Vector
277 return VectorImpl::add(&item);
301 ssize_t Vector<TYPE>::add() { function in class:android::tinyutils::Vector
302 return VectorImpl::add();
H A DVectorImpl.cpp164 ssize_t VectorImpl::add() function in class:android::tinyutils::VectorImpl
166 return add(0);
169 ssize_t VectorImpl::add(const void* item) function in class:android::tinyutils::VectorImpl
485 ssize_t SortedVectorImpl::add(const void* item) function in class:SortedVectorImpl
505 ssize_t err = add( reinterpret_cast<const char*>(buffer) + i*is );
/system/core/libutils/
H A DBasicHashtable.cpp152 size_t BasicHashtableImpl::add(hash_t hash, const void* entry) { function in class:android::BasicHashtableImpl
H A DVectorImpl.cpp234 ssize_t VectorImpl::add() function in class:android::VectorImpl
236 return add(0);
239 ssize_t VectorImpl::add(const void* item) function in class:android::VectorImpl
566 ssize_t SortedVectorImpl::add(const void* item)
586 ssize_t err = add( reinterpret_cast<const char*>(buffer) + i*is );
/system/core/libutils/tests/
H A DBasicHashtable_test.cpp122 static size_t add(BasicHashtable<TKey, key_value_pair_t<TKey, TValue> >& h, function in namespace:android
124 return h.add(hash_type(key), key_value_pair_t<TKey, TValue>(key, value));
219 index = add(h, 8, 1);
244 index = add(h, int(i), int(i * 10));
277 add(h, K, int(i));
322 add(h, 0, 0);
323 add(h, 1, 0);
334 add(h, ComplexKey(0), ComplexValue(0));
335 add(h, ComplexKey(1), ComplexValue(0));
349 add(
[all...]
/system/core/sh/
H A Dexec.c806 * Locate a command in the command hash table. If "add" is nonzero,
807 * add the command to the table if it is not already present. The
817 cmdlookup(const char *name, int add) argument
835 if (add && cmdp == NULL) {
/system/netd/
H A DNatController.cpp117 {{IP_PATH, "rule", "add", "from", "all", "lookup", "default", "prio", "32767"}, 0},
118 {{IP_PATH, "rule", "add", "from", "all", "lookup", "main", "prio", "32766"}, 0},
119 {{IP_PATH, "-6", "rule", "add", "from", "all", "lookup", "default", "prio", "32767"}, 0},
120 {{IP_PATH, "-6", "rule", "add", "from", "all", "lookup", "main", "prio", "32766"}, 0},
140 int NatController::routesOp(bool add, const char *intIface, const char *extIface, char **argv, int addrCount) { argument
146 if (add) {
201 // add this if we are the first added nat
256 int NatController::setTetherCountingRules(bool add, const char *intIface, const char *extIface) { argument
258 /* We only ever add tethering quota rules so that they stick. */
259 if (!add) {
338 setForwardRules(bool add, const char *intIface, const char *extIface) argument
[all...]
H A DSecondaryTableController.cpp304 int SecondaryTableController::setFwmarkRule(const char *iface, bool add) { argument
328 //add the catch all route to the tun. Route rules will make sure the right packets hit the table
332 add ? "add" : "del",
344 add ? "add" : "del",
355 //add rules for v6
360 add ? "add" : "del",
373 add
541 setFwmarkRoute(const char* iface, const char *dest, int prefix, bool add) argument
578 setUidRule(const char *iface, int uid_start, int uid_end, bool add) argument
622 setHostExemption(const char *host, bool add) argument
[all...]
H A DUidMarkMap.cpp25 bool UidMarkMap::add(int uid_start, int uid_end, int mark) { function in class:UidMarkMap

Completed in 151 milliseconds