Searched refs:tags (Results 1 - 25 of 62) sorted by last modified time

123

/haiku-fatelf/build/scripts/
H A Ddetermine_haiku_revision18 revision=`git describe --dirty --tags --match=hrev*`
20 # failed to find any hrev tags, use short hash instead
/haiku-fatelf/src/add-ons/kernel/file_systems/ext2/
H A DJournal.cpp751 // Maximum tags per descriptor block
787 JournalBlockTag* tags = (JournalBlockTag*)descriptorBlock->data; local
792 while (tags < lastTag && (tags->Flags() & JOURNAL_FLAG_LAST_TAG) == 0) {
793 if ((tags->Flags() & JOURNAL_FLAG_SAME_UUID) == 0) {
795 tags += 2; // Skip new UUID
798 TRACE("Journal::_CountTags(): Tag block: %lu\n", tags->BlockNumber());
800 tags++; // Go to next tag
804 if ((tags->Flags() & JOURNAL_FLAG_LAST_TAG) != 0)
807 TRACE("Journal::_CountTags(): counted tags
858 uint32 tags = _CountTags(header); local
[all...]
/haiku-fatelf/src/tests/system/libroot/posix/posixtestsuite/
H A Dlocate-test38 Note that the [requires compilation] tags will mean that the actual
/haiku-fatelf/src/tools/rman/
H A Drman.c37 /* maximum number of tags per line */
51 struct { enum tagtype type; int first; int last; } tags[MAXTAGS], tagtmp; variable in typeref:struct:__anon6126
387 tags[tagc].type = type;
388 tags[tagc].first = first;
389 tags[tagc].last = last;
509 * Tk -- just emit list of text-tags pairs
1431 tags[0].last = linelen;
2544 /* set I for tags below */
2552 /*** tags and filler spaces ***/
2629 if (efirst>=0 /*&& (esccode==0 || esccode==1 || esccode==4 || esccode==22 || esccode==24) /*&& hl>=0 && hl2==-1 && tags[MAXTAG
[all...]
/haiku-fatelf/src/servers/app/font/
H A DFontEngine.cpp72 char* tags; local
92 tags = outline.tags + first;
93 tag = FT_CURVE_TAG(tags[0]);
102 if (FT_CURVE_TAG(outline.tags[last]) == FT_CURVE_TAG_ON) {
116 tags--;
127 tags++;
129 tag = FT_CURVE_TAG(tags[0]);
151 tags++;
152 tag = FT_CURVE_TAG(tags[
[all...]
/haiku-fatelf/src/libs/ncurses/menu/
H A DMakefile150 tags:
157 -rm -f core tags TAGS *~ *.bak *.i *.ln *.atac trace
/haiku-fatelf/src/libs/ncurses/misc/
H A DMakefile122 tags :
129 -rm -f core tags TAGS *~ *.bak *.ln *.atac trace
/haiku-fatelf/src/libs/ncurses/ncurses/
H A DMakefile233 tags:
240 -rm -f core tags TAGS *~ *.bak *.i *.ln *.atac trace
/haiku-fatelf/src/libs/ncurses/panel/
H A DMakefile142 tags:
149 -rm -f core tags TAGS *~ *.bak *.i *.ln *.atac trace
/haiku-fatelf/src/libs/ncurses/progs/
H A DMakefile247 tags:
254 -rm -f core tags TAGS *~ *.bak *.i *.ln *.atac trace
/haiku-fatelf/src/libs/ncurses/tack/
H A DMakefile144 tags:
151 -rm -f core tags TAGS *~ *.bak *.i *.atac trace
/haiku-fatelf/src/libs/ncurses/test/
H A DMakefile149 tags:
267 -rm -f core tags TAGS *~ *.bak *.i *.ln *.atac trace
H A Dlistused.sh76 tags=
82 tags=$prog
100 if test "$last" = "$tags"
104 HAVE="$HAVE $tags $have"
107 HAVE="$tags $have"
109 last="$tags"
/haiku-fatelf/src/libs/termcap/
H A Dtexinfo.tex5401 % in xref tags, i.e., node names. But since ^^e4 notation isn't
/haiku-fatelf/src/libs/agg/font_freetype/
H A Dagg_font_freetype.cpp160 char* tags; local
181 tags = outline.tags + first;
182 tag = FT_CURVE_TAG(tags[0]);
191 if(FT_CURVE_TAG(outline.tags[last]) == FT_CURVE_TAG_ON)
208 tags--;
221 tags++;
223 tag = FT_CURVE_TAG(tags[0]);
250 tags++;
251 tag = FT_CURVE_TAG(tags[
[all...]
/haiku-fatelf/src/libs/compat/freebsd_network/compat/sys/
H A Dmbuf.h112 SLIST_HEAD(packet_tags, m_tag) tags; member in struct:pkthdr
116 SLIST_ENTRY(m_tag) m_tag_link; // List of packet tags
228 SLIST_INSERT_HEAD(&memoryBuffer->m_pkthdr.tags, tag, m_tag_link);
235 SLIST_REMOVE(&memoryBuffer->m_pkthdr.tags, tag, m_tag, m_tag_link);
/haiku-fatelf/src/libs/compat/freebsd_network/
H A Dfbsd_mbuf.c119 * In particular, this does a deep copy of the packet tags.
129 SLIST_INIT(&to->m_pkthdr.tags);
381 to->m_pkthdr = from->m_pkthdr; /* especially tags */
382 SLIST_INIT(&from->m_pkthdr.tags); /* purge tags from src */
H A Dfbsd_mbuf2.c351 p = SLIST_FIRST(&m->m_pkthdr.tags);
360 * Strip off all tags that would normally vanish when
362 * tags will exist after this; these are expected to remain
371 SLIST_FOREACH_SAFE(p, &m->m_pkthdr.tags, m_tag_link, q)
384 p = SLIST_FIRST(&m->m_pkthdr.tags);
426 * tags even if the operation fails. This should not be a problem, as
439 SLIST_FOREACH(p, &from->m_pkthdr.tags, m_tag_link) {
446 SLIST_INSERT_HEAD(&to->m_pkthdr.tags, t, m_tag_link);
H A Dmbuf.c57 SLIST_INIT(&memoryBuffer->m_pkthdr.tags);
/haiku-fatelf/src/libs/ncurses/Ada95/gen/
H A DMakefile.in350 tags:
/haiku-fatelf/src/libs/ncurses/
H A DMakefile95 tags \
/haiku-fatelf/src/libs/ncurses/c++/
H A DMakefile133 tags:
185 -rm -f core tags TAGS *~ *.bak *.i *.ii *.ln *.atac trace
/haiku-fatelf/src/libs/ncurses/form/
H A DMakefile144 tags:
151 -rm -f core tags TAGS *~ *.bak *.i *.ln *.atac trace
/haiku-fatelf/src/libs/ncurses/include/
H A DMakefile107 tags:
114 -rm -f core tags TAGS *~ *.bak *.i *.ln *.atac trace
/haiku-fatelf/src/libs/ncurses/man/
H A DMakefile52 tags :
71 -rm -f core tags TAGS *~ *.bak *.ln *.atac trace

Completed in 307 milliseconds

123