Lines Matching full:len
47 #define xmlDictComputeKey(dict, name, len) \
49 xmlDictComputeFastKey(name, len) : \
50 xmlDictComputeBigKey(name, len))
52 #define xmlDictComputeQKey(dict, prefix, plen, name, len) \
54 (xmlDictComputeKey(dict, name, len)) : \
56 xmlDictComputeFastQKey(prefix, plen, name, len) : \
57 xmlDictComputeBigQKey(prefix, plen, name, len)))
60 #define xmlDictComputeKey(dict, name, len) \
61 xmlDictComputeFastKey(name, len)
62 #define xmlDictComputeQKey(dict, prefix, plen, name, len) \
63 xmlDictComputeFastQKey(prefix, plen, name, len)
74 int len;
151 * @len: the length of the name, if -1 it is recomputed
209 * @len: the length of the name, if -1 it is recomputed
313 const xmlChar *name, int len)
329 for (i = 0;i < len; i++) {
384 const xmlChar *name, int len)
393 if (len > 10) {
394 value += name[len - (plen + 1 + 1)];
395 len = 10;
412 len -= plen;
413 if (len > 0) {
415 len--;
417 switch (len) {
576 okey = xmlDictComputeKey(dict, olddict[i].name, olddict[i].len);
589 entry->len = olddict[i].len;
619 okey = xmlDictComputeKey(dict, iter->name, iter->len);
718 * @len: the length of the name, if -1 it is recomputed
725 xmlDictLookup(xmlDictPtr dict, const xmlChar *name, int len) {
734 if (len < 0)
735 len = strlen((const char *) name);
740 okey = xmlDictComputeKey(dict, name, len);
748 if ((insert->okey == okey) && (insert->len == len)) {
749 if (!memcmp(insert->name, name, len))
753 if ((insert->okey == okey) && (insert->len == len) &&
754 (!xmlStrncmp(insert->name, name, len)))
760 if ((insert->okey == okey) && (insert->len == len)) {
761 if (!memcmp(insert->name, name, len))
765 if ((insert->okey == okey) && (insert->len == len) &&
766 (!xmlStrncmp(insert->name, name, len)))
779 skey = xmlDictComputeKey(dict->subdict, name, len);
790 if ((tmp->okey == skey) && (tmp->len == len)) {
791 if (!memcmp(tmp->name, name, len))
795 if ((tmp->okey == skey) && (tmp->len == len) &&
796 (!xmlStrncmp(tmp->name, name, len)))
802 if ((tmp->okey == skey) && (tmp->len == len)) {
803 if (!memcmp(tmp->name, name, len))
807 if ((tmp->okey == skey) && (tmp->len == len) &&
808 (!xmlStrncmp(tmp->name, name, len)))
815 ret = xmlDictAddString(dict, name, len);
826 entry->len = len;
851 * @len: the length of the name, if -1 it is recomputed
858 xmlDictExists(xmlDictPtr dict, const xmlChar *name, int len) {
865 if (len < 0)
866 len = strlen((const char *) name);
871 okey = xmlDictComputeKey(dict, name, len);
879 if ((insert->okey == okey) && (insert->len == len)) {
880 if (!memcmp(insert->name, name, len))
884 if ((insert->okey == okey) && (insert->len == len) &&
885 (!xmlStrncmp(insert->name, name, len)))
891 if ((insert->okey == okey) && (insert->len == len)) {
892 if (!memcmp(insert->name, name, len))
896 if ((insert->okey == okey) && (insert->len == len) &&
897 (!xmlStrncmp(insert->name, name, len)))
910 skey = xmlDictComputeKey(dict->subdict, name, len);
921 if ((tmp->okey == skey) && (tmp->len == len)) {
922 if (!memcmp(tmp->name, name, len))
926 if ((tmp->okey == skey) && (tmp->len == len) &&
927 (!xmlStrncmp(tmp->name, name, len)))
933 if ((tmp->okey == skey) && (tmp->len == len)) {
934 if (!memcmp(tmp->name, name, len))
938 if ((tmp->okey == skey) && (tmp->len == len) &&
939 (!xmlStrncmp(tmp->name, name, len)))
965 int len, plen, l;
972 l = len = strlen((const char *) name);
974 len += 1 + plen;
986 if ((insert->okey == okey) && (insert->len == len) &&
991 if ((insert->okey == okey) && (insert->len == len) &&
1013 if ((tmp->okey == skey) && (tmp->len == len) &&
1018 if ((tmp->okey == skey) && (tmp->len == len) &&
1036 entry->len = len;
