Searched refs:fragment (Results 1 - 25 of 30) sorted by relevance

12

/haiku-fatelf/src/tools/docbook/libxml2/
H A Dxinclude.c54 xmlChar *fragment; /* the fragment in the URI */ member in struct:_xmlXIncludeRef
204 if (ref->fragment != NULL)
205 xmlFree(ref->fragment);
238 ret->fragment = NULL;
486 xmlChar *fragment = NULL; local
566 fragment = xmlXIncludeGetProp(ctxt, cur, XINCLUDE_PARSE_XPOINTER);
569 * Check the URL and remove any fragment identifier
575 if (fragment != NULL)
576 xmlFree(fragment);
1375 xmlChar *fragment = NULL; local
[all...]
H A Duri.c485 if (uri->fragment != NULL) {
497 p = uri->fragment;
569 if (uri->fragment != NULL) xmlFree(uri->fragment);
570 uri->fragment = NULL;
593 if (uri->fragment != NULL) xmlFree(uri->fragment);
1046 if (uri->fragment) {
1047 segment = xmlURIEscapeStr(BAD_CAST uri->fragment, BAD_CAST "#");
1071 * Parse an URI fragment strin
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/fat/
H A Dfat.h33 status_t fragment(nspace *vol, uint32 *pattern);
/haiku-fatelf/src/bin/network/wget/src/
H A Durl.h72 char *fragment; member in struct:url
H A Durl.c58 scm_has_fragment = 8 /* whether scheme has #fragment */
725 params, query, and fragment. They are ordered like this:
727 scheme://host[:port][/path][;params][?query][#fragment] */
736 query string and fragment. */
847 GET_URL_PART ('#', fragment);
904 u->fragment = strdupdelim (fragment_b, fragment_e);
906 if (opt.enable_iri || path_modified || u->fragment || host_modified || path_b == path_e)
1000 params appended. The "fragment" (#foo) is intentionally ignored,
1176 xfree_null (url->fragment);
1702 terminated by one or more of the ?query or ;params or #fragment,
[all...]
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/dos/r5/
H A Dfat.h29 status_t fragment(nspace *vol, uint32 *pattern);
H A Dfat.c556 status_t fragment(nspace *vol, uint32 *pattern) function
569 dprintf("fragment: only for FAT16 and FAT32\n");
581 dprintf("fragment: error getting fat block %lx\n", sector);
623 dprintf("fragment: error getting fat block %lx\n", sector);
H A Ddosfs.c916 result = fragment(vol, buf);
/haiku-fatelf/src/tests/kits/net/url/
H A Durl_test.cpp30 const char* fragment; member in struct:__anon5855::__anon5856
37 "http://user:pass@www.foo.com:80/path?query#fragment",
55 { "http://user:pass@host:80/path?query#fragment",
56 { "http", "user", "pass", "host", 80, "/path", "query", "fragment" } },
57 { "http://www.host.tld/path?query#fragment",
58 { "http", "", "", "www.host.tld",0, "/path", "query", "fragment" } }
93 ASSERT(BString(kTestExplode[testIndex].expected.fragment) == BString(testUrl.Fragment()));
/haiku-fatelf/src/tools/docbook/libxml2/include/libxml/
H A Duri.h38 char *fragment; /* the fragment identifier */ member in struct:_xmlURI
/haiku-fatelf/src/add-ons/kernel/network/protocols/ipv4/
H A Dipv4.cpp53 // slots in the fragment packet's hash
55 // discard fragment after 60 seconds
272 // invalid fragment
276 // Search for a position in the list to insert the fragment
282 if (previous->fragment.start <= start) {
283 // The new fragment can be inserted after this one
290 // See if we already have the fragment's data
292 if (previous != NULL && previous->fragment.start <= start
293 && previous->fragment.end >= end) {
294 // we do, so we can just drop this fragment
411 net_buffer* fragment; local
[all...]
/haiku-fatelf/src/add-ons/kernel/network/protocols/ipv6/
H A Dipv6.cpp54 // slots in the fragment packet's hash
56 // discard fragment after 60 seconds [RFC 2460]
313 // invalid fragment
317 // Search for a position in the list to insert the fragment
323 if (previous->fragment.start <= start) {
324 // The new fragment can be inserted after this one
331 // See if we already have the fragment's data
333 if (previous != NULL && previous->fragment.start <= start
334 && previous->fragment.end >= end) {
335 // we do, so we can just drop this fragment
452 net_buffer* fragment; local
[all...]
/haiku-fatelf/src/bin/gdb/opcodes/
H A Dtic30-dis.c574 get_indirect_operand (fragment, size, buffer)
575 unsigned short fragment;
590 mod = (fragment & 0x00F8) >> 3;
591 arnum = (fragment & 0x0007);
595 mod = (fragment & 0xF800) >> 11;
596 arnum = (fragment & 0x0700) >> 8;
597 disp = (fragment & 0x00FF);
640 get_register_operand (fragment, buffer)
641 unsigned char fragment;
650 if ((fragment
[all...]
/haiku-fatelf/src/tools/docbook/libxslt/libxslt/
H A Dfunctions.c109 xmlChar *fragment; local
132 * check for and remove fragment identifier
134 fragment = (xmlChar *)uri->fragment;
135 if (fragment != NULL) {
136 uri->fragment = NULL;
152 if (fragment != NULL)
153 xmlFree(fragment);
160 if ( fragment == NULL ) {
166 /* use XPointer of HTML location for fragment I
198 fragment); local
[all...]
/haiku-fatelf/src/system/boot/loader/file_systems/bfs/
H A DBPlusTree.cpp391 // does the value link to a duplicate fragment?
395 bplustree_node *fragment = cached->SetTo(bplustree_node::FragmentOffset( local
397 if (fragment == NULL) {
398 FATAL(("Could not get duplicate fragment at %Ld\n",values[i]));
405 duplicate_array *array = fragment->FragmentAt(j);
410 *_fragment = fragment;
768 // the duplicate fragment handling is currently hard-coded to a node size
772 uint32 fragment = (NUM_FRAGMENT_VALUES + 1) * ((uint64)offset & 0x3ff); local
774 return ((off_t *)this)[fragment];
794 * used fragment coun
[all...]
/haiku-fatelf/headers/os/net/
H A DUrl.h31 BUrl& SetFragment(const BString& fragment);
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/bfs/r5/
H A DBPlusTree.cpp632 // does the value link to a duplicate fragment?
636 bplustree_node *fragment = cached->SetTo(bplustree_node::FragmentOffset(value), false); local
637 if (fragment == NULL) {
638 FATAL(("Could not get duplicate fragment at %Ld\n", value));
645 duplicate_array *array = fragment->FragmentAt(j);
649 *_fragment = fragment;
670 // If it's a duplicate fragment, try to insert it into that, or if it
682 FATAL(("insertDuplicate: Invalid array[%ld] size in fragment %Ld == %Ld!\n",
692 // test if the fragment will be empty if we remove this key's values
712 // copy the array from the fragment nod
790 bplustree_node *fragment; local
1348 bplustree_node *fragment = NULL; local
1996 uint32 fragment = (NUM_FRAGMENT_VALUES + 1) * ((uint64)offset & 0x3ff); local
[all...]
/haiku-fatelf/headers/private/net/
H A Dnet_buffer.h29 } fragment; member in union:net_buffer::__anon1152
/haiku-fatelf/src/add-ons/kernel/file_systems/bfs/
H A DBPlusTree.cpp1088 /*! This will find a free duplicate fragment in the given bplustree_node.
1089 The CachedNode will be set to the writable fragment on success.
1100 // does the value link to a duplicate fragment?
1104 const bplustree_node* fragment = cached.SetTo( local
1106 if (fragment == NULL) {
1107 FATAL(("Could not get duplicate fragment at %" B_PRIdOFF ", inode %"
1115 duplicate_array* array = fragment->FragmentAt(j);
1118 // found an unused fragment
1144 // If it's a duplicate fragment, try to insert it into that, or if it
1158 FATAL(("_InsertDuplicate: Invalid array[%d] size in fragment "
1275 bplustree_node* fragment; local
1934 bplustree_node* fragment = NULL; local
2861 uint32 fragment = (NUM_FRAGMENT_VALUES + 1) * ((uint64)offset & 0x3ff); local
[all...]
/haiku-fatelf/src/kits/network/libnetapi/
H A DUrl.cpp180 BUrl::SetFragment(const BString& fragment) argument
182 fFragment = fragment;
733 // Extract fragment field if needed
/haiku-fatelf/src/libs/print/libgutenprint/doc/gutenprint/html/
H A Ddoxygen.css140 .fragment {
145 pre.fragment {
/haiku-fatelf/src/libs/print/libgutenprint/doc/gutenprintui2/html/
H A Ddoxygen.css140 .fragment {
145 pre.fragment {
/haiku-fatelf/src/bin/bfs_tools/lib/
H A DBPlusTree.cpp1162 // the duplicate fragment handling is currently hard-coded to a node size
1167 uint32 fragment = 8 * ((uint64)offset & 0x3ff); local
1169 return ((off_t *)this)[fragment];
/haiku-fatelf/src/add-ons/kernel/file_systems/ext2/
H A Dext2.h431 uint32 fragment; member in struct:ext2_inode
/haiku-fatelf/src/add-ons/kernel/drivers/network/wlan/iprowifi4965/dev/iwn/
H A Dif_iwnreg.h1267 uint32_t fragment; member in struct:iwn_rx_ht_phy_stats

Completed in 156 milliseconds

12